/usr/include/polybori/groebner/PolyEntryVector.h is in libpolybori-groebner-dev 0.8.3-3+b2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 | // -*- c++ -*-
//*****************************************************************************
/** @file PolyEntryVector.h
*
* @author Michael Brickenstein (original) and Alexander Dreyer (refactored)
* @date 2012-01-04
*
* This file includes the definition of the class @c PolyEntryVector.
*
* @par Copyright:
* (c) 2006-2012 by The PolyBoRi Team
*
**/
//*****************************************************************************
#ifndef polybori_groebner_PolyEntryVector_h_
#define polybori_groebner_PolyEntryVector_h_
#include "PolyEntryReference.h"
#include "PolyEntryIndices.h"
#include "PolyEntry.h"
// include basic definitions
#include "groebner_defs.h"
BEGIN_NAMESPACE_PBORIGB
class PolyEntryVector {
typedef std::vector<PolyEntry> data_type;
public:
/// Vector-style interface
//@{
typedef data_type::value_type value_type;
typedef data_type::size_type size_type;
typedef data_type::const_iterator const_iterator;
typedef data_type::const_reference const_reference;
typedef PolyEntryReference reference;
bool empty() const { return m_data.empty(); }
size_type size() const { return m_data.size(); }
const_iterator begin() const { return m_data.begin(); }
const_iterator end() const { return m_data.end(); }
const_reference front() const { return m_data.front(); }
const_reference back() const { return m_data.back(); }
/// Read-only access to element by index, leading term or monomial
template <class KeyType>
const_reference operator[](const KeyType& rhs) const {
return operator()(rhs);
}
//@}
/// Alternative to @c front which allows partial (but consistent) access
reference first() { return reference(m_data.front(), m_indices); }
/// Constant variant, equivalent to @c front, for completeness reasons
const_reference first() const { return front(); }
/// Alternative to @c back() which allows partial (but consistent) access
reference last() { return reference(m_data.back(), m_indices); }
/// Constant variant, equivalent to @c back, for completeness reasons
const_reference last() const { return back(); }
/// Default constructor
PolyEntryVector():
m_data(), m_indices() {}
/// Just insert element
virtual void append(const PolyEntry& element) {
m_data.push_back(element);
#ifndef PBORI_NDEBUG
if(m_indices.checked(back().lead) != (size_type)-1)
throw std::runtime_error("leading terms not unique when appending to PolyEntryVector");
#endif
m_indices.insert(back(), size() - 1);
}
/// Read-only access to element by index, leading term or monomial
template <class KeyType>
const_reference operator()(const KeyType& key) const {
return m_data[index(key)];
}
/// (Partially) write access to element by index, leading term or monomial
template <class KeyType>
reference operator()(const KeyType& rhs) {
return reference(m_data[index(rhs)], m_indices);
}
/// Exchange element given by @c key
template <class KeyType, class Type>
void exchange(const KeyType& key, const Type& rhs) { operator()(key) = rhs; }
/// Retrieve index associated to @c key
template <class KeyType>
size_type index(const KeyType& key) const { return m_indices(key); }
/// Retrieve index associated to @c key if @c key exists, -1 otherwise
template <class KeyType>
size_type checked_index(const KeyType& key) const {
return m_indices.checked(key);
}
/// Retrieve polynomial associated to @c key
template <class KeyType>
const Polynomial& polynomial(const KeyType& key) const {
return operator[](key).p;
}
private:
data_type m_data;
PolyEntryIndices m_indices;
};
END_NAMESPACE_PBORIGB
#endif /* polybori_groebner_PolyEntryVector_h_ */
|