Age | Commit message (Collapse) | Author | |
---|---|---|---|
2008-02-20 | Applied an update from Hash to Set (they're basically the same logic/code, in | Mike Buland | |
fact, I need to get in there and change all the comments and exceptions in Set to refer to Set and not Hash). Util has the functors in it that are shared now, and List actually uses those functors for it's insertSorted function, that thing has come in so handy. | |||
2008-02-19 | Bu::Heap is a real class, it works great, except it doesn't grow right now. | Mike Buland | |
I'm thinking the heap should add one layer to the binary tree each time it grows, which means double+1 each time. The Bu::ItoHeap will be implemented as soon as the rest of Bu::Heap is done. Also, I finally added bu/util.h which is mainly handy template functions like Bu::swap, Bu::min, Bu::max, and Bu::mid. A few more may be added. |