summaryrefslogtreecommitdiff
path: root/src/Witness_complex/include/gudhi/Witness_complex/all_faces_in.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/Witness_complex/include/gudhi/Witness_complex/all_faces_in.h')
-rw-r--r--src/Witness_complex/include/gudhi/Witness_complex/all_faces_in.h30
1 files changed, 25 insertions, 5 deletions
diff --git a/src/Witness_complex/include/gudhi/Witness_complex/all_faces_in.h b/src/Witness_complex/include/gudhi/Witness_complex/all_faces_in.h
index d009caca..b68d75a1 100644
--- a/src/Witness_complex/include/gudhi/Witness_complex/all_faces_in.h
+++ b/src/Witness_complex/include/gudhi/Witness_complex/all_faces_in.h
@@ -1,3 +1,25 @@
+/* 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): Siargey Kachanovich
+ *
+ * Copyright (C) 2015 INRIA (France)
+ *
+ * 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/>.
+ */
+
#ifndef WITNESS_COMPLEX_ALL_FACES_IN_H_
#define WITNESS_COMPLEX_ALL_FACES_IN_H_
@@ -9,16 +31,14 @@ template < typename SimplicialComplexForWitness,
typename Simplex >
bool all_faces_in(Simplex& simplex,
double* filtration_value,
- SimplicialComplexForWitness& sc)
- {
+ SimplicialComplexForWitness& sc) {
typedef typename SimplicialComplexForWitness::Simplex_handle Simplex_handle;
if (simplex.size() == 1)
return true; /* Add vertices unconditionally */
-
+
Simplex facet;
- for (typename Simplex::iterator not_it = simplex.begin(); not_it != simplex.end(); ++not_it)
- {
+ for (typename Simplex::iterator not_it = simplex.begin(); not_it != simplex.end(); ++not_it) {
facet.clear();
for (typename Simplex::iterator it = simplex.begin(); it != simplex.end(); ++it)
if (it != not_it)