////////////////////////////////////////////////////////////////////// \brief Return iterator to beginning of map. ///////////////////////////////////

///////////////////////////////////////////////////////////////////// Returns the logical block factor. The block size is obtained by multiplying the

////////////////////////////////////////////////////////////////////// \brief Special-value constructor returning a pointer to the end. /////////////

int getopts_usage() * * Returns: 1 - Successful */

////////////////////////////////////////////////////////////////////// \brief Initialize node constructed in a subclass. This lets the user define a

* \brief Return true if this is a leaf node */

////////////////////////////////////////////////////////////////////// Is this node the tree's root? /////////////////////////////////////////////////

A simple progress bar that shows percentage complete and current file offset

* Clear the bit vector (reset all to 0) */

Check whether the array is empty.

Whether the result is an error.

////////////////////////////////////////////////////////////////////////// \internal Unregister a registered pointer. ////////////////////////////////

////////////////////////////////////////////////////////////////////// \brief Get iterator to element. \param key Key of element to find. ////////////

files.close_readers_and_delete() should be called after this

////////////////////////////////////////////////////////////////////// Get the flag used to determine the kind of node represented. //////////////////

int getopts() * * Returns: -1 - Couldn't allocate memory. Please handle me. * 0 - No arguements to parse * # - The number in

Return true if given point is inside the box defined by hi and lo.