* @ingroup persistence_matrix * * @brief Default death comparator. Simply assumes that two positive paired columns are never swapped. Which is true

* @brief Removes the given cell by pushing up the matrix the corresponding column and erasing it. * * @param cellID Internal ID of the cell to r

* @brief Computes the births of the current essential cycles. * * @param diag Reference to vector where to store the infinite bars. */

This is a function for computing the sliced Wasserstein distance between two persistence diagrams that have already been projected onto some line

* @brief Stores the filtration value if the value is new. Assumes that the given value is either greater (or equal) * than previous ones or smaller

Transform a Dictionary_const_it into a Dictionary_it

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

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

* @brief Adds the first element to the second one and multiplies the third one with it. * Returns the result in the field. * * @warning Not o

* @brief Adds the first element to the second one and multiplies the third one with it. * Returns the result in the field. * * @param e First

* @brief Adds the first element to the second one and multiplies the third one with it, that is * `((e + a) * m) % productOfAllCharacteristics`, su

* @brief Adds the first element to the second one and multiplies the third one with it, that is * `((e + a) * m) % productOfAllCharacteristics`, su

* @brief Adds the first element to the second one and multiplies the third one with it, that is * `((e + a) * m) % productOfAllCharacteristics`, su

* @brief Adds the first element to the second one and multiplies the third one with it, that is * `((e + a) * m) % productOfAllCharacteristics`, su

* @brief Stores in the first element the sum of two given elements in the field, that is * `(e1 + e2) % productOfAllCharacteristics`, such that the

* @brief Stores in the first element the sum of two given elements in the field, that is * `(e1 + e2) % productOfAllCharacteristics`, such that the

go down recursively in the tree while advancing the simplex iterator. when it reaches a leaf, it inserts the remaining that is not present