//////////////////////////////////////////////////// \brief Find the representative of the set contaning a given element. \param t The element of whi

////////////////////////////////////////////////////////////////////// \brief Reverse iterator to beginning of reverse sequence. /////////////////////

////////////////////////////////////////////////////////////////////// \brief Used internally to check order of method calls. ///////////////////////

////////////////////////////////////////////////////////////////////// \brief Return the size of the array. \return The size of the array. //////////

Default constructor creates a null value.

Using GetAdress to read multiple bytes is unsafe as it might be a buffer overflow * * This API is to check first whether GetAdress is safe t

Const member iterator ! \pre IsObject() == true */

* \brief Check if the tree is empty */

////////////////////////////////////////////////////////////////////// Get the ID indicating the block the parent node is stored in. /////////////////

Shared state, must have mutex to use.

////////////////////////////////////////////////////////////////////// \brief Reverse iterator to end of reverse sequence. ///////////////////////////

////////////////////////////////////////////////////////////////////// Returns the weight of a leaf, being its size. Just for symmetry with the nodes.

Get a buffer as copy. * * This API is to be used when GetAdress is not safe to use. */

Gets the JSON pointer pointed to the invalid value.

Gets the keyword of invalid schema.

Gets the JSON pointer pointed to the invalid schema.

insert a new node into the interval tree

search for all intervals that overlap a given interval Returns number of intervals found. Uses two stacks for a non-recursive tree traversal. Kind'o

Initialize this value as constant string, without calling destructor.

//////////////////////////////////////////////////////////////////// \brief Check if we can read an item with read_back(). \returns Whether or not we

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

any, stream

* \brief Returns a range containing all elements with the given * key in the container. The range is defined by two iterators, * one pointing to t

////////////////////////////////////////////////////////////////////// \brief Returns the only logstream object. /////////////////////////////////////

////////////////////////////////////////////////////////////////// This method returns the height of the rectangle. //////////////////////////////////

////////////////////////////////////////////////////////////////////// \brief Get the input push node. ///////////////////////////////////////////////

////////////////////////////////////////////////////////////////////////// \return Whether the object contained is constructed or not. ///////////////

////////////////////////////////////////////////////////////////////// Is this node a leaf? //////////////////////////////////////////////////////////