* Computes the number of landscape functions. **/

\brief Returns the number of simplices in the simplex_tree. * * This function takes time linear in the number of simplices. */

* @brief Returns the row index stored in the entry. * * @return @ref rowindex "Row index" of the entry. */

TODO: check which one is faster (probably doesn't matter)

\brief Returns a range over the vertices of a simplex. * * The order in which the vertices are visited is the decreasing order for < on Vertex_h

* @brief Returns the dimension of the given sibling simplices. * * @param curr_sib Pointer to the sibling container. * @return Height of the

* Computes the number of landscape functions. **/

* @brief Adds a new vertex or a new edge in a flag complex, as well as all * simplices of its star, defined to maintain the property * of the

* @brief Returns the value of the element. * * @return Value of the element. */

\brief Returns a Simplex_handle different from all Simplex_handles * associated to the simplices in the simplicial complex. * * One can call

* Returns number of all cubes in the data structure. **/

* Return a size of a vector. **/

\brief Sets the filtration value of a simplex. * \exception std::invalid_argument In debug mode, if sh is a null_simplex. */

\brief Returns an upper bound on the dimension of the simplicial complex. * * @note Not thread safe */

\brief Returns the children of the node in the simplex tree pointed by sh. * \exception std::invalid_argument In debug mode, if sh has no child.

* @brief Adds an edge between vertices a and b without blockers. * @details For instance, the complex contains edge 01 and 12, then calling * ad

* @brief Destroys the given entry. * * @param entry @ref Entry pointer. */

\brief Returns the number of finite vertices in the triangulation. */

* @brief Adds a vertex to the simplicial complex and returns its Vertex_handle. * @remark Vertex representation is contiguous. */

\brief Remove all the simplices, leaving an empty complex. */

* @brief Sets the value. * * @param element Value to store. */

:returns: A simplex tree created from the Cover complex. :rtype: SimplexTree

* @brief Returns a Complex_vertex_range over all vertices of the complex */

* Return number of points in the diagram. **/

\brief Initializes the coefficient field.*/

\brief Compute the persistent homology of the filtered simplicial * complex. * * @param[in] min_interval_length the computation discards all

* @brief Stores in the first element the multiplication of two given elements in the field, * that is `(e1 * e2) % characteristic`, such that the r

* @brief returns the number of blockers in the complex. */

\brief Output the persistence diagram in ostream. * * The file format is the following: * p1*...*pr dim b d * * where "dim" is the

* @brief Returns the sum of two elements in the field. * * @param e1 First element. * @param e2 Second element. * @return `(e1 + e2) % cha

* A procedure used to compare doubles. Typically given two doubles \f$ A \f$ and \f$ B \f$, comparing both with * \f$ A == B \f$ is not good idea. In

\brief Dimension of the triangulation. */

* @brief Returns the multiplication of two elements in the field. * * @param e1 First element. * @param e2 Second element. * @return `(e1

Restart the timer

* @brief Returns the current characteristic. * * @return The value of the current characteristic. */

Args: X ((n,d)-array of float|(n,n)-array of float|Sequence[Iterable[int]]): coordinates of the points, or distan