/usr/include/polybori/CDegLexIter.h is in libpolybori-dev 0.5~rc1-2.1build2.
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 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 | // -*- c++ -*-
//*****************************************************************************
/** @file CDegLexIter.h
*
* @author Alexander Dreyer
* @date 2006-09-06
*
* This file defines a degree lexicographic iterator.
*
* @par Copyright:
* (c) 2006 by The PolyBoRi Team
*
* @internal
* @version \$Id: CDegLexIter.h,v 1.9 2008/07/08 21:41:58 alexanderdreyer Exp $
*
* @par History:
* @verbatim
* $Log: CDegLexIter.h,v $
* Revision 1.9 2008/07/08 21:41:58 alexanderdreyer
* Merge: from developer's repository
*
* Revision 1.5 2007/11/06 15:03:34 dreyer
* CHANGE: More generic copyright
*
* Revision 1.4 2007/04/30 15:20:30 dreyer
* CHANGE: Switching from CTermIter to iterators based on CTermStack
*
* Revision 1.3 2006/09/08 14:31:38 dreyer
* ADD: COrderedIter and infrastructure for order-dependent iterator
*
* Revision 1.2 2006/09/08 10:22:59 dreyer
* FIX: Gcc 4 ist more pedantic
*
* Revision 1.1 2006/09/07 16:04:32 dreyer
* ADD: CDegLexIter.h
*
* @endverbatim
**/
//*****************************************************************************
// include basic definitions
#include "pbori_defs.h"
#include "BoolePolynomial.h"
#include "CDelayedTermIter.h"
#include "CRestrictedIter.h"
#include <algorithm>
#ifndef CDegLexIter_h_
#define CDegLexIter_h_
BEGIN_NAMESPACE_PBORI
#if 0
template<class PolyType, class PolyDegIter = typename PolyType::deg_iterator>
class CDegLexIter {
public:
/// Fix type for polynomials
typedef PolyType poly_type;
/// Fix type for sizes
typedef typename poly_type::size_type size_type;
/// Fix type for Boolean values
typedef typename poly_type::bool_type bool_type;
/// Fix type for monomials
typedef typename poly_type::monom_type monom_type;
/// Set type for terms
typedef monom_type term_type;
/// Fix type for polynomials
typedef typename poly_type::deg_iterator deg_iterator;
/// @name Interface types for standard iterator access
//@{
typedef term_type value_type;
typedef std::forward_iterator_tag iterator_category;
typedef typename deg_iterator::difference_type difference_type;
typedef void pointer;
typedef value_type reference;
//@}
/// Get type, this is inherited from
typedef CDelayedTermIter<monom_type,
change_assign<monom_type>, project_ith<2>,
deg_iterator> delayed_term_iterator;
typedef CRestrictedIter<delayed_term_iterator> bounded_iterator;
/// Generic access to type of *this
typedef CDegLexIter self;
// Constructor
CDegLexIter(const delayed_term_iterator& start,
const delayed_term_iterator& finish ):
m_iter(std::max_element(start, finish)), m_start(start), m_finish(finish) {
}
// Default Constructor
CDegLexIter(): m_iter(), m_start(), m_finish() {}
/// Constant dereference operator
reference operator*() const {
return m_iter.term();
}
/// Prefix increment operator
self& operator++() {
if (m_iter != m_finish) {
size_type deg = *m_iter;
++m_iter;
m_iter = std::find(m_iter, m_finish, deg);
if(m_iter == m_finish) {
m_iter = std::max_element( bounded_iterator(m_start, deg),
bounded_iterator(m_finish, deg) );
}
}
return *this;
}
self operator++(int) {
self result(*this);
operator++();
return result;
}
bool_type operator!=(const self& rhs) const {
return (m_iter != rhs.m_iter);
}
bool_type operator==(const self& rhs) const {
return (m_iter == rhs.m_iter);
}
private:
delayed_term_iterator m_iter, m_start, m_finish;
};
#endif
END_NAMESPACE_PBORI
#endif
|