leonardo (![[info]](http://l-stat.livejournal.com/img/userinfo.gif){kind=small} leonardo_m) wrote, |
Re: Convex Hull
Thank you, I update it daily/weekly, I try to write good code, but the whole lib is a bit messy anyway. The things I may add in some of the next days: the missing set methods, better memory management of dynamic arrays, opCat() method among some lazy iterables (or maybe a simpler xchain()). Later I'll try to add a fast Deque data structure, at the moment it's half finished.
dsource maintainers have ignored my request twice.
For Blaze, I think you need a "priority queue" data structure, able to be filtered quickly, so it may be actually implemented as a B+ tree or something similar (but something simpler may be enough too). My future Deque will not help you much.
your Big D library and you have a treasure trove of great code!
Thank you, I update it daily/weekly, I try to write good code, but the whole lib is a bit messy anyway. The things I may add in some of the next days: the missing set methods, better memory management of dynamic arrays, opCat() method among some lazy iterables (or maybe a simpler xchain()). Later I'll try to add a fast Deque data structure, at the moment it's half finished.
Have you thought about moving it to www.dsource.org as a project?
dsource maintainers have ignored my request twice.
For Blaze, I think you need a "priority queue" data structure, able to be filtered quickly, so it may be actually implemented as a B+ tree or something similar (but something simpler may be enough too). My future Deque will not help you much.
