multipers 2.3.3b6__cp312-cp312-macosx_10_13_x86_64.whl

multipers/gudhi/gudhi/Persistence_matrix/columns/unordered_set_column.h

@@ -0,0 +1,1012 @@
+/*    This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
+ *    See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
+ *    Author(s):       Hannah Schreiber
+ *
+ *    Copyright (C) 2022-24 Inria
+ *
+ *    Modification(s):
+ *      - YYYY/MM Author: Description of the modification
+ */
+
+/**
+ * @file unordered_set_column.h
+ * @author Hannah Schreiber
+ * @brief Contains the @ref Gudhi::persistence_matrix::Unordered_set_column class.
+ * Also defines the std::hash method for @ref Gudhi::persistence_matrix::Unordered_set_column.
+ */
+
+#ifndef PM_UNORDERED_SET_COLUMN_H
+#define PM_UNORDERED_SET_COLUMN_H
+
+#include <vector>
+#include <stdexcept>
+#include <type_traits>
+#include <set>
+#include <utility>  //std::swap, std::move & std::exchange
+
+#include <boost/iterator/indirect_iterator.hpp>
+#if BOOST_VERSION >= 108100
+#include <boost/unordered/unordered_flat_set.hpp>
+#else
+#include <unordered_set>
+#endif
+
+#include <gudhi/Persistence_matrix/allocators/entry_constructors.h>
+
+namespace Gudhi {
+namespace persistence_matrix {
+
+// For unordered_set container. Outside of Unordered_set_column because of a msvc bug who can't compile properly
+// unordered_flat_set if the hash method is nested.
+template <class Entry>
+struct EntryPointerHash
+{
+  size_t operator()(const Entry* c) const { return std::hash<Entry>()(*c); }
+};
+template <class Entry>
+struct EntryPointerEq
+{
+  bool operator()(const Entry* c1, const Entry* c2) const { return *c1 == *c2; }
+};
+
+/**
+ * @class Unordered_set_column unordered_set_column.h gudhi/Persistence_matrix/columns/unordered_set_column.h
+ * @ingroup persistence_matrix
+ *
+ * @brief Column class following the @ref PersistenceMatrixColumn concept.
+ *
+ * Column based on an unordered set structure. The entries are not ordered, but only non-zero values
+ * are stored uniquely in the underlying container. When adding an entry range into it, the given entry range
+ * also does not need to be ordered (contrary to most other column types).
+ *
+ * @tparam Master_matrix An instantiation of @ref Matrix from which all types and options are deduced.
+ * @tparam Entry_constructor Factory of @ref Entry classes.
+ */
+template <class Master_matrix>
+class Unordered_set_column : public Master_matrix::Row_access_option,
+                             public Master_matrix::Column_dimension_option,
+                             public Master_matrix::Chain_column_option
+{
+ public:
+  using Master = Master_matrix;
+  using Index = typename Master_matrix::Index;
+  using ID_index = typename Master_matrix::ID_index;
+  using Dimension = typename Master_matrix::Dimension;
+  using Field_element = typename Master_matrix::Element;
+  using Entry = typename Master_matrix::Matrix_entry;
+  using Column_settings = typename Master_matrix::Column_settings;
+
+ private:
+  using Field_operators = typename Master_matrix::Field_operators;
+  using Entry_constructor = typename Master_matrix::Entry_constructor;
+
+  struct EntryPointerComp {
+    bool operator()(const Entry* c1, const Entry* c2) const { return *c1 < *c2; }
+  };
+
+#if BOOST_VERSION >= 108100
+  using Column_support = boost::unordered_flat_set<Entry*, EntryPointerHash<Entry>, EntryPointerEq<Entry>>;
+#else
+  using Column_support = std::unordered_set<Entry*, EntryPointerHash<Entry>, EntryPointerEq<Entry>>;
+#endif
+
+ public:
+  using iterator = boost::indirect_iterator<typename Column_support::iterator>;
+  using const_iterator = boost::indirect_iterator<typename Column_support::const_iterator>;
+
+  Unordered_set_column(Column_settings* colSettings = nullptr);
+  template <class Container = typename Master_matrix::Boundary>
+  Unordered_set_column(const Container& nonZeroRowIndices, Column_settings* colSettings);
+  template <class Container = typename Master_matrix::Boundary, class Row_container>
+  Unordered_set_column(Index columnIndex,
+                       const Container& nonZeroRowIndices,
+                       Row_container* rowContainer,
+                       Column_settings* colSettings);
+  template <class Container = typename Master_matrix::Boundary>
+  Unordered_set_column(const Container& nonZeroChainRowIndices, Dimension dimension, Column_settings* colSettings);
+  template <class Container = typename Master_matrix::Boundary, class Row_container>
+  Unordered_set_column(Index columnIndex,
+                       const Container& nonZeroChainRowIndices,
+                       Dimension dimension,
+                       Row_container* rowContainer,
+                       Column_settings* colSettings);
+  Unordered_set_column(const Unordered_set_column& column, Column_settings* colSettings = nullptr);
+  template <class Row_container>
+  Unordered_set_column(const Unordered_set_column& column,
+                       Index columnIndex,
+                       Row_container* rowContainer,
+                       Column_settings* colSettings = nullptr);
+  Unordered_set_column(Unordered_set_column&& column) noexcept;
+  ~Unordered_set_column();
+
+  std::vector<Field_element> get_content(int columnLength = -1) const;
+  bool is_non_zero(ID_index rowIndex) const;
+  bool is_empty() const;
+  std::size_t size() const;
+
+  template <class Row_index_map>
+  void reorder(const Row_index_map& valueMap, [[maybe_unused]] Index columnIndex = -1);
+  void clear();
+  void clear(ID_index rowIndex);
+
+  ID_index get_pivot() const;
+  Field_element get_pivot_value() const;
+
+  iterator begin() noexcept;
+  const_iterator begin() const noexcept;
+  iterator end() noexcept;
+  const_iterator end() const noexcept;
+
+  template <class Entry_range>
+  Unordered_set_column& operator+=(const Entry_range& column);
+  Unordered_set_column& operator+=(Unordered_set_column& column);
+
+  Unordered_set_column& operator*=(unsigned int v);
+
+  // this = v * this + column
+  template <class Entry_range>
+  Unordered_set_column& multiply_target_and_add(const Field_element& val, const Entry_range& column);
+  Unordered_set_column& multiply_target_and_add(const Field_element& val, Unordered_set_column& column);
+  // this = this + column * v
+  template <class Entry_range>
+  Unordered_set_column& multiply_source_and_add(const Entry_range& column, const Field_element& val);
+  Unordered_set_column& multiply_source_and_add(Unordered_set_column& column, const Field_element& val);
+
+  void push_back(const Entry& entry);
+
+  friend bool operator==(const Unordered_set_column& c1, const Unordered_set_column& c2) {
+    if (&c1 == &c2) return true;
+    if (c1.column_.size() != c2.column_.size()) return false;
+
+    for (Entry* entry : c1.column_) {
+      auto it = c2.column_.find(entry);
+      if (it == c2.column_.end()) return false;
+      if constexpr (!Master_matrix::Option_list::is_z2)
+        if ((*it)->get_element() != entry->get_element()) return false;
+    }
+    return true;
+  }
+  friend bool operator<(const Unordered_set_column& c1, const Unordered_set_column& c2) {
+    if (&c1 == &c2) return false;
+
+    using ID_index = Unordered_set_column<Master_matrix>::ID_index;
+    using Entry_rep =
+        typename std::conditional<Master_matrix::Option_list::is_z2,
+                                  ID_index,
+                                  std::pair<ID_index, unsigned int>
+                                 >::type;
+
+    auto it1 = c1.column_.begin();
+    auto it2 = c2.column_.begin();
+    std::set<Entry_rep> entries1, entries2;
+    while (it1 != c1.column_.end() && it2 != c2.column_.end()) {
+      if constexpr (Master_matrix::Option_list::is_z2) {
+        entries1.insert((*it1)->get_row_index());
+        entries2.insert((*it2)->get_row_index());
+      } else {
+        entries1.emplace((*it1)->get_row_index(), (*it1)->get_element());
+        entries2.emplace((*it2)->get_row_index(), (*it2)->get_element());
+      }
+      ++it1;
+      ++it2;
+    }
+    while (it1 != c1.column_.end()) {
+      if constexpr (Master_matrix::Option_list::is_z2) {
+        entries1.insert((*it1)->get_row_index());
+      } else {
+        entries1.emplace((*it1)->get_row_index(), (*it1)->get_element());
+      }
+      ++it1;
+    }
+    while (it2 != c2.column_.end()) {
+      if constexpr (Master_matrix::Option_list::is_z2) {
+        entries2.insert((*it2)->get_row_index());
+      } else {
+        entries2.emplace((*it2)->get_row_index(), (*it2)->get_element());
+      }
+      ++it2;
+    }
+    return entries1 < entries2;
+  }
+
+  // Disabled with row access.
+  Unordered_set_column& operator=(const Unordered_set_column& other);
+
+  friend void swap(Unordered_set_column& col1, Unordered_set_column& col2) {
+    swap(static_cast<typename Master_matrix::Row_access_option&>(col1),
+         static_cast<typename Master_matrix::Row_access_option&>(col2));
+    swap(static_cast<typename Master_matrix::Column_dimension_option&>(col1),
+         static_cast<typename Master_matrix::Column_dimension_option&>(col2));
+    swap(static_cast<typename Master_matrix::Chain_column_option&>(col1),
+         static_cast<typename Master_matrix::Chain_column_option&>(col2));
+    col1.column_.swap(col2.column_);
+    std::swap(col1.operators_, col2.operators_);
+    std::swap(col1.entryPool_, col2.entryPool_);
+  }
+
+ private:
+  using RA_opt = typename Master_matrix::Row_access_option;
+  using Dim_opt = typename Master_matrix::Column_dimension_option;
+  using Chain_opt = typename Master_matrix::Chain_column_option;
+
+  Column_support column_;
+  Field_operators* operators_;
+  Entry_constructor* entryPool_;
+
+  void _delete_entry(typename Column_support::iterator& it);
+  Entry* _insert_entry(const Field_element& value, ID_index rowIndex);
+  void _insert_entry(ID_index rowIndex);
+  template <class Entry_range>
+  bool _add(const Entry_range& column);
+  template <class Entry_range>
+  bool _multiply_target_and_add(const Field_element& val, const Entry_range& column);
+  template <class Entry_range>
+  bool _multiply_source_and_add(const Entry_range& column, const Field_element& val);
+  template <class Entry_range, typename F1, typename F2>
+  bool _generic_add(const Entry_range& source, F1&& process_source, F2&& update_target);
+};
+
+template <class Master_matrix>
+inline Unordered_set_column<Master_matrix>::Unordered_set_column(Column_settings* colSettings)
+    : RA_opt(),
+      Dim_opt(),
+      Chain_opt(),
+      operators_(nullptr),
+      entryPool_(colSettings == nullptr ? nullptr : &(colSettings->entryConstructor))
+{
+  if (operators_ == nullptr && entryPool_ == nullptr) return; // to allow default constructor which gives a dummy column
+  if constexpr (!Master_matrix::Option_list::is_z2) {
+    operators_ = &(colSettings->operators);
+  }
+}
+
+template <class Master_matrix>
+template <class Container>
+inline Unordered_set_column<Master_matrix>::Unordered_set_column(const Container& nonZeroRowIndices,
+                                                                 Column_settings* colSettings)
+    : RA_opt(),
+      Dim_opt(nonZeroRowIndices.size() == 0 ? 0 : nonZeroRowIndices.size() - 1),
+      Chain_opt(),
+      column_(nonZeroRowIndices.size()),
+      operators_(nullptr),
+      entryPool_(&(colSettings->entryConstructor))
+{
+  static_assert(!Master_matrix::isNonBasic || Master_matrix::Option_list::is_of_boundary_type,
+                "Constructor not available for chain columns, please specify the dimension of the chain.");
+
+  if constexpr (Master_matrix::Option_list::is_z2) {
+    for (ID_index id : nonZeroRowIndices) {
+      _insert_entry(id);
+    }
+  } else {
+    operators_ = &(colSettings->operators);
+    for (const auto& p : nonZeroRowIndices) {
+      _insert_entry(operators_->get_value(p.second), p.first);
+    }
+  }
+}
+
+template <class Master_matrix>
+template <class Container, class Row_container>
+inline Unordered_set_column<Master_matrix>::Unordered_set_column(Index columnIndex,
+                                                                 const Container& nonZeroRowIndices,
+                                                                 Row_container* rowContainer,
+                                                                 Column_settings* colSettings)
+    : RA_opt(columnIndex, rowContainer),
+      Dim_opt(nonZeroRowIndices.size() == 0 ? 0 : nonZeroRowIndices.size() - 1),
+      Chain_opt([&] {
+        if constexpr (Master_matrix::Option_list::is_z2) {
+          return nonZeroRowIndices.begin() == nonZeroRowIndices.end() ? -1 : *std::prev(nonZeroRowIndices.end());
+        } else {
+          return nonZeroRowIndices.begin() == nonZeroRowIndices.end() ? -1 : std::prev(nonZeroRowIndices.end())->first;
+        }
+      }()),
+      column_(nonZeroRowIndices.size()),
+      operators_(nullptr),
+      entryPool_(&(colSettings->entryConstructor))
+{
+  static_assert(!Master_matrix::isNonBasic || Master_matrix::Option_list::is_of_boundary_type,
+                "Constructor not available for chain columns, please specify the dimension of the chain.");
+
+  if constexpr (Master_matrix::Option_list::is_z2) {
+    for (ID_index id : nonZeroRowIndices) {
+      _insert_entry(id);
+    }
+  } else {
+    operators_ = &(colSettings->operators);
+    for (const auto& p : nonZeroRowIndices) {
+      _insert_entry(operators_->get_value(p.second), p.first);
+    }
+  }
+}
+
+template <class Master_matrix>
+template <class Container>
+inline Unordered_set_column<Master_matrix>::Unordered_set_column(const Container& nonZeroRowIndices,
+                                                                 Dimension dimension,
+                                                                 Column_settings* colSettings)
+    : RA_opt(),
+      Dim_opt(dimension),
+      Chain_opt([&] {
+        if constexpr (Master_matrix::Option_list::is_z2) {
+          return nonZeroRowIndices.begin() == nonZeroRowIndices.end() ? -1 : *std::prev(nonZeroRowIndices.end());
+        } else {
+          return nonZeroRowIndices.begin() == nonZeroRowIndices.end() ? -1 : std::prev(nonZeroRowIndices.end())->first;
+        }
+      }()),
+      column_(nonZeroRowIndices.size()),
+      operators_(nullptr),
+      entryPool_(&(colSettings->entryConstructor))
+{
+  if constexpr (Master_matrix::Option_list::is_z2) {
+    for (ID_index id : nonZeroRowIndices) {
+      _insert_entry(id);
+    }
+  } else {
+    operators_ = &(colSettings->operators);
+    for (const auto& p : nonZeroRowIndices) {
+      _insert_entry(operators_->get_value(p.second), p.first);
+    }
+  }
+}
+
+template <class Master_matrix>
+template <class Container, class Row_container>
+inline Unordered_set_column<Master_matrix>::Unordered_set_column(Index columnIndex,
+                                                                 const Container& nonZeroRowIndices,
+                                                                 Dimension dimension,
+                                                                 Row_container* rowContainer,
+                                                                 Column_settings* colSettings)
+    : RA_opt(columnIndex, rowContainer),
+      Dim_opt(dimension),
+      Chain_opt([&] {
+        if constexpr (Master_matrix::Option_list::is_z2) {
+          return nonZeroRowIndices.begin() == nonZeroRowIndices.end() ? -1 : *std::prev(nonZeroRowIndices.end());
+        } else {
+          return nonZeroRowIndices.begin() == nonZeroRowIndices.end() ? -1 : std::prev(nonZeroRowIndices.end())->first;
+        }
+      }()),
+      column_(nonZeroRowIndices.size()),
+      operators_(nullptr),
+      entryPool_(&(colSettings->entryConstructor))
+{
+  if constexpr (Master_matrix::Option_list::is_z2) {
+    for (ID_index id : nonZeroRowIndices) {
+      _insert_entry(id);
+    }
+  } else {
+    operators_ = &(colSettings->operators);
+    for (const auto& p : nonZeroRowIndices) {
+      _insert_entry(operators_->get_value(p.second), p.first);
+    }
+  }
+}
+
+template <class Master_matrix>
+inline Unordered_set_column<Master_matrix>::Unordered_set_column(const Unordered_set_column& column,
+                                                                 Column_settings* colSettings)
+    : RA_opt(),
+      Dim_opt(static_cast<const Dim_opt&>(column)),
+      Chain_opt(static_cast<const Chain_opt&>(column)),
+      column_(column.column_.bucket_count()),
+      operators_(colSettings == nullptr ? column.operators_ : nullptr),
+      entryPool_(colSettings == nullptr ? column.entryPool_ : &(colSettings->entryConstructor))
+{
+  static_assert(!Master_matrix::Option_list::has_row_access,
+                "Simple copy constructor not available when row access option enabled. Please specify the new column "
+                "index and the row container.");
+
+  if constexpr (!Master_matrix::Option_list::is_z2) {
+    if (colSettings != nullptr) operators_ = &(colSettings->operators);
+  }
+
+  for (const Entry* entry : column.column_) {
+    if constexpr (Master_matrix::Option_list::is_z2) {
+      _insert_entry(entry->get_row_index());
+    } else {
+      _insert_entry(entry->get_element(), entry->get_row_index());
+    }
+  }
+}
+
+template <class Master_matrix>
+template <class Row_container>
+inline Unordered_set_column<Master_matrix>::Unordered_set_column(const Unordered_set_column& column,
+                                                                 Index columnIndex,
+                                                                 Row_container* rowContainer,
+                                                                 Column_settings* colSettings)
+    : RA_opt(columnIndex, rowContainer),
+      Dim_opt(static_cast<const Dim_opt&>(column)),
+      Chain_opt(static_cast<const Chain_opt&>(column)),
+      column_(column.column_.bucket_count()),
+      operators_(colSettings == nullptr ? column.operators_ : nullptr),
+      entryPool_(colSettings == nullptr ? column.entryPool_ : &(colSettings->entryConstructor))
+{
+  if constexpr (!Master_matrix::Option_list::is_z2) {
+    if (colSettings != nullptr) operators_ = &(colSettings->operators);
+  }
+
+  for (const Entry* entry : column.column_) {
+    if constexpr (Master_matrix::Option_list::is_z2) {
+      _insert_entry(entry->get_row_index());
+    } else {
+      _insert_entry(entry->get_element(), entry->get_row_index());
+    }
+  }
+}
+
+template <class Master_matrix>
+inline Unordered_set_column<Master_matrix>::Unordered_set_column(Unordered_set_column&& column) noexcept
+    : RA_opt(std::move(static_cast<RA_opt&>(column))),
+      Dim_opt(std::move(static_cast<Dim_opt&>(column))),
+      Chain_opt(std::move(static_cast<Chain_opt&>(column))),
+      column_(std::move(column.column_)),
+      operators_(std::exchange(column.operators_, nullptr)),
+      entryPool_(std::exchange(column.entryPool_, nullptr))
+{}
+
+template <class Master_matrix>
+inline Unordered_set_column<Master_matrix>::~Unordered_set_column()
+{
+  for (auto* entry : column_) {
+    if constexpr (Master_matrix::Option_list::has_row_access) RA_opt::unlink(entry);
+    entryPool_->destroy(entry);
+  }
+}
+
+template <class Master_matrix>
+inline std::vector<typename Unordered_set_column<Master_matrix>::Field_element>
+Unordered_set_column<Master_matrix>::get_content(int columnLength) const
+{
+  if (columnLength < 0 && column_.size() > 0)
+    columnLength = (*std::max_element(column_.begin(), column_.end(), EntryPointerComp()))->get_row_index() + 1;
+  else if (columnLength < 0)
+    return std::vector<Field_element>();
+
+  std::vector<Field_element> container(columnLength, 0);
+  for (auto it = column_.begin(); it != column_.end(); ++it) {
+    if ((*it)->get_row_index() < static_cast<ID_index>(columnLength)) {
+      if constexpr (Master_matrix::Option_list::is_z2) {
+        container[(*it)->get_row_index()] = 1;
+      } else {
+        container[(*it)->get_row_index()] = (*it)->get_element();
+      }
+    }
+  }
+  return container;
+}
+
+template <class Master_matrix>
+inline bool Unordered_set_column<Master_matrix>::is_non_zero(ID_index rowIndex) const
+{
+  Entry entry(rowIndex);
+  return column_.find(&entry) != column_.end();
+}
+
+template <class Master_matrix>
+inline bool Unordered_set_column<Master_matrix>::is_empty() const
+{
+  return column_.empty();
+}
+
+template <class Master_matrix>
+inline std::size_t Unordered_set_column<Master_matrix>::size() const
+{
+  return column_.size();
+}
+
+template <class Master_matrix>
+template <class Row_index_map>
+inline void Unordered_set_column<Master_matrix>::reorder(const Row_index_map& valueMap,
+                                                         [[maybe_unused]] Index columnIndex)
+{
+  static_assert(!Master_matrix::isNonBasic || Master_matrix::Option_list::is_of_boundary_type,
+                "Method not available for chain columns.");
+
+  Column_support newSet;
+
+  for (Entry* entry : column_) {
+    if constexpr (Master_matrix::Option_list::has_row_access) {
+      RA_opt::unlink(entry);
+      if (columnIndex != static_cast<Index>(-1)) entry->set_column_index(columnIndex);
+    }
+    entry->set_row_index(valueMap.at(entry->get_row_index()));
+    newSet.insert(entry);
+    if constexpr (Master_matrix::Option_list::has_row_access &&
+                  Master_matrix::Option_list::has_intrusive_rows)  // intrusive list
+      RA_opt::insert_entry(entry->get_row_index(), entry);
+  }
+
+  // when row is a set, all entries have to be deleted first, to avoid colliding when inserting
+  if constexpr (Master_matrix::Option_list::has_row_access && !Master_matrix::Option_list::has_intrusive_rows) {  // set
+    for (Entry* entry : newSet) {
+      RA_opt::insert_entry(entry->get_row_index(), entry);
+    }
+  }
+
+  column_.swap(newSet);
+}
+
+template <class Master_matrix>
+inline void Unordered_set_column<Master_matrix>::clear()
+{
+  static_assert(!Master_matrix::isNonBasic || Master_matrix::Option_list::is_of_boundary_type,
+                "Method not available for chain columns as a base element should not be empty.");
+
+  for (auto* entry : column_) {
+    if constexpr (Master_matrix::Option_list::has_row_access) RA_opt::unlink(entry);
+    entryPool_->destroy(entry);
+  }
+
+  column_.clear();
+}
+
+template <class Master_matrix>
+inline void Unordered_set_column<Master_matrix>::clear(ID_index rowIndex)
+{
+  static_assert(!Master_matrix::isNonBasic || Master_matrix::Option_list::is_of_boundary_type,
+                "Method not available for chain columns.");
+
+  auto entry = entryPool_->construct(rowIndex);
+  auto it = column_.find(entry);
+  if (it != column_.end()) {
+    _delete_entry(it);
+  }
+  entryPool_->destroy(entry);
+}
+
+template <class Master_matrix>
+inline typename Unordered_set_column<Master_matrix>::ID_index Unordered_set_column<Master_matrix>::get_pivot() const
+{
+  static_assert(Master_matrix::isNonBasic,
+                "Method not available for base columns.");  // could technically be, but is the notion useful then?
+
+  if constexpr (Master_matrix::Option_list::is_of_boundary_type) {
+    if (column_.empty()) return -1;
+    // linear search could be avoided with storing the pivot. But even then, some modifications of the column requires
+    // the max, so not clear how much it is worth it.
+    return (*std::max_element(column_.begin(), column_.end(), EntryPointerComp()))->get_row_index();
+  } else {
+    return Chain_opt::get_pivot();
+  }
+}
+
+template <class Master_matrix>
+inline typename Unordered_set_column<Master_matrix>::Field_element
+Unordered_set_column<Master_matrix>::get_pivot_value() const
+{
+  static_assert(Master_matrix::isNonBasic,
+                "Method not available for base columns.");  // could technically be, but is the notion useful then?
+
+  if constexpr (Master_matrix::Option_list::is_z2) {
+    return 1;
+  } else {
+    if constexpr (Master_matrix::Option_list::is_of_boundary_type) {
+      if (column_.empty()) return 0;
+      return (*std::max_element(column_.begin(), column_.end(), EntryPointerComp()))->get_element();
+    } else {
+      if (Chain_opt::get_pivot() == static_cast<ID_index>(-1)) return Field_element();
+      for (const Entry* entry : column_) {
+        if (entry->get_row_index() == Chain_opt::get_pivot()) return entry->get_element();
+      }
+      return Field_element();  // should never happen if chain column is used properly
+    }
+  }
+}
+
+template <class Master_matrix>
+inline typename Unordered_set_column<Master_matrix>::iterator Unordered_set_column<Master_matrix>::begin() noexcept
+{
+  return column_.begin();
+}
+
+template <class Master_matrix>
+inline typename Unordered_set_column<Master_matrix>::const_iterator Unordered_set_column<Master_matrix>::begin()
+    const noexcept
+{
+  return column_.begin();
+}
+
+template <class Master_matrix>
+inline typename Unordered_set_column<Master_matrix>::iterator Unordered_set_column<Master_matrix>::end() noexcept
+{
+  return column_.end();
+}
+
+template <class Master_matrix>
+inline typename Unordered_set_column<Master_matrix>::const_iterator Unordered_set_column<Master_matrix>::end()
+    const noexcept
+{
+  return column_.end();
+}
+
+template <class Master_matrix>
+template <class Entry_range>
+inline Unordered_set_column<Master_matrix>& Unordered_set_column<Master_matrix>::operator+=(const Entry_range& column)
+{
+  static_assert((!Master_matrix::isNonBasic || std::is_same_v<Entry_range, Unordered_set_column>),
+                "For boundary columns, the range has to be a column of same type to help ensure the validity of the "
+                "base element.");  // could be removed, if we give the responsibility to the user.
+  static_assert((!Master_matrix::isNonBasic || Master_matrix::Option_list::is_of_boundary_type),
+                "For chain columns, the given column cannot be constant.");
+
+  _add(column);
+
+  return *this;
+}
+
+template <class Master_matrix>
+inline Unordered_set_column<Master_matrix>& Unordered_set_column<Master_matrix>::operator+=(
+    Unordered_set_column& column)
+{
+  if constexpr (Master_matrix::isNonBasic && !Master_matrix::Option_list::is_of_boundary_type) {
+    // assumes that the addition never zeros out this column.
+    if (_add(column)) {
+      Chain_opt::swap_pivots(column);
+      Dim_opt::swap_dimension(column);
+    }
+  } else {
+    _add(column);
+  }
+
+  return *this;
+}
+
+template <class Master_matrix>
+inline Unordered_set_column<Master_matrix>& Unordered_set_column<Master_matrix>::operator*=(unsigned int v)
+{
+  if constexpr (Master_matrix::Option_list::is_z2) {
+    if (v % 2 == 0) {
+      if constexpr (Master_matrix::isNonBasic && !Master_matrix::Option_list::is_of_boundary_type) {
+        throw std::invalid_argument("A chain column should not be multiplied by 0.");
+      } else {
+        clear();
+      }
+    }
+  } else {
+    Field_element val = operators_->get_value(v);
+
+    if (val == Field_operators::get_additive_identity()) {
+      if constexpr (Master_matrix::isNonBasic && !Master_matrix::Option_list::is_of_boundary_type) {
+        throw std::invalid_argument("A chain column should not be multiplied by 0.");
+      } else {
+        clear();
+      }
+      return *this;
+    }
+
+    if (val == Field_operators::get_multiplicative_identity()) return *this;
+
+    for (Entry* entry : column_) {
+      operators_->multiply_inplace(entry->get_element(), val);
+      if constexpr (Master_matrix::Option_list::has_row_access) RA_opt::update_entry(*entry);
+    }
+  }
+
+  return *this;
+}
+
+template <class Master_matrix>
+template <class Entry_range>
+inline Unordered_set_column<Master_matrix>& Unordered_set_column<Master_matrix>::multiply_target_and_add(
+    const Field_element& val, const Entry_range& column)
+{
+  static_assert((!Master_matrix::isNonBasic || std::is_same_v<Entry_range, Unordered_set_column>),
+                "For boundary columns, the range has to be a column of same type to help ensure the validity of the "
+                "base element.");  // could be removed, if we give the responsibility to the user.
+  static_assert((!Master_matrix::isNonBasic || Master_matrix::Option_list::is_of_boundary_type),
+                "For chain columns, the given column cannot be constant.");
+
+  if constexpr (Master_matrix::Option_list::is_z2) {
+    if (val) {
+      _add(column);
+    } else {
+      clear();
+      _add(column);
+    }
+  } else {
+    _multiply_target_and_add(val, column);
+  }
+
+  return *this;
+}
+
+template <class Master_matrix>
+inline Unordered_set_column<Master_matrix>& Unordered_set_column<Master_matrix>::multiply_target_and_add(
+    const Field_element& val, Unordered_set_column& column)
+{
+  if constexpr (Master_matrix::isNonBasic && !Master_matrix::Option_list::is_of_boundary_type) {
+    // assumes that the addition never zeros out this column.
+    if constexpr (Master_matrix::Option_list::is_z2) {
+      if (val) {
+        if (_add(column)) {
+          Chain_opt::swap_pivots(column);
+          Dim_opt::swap_dimension(column);
+        }
+      } else {
+        throw std::invalid_argument("A chain column should not be multiplied by 0.");
+      }
+    } else {
+      if (_multiply_target_and_add(val, column)) {
+        Chain_opt::swap_pivots(column);
+        Dim_opt::swap_dimension(column);
+      }
+    }
+  } else {
+    if constexpr (Master_matrix::Option_list::is_z2) {
+      if (val) {
+        _add(column);
+      } else {
+        clear();
+        _add(column);
+      }
+    } else {
+      _multiply_target_and_add(val, column);
+    }
+  }
+
+  return *this;
+}
+
+template <class Master_matrix>
+template <class Entry_range>
+inline Unordered_set_column<Master_matrix>& Unordered_set_column<Master_matrix>::multiply_source_and_add(
+    const Entry_range& column, const Field_element& val)
+{
+  static_assert((!Master_matrix::isNonBasic || std::is_same_v<Entry_range, Unordered_set_column>),
+                "For boundary columns, the range has to be a column of same type to help ensure the validity of the "
+                "base element.");  // could be removed, if we give the responsibility to the user.
+  static_assert((!Master_matrix::isNonBasic || Master_matrix::Option_list::is_of_boundary_type),
+                "For chain columns, the given column cannot be constant.");
+
+  if constexpr (Master_matrix::Option_list::is_z2) {
+    if (val) {
+      _add(column);
+    }
+  } else {
+    _multiply_source_and_add(column, val);
+  }
+
+  return *this;
+}
+
+template <class Master_matrix>
+inline Unordered_set_column<Master_matrix>& Unordered_set_column<Master_matrix>::multiply_source_and_add(
+    Unordered_set_column& column, const Field_element& val)
+{
+  if constexpr (Master_matrix::isNonBasic && !Master_matrix::Option_list::is_of_boundary_type) {
+    // assumes that the addition never zeros out this column.
+    if constexpr (Master_matrix::Option_list::is_z2) {
+      if (val) {
+        if (_add(column)) {
+          Chain_opt::swap_pivots(column);
+          Dim_opt::swap_dimension(column);
+        }
+      }
+    } else {
+      if (_multiply_source_and_add(column, val)) {
+        Chain_opt::swap_pivots(column);
+        Dim_opt::swap_dimension(column);
+      }
+    }
+  } else {
+    if constexpr (Master_matrix::Option_list::is_z2) {
+      if (val) {
+        _add(column);
+      }
+    } else {
+      _multiply_source_and_add(column, val);
+    }
+  }
+
+  return *this;
+}
+
+template <class Master_matrix>
+inline void Unordered_set_column<Master_matrix>::push_back(const Entry& entry)
+{
+  static_assert(Master_matrix::Option_list::is_of_boundary_type, "`push_back` is not available for Chain matrices.");
+
+  if constexpr (Master_matrix::Option_list::is_z2) {
+    _insert_entry(entry.get_row_index());
+  } else {
+    _insert_entry(entry.get_element(), entry.get_row_index());
+  }
+}
+
+template <class Master_matrix>
+inline Unordered_set_column<Master_matrix>& Unordered_set_column<Master_matrix>::operator=(
+    const Unordered_set_column& other)
+{
+  static_assert(!Master_matrix::Option_list::has_row_access, "= assignment not enabled with row access option.");
+
+  Dim_opt::operator=(other);
+  Chain_opt::operator=(other);
+
+  for (auto* entry : column_) {
+    if constexpr (Master_matrix::Option_list::has_row_access) RA_opt::unlink(entry);
+    entryPool_->destroy(entry);
+  }
+  column_.clear();
+
+  operators_ = other.operators_;
+  entryPool_ = other.entryPool_;
+
+  for (const Entry* entry : other.column_) {
+    if constexpr (Master_matrix::Option_list::is_z2) {
+      _insert_entry(entry->get_row_index());
+    } else {
+      _insert_entry(entry->get_element(), entry->get_row_index());
+    }
+  }
+
+  return *this;
+}
+
+template <class Master_matrix>
+inline void Unordered_set_column<Master_matrix>::_delete_entry(typename Column_support::iterator& it)
+{
+  if constexpr (Master_matrix::Option_list::has_row_access) RA_opt::unlink(*it);
+  entryPool_->destroy(*it);
+  auto tmp = it++;
+  // it = column_.erase(it);
+  column_.erase(tmp);
+}
+
+template <class Master_matrix>
+inline typename Unordered_set_column<Master_matrix>::Entry* Unordered_set_column<Master_matrix>::_insert_entry(
+    const Field_element& value, ID_index rowIndex)
+{
+  if constexpr (Master_matrix::Option_list::has_row_access) {
+    Entry* newEntry = entryPool_->construct(RA_opt::columnIndex_, rowIndex);
+    newEntry->set_element(value);
+    column_.insert(newEntry);
+    RA_opt::insert_entry(rowIndex, newEntry);
+    return newEntry;
+  } else {
+    Entry* newEntry = entryPool_->construct(rowIndex);
+    newEntry->set_element(value);
+    column_.insert(newEntry);
+    return newEntry;
+  }
+}
+
+template <class Master_matrix>
+inline void Unordered_set_column<Master_matrix>::_insert_entry(ID_index rowIndex)
+{
+  if constexpr (Master_matrix::Option_list::has_row_access) {
+    Entry* newEntry = entryPool_->construct(RA_opt::columnIndex_, rowIndex);
+    column_.insert(newEntry);
+    RA_opt::insert_entry(rowIndex, newEntry);
+  } else {
+    Entry* newEntry = entryPool_->construct(rowIndex);
+    column_.insert(newEntry);
+  }
+}
+
+template <class Master_matrix>
+template <class Entry_range>
+inline bool Unordered_set_column<Master_matrix>::_add(const Entry_range& column)
+{
+  return _generic_add(
+      column,
+      [&](const Entry& oldEntry, Entry* newEntry) {
+        if constexpr (!Master_matrix::Option_list::is_z2) newEntry->set_element(oldEntry.get_element());
+      },
+      [&](Entry* targetEntry, const Entry& sourceEntry) {
+        if constexpr (!Master_matrix::Option_list::is_z2)
+          operators_->add_inplace(targetEntry->get_element(), sourceEntry.get_element());
+      });
+}
+
+template <class Master_matrix>
+template <class Entry_range>
+inline bool Unordered_set_column<Master_matrix>::_multiply_target_and_add(const Field_element& val,
+                                                                          const Entry_range& column)
+{
+  if (val == 0u) {
+    if constexpr (Master_matrix::isNonBasic && !Master_matrix::Option_list::is_of_boundary_type) {
+      throw std::invalid_argument("A chain column should not be multiplied by 0.");
+      // this would not only mess up the base, but also the pivots stored.
+    } else {
+      clear();
+      for (const Entry& v : column) {
+        _insert_entry(v.get_element(), v.get_row_index());
+      }
+      return true;
+    }
+  }
+
+  // because the column is unordered, I don't see a way to do both operations in one go
+  // without guarantees on the entry range...
+  operator*=(val);
+  return _add(column);
+}
+
+template <class Master_matrix>
+template <class Entry_range>
+inline bool Unordered_set_column<Master_matrix>::_multiply_source_and_add(const Entry_range& column,
+                                                                          const Field_element& val)
+{
+  if (val == 0u) {
+    return false;
+  }
+
+  return _generic_add(
+      column,
+      [&](const Entry& oldEntry, Entry* newEntry) {
+        newEntry->set_element(oldEntry.get_element());
+        operators_->multiply_inplace(newEntry->get_element(), val);
+      },
+      [&](Entry* targetEntry, const Entry& sourceEntry) {
+        operators_->multiply_and_add_inplace_back(sourceEntry.get_element(), val, targetEntry->get_element());
+      });
+}
+
+template <class Master_matrix>
+template <class Entry_range, typename F1, typename F2>
+inline bool Unordered_set_column<Master_matrix>::_generic_add(const Entry_range& source,
+                                                              F1&& process_source,
+                                                              F2&& update_target)
+{
+  bool pivotIsZeroed = false;
+
+  for (const Entry& entry : source) {
+    Entry* newEntry;
+    if constexpr (Master_matrix::Option_list::has_row_access) {
+      newEntry = entryPool_->construct(RA_opt::columnIndex_, entry.get_row_index());
+    } else {
+      newEntry = entryPool_->construct(entry.get_row_index());
+    }
+    auto res = column_.insert(newEntry);
+    if (res.second) {
+      process_source(entry, newEntry);
+      if constexpr (Master_matrix::Option_list::has_row_access) RA_opt::insert_entry(entry.get_row_index(), newEntry);
+    } else {
+      entryPool_->destroy(newEntry);
+      if constexpr (Master_matrix::Option_list::is_z2) {
+        if constexpr (Master_matrix::isNonBasic && !Master_matrix::Option_list::is_of_boundary_type) {
+          if (entry.get_row_index() == Chain_opt::get_pivot()) pivotIsZeroed = true;
+        }
+        _delete_entry(res.first);
+      } else {
+        update_target(*res.first, entry);
+        if ((*res.first)->get_element() == Field_operators::get_additive_identity()) {
+          if constexpr (Master_matrix::isNonBasic && !Master_matrix::Option_list::is_of_boundary_type) {
+            if ((*res.first)->get_row_index() == Chain_opt::get_pivot()) pivotIsZeroed = true;
+          }
+          _delete_entry(res.first);
+        } else {
+          if constexpr (Master_matrix::Option_list::has_row_access) RA_opt::update_entry(**res.first);
+        }
+      }
+    }
+  }
+
+  return pivotIsZeroed;
+}
+
+}  // namespace persistence_matrix
+}  // namespace Gudhi
+
+/**
+ * @ingroup persistence_matrix
+ *
+ * @brief Hash method for @ref Gudhi::persistence_matrix::Unordered_set_column.
+ *
+ * @tparam Master_matrix Template parameter of @ref Gudhi::persistence_matrix::Unordered_set_column.
+ * @tparam Entry_constructor Template parameter of @ref Gudhi::persistence_matrix::Unordered_set_column.
+ */
+template <class Master_matrix>
+struct std::hash<Gudhi::persistence_matrix::Unordered_set_column<Master_matrix>> {
+  std::size_t operator()(const Gudhi::persistence_matrix::Unordered_set_column<Master_matrix>& column) const {
+    // can't use Gudhi::persistence_matrix::hash_column because unordered
+    std::size_t seed = 0;
+    for (const auto& entry : column) {
+      seed ^= std::hash<unsigned int>()(entry.get_row_index() * static_cast<unsigned int>(entry.get_element()));
+    }
+    return seed;
+  }
+};
+
+#endif  // PM_UNORDERED_SET_COLUMN_H