--------------------------------------------------------------- @brief returns if a group/parameter is blocking/positional */

-<a href="qh-set_r.htm#TOC" >-------------------------------<a name="settempfree">-</a> qh_settempfree(qh, set )

Getters

\brief Direct the edge. Direct the given edge. The returned arc represents the given edge and its direction comes from the bool parameter. If it is \

\brief Swaps the position of the two items in the map. Swaps the position of the two items in the map.

@brief iterator only to valid sites

-<a href="qh-geom_r.htm#TOC" >-------------------------------</a><a name="distplane">-</a> qh_distplane(qh, point, fa

Returns \c true if \c v is reached from the root(s). \pre Either \ref run(Node) "run()" or \ref init() must be called before using this function.

\brief Initializes the internal data structures. Initializes the internal data structures.

\brief Remove the item having minimum priority. This function removes the item having minimum priority. \pre The heap must be non-empty.

--------------------------------------------------------------- @brief returns if a group/parameter is repeatable */

-<a href="qh-mem_r.htm#TOC" >--------------------------------</a><a name="memfree">-</a> qh_memfree(qh, object, insiz

Does NOT check capacity. To be used after ensure_slots, for example.

Returns the distance of the given node from the root(s). \warning If node \c v is not reached from the root(s), then the return value of this functio

@brief width of the box

\brief The minimum priority. This function returns the minimum priority. \pre The heap must be non-empty.

-<a href="qh-qhull_r.htm#TOC" >-------------------------------</a><a name="errexit2">-</a> qh_errexit2(qh, exitcode,

Set output format. The output format is global for all timestamp instances.

\brief Number of nodes.

\brief Split the current path. It splits the current path into two parts. The part before the iterator \c it will remain in the current path and the

@brief getter for resource capacity

Executes the algorithm. This method runs the %DFS algorithm from the root node in order to compute the DFS path to each node. The algorithm computes

@brief capacity of the map

-<a href="qh-set_r.htm#TOC" >-------------------------------<a name="settemp">-</a> qh_settemp(qh, setsize ) retu

Adds a new source node to the set of nodes to be processed. \pre The stack must be empty. Otherwise the algorithm gives wrong results. (One of the ou

\brief Returns the edge connecting the given nodes. Returns the edge connecting the given nodes.

\brief Gives back a pointer to the notifier which the map attached into. This function gives back a pointer to the notifier which the map attached in

Returns \c true if \c a is \e surely positive

Key is internally allocated and copied; value is simply assigned

This function gives back \c true if the given node is valid, i.e. it is a real node of the graph. \warning A removed node could become valid again if

Add a new box to the box list

-<a href="qh-set_r.htm#TOC" >-------------------------------<a name="setfree">-</a> qh_setfree(qh, setp ) frees t

\brief First item in the container. Returns the first item in the container. It is for start the iteration on the container.

-<a href="qh-globa_r.htm#TOC" >-------------------------------</a><a name="strtol">-</a> qh_strtol( s, endp) qh_strto

\brief Next item in the container. Returns the next item in the container. It is for iterate on the container.

@brief number of BLEs in a CLB

--------------------------------------------------------------- @brief returns if a parameter is required */

@brief setter for the dimensions

\brief Return the state of an item. This method returns \c PRE_HEAP if the given item has never been in the heap, \c IN_HEAP if it is in the heap at

@brief getter for height

\brief Length of the path.

-<a href="qh-set_r.htm#TOC" >-------------------------------<a name="setin">-</a> qh_setin( set, setelem ) return

\brief Decrease the priority of an item to the given value. This function decreases the priority of an item to the given value. \param i The item. \p

@brief number of instances

@brief shortcut getter for pin

@brief reserve capacity @param s1 size of the first dimension @param s total number of elements

@brief returns if children are mutually exclusive alternatives */

Returns the size of the map.