From: Yitzhak Sapir (yitzhaks_at_[hidden])
Date: 2002-10-08 14:38:19
> From: Yitzhak Sapir
> The compile time complexity is O(1) for operator* and O(1)
> for operator++,
> because I build compile-time static data structures to hold
> each value of
> the iteration. But the iterator still can't be random access.
I meant the run time complexity for the compile time case.
The compile time complexity for building the tables is
probably closer to n^2 though it could probably be
And I know I'm probably missing lots of "typename"s. But,
unfortunately, my compiler isn't compliant, and I don't
have experience in putting typenames in the right place,
and I believe such experience can only be built with a
compiler that would complain when you have something
wrong. So if there is anyone that could suggest his or her
help in fixing up the typenames, or at least a suitable
compiler to use, would they please offer their advice?
Would Borland 5.5 work? (I have that).
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk