libbu++.git - System level, general purpose C++ library.

Age	Commit message (Collapse)	Author
2010-10-06	Changed the Bu::Heap to allow iteration, and added lots of cool features to	Mike Buland
	Bu::MiniCron.
2010-02-13	Added and updated the license info in all the source files, they still said	Mike Buland
	copyright 2007-2008.
2009-12-06	I corrected a peculiar heap corner case that caused an infinite loop.	Mike Buland

2009-11-18	Hey, fixed the problems in heap. It should now work properly no matter what the	Mike Buland
	data or order etc.
2009-11-12	I've started my campaign to clean up all of the header files in libbu++ as far	Mike Buland
	as includes go. This required a little bit of reworking as far as archive goes, but I've been planning on changing it aronud for a bit anyway. The final result here is that you may need to add some more includes in your own code, libbu++ doesn't include as many random things you didn't ask for anymore, most of these seem to be bu/hash.h, unistd.h, and time.h. Also, any Archive functions and operators should use ArchiveBase when they can instead of Archive, archivebase.h is a much lighterweight include that will be used everywhere in core that it can be, there are a few classes that actually want a specific archiver to be used, they will use it (such as the nids storage class). So far, except for adding header files, nothing has changed in functionality, and no other code changes should be required, although the above mentioned archive changeover is reccomended.
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	Oops. I made the Bu::Heap API look like a stack, not a queue, that's been	Mike Buland
	fixed, and the Bu::ItoHeap is working and tested. Note that when multiple items have the same sort order, they will come out in random order.
2008-02-19	I believe this will do the trick. The Bu::Heap class now uses the appropriate	Mike Buland
	allocators for all work, every data type used in a Bu::Heap must support the equals operator and <= or >=, or you need to write your own comparison functor. The heap works as both a min-heap and max-heap, just change out the functor used for camparison, kinda' cool. The print function I'll leave in for a little while, but not in the long run, it just prints a dot graph to stdout. Next up, the Ito version.
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.