/usr/include/dballe/core/stlutils.tcc is in libdballe-dev 7.7-1.
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 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 | /*
* core/stlutils - Useful functions to work with the STL
*
* Copyright (C) 2013 ARPA-SIM <urpsim@smr.arpa.emr.it>
*
* 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 2 of the License.
*
* 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, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*
* Author: Enrico Zini <enrico@enricozini.com>
*/
#ifndef DBA_CORE_STLUTILS_TCC
#define DBA_CORE_STLUTILS_TCC
namespace dballe {
namespace stl {
namespace stlutils {
template<typename T>
struct SequenceSingleton : public Sequence<T>
{
T val;
bool exausted;
SequenceSingleton(const T& val) : val(val), exausted(false) {}
virtual bool valid() const { return !exausted; }
virtual const T& get() const { return val; }
virtual void next() { exausted = true; }
};
template<typename ITER>
struct SequenceIters : public Sequence<typename ITER::value_type>
{
ITER begin;
ITER end;
SequenceIters(const ITER& begin, const ITER& end)
: begin(begin), end(end) {}
virtual bool valid() const { return begin != end; }
virtual const typename ITER::value_type& get() const { return *begin; }
virtual void next() { ++begin; }
};
template<typename T>
struct SequenceUnion : public Sequence<T>
{
Union<T> sequence_union;
typename Union<T>::const_iterator begin;
typename Union<T>::const_iterator end;
SequenceUnion(std::unique_ptr< Sequences<T> >& sequences)
: begin(sequence_union.begin(sequences)), end(sequence_union.end()) {}
virtual bool valid() const { return begin != end; }
virtual const T& get() const { return *begin; }
virtual void next() { ++begin; }
};
template<typename T>
struct SequenceIntersection : public Sequence<T>
{
Intersection<T> sequence_intersection;
typename Intersection<T>::const_iterator begin;
typename Intersection<T>::const_iterator end;
SequenceIntersection(std::unique_ptr< Sequences<T> >& sequences)
: begin(sequence_intersection.begin(sequences)), end(sequence_intersection.end()) {}
virtual bool valid() const { return begin != end; }
virtual const T& get() const { return *begin; }
virtual void next() { ++begin; }
};
} // back to dballe::stl
template<typename T>
void Sequences<T>::add_singleton(const T& val)
{
this->push_back(new stlutils::SequenceSingleton<T>(val));
}
template<typename T> template<typename ITER>
void Sequences<T>::add(const ITER& begin, const ITER& end)
{
this->push_back(new stlutils::SequenceIters<ITER>(begin, end));
}
template<typename T> template<typename C>
void Sequences<T>::add(const C& container)
{
this->push_back(new stlutils::SequenceIters<typename C::const_iterator>(container.begin(), container.end()));
}
template<typename T>
void Sequences<T>::add(std::unique_ptr< stlutils::Sequence<T> >& sequence)
{
this->push_back(sequence.release());
}
template<typename T>
void Sequences<T>::add_union(std::unique_ptr< Sequences<T> >& sequences)
{
this->push_back(new stlutils::SequenceUnion<T>(sequences));
}
template<typename T>
void Sequences<T>::add_intersection(std::unique_ptr< Sequences<T> >& sequences)
{
this->push_back(new stlutils::SequenceIntersection<T>(sequences));
}
namespace stlutils {
template<typename T>
void Itersection<T>::sync_iters()
{
using namespace std;
while (true)
{
typename Sequences<T>::iterator i = this->sequences->begin();
const T& candidate = (*i)->get();
for ( ; i != this->sequences->end(); ++i)
{
while ((*i)->valid() && (*i)->get() < candidate)
(*i)->next();
// When we reach the end of a sequence, we are done
if (!(*i)->valid())
{
this->clear();
return;
}
if ((*i)->get() > candidate)
{
(*this->sequences)[0]->next();
if (!(*this->sequences)[0]->valid())
{
this->clear();
return;
}
// Continue, but at the while level
goto next_round;
}
}
// All sequences have the same item: stop.
return;
next_round: ;
}
}
template<typename T>
void Iterunion<T>::find_min()
{
/**
* If minval is 0, set it to the minimum value.
* If minval points to an element, advance all sequences that have that
* element as minimum value, and set minval to the next minimum value.
*
* Returns false when all sequences are exausted; true if a new minimum
* value was found.
*/
if (minval)
{
// Advance all sequences that have that element as minimum value, and
// set minval to the next minimum value.
// Advance all iterators that point to the minimum value
for (typename Sequences<T>::iterator i = this->sequences->begin();
i != this->sequences->end(); ++i)
{
if (!(*i)->valid()) continue;
if ((*i)->get() == *minval)
(*i)->next();
}
}
// Set it to the minimum value.
bool found = false;
minval = 0;
for (typename Sequences<T>::const_iterator i = this->sequences->begin();
i != this->sequences->end(); ++i)
{
if (!(*i)->valid()) continue;
if (!minval || (*i)->get() < *minval)
{
minval = &((*i)->get());
found = true;
}
}
if (!found)
{
this->clear();
minval = 0;
}
#if 0
for (typename std::vector< Sequence<ITER> >::const_iterator i = iters.begin();
i != iters.end(); )
{
if (**i != *minval)
{
++i;
} else {
// Same as minval: advance it
i->next();
if (i->valid) {
++i;
continue;
} else if (i == iters.rbegin()) {
TODO_reduce_by_one();
break;
} else {
TODO_swap_last_to_here();
// do not advance i
}
}
}
#endif
}
}
}
}
#endif
|