Re: a van Emde Boas tree
On Tuesday, 5 February 2019 at 16:04:03 UTC, Petar Kirov [ZombineDev] wrote: On Tuesday, 5 February 2019 at 15:47:30 UTC, Dejan Lekic wrote: On Tuesday, 5 February 2019 at 15:28:04 UTC, Alex wrote: Hi all, my van Emde Boas tree finally reached an announceable state, at version 0.12.0. vEB tree is an interesting data structure. Where is the implementation? - You did not provide any links... Most likely the repo is this one: https://github.com/Sandman83/vebtree Yes... sorry. Too deep in the code... https://code.dlang.org/packages/vebtree
Re: a van Emde Boas tree
Dne 5.2.2019 v 16:47 Dejan Lekic via Digitalmars-d-announce napsal(a): > On Tuesday, 5 February 2019 at 15:28:04 UTC, Alex wrote: >> Hi all, >> my van Emde Boas tree finally reached an announceable state, at >> version 0.12.0. > > vEB tree is an interesting data structure. Where is the implementation? > - You did not provide any links... I guess it is: https://code.dlang.org/packages/vebtree
Re: a van Emde Boas tree
On Tuesday, 5 February 2019 at 15:47:30 UTC, Dejan Lekic wrote: On Tuesday, 5 February 2019 at 15:28:04 UTC, Alex wrote: Hi all, my van Emde Boas tree finally reached an announceable state, at version 0.12.0. vEB tree is an interesting data structure. Where is the implementation? - You did not provide any links... Most likely the repo is this one: https://github.com/Sandman83/vebtree
Re: a van Emde Boas tree
On Tuesday, 5 February 2019 at 15:28:04 UTC, Alex wrote: Hi all, my van Emde Boas tree finally reached an announceable state, at version 0.12.0. vEB tree is an interesting data structure. Where is the implementation? - You did not provide any links...
Re: a van Emde Boas tree
On Tuesday, 5 February 2019 at 15:28:04 UTC, Alex wrote: Hi all, my van Emde Boas tree finally reached an announceable state, at version 0.12.0. clip All tickets are welcome of course and will be managed in my spare time. Link?
a van Emde Boas tree
Hi all, my van Emde Boas tree finally reached an announceable state, at version 0.12.0. It operates on a closed universe, defined on construction. After that, the tree operates on unique key up to a certain capacity, which is at least as large as the universe size. All operations including insertion, removing, look up and next neighbor search are O(log(log(U)). min and max lookup are O(1). Some graphics are included on the front page for performance comparison with existent libraries. I relicensed the package to BSL-1.0 and moved it on github, so the documentation should work properly now. All tickets are welcome of course and will be managed in my spare time.
