* Merges two chains. * \param first First chain (will contain the result). * \param second Second chain (will be empty after the merge). * \param c

* Sorts a chain. * It's a stable merge sort using power of 2 buckets, with O(N*log(N)) complexity, * similar to the one used in the SGI STL librarie

* Splices a chain in the middle of another chain. * \param first_before Node before the splice point. * \param first_after Node after the splice poi

* Initializes the list. * The list is completely inplace, so it doesn't need to be deinitialized. */

\internal * Inserts an element at the head of a non-empty list. * The element is inserted at the head of the list. The list cannot be empty. * \par

\internal * Setup a list. */

* Create a new list with a single element. */

* Add an element to an existing list. * \note The element is inserted at the end of the list. */

* Remove an element from the list. */

we need a small function to figure out # of items set in the bm */

Arithmetic. The only hard part is making sure that we're not on a marked-deleted array element

Arithmetic. The only hard part is making sure that we're not on a marked-deleted array element