From: Joel de Guzman (joel_at_[hidden])
Date: 2004-11-18 02:50:01
Gennadiy Rozental wrote:
>>have O(N) instantiations for every lookup, we have O(1).
> I do not understand your code that well to contradict you, but I frankly
> very much doubt so.
>>seem to have an mpl::find_if<> instantiation for every one of those, so
>>make that O(N^2).
> I use mpl algorithm to speed up delepoment. I may've use my own list
> implementation, as you do. And I don't expect it to see signifant diffence
> in both complexity and performance.
How can you be so sure?
-- Joel de Guzman http://www.boost-consulting.com http://spirit.sf.net
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk