Changeset 2120:a907fb95f1e0 in lemon-0.x
- Timestamp:
- 07/05/06 18:59:45 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2832
- Location:
- lemon/concept
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/concept/bpugraph.h
r2111 r2120 119 119 /// the items; this order has nothing to do with the iteration 120 120 /// ordering of the items. 121 ///122 /// \bug This is a technical requirement. Do we really need this?123 121 bool operator<(Node) const { return false; } 124 122 … … 415 413 /// the items; this order has nothing to do with the iteration 416 414 /// ordering of the items. 417 ///418 /// \bug This is a technical requirement. Do we really need this?419 415 bool operator<(UEdge) const { return false; } 420 416 }; … … 552 548 /// the items; this order has nothing to do with the iteration 553 549 /// ordering of the items. 554 ///555 /// \bug This is a technical requirement. Do we really need this?556 550 bool operator<(Edge) const { return false; } 557 551 -
lemon/concept/graph.h
r2117 r2120 124 124 /// the items; this order has nothing to do with the iteration 125 125 /// ordering of the items. 126 ///127 /// \bug This is a technical requirement. Do we really need this?128 126 bool operator<(Node) const { return false; } 129 127 … … 216 214 /// the items; this order has nothing to do with the iteration 217 215 /// ordering of the items. 218 ///219 /// \bug This is a technical requirement. Do we really need this?220 216 bool operator<(Edge) const { return false; } 221 217 }; -
lemon/concept/ugraph.h
r2111 r2120 108 108 /// the items; this order has nothing to do with the iteration 109 109 /// ordering of the items. 110 ///111 /// \bug This is a technical requirement. Do we really need this?112 110 bool operator<(Node) const { return false; } 113 111 … … 200 198 /// the items; this order has nothing to do with the iteration 201 199 /// ordering of the items. 202 ///203 /// \bug This is a technical requirement. Do we really need this?204 200 bool operator<(UEdge) const { return false; } 205 201 }; … … 338 334 /// the items; this order has nothing to do with the iteration 339 335 /// ordering of the items. 340 ///341 /// \bug This is a technical requirement. Do we really need this?342 336 bool operator<(Edge) const { return false; } 343 337
Note: See TracChangeset
for help on using the changeset viewer.