Accessors for the implementation object.

<b>Effects</b>: Checks if a value can be inserted in the container, using a user provided key instead of the value itself. <b>Returns</b>: If there i

Pass through `make_error_code` function for `boost::system::error_code`. */

Recursive function that finds a matching string in the tree. ! Must check match_results::has_remaining() after match() is * called. This is require

<b>Effects</b>: Copy constructs a map. <b>Complexity</b>: Linear in x.size().

* Compress a 9-bit representation of the refinement configuration * to a 8-bit representation. */

Return the underlying character array directly. Returns a pointer to the underlying array serving as storage. The value returned is s

* Return an iterator pointing to the element past the last used one. */

Access.

Returns the pointer pointing to the owned object

Returns the internal key_t value

Inserts \p value at the end of the vector (resizing if neccessary). Note that calling \c push_back() to insert data values one at a time is inefficie