/usr/include/healpix_cxx/rangeset.h is in libhealpix-cxx-dev 3.11.2-7.1ubuntu1.
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 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 | /*
* This file is part of libcxxsupport.
*
* libcxxsupport 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, or
* (at your option) any later version.
*
* libcxxsupport 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 libcxxsupport; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
/*
* libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik
* and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt
* (DLR).
*/
/*! \file rangeset.h
* Class for storing sets of ranges of integer numbers
*
* Copyright (C) 2011-2013 Max-Planck-Society
* \author Martin Reinecke
*/
#ifndef PLANCK_RANGESET_H
#define PLANCK_RANGESET_H
#include <algorithm>
#include <vector>
#include <utility>
#include <iostream>
#include "datatypes.h"
#include "error_handling.h"
/*! Class for storing sets of ranges of integer numbers */
template<typename T> class rangeset
{
private:
typedef std::vector<T> rtype;
typedef typename rtype::iterator iterator;
typedef typename rtype::const_iterator c_iterator;
rtype r;
/*! Returns the index of the last number in \c r which is <= \a val.
If \a val is smaller than all numbers in \c r, returns -1. */
tdiff iiv (const T &val) const
{ return tdiff(std::upper_bound(r.begin(),r.end(),val)-r.begin())-1; }
void addRemove (T a, T b, tdiff v)
{
tdiff pos1=iiv(a), pos2=iiv(b);
if ((pos1>=0) && (r[pos1]==a)) --pos1;
// first to delete is at pos1+1; last is at pos2
bool insert_a = (pos1&1)==v;
bool insert_b = (pos2&1)==v;
int rmstart=pos1+1+(insert_a ? 1 : 0);
int rmend =pos2-(insert_b?1:0);
planck_assert((rmend-rmstart)&1,"cannot happen");
if (insert_a && insert_b && (pos1+1>pos2)) // insert
{
r.insert(r.begin()+pos1+1,2,a);
r[pos1+2]=b;
}
else
{
if (insert_a) r[pos1+1]=a;
if (insert_b) r[pos2]=b;
r.erase(r.begin()+rmstart,r.begin()+rmend+1);
}
}
static void generalUnion (const rtype &a, const rtype &b,
bool flip_a, bool flip_b, rtype &c)
{
planck_assert((&c!=&a)&&(&c!=&b), "cannot overwrite the rangeset");
c.clear();
bool state_a=flip_a, state_b=flip_b, state_res=state_a||state_b;
tsize ia=0, ea=a.size(), ib=0, eb=b.size();
bool runa = ia!=ea, runb = ib!=eb;
while(runa||runb)
{
bool adv_a=false, adv_b=false;
T val,va=T(),vb=T();
if (runa) va = a[ia];
if (runb) vb = b[ib];
if (runa && (!runb || (va<=vb))) { adv_a=true; val=va; }
if (runb && (!runa || (vb<=va))) { adv_b=true; val=vb; }
if (adv_a) { state_a=!state_a; ++ia; runa = ia!=ea; }
if (adv_b) { state_b=!state_b; ++ib; runb = ib!=eb; }
if ((state_a||state_b)!=state_res)
{ c.push_back(val); state_res = !state_res; }
}
}
public:
/*! Removes all rangeset entries. */
void clear() { r.clear(); }
/*! Reserves space for \a n ranges. */
void reserve(tsize n) { r.reserve(2*n); }
/*! Returns the current number of ranges. */
tsize size() const { return r.size()>>1; }
/*! Returns the current vector of ranges. */
const rtype &data() const { return r; }
/*! Returns the first value of range \a i. */
const T &ivbegin (tdiff i) const { return r[2*i]; }
/*! Returns the one-past-last value of range \a i. */
const T &ivend (tdiff i) const { return r[2*i+1]; }
/*! Returns the length of range \a i. */
T ivlen (tdiff i) const { return r[2*i+1]-r[2*i]; }
/*! Appends \a [v1;v2[ to the rangeset. \a v1 must be larger
than the minimum of the last range in the rangeset. */
void append(const T &v1, const T &v2)
{
if (v2<=v1) return;
if ((!r.empty()) && (v1<=r.back()))
{
planck_assert (v1>=r[r.size()-2],"bad append operation");
if (v2>r.back()) r.back()=v2;
}
else
{ r.push_back(v1); r.push_back(v2); }
}
/*! Appends \a [v;v+1[ to the rangeset. \a v must be larger
than the minimum of the last range in the rangeset. */
void append(const T &v)
{ append(v,v+1); }
/*! Appends \a other to the rangeset. All values in \a other must be larger
than the minimum of the last range in the rangeset. */
void append (const rangeset &other)
{
for (tsize j=0; j<other.size(); ++j)
append(other.ivbegin(j),other.ivend(j));
}
/*! After this operation, the rangeset contains the union of itself
with \a [v1;v2[. */
void add(const T &v1, const T &v2) { addRemove(v1,v2,1); }
/*! After this operation, the rangeset contains the union of itself
with \a [v;v+1[. */
void add(const T &v) { addRemove(v,v+1,1); }
/*! Removes all values within \a [v1;v2[ from the rangeset. */
void remove(const T &v1, const T &v2) { addRemove(v1,v2,0); }
/*! Removes the value \a v from the rangeset. */
void remove(const T &v) { addRemove(v,v+1,0); }
/*! Removes all values not within \a [a;b[ from the rangeset. */
void intersect (const T &a, const T &b)
{
if (r.empty()) return; // nothing to remove
if ((b<=r[0]) || (a>=r.back())) { r.clear(); return; } // no overlap
if ((a<=r[0]) && (b>=r.back())) return; // full rangeset in interval
tdiff pos2=iiv(b);
if ((pos2>=0) && (r[pos2]==b)) --pos2;
bool insert_b = (pos2&1)==0;
r.erase(r.begin()+pos2+1,r.end());
if (insert_b) r.push_back(b);
tdiff pos1=iiv(a);
bool insert_a = (pos1&1)==0;
if (insert_a) r[pos1--]=a;
if (pos1>=0)
r.erase(r.begin(),r.begin()+pos1+1);
}
/*! Returns the total number of elements in the rangeset. */
T nval() const
{
T result=T(0);
for (tsize i=0; i<r.size(); i+=2)
result+=r[i+1]-r[i];
return result;
}
/*! After this operation, \a res contains all elements of the rangeset
in ascending order. */
void toVector (std::vector<T> &res) const
{
res.clear();
res.reserve(nval());
for (tsize i=0; i<r.size(); i+=2)
for (T m(r[i]); m<r[i+1]; ++m)
res.push_back(m);
}
/*! After this operation, the rangeset contains the union of itself
and \a other. */
void unite (const rangeset &other)
{
rtype tmp;
generalUnion (r,other.r,false,false,tmp);
std::swap(r,tmp);
}
/*! After this operation, the rangeset contains the intersection of itself
and \a other. */
void intersect (const rangeset &other)
{
rtype tmp;
generalUnion (r,other.r,true,true,tmp);
std::swap(r,tmp);
}
/*! After this operation, the rangeset contains the union of itself
with the inverse of \a other. */
void subtract (const rangeset &other)
{
rtype tmp;
generalUnion (r,other.r,true,false,tmp);
std::swap(r,tmp);
}
/*! After this operation, the rangeset contains the union of \a a
and \a b. */
void setToUnion (const rangeset &a, const rangeset &b)
{ generalUnion (a.r,b.r,false,false,r); }
/*! After this operation, the rangeset contains the intersection of \a a
and \a b. */
void setToIntersection (const rangeset &a, const rangeset &b)
{ generalUnion (a.r,b.r,true,true,r); }
/*! After this operation, the rangeset contains the union of \a a
with the inverse of \a b. */
void setToDifference (const rangeset &a, const rangeset &b)
{ generalUnion (a.r,b.r,true,false,r); }
/*! Returns the index of the interval containing \a v; if no such interval
exists, -1 is returned. */
tdiff findInterval (const T &v) const
{
tdiff res = iiv(v);
return (res&1) ? -1 : res>>1;
}
/*! Returns \a true if the rangeset is identical to \a other, else \a false.
*/
bool equals (const rangeset &other) const
{ return r==other.data(); }
/*! Returns \a true if the rangeset contains all values in the range
\a [a;b[, else \a false. */
bool containsAll (T a,T b) const
{
tdiff res=iiv(a);
if (res&1) return false;
return (b<=r[res+1]);
}
/*! Returns \a true if the rangeset contains the value \a v,
else \a false. */
bool contains (T v) const
{ return !(iiv(v)&1); }
/*! Returns \a true if the rangeset contains all values stored in \a other,
else \a false. */
bool contains (const rangeset &other) const
{
tsize im=0, em=r.size();
for (tsize i=0; i<other.r.size(); i+=2)
{
T a=other.r[i], b=other.r[i+1];
while ((im!=em) && (r[im+1] < a)) im+=2;
if (im==em) return false;
if ((r[im]>a) || (r[im+1]<b)) return false;
}
return true;
}
};
template<typename T> inline std::ostream &operator<< (std::ostream &os,
const rangeset<T> &rs)
{
os << "{ ";
for (tsize i=0; i<rs.size(); ++i)
os << "["<<rs.ivbegin(i)<<";"<<rs.ivend(i)<<"[ ";
return os << "}";
}
#endif
|