Alexander Klenin schrieb: > The best Succ(X) algorithm I can think of that works correctly on > sparse enums is O(log enum_size).
It depends how much memory one wastes ;) _______________________________________________ fpc-devel maillist - fpc-devel@lists.freepascal.org http://lists.freepascal.org/mailman/listinfo/fpc-devel
