---

assoc.cpp

//$Header: /home/ben/Mapper/c++/RCS/assoc.cpp,v 6.4 2002/06/14 23:23:14 ben Exp $
// Copyright Benedict Adamson 2002.
// This file is part of Mapper.

// Mapper is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.

// Mapper is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with Mapper; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

#include <cassert>

#include "angle_constraint.h"
#include "assoc.h"
#include "bearing_constraint.h"
#include "curve.h"
#include "distance_constraint.h"
#include "vector2.h"
#include "through_constraint.h"
#include "vector_constraint.h"



void assoc(
   angle_constraint &c,
   vector2 &p0,
   vector2 &p1,
   vector2 &p2
   )
{
   {//preconditions:
      assert( !c.points()[0] );
      assert( !c.points()[1] );
      assert( !c.points()[2] );
   };
   c.points_[0] = &p0;
   c.points_[1] = &p1;
   c.points_[2] = &p2;
   {//postconditions:
      assert( c.points()[0] == &p0 );
      assert( c.points()[1] == &p1 );
      assert( c.points()[2] == &p2 );
   };
}



void unassoc(
   angle_constraint &c
   )
{
   if( c.points_[0] ){
      c.points_[0] = 0;
      c.points_[1] = 0;
      c.points_[2] = 0;
   }
   {//postconditions
      assert( !c.points()[0] );
      assert( !c.points()[1] );
      assert( !c.points()[2] );
   };
}



void assoc(
   bearing_constraint &c,
   vector2 &p0,
   vector2 &p1
   )
{
   {//preconditions:
      assert( !c.points()[0] );
      assert( !c.points()[1] );
   };
   c.points_[0] = &p0;
   c.points_[1] = &p1;
   {//postconditions:
      assert( c.points()[0] == &p0 );
      assert( c.points()[1] == &p1 );
   };
}



void unassoc(
   bearing_constraint &c
   )
{
   if( c.points_[0] ){
      c.points_[0] = 0;
      c.points_[1] = 0;
   }
   {//postconditions
      assert( !c.points()[0] );
      assert( !c.points()[1] );
   };
}



void assoc(
   distance_constraint &c,
   vector2 &p0,
   vector2 &p1
   )
{
   {//preconditions:
      assert( !c.points()[0] );
      assert( !c.points()[1] );
   };
   c.points_[0] = &p0;
   c.points_[1] = &p1;
   {//postconditions:
      assert( c.points()[0] == &p0 );
      assert( c.points()[1] == &p1 );
   };
}



void unassoc(
   distance_constraint &c
   )
{
   if( c.points_[0] ){
      c.points_[0] = 0;
      c.points_[1] = 0;
   }
   {//postconditions
      assert( !c.points()[0] );
      assert( !c.points()[1] );
   };
}



void assoc(
   through_constraint &tc,
   curve &cu,
   vector2 &p
   )
{
   {//preconditions:
      assert( !tc.constrained_curve() );
      assert( tc.points().empty() );
      assert( 2 <= cu.param.size() );
   };
   tc.constrained_curve_ = &cu;
   const unsigned n = cu.param.size();
   tc.points().reserve( n+1 ); //optimisation
   tc.points().push_back( &p );
   for( unsigned i = 0; i < n; i++ ){
      assert( cu.param[i] );
      tc.points().push_back( cu.param[i] );
   };
   {//postconditions:
      assert( tc.constrained_curve() == &cu );
      assert( tc.points()[0] == &p );
      assert( tc.points().size() == cu.param.size()+1 );
      //tc.points[i+1] == tc.param[i] for i in [0 .. tc.param.size()-1];
   };
}



void assoc(
   vector_constraint &c,
   vector2 &p0,
   vector2 &p1
   )
{
   {//preconditions:
      assert( !c.points()[0] );
   };
   c.points_[0] = &p0;
   c.points_[1] = &p1;
   {//postconditions:
      assert( c.points()[0] == &p0 );
      assert( c.points()[1] == &p1 );
   };
}



void unassoc(
   vector_constraint &c
   )
{
   if( c.points_[0] ){
      c.points_[0] = 0;
      c.points_[1] = 0;
   }
   {//postconditions
      assert( !c.points()[0] );
      assert( !c.points()[1] );
   };
}

---