////////////////////////////////////////////////////////////////////// \brief Return an iterator to the end of the array. \return An iterator to the

* Add a key-value pair to the generator. * @param input_key The input key. * @param value A value (depending on the Valuestore implementation).

////////////////////////////////////////////////////////////////////// \brief Return an iterator to the beginning of the array. \return An iterator t

////////////////////////////////////////////////////////////////////// \brief Return an iterator to the i'th element of the array. \param idx The ind

////////////////////////////////////////////////////////////////////// Return the number of points stored in the tree. ///////////////////////////////

* Sets a bit in the bitvector. * @param bit the bit to set. */

////////////////////////////////////////////////////////////////////// \brief Change the size of the array. All elements are lost. Memory manager MU

/////////////////////////////////////////////////////////////// \brief Returns the number of items currently on the queue. \return Number of itmes in

////////////////////////////////////////////////////////////// Get the id of the block. /////////////////////////////////////////////////////////////

/////////////////////////////////////////////////////////////// \deprecated This should go as soon as all old code has been migrated. ////////////////

////////////////////////////////////////////////////////////////////// \brief Return a raw pointer to the array content. /////////////////////////////

* \brief Inserts element(s) into the container, if the container * doesn't already contain an element with an equivalent key. * * \return Return

Get the token array (const version only).

Recursively decodes byte strings to unicode

* Exact Match function. * * @param key the key to lookup. * @return a match iterator */

* A simple Contains method to check whether a key is in the dictionary. * * @param key The key * @return True if key is in the dictiona

/////////////////////////////////////////////////////////////// \brief Check if the queue is empty \return true if the queue is empty otherwize false

Whether a parse error has occured in the last parsing.

//////////////////////////////////////////////////////////////////// \brief Check if we can read an item with read(). This is logically equivalent to

///////////////////////////////////////////////////////////////////// Inquire the number of elements stored in the leaves of this tree. //////////////

////////////////////////////////////////////////////////////////////// Inquire the number of type t events. //////////////////////////////////////////

* \brief Returns the number of elements with key k. */

////////////////////////////////////////////////////////////// Sample the real time and store it /////////////////////////////////////////////////////

////////////////////////////////////////////////////////////////////// Record ONE event of type t. ///////////////////////////////////////////////////

////////////////////////////////////////////////////////////////////// Inquires the size (number of points stored). //////////////////////////////////

* \brief Return the number of elements in the tree */

////////////////////////////////////////////////////////////////////// \brief Step the progress indicator. \param steps How many steps to step. /////