diff options
author | Gard Spreemann <gspr@nonempty.org> | 2019-09-25 14:29:41 +0200 |
---|---|---|
committer | Gard Spreemann <gspr@nonempty.org> | 2019-09-25 14:29:41 +0200 |
commit | 599d68cd916f533bdb66dd9e684dd5703233b6bb (patch) | |
tree | 4b825dc642cb6eb9a060e54bf8d69288fbee4904 /concept/Simplex_tree/FiltrationValue.h | |
parent | a2e642954ae39025e041471d486ecbac25dff440 (diff) |
Delete all files in order to incorporate upstream's move to git.
Diffstat (limited to 'concept/Simplex_tree/FiltrationValue.h')
-rw-r--r-- | concept/Simplex_tree/FiltrationValue.h | 35 |
1 files changed, 0 insertions, 35 deletions
diff --git a/concept/Simplex_tree/FiltrationValue.h b/concept/Simplex_tree/FiltrationValue.h deleted file mode 100644 index f4dcf985..00000000 --- a/concept/Simplex_tree/FiltrationValue.h +++ /dev/null @@ -1,35 +0,0 @@ - /* This file is part of the Gudhi Library. The Gudhi library - * (Geometric Understanding in Higher Dimensions) is a generic C++ - * library for computational topology. - * - * Author(s): Clément Maria - * - * Copyright (C) 2014 Inria - * - * This program is free software: you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation, either version 3 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with this program. If not, see <http://www.gnu.org/licenses/>. - */ - -/** \brief Value type for a filtration function on a cell complex. - * - * A <EM>filtration</EM> of a cell complex (see FilteredComplex) is - * a function \f$f:\mathbf{K} \rightarrow \mathbb{R}\f$ satisfying \f$f(\tau)\leq - * f(\sigma)\f$ whenever \f$\tau \subseteq \sigma\f$. Ordering the simplices - * by increasing filtration values (breaking ties so as a simplex appears after - * its subsimplices of same filtration value) provides an indexing scheme - * (see IndexingTag). - */ - struct FiltrationValue { - /** \brief Operator < is a StrictWeakOrdering. */ - bool operator<(FiltrationValue f1, FiltrationValue f2); - }; |