From: Dan W. (danw_at_[hidden])
Date: 2004-01-11 13:26:26
Anatoli Tubman wrote:
> On Thursday 08 January 2004 21:30, Dan W. wrote:
>>... and it should be closer to O(1)
> That's O(1) lookup time, but what about comparing two maps?
> The nodes don't have to come up in the same order, so you
> basically need to traverse one of the maps and look up
> each value in the other. Or am I missing something?
No you're right. And for multiplying quantities, one needs to merge
lists, while eliminating duplicates, so I guess map is not up to it... I
guess I was just thinking with the wrong organ...
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk