Algorithms

The descriptions of the algorithms follow the same layout used by Austern:

• The algorithm prototype is stated. Some algorithms can have multiple prototypes. The first version of the algorithm usually assumes some default behavior, which can be overriden by using the second version.
• Preconditions lists all the conditions to be met before the algorithm can be used.
• Requirement on types details what the types of the algorithms' arguments must be.
• Finally, a very simple example is given.

All the examples illustrating each algorithm's description refer to the two following simple implementations of a model of Location and Geo-Value:

class location2d{
  public:
    typedef int coordinate_type;
    location2d(int X, int Y) {coord[0]=X; coord[1]=Y;}
    int& operator[](unsigned int i) {
      assert(i<2); return coord[i];
    }
  
  private:
    int coord[2];
};

class geo_value2d{
  public:
    typedef double property_type;
    typedef location2d location_type;
    geo_value2d();
    geo_value2d(location2d u, double prop) : loc(u), pval(prop) {};
    const location_type& location() const {return loc;}
    property_type& property_value() {return pval;}
    const property_type& property_value() const {return pval;}
  
  private:
    double pval;
    location2d loc;
};