returns the \c i'th vertex of edge \c e. \c i has to be 0 or 1.

returns whether \c v is a boundary vertex, i.e., at least one of its incident halfface is not associated with a cell.

not ANSI_DECLARATORS */

returns number of faces in the mesh

\returns the number of coefficients, which is rows()*cols(). * \sa rows(), cols(), SizeAtCompileTime. */

Integer representation of a floating-point value. define IR(x) ((udword&)(x))

Total number of elements

returns halfedge container for C++11 range-based for-loops

! @brief access specified array element with bounds checking Returns a reference to the element at specified location @a idx, with bounds

returns edge container for C++11 range-based for-loops

We very rarely use this [] operator, so the assert overhead is fine.

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

@param resize the bitset so that it contains at least size bits * @param size */

Load the rendering parameters from a file.

\returns the value of the matrix at position \a i, \a j * This function returns Scalar(0) if the element is an explicit \em zero */

! @brief return whether pointer points to the root document @return true iff the JSON pointer points to the root document @complexity Co

returns number of edges in the graph

! @brief check whether a string is UTF-8 encoded The function checks each byte of a string whether it is UTF-8 encoded. The result of the

* @return number of features in this index. */

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

* Clears the heap. */

Clear any existing decomposition * \sa rankUpdate(w,sigma) */