Assignment without calling destructor

Resizes a memory block (concept Allocator)

Skip whitespace with SSE 4.2 pcmpistrm instruction, testing 16 8-byte characters at once.

Generate 31 random bits using rand(), which normally generates only 15 random bits.

////////////////////////////////////////////////////////////////////// \deprecated Add a target for the log messages /////////////////////////////////

Just like atoi or atol, but should also work for 64bit numbers Also supports KMG suffixes (e.g. 2K = 2*1024)

* \brief Constructs and returns a btree from the value that was pushed to the builder. The btree builder should not be used again after this point. *

////////////////////////////////////////////////////////////////////// \brief Perform phase 2: Performing all merges in the merge tree except the last

////////////////////////////////////////////////////////////// Return the capacity (i.e., maximum number of T elements) of this b_vector. ////////////

* \brief Returns an iterator to the first element of the container. */

* \brief Returns an iterator to the element following the last element of the container. */

* \brief Move to the ith child * * Requires !is_leaf() and i < count() */

////////////////////////////////////////////////////////////////////// \brief Get the serialized size of the items written. This is exactly the size

/////////////////////////////////////////////////////////////// \brief Returns whether the stack is empty or not. ////////////////////////////////////

Win32 File Seeks use high/low order offsets Getting Highorder 32 Bit OFFSET

Getting Loworder 32 Bit OFFSET

////////////////////////////////////////////////////////////////////// \brief Get options specified for plot(), as a combination of \c node::PLOT val

write, stream

///////////////////////////////////////////////////////////////////// Returns the height of the tree, including the leaf level. A value of 0 represent

////////////////////////////////////////////////////////////////// Checks whether the rectangle and the given rectangle have a non-empty intersection.

////////////////////////////////////////////////////////////////// \returns Whether this file should not be deleted when this object goes out of scope

////////////////////////////////////////////////////////////////////// \brief Make the priority queue safe after a sequence of calls to unsafe_push. /

////////////////////////////////////////////////////////////////////// \brief Compute current memory usage. This includes the item buffer array as w