/usr/include/healpix_cxx/rangeset.h is in libhealpix-cxx-dev 3.30.0-6.
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 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 | /*
* 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-2014 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;
tdiff rmstart=pos1+1+(insert_a ? 1 : 0);
tdiff 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);
}
}
/*! Estimate a good strategy for set operations involving two rangesets. */
static int strategy (tsize sza, tsize szb)
{
const double fct1 = 1.;
const double fct2 = 1.;
tsize slo = sza<szb ? sza : szb,
shi = sza<szb ? szb : sza;
double cost1 = fct1 * (sza+szb);
double cost2 = fct2 * slo * std::max(1,ilog2(shi));
return (cost1<=cost2) ? 1 : (slo==sza) ? 2 : 3;
}
void generalUnion1 (const rangeset &a, const rangeset &b,
bool flip_a, bool flip_b)
{
bool state_a=flip_a, state_b=flip_b, state_res=state_a||state_b;
tsize ia=0, ea=a.r.size(), ib=0, eb=b.r.size();
bool runa = ia!=ea, runb = ib!=eb;
while(runa||runb)
{
T va = runa ? a.r[ia] : T(0),
vb = runb ? b.r[ib] : T(0);
bool adv_a = runa && (!runb || (va<=vb)),
adv_b = runb && (!runa || (vb<=va));
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)
{ r.push_back(adv_a ? va : vb); state_res = !state_res; }
}
}
void generalUnion2 (const rangeset &a, const rangeset &b,
bool flip_a, bool flip_b)
{
tdiff iva = flip_a ? 0 : -1;
tdiff asz=tdiff(a.r.size()), bsz=tdiff(b.r.size());
while (iva<asz)
{
tdiff ivb = (iva==-1) ? -1 : b.iiv(a.r[iva]);
bool state_b = flip_b^((ivb&1)==0);
if ((iva>-1) && (!state_b)) r.push_back(a.r[iva]);
while((ivb<bsz-1)&&((iva==asz-1)||(b.r[ivb+1]<a.r[iva+1])))
{ ++ivb; state_b=!state_b; r.push_back(b.r[ivb]); }
if ((iva<asz-1)&&(!state_b)) r.push_back(a.r[iva+1]);
iva+=2;
}
}
void generalUnion (const rangeset &a, const rangeset &b,
bool flip_a, bool flip_b)
{
planck_assert((this!=&a)&&(this!=&b), "cannot overwrite the rangeset");
if (a.r.empty())
{
if (flip_a) clear(); else *this=b;
return;
}
if (b.r.empty())
{
if (flip_b) clear(); else *this=a;
return;
}
clear();
int strat = strategy (a.nranges(), b.nranges());
(strat==1) ? generalUnion1(a,b,flip_a,flip_b) :
((strat==2) ? generalUnion2(a,b,flip_a,flip_b)
: generalUnion2(b,a,flip_b,flip_a));
}
void generalXor (const rangeset &a, const rangeset &b)
{
clear();
bool state_a=false, state_b=false, state_res=state_a||state_b;
tsize ia=0, ea=a.r.size(), ib=0, eb=b.r.size();
bool runa = ia!=ea, runb = ib!=eb;
while(runa||runb)
{
T va = runa ? a.r[ia] : T(0),
vb = runb ? b.r[ib] : T(0);
bool adv_a = runa && (!runb || (va<=vb)),
adv_b = runb && (!runa || (vb<=va));
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)
{ r.push_back(adv_a ? va : vb); state_res = !state_res; }
}
}
static bool generalAllOrNothing1 (const rangeset &a, const rangeset &b,
bool flip_a, bool flip_b)
{
bool state_a=flip_a, state_b=flip_b, state_res=state_a||state_b;
tsize ia=0, ea=a.r.size(), ib=0, eb=b.r.size();
bool runa = ia!=ea, runb = ib!=eb;
while(runa||runb)
{
T va = runa ? a.r[ia] : T(0),
vb = runb ? b.r[ib] : T(0);
bool adv_a = runa && (!runb || (va<=vb)),
adv_b = runb && (!runa || (vb<=va));
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)
return false;
}
return true;
}
static bool generalAllOrNothing2 (const rangeset &a, const rangeset &b,
bool flip_a, bool flip_b)
{
tdiff iva = flip_a ? 0 : -1;
tdiff asz=tdiff(a.r.size()), bsz=tdiff(b.r.size());
while (iva<asz)
{
if (iva==-1) // implies that flip_a==false
{ if ((!flip_b)||(b.r[0]<a.r[0])) return false; }
else if (iva==asz-1) // implies that flip_a==false
{ if ((!flip_b)||(b.r[bsz-1]>a.r[asz-1])) return false; }
else
{
tdiff ivb=b.iiv(a.r[iva]);
if ((ivb!=bsz-1)&&(b.r[ivb+1]<a.r[iva+1])) return false;
if (flip_b==((ivb&1)==0)) return false;
}
iva+=2;
}
return true;
}
static bool generalAllOrNothing (const rangeset &a, const rangeset &b,
bool flip_a, bool flip_b)
{
if (a.r.empty())
return flip_a ? true : b.r.empty();
if (b.r.empty())
return flip_b ? true : a.r.empty();
int strat = strategy (a.nranges(), b.nranges());
return (strat==1) ? generalAllOrNothing1(a,b,flip_a,flip_b) :
((strat==2) ? generalAllOrNothing2(a,b,flip_a,flip_b)
: generalAllOrNothing2(b,a,flip_b,flip_a));
}
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 nranges() const { return r.size()>>1; }
tsize size() const { return nranges(); }
bool empty() const { return r.empty(); }
/*! Returns the current vector of ranges. */
const rtype &data() const { return r; }
void checkConsistency() const
{
planck_assert((r.size()&1)==0,"invalid number of entries");
for (tsize i=1; i<r.size(); ++i)
planck_assert(r[i]>r[i-1],"inconsistent entries");
}
void setData (const rtype &inp)
{
r=inp;
checkConsistency();
}
/*! 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.nranges(); ++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)
{
if (v2<=v1) return;
if (r.empty() || (v1>=r[r.size()-2])) append(v1,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) { add(v,v+1); }
/*! Removes all values within \a [v1;v2[ from the rangeset. */
void remove(const T &v1, const T &v2)
{
if (v2<=v1) return;
if (r.empty()) return;
if ((v2<=r[0])||(v1>=r.back())) return;
if ((v1<=r[0]) && (v2>=r.back())) { r.clear(); return; }
addRemove(v1,v2,0);
}
/*! Removes the value \a v from the rangeset. */
void remove(const T &v) { remove(v,v+1); }
/*! 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);
}
/*! Returns a vector containing all elements of the rangeset in ascending
order. */
std::vector<T> toVector() const
{
std::vector<T> res;
toVector(res);
return res;
}
/*! Returns the union of this rangeset and \a other. */
rangeset op_or (const rangeset &other) const
{
rangeset res;
res.generalUnion (*this,other,false,false);
return res;
}
/*! Returns the intersection of this rangeset and \a other. */
rangeset op_and (const rangeset &other) const
{
rangeset res;
res.generalUnion (*this,other,true,true);
return res;
}
/*! Returns the part of this rangeset which is not in \a other. */
rangeset op_andnot (const rangeset &other) const
{
rangeset res;
res.generalUnion (*this,other,true,false);
return res;
}
/*! Returns the parts of this rangeset and \a other, which are not in
both rangesets. */
rangeset op_xor (const rangeset &other) const
{
rangeset res;
res.generalXor (*this,other);
return res;
}
/*! 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 operator== (const rangeset &other) const
{ return r==other.r; }
/*! Returns \a true if the rangeset contains all values in the range
\a [a;b[, else \a false. */
bool contains (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
{ return generalAllOrNothing(*this,other,false,true); }
/** Returns true if any of the numbers [a;b[ are contained in the set,
else false. */
bool overlaps (T a,T b) const
{
tdiff res=iiv(a);
if ((res&1)==0) return true;
if (res==tdiff(r.size())-1) return false; // beyond the end of the set
return (r[res+1]<b);
}
/** Returns true if there is overlap between the set and "other",
else false. */
bool overlaps (const rangeset &other) const
{ return !generalAllOrNothing(*this,other,true,true); }
};
template<typename T> inline std::ostream &operator<< (std::ostream &os,
const rangeset<T> &rs)
{
os << "{ ";
for (tsize i=0; i<rs.nranges(); ++i)
os << "["<<rs.ivbegin(i)<<";"<<rs.ivend(i)<<"[ ";
return os << "}";
}
#endif
|