/* 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 Sophia Antipolis-Méditerranée (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 .
*/
#ifndef PERSISTENT_COHOMOLOGY_PERSISTENT_COHOMOLOGY_COLUMN_H_
#define PERSISTENT_COHOMOLOGY_PERSISTENT_COHOMOLOGY_COLUMN_H_
#include
#include
#include
namespace Gudhi {
namespace persistent_cohomology {
template
class Persistent_cohomology_column;
struct cam_h_tag;
// for horizontal traversal in the CAM
struct cam_v_tag;
// for vertical traversal in the CAM
typedef boost::intrusive::list_base_hook,
boost::intrusive::link_mode // allows .unlink()
> base_hook_cam_h;
typedef boost::intrusive::list_base_hook,
boost::intrusive::link_mode // faster hook, less safe
> base_hook_cam_v;
/** \internal
* \brief
*
*/
template
class Persistent_cohomology_cell : public base_hook_cam_h,
public base_hook_cam_v {
public:
template friend class Persistent_cohomology;
friend class Persistent_cohomology_column;
typedef Persistent_cohomology_column Column;
Persistent_cohomology_cell(SimplexKey key, ArithmeticElement x,
Column * self_col)
: key_(key),
coefficient_(x),
self_col_(self_col) {
}
SimplexKey key_;
ArithmeticElement coefficient_;
Column * self_col_;
};
/*
* \brief Sparse column for the Compressed Annotation Matrix.
*
* The non-zero coefficients of the column are stored in a
* boost::intrusive::list. Contains a hook to be stored in a
* boost::intrusive::set.
*
* Movable but not Copyable.
*/
template
class Persistent_cohomology_column : public boost::intrusive::set_base_hook<
boost::intrusive::link_mode > {
template friend class Persistent_cohomology;
public:
typedef Persistent_cohomology_cell Cell;
typedef boost::intrusive::list,
boost::intrusive::base_hook > Col_type;
/** \brief Creates an empty column.*/
explicit Persistent_cohomology_column(SimplexKey key)
: col_(),
class_key_(key) {}
/** \brief Returns true iff the column is null.*/
bool is_null() const {
return col_.empty();
}
/** \brief Returns the key of the representative simplex of
* the set of simplices having this column as annotation vector
* in the compressed annotation matrix.*/
SimplexKey class_key() const {
return class_key_;
}
/** \brief Lexicographic comparison of two columns.*/
friend bool operator<(const Persistent_cohomology_column& c1,
const Persistent_cohomology_column& c2) {
typename Col_type::const_iterator it1 = c1.col_.begin();
typename Col_type::const_iterator it2 = c2.col_.begin();
while (it1 != c1.col_.end() && it2 != c2.col_.end()) {
if (it1->key_ == it2->key_) {
if (it1->coefficient_ == it2->coefficient_) {
++it1;
++it2;
} else {
return it1->coefficient_ < it2->coefficient_;
}
} else {
return it1->key_ < it2->key_;
}
}
return (it2 != c2.col_.end());
}
Col_type col_;
SimplexKey class_key_;
};
} // namespace persistent_cohomology
} // namespace Gudhi
#endif // PERSISTENT_COHOMOLOGY_PERSISTENT_COHOMOLOGY_COLUMN_H_
|