equal
deleted
inserted
replaced
116 /// similar associative container we require this. |
116 /// similar associative container we require this. |
117 /// |
117 /// |
118 /// \note This operator only have to define some strict ordering of |
118 /// \note This operator only have to define some strict ordering of |
119 /// the items; this order has nothing to do with the iteration |
119 /// the items; this order has nothing to do with the iteration |
120 /// ordering of the items. |
120 /// ordering of the items. |
121 /// |
|
122 /// \bug This is a technical requirement. Do we really need this? |
|
123 bool operator<(Node) const { return false; } |
121 bool operator<(Node) const { return false; } |
124 |
122 |
125 }; |
123 }; |
126 |
124 |
127 /// \brief The base type of anode iterators, |
125 /// \brief The base type of anode iterators, |
412 /// similar associative container we require this. |
410 /// similar associative container we require this. |
413 /// |
411 /// |
414 /// \note This operator only have to define some strict ordering of |
412 /// \note This operator only have to define some strict ordering of |
415 /// the items; this order has nothing to do with the iteration |
413 /// the items; this order has nothing to do with the iteration |
416 /// ordering of the items. |
414 /// ordering of the items. |
417 /// |
|
418 /// \bug This is a technical requirement. Do we really need this? |
|
419 bool operator<(UEdge) const { return false; } |
415 bool operator<(UEdge) const { return false; } |
420 }; |
416 }; |
421 |
417 |
422 /// This iterator goes through each undirected edge. |
418 /// This iterator goes through each undirected edge. |
423 |
419 |
549 /// similar associative container we require this. |
545 /// similar associative container we require this. |
550 /// |
546 /// |
551 /// \note This operator only have to define some strict ordering of |
547 /// \note This operator only have to define some strict ordering of |
552 /// the items; this order has nothing to do with the iteration |
548 /// the items; this order has nothing to do with the iteration |
553 /// ordering of the items. |
549 /// ordering of the items. |
554 /// |
|
555 /// \bug This is a technical requirement. Do we really need this? |
|
556 bool operator<(Edge) const { return false; } |
550 bool operator<(Edge) const { return false; } |
557 |
551 |
558 }; |
552 }; |
559 /// This iterator goes through each directed edge. |
553 /// This iterator goes through each directed edge. |
560 |
554 |