////////////////////////////////////////////////////////////////////// \brief For debugging: Describe the internal stream state in a string. ////////

////////////////////////////////////////////////////////////////// This method returns the x-coordinate of the right boundary. ///////////////////////

////////////////////////////////////////////////////////////////// This method returns the y-coordinate of the upper boundary. ///////////////////////

* Do the final compilation */

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

////////////////////////////////////////////////////////////////////// \brief Check if file is open. /////////////////////////////////////////////////

Checks whether the output is a complete JSON. ! A complete JSON has a complete root object or array. */

////////////////////////////////////////////////////////////////////// \brief End pipeline processing phase. The implementation may pull() from a pul

////////////////////////////////////////////////////////////////////// \brief Get the internal node ID of this node (mainly for debugging purposes). /

////////////////////////////////////////////////////////////////////// Set the flag used to determine the kind of node represented. \param[in] flag th

////////////////////////////////////////////////////////////////////// Set the ID indicating the block the parent node is stored in. \param[in] parent

@endcond

/////////////////////////////////////////////////////////////// Set the persistence status of the (stream underlying the) stack. \param p A persi

* Match a key near: Match as much as possible exact given the minimum prefix length and then return everything below. * * If greedy is True it

* \brief Increase the capacity of the container to a value that's * greater or equal to new_cap. If new_cap is greater than the * current capacity

////////////////////////////////////////////////////////////////////// \brief Return number of elements in map. //////////////////////////////////////

* Initialize a dictionary from a file. * * @param filename filename to load keyvi file from. * @param loading_strategy optional: Loadin

* Get the next non set bit in the bitvector starting from the given position. * @param start_bit the bit to start searching from * @return t

* Write persisted data into the given stream. * @param stream The stream to write into. */

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

////////////////////////////////////////////////////////////////////// Returns the number of children of this node. //////////////////////////////////

* \brief Return the index of this node in its parent * * Requires has_parent() */

////////////////////////////////////////////////////////////////// This method sets the ID. \param[in] id the new id /////////////////////////////////

////////////////////////////////////////////////////////////////////////// \brief Pipelining sorter using std::less. /////////////////////////////////

Get the \ref ParseErrorCode of last parsing.

////////////////////////////////////////////////////////////////////// \brief Begin pipeline processing phase. The implementation may pull() from a p

////////////////////////////////////////////////////////////// Return the size of this block in bytes. ///////////////////////////////////////////////

////////////////////////////////////////////////////////////////////// Returns the maximum number of points that can be stored in this leaf. /////////

////////////////////////////////////////////////////////////////////// Add a new child in the next free slot. \param[in] bb the bounding box of the ch