multipers 2.2.3__cp312-cp312-win_amd64.whl → 2.3.1__cp312-cp312-win_amd64.whl

multipers/multiparameter_module_approximation/list_column.h

@@ -1,174 +1,174 @@
-/*    This file is part of the MMA Library - https://gitlab.inria.fr/dloiseau/multipers - which is released under MIT.
- *    See file LICENSE for full license details.
- *    Author(s):       Hannah Schreiber
- *
- *    Copyright (C) 2022 Inria
- *
- *    Modification(s):
- *      - YYYY/MM Author: Description of the modification
- */
-
-#ifndef LISTCOLUMN_H
-#define LISTCOLUMN_H
-
-#include <iostream>
-#include <list>
-#include <unordered_set>
-
-#include "utilities.h"
-
-namespace Vineyard {
-
-class List_column
-{
-public:
-    List_column();
-    List_column(boundary_type& boundary);
-    List_column(List_column& column);
-    List_column(List_column&& column) noexcept;
-
-    void get_content(boundary_type& container);
-    bool contains(unsigned int value) const;
-    bool is_empty();
-    dimension_type get_dimension() const;
-    int get_pivot();
-    void clear();
-    void clear(unsigned int value);
-    void reorder(std::vector<index>& valueMap);
-    void add(List_column& column);
-
-    List_column& operator=(List_column other);
-
-    friend void swap(List_column& col1, List_column& col2);
-
-private:
-    int dim_;
-    std::list<unsigned int> column_;
-};
-
-inline List_column::List_column() : dim_(0)
-{}
-
-inline List_column::List_column(boundary_type &boundary)
-    : dim_(boundary.size() == 0 ? 0 : boundary.size() - 1),
-      column_(boundary.begin(), boundary.end())
-{}
-
-inline List_column::List_column(List_column &column)
-    : dim_(column.dim_),
-	  column_(column.column_)
-{}
-
-inline List_column::List_column(List_column &&column) noexcept
-    : dim_(std::exchange(column.dim_, 0)),
-	  column_(std::move(column.column_))
-{}
-
-inline void List_column::get_content(boundary_type &container)
-{
-    std::copy(column_.begin(), column_.end(), std::back_inserter(container));
-}
-
-inline bool List_column::contains(unsigned int value) const
-{
-	for (unsigned int v : column_){
-        if (v == value) return true;
-    }
-    return false;
-}
-
-inline bool List_column::is_empty()
-{
-    return column_.empty();
-}
-
-inline dimension_type List_column::get_dimension() const
-{
-    return dim_;
-}
-
-inline int List_column::get_pivot()
-{
-	if (column_.empty()) return -1;
-
-    return column_.back();
-}
-
-inline void List_column::clear()
-{
-    column_.clear();
-}
-
-inline void List_column::clear(unsigned int value)
-{
-    auto it = column_.begin();
-    while (it != column_.end() && *it != value) it++;
-    if (it != column_.end()) column_.erase(it);
-}
-
-inline void List_column::reorder(std::vector<index> &valueMap)
-{
-	std::list<unsigned int>::iterator it = column_.begin();
-	while (it != column_.end()) {
-		*it = valueMap.at(*it);
-		it++;
-	}
-	column_.sort();
-}
-
-inline void List_column::add(List_column &column)
-{
-    if (column.is_empty()) return;
-    if (column_.empty()){
-        std::copy(column.column_.begin(), column.column_.end(), std::back_inserter(column_));
-        return;
-    }
-
-    std::list<unsigned int>::iterator itToAdd = column.column_.begin();
-    std::list<unsigned int>::iterator itTarget = column_.begin();
-    unsigned int valToAdd = *itToAdd;
-    unsigned int valTarget = *itTarget;
-
-    while (itToAdd != column.column_.end() && itTarget != column_.end())
-    {
-        if (itToAdd != column.column_.end() && itTarget != column_.end()){
-            if (valToAdd == valTarget){
-                column_.erase(itTarget++);
-                itToAdd++;
-            } else if (valToAdd < valTarget){
-                column_.insert(itTarget, valToAdd);
-                itToAdd++;
-            } else {
-                itTarget++;
-            }
-        }
-
-        valToAdd = *itToAdd;
-        valTarget = *itTarget;
-    }
-
-    while (itToAdd != column.column_.end()){
-        valToAdd = *itToAdd;
-        if (itToAdd != column.column_.end()){
-            column_.push_back(valToAdd);
-            itToAdd++;
-        }
-    }
-}
-
-inline List_column &List_column::operator=(List_column other)
-{
-    std::swap(dim_, other.dim_);
-    std::swap(column_, other.column_);
-    return *this;
-}
-
-inline void swap(List_column& col1, List_column& col2)
-{
-    std::swap(col1.dim_, col2.dim_);
-    col1.column_.swap(col2.column_);
-}
-
-}   //namespace Vineyard
-
-#endif // LISTCOLUMN_H
+/*    This file is part of the MMA Library - https://gitlab.inria.fr/dloiseau/multipers - which is released under MIT.
+ *    See file LICENSE for full license details.
+ *    Author(s):       Hannah Schreiber
+ *
+ *    Copyright (C) 2022 Inria
+ *
+ *    Modification(s):
+ *      - YYYY/MM Author: Description of the modification
+ */
+
+#ifndef LISTCOLUMN_H
+#define LISTCOLUMN_H
+
+#include <iostream>
+#include <list>
+#include <unordered_set>
+
+#include "utilities.h"
+
+namespace Vineyard {
+
+class List_column
+{
+public:
+    List_column();
+    List_column(boundary_type& boundary);
+    List_column(List_column& column);
+    List_column(List_column&& column) noexcept;
+
+    void get_content(boundary_type& container);
+    bool contains(unsigned int value) const;
+    bool is_empty();
+    dimension_type get_dimension() const;
+    int get_pivot();
+    void clear();
+    void clear(unsigned int value);
+    void reorder(std::vector<index>& valueMap);
+    void add(List_column& column);
+
+    List_column& operator=(List_column other);
+
+    friend void swap(List_column& col1, List_column& col2);
+
+private:
+    int dim_;
+    std::list<unsigned int> column_;
+};
+
+inline List_column::List_column() : dim_(0)
+{}
+
+inline List_column::List_column(boundary_type &boundary)
+    : dim_(boundary.size() == 0 ? 0 : boundary.size() - 1),
+      column_(boundary.begin(), boundary.end())
+{}
+
+inline List_column::List_column(List_column &column)
+    : dim_(column.dim_),
+	  column_(column.column_)
+{}
+
+inline List_column::List_column(List_column &&column) noexcept
+    : dim_(std::exchange(column.dim_, 0)),
+	  column_(std::move(column.column_))
+{}
+
+inline void List_column::get_content(boundary_type &container)
+{
+    std::copy(column_.begin(), column_.end(), std::back_inserter(container));
+}
+
+inline bool List_column::contains(unsigned int value) const
+{
+	for (unsigned int v : column_){
+        if (v == value) return true;
+    }
+    return false;
+}
+
+inline bool List_column::is_empty()
+{
+    return column_.empty();
+}
+
+inline dimension_type List_column::get_dimension() const
+{
+    return dim_;
+}
+
+inline int List_column::get_pivot()
+{
+	if (column_.empty()) return -1;
+
+    return column_.back();
+}
+
+inline void List_column::clear()
+{
+    column_.clear();
+}
+
+inline void List_column::clear(unsigned int value)
+{
+    auto it = column_.begin();
+    while (it != column_.end() && *it != value) it++;
+    if (it != column_.end()) column_.erase(it);
+}
+
+inline void List_column::reorder(std::vector<index> &valueMap)
+{
+	std::list<unsigned int>::iterator it = column_.begin();
+	while (it != column_.end()) {
+		*it = valueMap.at(*it);
+		it++;
+	}
+	column_.sort();
+}
+
+inline void List_column::add(List_column &column)
+{
+    if (column.is_empty()) return;
+    if (column_.empty()){
+        std::copy(column.column_.begin(), column.column_.end(), std::back_inserter(column_));
+        return;
+    }
+
+    std::list<unsigned int>::iterator itToAdd = column.column_.begin();
+    std::list<unsigned int>::iterator itTarget = column_.begin();
+    unsigned int valToAdd = *itToAdd;
+    unsigned int valTarget = *itTarget;
+
+    while (itToAdd != column.column_.end() && itTarget != column_.end())
+    {
+        if (itToAdd != column.column_.end() && itTarget != column_.end()){
+            if (valToAdd == valTarget){
+                column_.erase(itTarget++);
+                itToAdd++;
+            } else if (valToAdd < valTarget){
+                column_.insert(itTarget, valToAdd);
+                itToAdd++;
+            } else {
+                itTarget++;
+            }
+        }
+
+        valToAdd = *itToAdd;
+        valTarget = *itTarget;
+    }
+
+    while (itToAdd != column.column_.end()){
+        valToAdd = *itToAdd;
+        if (itToAdd != column.column_.end()){
+            column_.push_back(valToAdd);
+            itToAdd++;
+        }
+    }
+}
+
+inline List_column &List_column::operator=(List_column other)
+{
+    std::swap(dim_, other.dim_);
+    std::swap(column_, other.column_);
+    return *this;
+}
+
+inline void swap(List_column& col1, List_column& col2)
+{
+    std::swap(col1.dim_, col2.dim_);
+    col1.column_.swap(col2.column_);
+}
+
+}   //namespace Vineyard
+
+#endif // LISTCOLUMN_H