3 Apr
2015
3 Apr
'15
9:47 a.m.
This is really good, I hadn't heard about this before. Is there a van embe
boas tree implementation in c++ anywhere in boost?
On Fri, Apr 3, 2015 at 5:36 AM, Cosmin Boaca
If your keys are in such a bounded range maybe a VEB tree may be more suitable [0]. It has O(log log M) complexity on insert operation and if you have many entries it should work good and be quite space efficient. If it doesn't suites your needs, maybe I have misunderstood the problem.
http://en.wikipedia.org/wiki/Van_Emde_Boas_tree
Cosmin
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost