* Get the value that is stored for the given key and remove it from the map. This invokes * undefined behavior when the key is not in the map. *

Resizes the underlying \c std::vector container, so changes the keyset of the map. \param size The new size of the map. The new keyset will be the ran

Create a value which is assigned to: ``UnitTesting._extra_arguments``

\brief The first node of the edge. Returns the first node of the given edge. Edges don't have source and target nodes, however, methods u() and v()

FixedArray::end() Returns an iterator to the end of the fixed array.

\brief Replace an item in the heap. This function replaces item \c i with item \c j. Item \c i must be in the heap, while \c j must be out of the hea

\returns the stored value at index \a key * If the value does not exist, then the value \a defaultValue is returned without any insertion. */

\brief Insert a pair of item and priority into the heap. This function inserts \c p.first to the heap with priority \c p.second. \param p The pair to

\returns the value of the current coefficient.

\brief The second node of the edge. Returns the second node of the given edge. Edges don't have source and target nodes, however, methods u() and v(

TODO(sergey): Think of a better place for this. */

@brief Return the length of the quaternion */

* Returns a copy of the value that corresponds to the given key. If the key is not in the * map, the provided default_value is returned. */

\brief The oppositely directed arc. Returns the oppositely directed arc representing the same edge.

\returns the row index of the current coefficient.

return size of container note , python binding disabled for now! cannot yet deal with long-long types