The dimension of the vector. This function always returns 2.

\brief The target node of the arc. Returns the target node of the given arc.

@brief getter for element

\brief Returns the index of the element's component. The method returns the index of the element's component. This is an integer between zero and the

Gives back the the 'after the last' iterator

\brief The source node of the arc. Returns the source node of the given arc.

adds an element to the back of heap and expand if necessary, but does not maintain heap property

\brief Add a new node to the graph. This function adds a new node to the graph. \return The new node.

Gives back the given iterator set for the first key

\brief Add a new arc to the digraph. Add a new arc to the digraph with source node \c s and target node \c t. \return The new arc.

-<a href="qh-user_r.htm#TOC" >-------------------------------</a><a name="errexit">-</a> qh_errexit(qh, exitcode, fac

Return \c true if the box is empty (i.e. return \c false if at least one point was added to the box or the coordinates of the box were set). The coor

-<a href="qh-set_r.htm#TOC" >-------------------------------<a name="setsize">-</a> qh_setsize(qh, set ) returns

Make the box empty

-<a href="qh-globa_r.htm#TOC" >-------------------------------</a><a name="option">-</a> qh_option(qh, option, intVal

@brief get id of the object @return id

\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

@brief convert a task type to a human-readable string */

\brief Add a new edge to the graph. This function adds a new edge to the graph between nodes \c u and \c v with inherent orientation from node \c u t

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

-<a href="qh-poly_r.htm#TOC" >-------------------------------</a><a name="pointid">-</a> qh_pointid(qh, point ) r

\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()

@brief returns mutating iterator to position one past the last element */

@brief getter for the number of valid sites

\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(

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

--------------------------------------------------------------- @brief returns true, if group has no children, false otherwise */

\brief Remove the given item from the heap. This function removes the given item from the heap if it is already stored. \param i The item to delete.

-<a href="qh-set_r.htm#TOC" >-------------------------------<a name="setappend">-</a> qh_setappend(qh, setp, newelem

\brief Returns the ID of the column.

Ensure at least the specified number of free slots at the end

\brief Gives back a representant item of the component. Gives back a representant item of the component.

--------------------------------------------------------------- @brief returns mutating iterator to position of first element */

\brief Return \c true if the given edge is in the matching. This function returns \c true if the given edge is in the current matching.

@brief getter for name

Insert item at specified index, pushing the remaining forward

Give back the top of the box. If the box is empty, then the return value is not defined.

\brief The node with the given index. This function returns the node with the given index. \sa index()

\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

@brief returns number of children */

@brief getter for raw database