ported the graph library to borland

[SVN r7965]
This commit is contained in:
Jeremy Siek
2000-10-17 00:16:05 +00:00
parent b54236986d
commit cebe553621

View File

@ -37,8 +37,11 @@ struct type {};
// class if you want to customize particular policies. // class if you want to customize particular policies.
struct default_iterator_policies struct default_iterator_policies
{ {
// Some of these members were defined static, but Borland got confused
// and thought they were non-const.
template <class Reference, class Iterator> template <class Reference, class Iterator>
static Reference dereference(type<Reference>, const Iterator& x) Reference dereference(type<Reference>, const Iterator& x) const
{ return *x; } { return *x; }
template <class Iterator> template <class Iterator>
@ -54,15 +57,15 @@ struct default_iterator_policies
{ x += n; } { x += n; }
template <class Difference, class Iterator1, class Iterator2> template <class Difference, class Iterator1, class Iterator2>
static Difference distance(type<Difference>, const Iterator1& x, const Iterator2& y) Difference distance(type<Difference>, const Iterator1& x, const Iterator2& y) const
{ return y - x; } { return y - x; }
template <class Iterator1, class Iterator2> template <class Iterator1, class Iterator2>
static bool equal(const Iterator1& x, const Iterator2& y) bool equal(const Iterator1& x, const Iterator2& y) const
{ return x == y; } { return x == y; }
template <class Iterator1, class Iterator2> template <class Iterator1, class Iterator2>
static bool less(const Iterator1& x, const Iterator2& y) bool less(const Iterator1& x, const Iterator2& y) const
{ return x < y; } { return x < y; }
}; };