/usr/include/vigra/multi_hierarchical_iterator.hxx is in libvigraimpex-dev 1.10.0+git20160211.167be93+dfsg-5ubuntu1.
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 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 | /************************************************************************/
/* */
/* Copyright 2003-2012 by Gunnar Kedenburg and Ullrich Koethe */
/* */
/* This file is part of the VIGRA computer vision library. */
/* ( Version 1.3.0, Sep 10 2004 ) */
/* The VIGRA Website is */
/* http://hci.iwr.uni-heidelberg.de/vigra/ */
/* Please direct questions, bug reports, and contributions to */
/* ullrich.koethe@iwr.uni-heidelberg.de or */
/* vigra@informatik.uni-hamburg.de */
/* */
/* Permission is hereby granted, free of charge, to any person */
/* obtaining a copy of this software and associated documentation */
/* files (the "Software"), to deal in the Software without */
/* restriction, including without limitation the rights to use, */
/* copy, modify, merge, publish, distribute, sublicense, and/or */
/* sell copies of the Software, and to permit persons to whom the */
/* Software is furnished to do so, subject to the following */
/* conditions: */
/* */
/* The above copyright notice and this permission notice shall be */
/* included in all copies or substantial portions of the */
/* Software. */
/* */
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND */
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES */
/* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND */
/* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT */
/* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, */
/* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING */
/* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR */
/* OTHER DEALINGS IN THE SOFTWARE. */
/* */
/************************************************************************/
#ifndef VIGRA_MULTI_HIERARCHICAL_ITERATOR_HXX
#define VIGRA_MULTI_HIERARCHICAL_ITERATOR_HXX
#include <sys/types.h>
#include "multi_fwd.hxx"
#include "iteratortags.hxx"
#include "multi_handle.hxx"
namespace vigra {
/** \addtogroup MultiIteratorGroup
*/
//@{
/********************************************************/
/* */
/* MultiHierarchicalIterator */
/* */
/********************************************************/
template <unsigned int N,
class HANDLES,
int DIMENSION = N-1>
class HierarchicalIterator
#ifndef DOXYGEN // doxygen doesn't understand this inheritance
: public HierarchicalIterator<N, HANDLES, DIMENSION-1>
#endif
{
public:
typedef HierarchicalIterator<N, HANDLES, DIMENSION-1> base_type;
static const int level = DIMENSION;
typedef typename base_type::value_type value_type;
typedef typename base_type::reference reference;
typedef typename base_type::const_reference const_reference;
typedef typename base_type::pointer pointer;
typedef typename base_type::const_pointer const_pointer;
typedef typename base_type::difference_type difference_type;
typedef typename base_type::shape_type shape_type;
explicit HierarchicalIterator(HANDLES const & handles = HANDLES())
: base_type(handles)
{}
void operator++ ()
{
this->handles_.template increment<level>();
}
void operator-- ()
{
this->handles_.template decrement<level>();
}
HierarchicalIterator operator++ (int)
{
HierarchicalIterator ret = *this;
++(*this);
return ret;
}
HierarchicalIterator operator-- (int)
{
HierarchicalIterator ret = *this;
--(*this);
return ret;
}
HierarchicalIterator & operator+= (difference_type n)
{
this->handles_.addDim(level, n);
return *this;
}
HierarchicalIterator & operator+= (shape_type const & d)
{
base_type::operator+=(d);
return *this;
}
HierarchicalIterator &operator-= (difference_type n)
{
this->handles_.addDim(level, -n);
return *this;
}
// HierarchicalIterator & operator-= (multi_difference_type const & d)
// {
// this->m_ptr -= total_stride(d.begin());
// return *this;
// }
HierarchicalIterator operator+ (difference_type n) const
{
return HierarchicalIterator(*this) += n;
}
// HierarchicalIterator operator+ (multi_difference_type const & d) const
// {
// StridedMultiIterator ret = *this;
// ret += d;
// return ret;
// }
difference_type operator- (HierarchicalIterator const & d) const
{
return this->point()[level] - d.point()[level];
}
HierarchicalIterator operator- (difference_type n) const
{
return HierarchicalIterator(*this) -= n;
}
// HierarchicalIterator operator- (multi_difference_type const & d) const
// {
// HierarchicalIterator ret = *this;
// ret -= d;
// return ret;
// }
bool operator== (const HierarchicalIterator &rhs) const
{
return this->point()[level] == rhs.point()[level];
}
bool operator!= (const HierarchicalIterator &rhs) const
{
return this->point()[level] != rhs.point()[level];
}
bool operator< (const HierarchicalIterator &rhs) const
{
return this->point()[level] < rhs.point()[level];
}
bool operator<= (const HierarchicalIterator &rhs) const
{
return this->point()[level] <= rhs.point()[level];
}
bool operator> (const HierarchicalIterator &rhs) const
{
return this->point()[level] > rhs.point()[level];
}
bool operator>= (const HierarchicalIterator &rhs) const
{
return this->point()[level] >= rhs.point()[level];
}
base_type begin () const
{
return *this;
}
base_type end () const
{
return base_type(*this) += this->shape()[level-1] - this->point()[level-1];
}
HierarchicalIterator getEndIterator() const
{
return HierarchicalIterator(*this) += this->shape() - this->point();
}
// iterator iteratorForDimension(unsigned int d) const
// {
// vigra_precondition(d <= level,
// "StridedMultiIterator<N>::iteratorForDimension(d): d < N required");
// return iterator(this->m_ptr, stride_traits::shift(m_stride, d), 0);
// }
template <int K>
HierarchicalIterator<N, HANDLES, K> &
dim()
{
return *this;
}
template <int K>
HierarchicalIterator<N, HANDLES, K> const &
dim() const
{
return *this;
}
};
/********************************************************/
template <unsigned int N,
class HANDLES>
class HierarchicalIterator<N, HANDLES, 0>
{
public:
static const int level = 0;
typedef CoupledHandleTraits<HANDLES> HandleTraits;
typedef typename HandleTraits::value_type value_type;
typedef typename HandleTraits::reference reference;
typedef typename HandleTraits::const_reference const_reference;
typedef typename HandleTraits::pointer pointer;
typedef typename HandleTraits::const_pointer const_pointer;
typedef MultiArrayIndex difference_type;
typedef typename MultiArrayShape<N>::type shape_type;
typedef HierarchicalIterator<N, HANDLES, 0> iterator;
typedef std::random_access_iterator_tag iterator_category;
protected:
HANDLES handles_;
public:
explicit HierarchicalIterator(HANDLES const & handles = HANDLES())
: handles_(handles)
{}
void operator++ ()
{
handles_.template increment<level>();
}
void operator-- ()
{
handles_.template decrement<level>();
}
HierarchicalIterator operator++ (int)
{
HierarchicalIterator ret = *this;
++(*this);
return ret;
}
HierarchicalIterator operator-- (int)
{
HierarchicalIterator ret = *this;
--(*this);
return ret;
}
HierarchicalIterator & operator+= (difference_type n)
{
handles_.addDim(level, n);
return *this;
}
HierarchicalIterator & operator+= (shape_type const & d)
{
handles_.add(d);
handles_.scanOrderIndex_ += detail::CoordinateToScanOrder<N>::exec(shape(), d);
return *this;
}
HierarchicalIterator & operator-= (difference_type n)
{
handles_.addDim(level, -n);
return *this;
}
// HierarchicalIterator & operator-= (multi_difference_type const & d)
// {
// m_ptr -= d[level];
// return *this;
// }
HierarchicalIterator operator+ (difference_type n) const
{
return HierarchicalIterator(*this) += n;
}
// HierarchicalIterator operator+ (multi_difference_type const & d) const
// {
// HierarchicalIterator ret = *this;
// ret += d;
// return ret;
// }
difference_type operator- (HierarchicalIterator const & d) const
{
return point()[level] - d.point()[level];
}
HierarchicalIterator operator- (difference_type n) const
{
return HierarchicalIterator(*this) -= n;
}
// HierarchicalIterator operator- (multi_difference_type const & d) const
// {
// HierarchicalIterator ret = *this;
// ret -= d;
// return ret;
// }
// reference operator[] (difference_type n) const
// {
// return m_ptr [n];
// }
// reference operator[] (multi_difference_type const & d) const
// {
// return m_ptr [d[level]];
// }
reference operator* ()
{
return HandleTraits::dereference(handles_);
}
const_reference operator* () const
{
return HandleTraits::dereference(handles_);
}
template <unsigned int TARGET_INDEX>
typename CoupledHandleCast<TARGET_INDEX, HANDLES>::reference
get()
{
return handles_.template get<TARGET_INDEX>();
}
template <unsigned int TARGET_INDEX>
typename CoupledHandleCast<TARGET_INDEX, HANDLES>::const_reference
get() const
{
return handles_.template get<TARGET_INDEX>();
}
pointer operator->()
{
return &HandleTraits::dereference(handles_);
}
const_pointer operator->() const
{
return &HandleTraits::dereference(handles_);
}
bool operator== (const HierarchicalIterator &rhs) const
{
return point()[level] == rhs.point()[level];
}
bool operator!= (const HierarchicalIterator &rhs) const
{
return point()[level] != rhs.point()[level];
}
bool operator< (const HierarchicalIterator &rhs) const
{
return point()[level] < rhs.point()[level];
}
bool operator<= (const HierarchicalIterator &rhs) const
{
return point()[level] <= rhs.point()[level];
}
bool operator> (const HierarchicalIterator &rhs) const
{
return point()[level] > rhs.point()[level];
}
bool operator>= (const HierarchicalIterator &rhs) const
{
return point()[level] >= rhs.point()[level];
}
// iterator iteratorForDimension(unsigned int d) const
// {
// vigra_precondition(d == 0,
// "MultiIterator<1>::iteratorForDimension(d): d == 0 required");
// const difference_type stride = 1;
// return iterator(m_ptr, &stride, 0);
// }
HierarchicalIterator getEndIterator() const
{
return HierarchicalIterator(*this) += shape() - point();
}
shape_type const & point() const
{
return handles_.point();
}
shape_type const & shape() const
{
return handles_.shape();
}
difference_type scanOrderIndex() const
{
return handles_.scanOrderIndex();
}
HANDLES const & handles() const
{
return handles_;
}
template <int K>
HierarchicalIterator<N, HANDLES, 0> &
dim()
{
return *this;
}
template <int K>
HierarchicalIterator<N, HANDLES, 0> const &
dim() const
{
return *this;
}
// protected:
// difference_type
// total_stride(typename multi_difference_type::const_iterator d) const
// {
// return d[level];
// }
};
/** Helper class to easliy get the type of a CoupledScanOrderIterator (and corresponding CoupledHandle) for up to five arrays of dimension N with element types T1,...,T5.
*/
template <unsigned int N, class T1=void, class T2=void, class T3=void, class T4=void, class T5=void>
struct HierarchicalIteratorType
{
/** Type of the CoupledHandle.*/
typedef typename CoupledHandleType<N, T1, T2, T3, T4, T5>::type HandleType;
/** Type of the CoupledScanOrderIterator.*/
typedef HierarchicalIterator<HandleType::dimensions, HandleType> IteratorType;
typedef IteratorType type;
};
// /** Alias for \ref vigra::CoupledIteratorType (maybe easier to remember).
// */
// template <unsigned int N, class T1=void, class T2=void, class T3=void, class T4=void, class T5=void>
// struct CoupledArrays
// : public CoupledIteratorType<N, T1, T2, T3, T4, T5>
// {};
/** Returns a HierarchicalIterator from shape to iterate over coordinates.
*/
template <int N>
typename HierarchicalIteratorType<N>::type
createHierarchicalIterator(TinyVector<MultiArrayIndex, N> const & shape)
{
typedef typename CoupledHandleType<N>::type P0;
typedef HierarchicalIterator<N, P0> IteratorType;
return IteratorType(P0(shape));
}
/** Returns a HierarchicalIterator to simultaneously iterate over image m1 and its coordinates.
*/
template <unsigned int N1, class T1, class S1>
typename HierarchicalIteratorType<N1, T1>::type
createHierarchicalIterator(MultiArrayView<N1, T1, S1> const & m1)
{
typedef typename CoupledHandleType<N1, T1>::type P1;
typedef typename P1::base_type P0;
typedef HierarchicalIterator<P1::dimensions, P1> IteratorType;
return IteratorType(P1(m1,
P0(m1.shape())));
}
/** Returns a HierarchicalIterator to simultaneously iterate over images m1, m2 and their coordinates.
*/
template <unsigned int N1, class T1, class S1,
unsigned int N2, class T2, class S2>
typename HierarchicalIteratorType<N1, T1, T2>::type
createHierarchicalIterator(MultiArrayView<N1, T1, S1> const & m1,
MultiArrayView<N2, T2, S2> const & m2)
{
typedef typename CoupledHandleType<N1, T1, T2>::type P2;
typedef typename P2::base_type P1;
typedef typename P1::base_type P0;
typedef HierarchicalIterator<P2::dimensions, P2> IteratorType;
return IteratorType(P2(m2,
P1(m1,
P0(m1.shape()))));
}
/** Returns a HierarchicalIterator to simultaneously iterate over images m1, m2, m3 and their coordinates.
*/
template <unsigned int N1, class T1, class S1,
unsigned int N2, class T2, class S2,
unsigned int N3, class T3, class S3>
typename HierarchicalIteratorType<N1, T1, T2, T3>::type
createHierarchicalIterator(MultiArrayView<N1, T1, S1> const & m1,
MultiArrayView<N2, T2, S2> const & m2,
MultiArrayView<N3, T3, S3> const & m3)
{
typedef typename CoupledHandleType<N1, T1, T2, T3>::type P3;
typedef typename P3::base_type P2;
typedef typename P2::base_type P1;
typedef typename P1::base_type P0;
typedef HierarchicalIterator<P3::dimensions, P3> IteratorType;
return IteratorType(P3(m3,
P2(m2,
P1(m1,
P0(m1.shape())))));
}
/** Returns a HierarchicalIterator to simultaneously iterate over images m1, m2, m3, m4 and their coordinates.
*/
template <unsigned int N1, class T1, class S1,
unsigned int N2, class T2, class S2,
unsigned int N3, class T3, class S3,
unsigned int N4, class T4, class S4>
typename HierarchicalIteratorType<N1, T1, T2, T3, T4>::type
createHierarchicalIterator(MultiArrayView<N1, T1, S1> const & m1,
MultiArrayView<N2, T2, S2> const & m2,
MultiArrayView<N3, T3, S3> const & m3,
MultiArrayView<N4, T4, S4> const & m4)
{
typedef typename CoupledHandleType<N1, T1, T2, T3, T4>::type P4;
typedef typename P4::base_type P3;
typedef typename P3::base_type P2;
typedef typename P2::base_type P1;
typedef typename P1::base_type P0;
typedef HierarchicalIterator<P4::dimensions, P4> IteratorType;
return IteratorType(P4(m4,
P3(m3,
P2(m2,
P1(m1,
P0(m1.shape()))))));
}
/** Returns a HierarchicalIterator to simultaneously iterate over images m1, m2, m3, m4, m5 and their coordinates.
*/
template <unsigned int N1, class T1, class S1,
unsigned int N2, class T2, class S2,
unsigned int N3, class T3, class S3,
unsigned int N4, class T4, class S4,
unsigned int N5, class T5, class S5>
typename HierarchicalIteratorType<N1, T1, T2, T3, T4, T5>::type
createHierarchicalIterator(MultiArrayView<N1, T1, S1> const & m1,
MultiArrayView<N2, T2, S2> const & m2,
MultiArrayView<N3, T3, S3> const & m3,
MultiArrayView<N4, T4, S4> const & m4,
MultiArrayView<N5, T5, S5> const & m5)
{
typedef typename CoupledHandleType<N1, T1, T2, T3, T4, T5>::type P5;
typedef typename P5::base_type P4;
typedef typename P4::base_type P3;
typedef typename P3::base_type P2;
typedef typename P2::base_type P1;
typedef typename P1::base_type P0;
typedef HierarchicalIterator<P5::dimensions, P5> IteratorType;
return IteratorType(P5(m5,
P4(m4,
P3(m3,
P2(m2,
P1(m1,
P0(m1.shape())))))));
}
template <unsigned int N, class A, class B>
HierarchicalIterator<N, typename ZipCoupledHandles<A, B>::type>
zip(HierarchicalIterator<N, A> const & a, HierarchicalIterator<N, B> const & b)
{
vigra_precondition(a.shape() == b.shape() && a.scanOrderIndex() == b.scanOrderIndex(),
"zip(HierarchicalIterator): iterators must have identical shape and position.");
typedef typename ZipCoupledHandles<A, B>::type Handle;
typedef HierarchicalIterator<N, Handle> IteratorType;
return IteratorType(ZipCoupledHandles<A, B>::construct(a.handles(), b.handles()));
}
//@}
} // namespace vigra
// namespace std {
// template <unsigned int N, class T, class REFERENCE, class POINTER>
// ostream & operator<<(ostream & o, vigra::StridedScanOrderIterator<N, T, REFERENCE, POINTER> const & i)
// {
// o << *i;
// return o;
// }
// } // namespace std
#endif // VIGRA_MULTI_HIERARCHICAL_ITERATOR_HXX
|