\brief The arc goes down from the node. Gives back the arc goes down from the node. If there is not outgoing arc then it gives back INVALID.

Return true if level \c l is empty.

\brief Return the first edge. This function gives back the first edge in the iteration order.

/ * @brief forwards string to first non-whitespace char; * std string -> unsigned conv yields max value, but we want 0; * also checks

Compute 2*exp(-1j*pi*u/(2N)), but not exactly the same. The actual return is 2*cos(pi*u/(2N)), 2*sin(pi*u/(2N)). This will make later multipl

Return the level of the highest active item or -1 if there is no active item.

@brief compute 1D index

Lift the item returned by highestActive() by one.

Lift the item returned by highestActive() to the top level and deactivate it.

This function lifts all items on and above level \c l to the top level and deactivates them.

Dummy parameter.

Merge the heap with another heap starting at the given position

@brief Given the net id of a clock net, return its clock id @return The clock id of the clock net with net id netId If the given net is not a clock ne

@brief get the new instance id given old instance id

\brief Return the next edge. This function gives back the next edge in the iteration order.

============================================= [BEGIN ] >>>>>>> Multi-Die Attribute >>>>>>> =============================================

-<a href="qh-poly_r.htm#TOC" >-------------------------------</a><a name="appendvertex">-</a> qh_appendvertex(qh, ver

-<a href="qh-poly_r.htm#TOC" >-------------------------------</a><a name="checkconvex">-</a> qh_checkconvex(qh, facet

-<a href="qh-geom_r.htm#TOC" >-------------------------------</a><a name="detsimplex">-</a> qh_detsimplex(qh, apex, p

-<a href="qh-geom_r.htm#TOC" >-------------------------------</a><a name="findbest">-</a> qh_findbest(qh, point, star

-<a href="qh-geom_r.htm#TOC" >-------------------------------</a><a name="findbestnew">-</a> qh_findbestnew(qh, point

-<a href="qh-merge_r.htm#TOC" >-------------------------------</a><a name="freemergesets">-</a> qh_freemergesets(qh )

-<a href="qh-poly_r.htm#TOC" >-------------------------------</a><a name="getreplacement">-</a> qh_getreplacement(qh,

-<a href="qh-merge_r.htm#TOC" >-------------------------------</a><a name="initmergesets">-</a> qh_initmergesets(qh )

-<a href="qh-geom_r.htm#TOC" >-------------------------------</a><a name="inthresholds">-</a> qh_inthresholds(qh, nor

-<a href="qh-qhull_r.htm#TOC" >-------------------------------</a><a name="partitionpoint">-</a> qh_partitionpoint(qh

-<a href="qh-poly_r.htm#TOC" >-------------------------------</a><a name="point_add">-</a> qh_point_add(qh, set, poin

-<a href="qh-user_r.htm#TOC" >-------------------------------</a><a name="printfacetlist">-</a> qh_printfacetlist(qh,

-<a href="qh-geom_r.htm#TOC" >-------------------------------</a><a name="printmatrix">-</a> qh_printmatrix(qh, fp, s

-<a href="qh-geom_r.htm#TOC" >-------------------------------</a><a name="printpoints">-</a> qh_printpoints(qh, fp, s

-<a href="qh-io_r.htm#TOC" >-------------------------------</a><a name="printridge">-</a> qh_printridge(qh, fp, ridge

-<a href="qh-qhull_r.htm#TOC" >-------------------------------</a><a name="printsummary">-</a> qh_printsummary(qh, fp

-<a href="qh-geom_r.htm#TOC" >-------------------------------</a><a name="setfacetplane">-</a> qh_setfacetplane(qh, f

-<a href="qh-set_r.htm#TOC" >-------------------------------<a name="setfreelong">-</a> qh_setfreelong(qh, setp )

-<a href="qh-set_r.htm#TOC" >-------------------------------<a name="settemppop">-</a> qh_settemppop(qh) pop and

-<a href="qh-poly_r.htm#TOC" >-------------------------------</a><a name="vertexintersect_new">-</a> qh_vertexinterse

\brief Called when a node is reached first time. This function is called when a node is reached first time.

Top function to perform the direct legalization

Set the direction of optimization

\brief Set the priority of an item or insert it, if it is not stored in the heap. This method sets the priority of the given item if it is already st

\brief Set the priority of an item or insert it, if it is not stored in the heap. This method sets the priority of the given item if it is already st

\brief Set the priority of an item or insert it, if it is not stored in the heap. This method sets the priority of the given item if it is already st

\brief Sets the priority of the current item. Sets the priority of the current item.

@brief setter for model pin index

@brief setter for net

@brief setter for x

TODO: assert point is dereferenceable? If site map have one, then use it. Otherwise, we compute it ourselves

\brief The number of items stored in the heap. This function returns the number of items stored in the heap.

\brief The number of items stored in the heap. This function returns the number of items stored in the heap.

\brief The number of items stored in the heap. This function returns the number of items stored in the heap.

Read the current time values of the process

Start the stopwatch.