BOUML is a UML 2 tool box that allows you to specify and generate code in C++, Java, IDL, and PHP. BOUML is very fast and doesn't require much memory to manage several thousands of classes. BOUML is extensible, and the external tools (named plug-outs) can be written in C++ or Java, using BOUML for their definition as any other program. UML models can be exported to HTML pages, including PNG or SVG graphics.
BPS implements a B-tree with a twist pointer set, which approaches the speed of the fastest, hash table based sets, while using several times less memory and still maintaining order. The set introduces a new B-tree variety with superior search and edit qualities. Compared with the GCC distributed tr1::unordered_set, the new set is only 30% slower while using 3 times less memory. Compared with the ordered std::set, it is almost 4 times faster while using 5 times less memory.
BS is a data structures library. It features fixed size, random access sequences. The sequences are constructed over B-trees. Complexity for most single item operations is about O(logN). The sequences are three to five times faster over random access BST-based sequences, while having better memory usage characteristics.
bscallmon is a small GUI tool that allows you to view the list of incoming and outgoing phone calls on routers running the BitSwitcher firmware without having to log into the router's Web interface. Features include a phone book, custom icons, unlimited call list size, and optional systray integration and call notification. It does not require compiling and runs on both Unix and Windows systems.