|
|
Boost : |
From: Powell, Gary (powellg_at_[hidden])
Date: 2004-03-23 19:25:10
After a first quick review of the code, indexed set has the same problem as circular queue does with comparison operators. Only one value type comparison is possible. IMO, if two value types have a valid comparison operation, then they are comparable. Memory allocation should have no bearing on this, and the types do not have to be identical.
i.e. an indexed set of shorts, { 1, 2, 3 } is equal to an indexed set of longs { 1L, 2L, 3L }. This means that less user code is written for these sort of things.
More to come as I have time to spend...
-Gary-
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk