/usr/include/vigra/multi_handle.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 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 | /************************************************************************/
/* */
/* Copyright 2011-2014 by Ullrich Koethe */
/* */
/* This file is part of the VIGRA computer vision library. */
/* 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 MULTI_HANDLE_HXX
#define MULTI_HANDLE_HXX
#include "multi_fwd.hxx"
#include "metaprogramming.hxx"
#include "multi_shape.hxx"
namespace vigra {
template <unsigned TARGET_INDEX, class Handle, unsigned int INDEX=Handle::index>
struct CoupledHandleCast;
#ifndef _MSC_VER // Visual Studio doesn't like these forward declarations
template <unsigned int TARGET_INDEX, class Handle>
typename CoupledHandleCast<TARGET_INDEX, Handle>::reference
get(Handle & handle);
template <unsigned int TARGET_INDEX, class Handle>
typename CoupledHandleCast<TARGET_INDEX, Handle>::const_reference
get(Handle const & handle);
#endif
/** \addtogroup MultiIteratorGroup
*/
//@{
/**
Handle class, used by CoupledScanOrderIterator as the value type to simultaneously itearate over multiple images.
*/
template <class T, class NEXT>
class CoupledHandle
: public NEXT
{
public:
typedef NEXT base_type;
typedef CoupledHandle<T, NEXT> self_type;
static const int index = NEXT::index + 1; // index of this member of the chain
static const unsigned int dimensions = NEXT::dimensions;
typedef T value_type;
typedef T * pointer;
typedef T const * const_pointer;
typedef T & reference;
typedef T const & const_reference;
typedef typename base_type::shape_type shape_type;
CoupledHandle()
: base_type(),
pointer_(),
strides_()
{}
template <class NEXT1>
CoupledHandle(CoupledHandle<T, NEXT1> const & h, NEXT const & next)
: base_type(next),
pointer_(h.pointer_),
strides_(h.strides_)
{}
CoupledHandle(const_pointer p, shape_type const & strides, NEXT const & next)
: base_type(next),
pointer_(const_cast<pointer>(p)),
strides_(strides)
{}
template <class Stride>
CoupledHandle(MultiArrayView<dimensions, T, Stride> const & v, NEXT const & next)
: base_type(next),
pointer_(const_cast<pointer>(v.data())),
strides_(v.stride())
{
vigra_precondition(v.shape() == this->shape(), "createCoupledIterator(): shape mismatch.");
}
inline void incDim(int dim)
{
pointer_ += strides_[dim];
base_type::incDim(dim);
}
inline void decDim(int dim)
{
pointer_ -= strides_[dim];
base_type::decDim(dim);
}
inline void addDim(int dim, MultiArrayIndex d)
{
pointer_ += d*strides_[dim];
base_type::addDim(dim, d);
}
inline void add(shape_type const & d)
{
pointer_ += dot(d, strides_);
base_type::add(d);
}
template<int DIMENSION>
inline void increment()
{
pointer_ += strides_[DIMENSION];
base_type::template increment<DIMENSION>();
}
template<int DIMENSION>
inline void decrement()
{
pointer_ -= strides_[DIMENSION];
base_type::template decrement<DIMENSION>();
}
// TODO: test if making the above a default case of the this hurts performance
template<int DIMENSION>
inline void increment(MultiArrayIndex offset)
{
pointer_ += offset*strides_[DIMENSION];
base_type::template increment<DIMENSION>(offset);
}
template<int DIMENSION>
inline void decrement(MultiArrayIndex offset)
{
pointer_ -= offset*strides_[DIMENSION];
base_type::template decrement<DIMENSION>(offset);
}
void restrictToSubarray(shape_type const & start, shape_type const & end)
{
pointer_ += dot(start, strides_);
base_type::restrictToSubarray(start, end);
}
// ptr access
reference operator*()
{
return *pointer_;
}
const_reference operator*() const
{
return *pointer_;
}
pointer operator->()
{
return pointer_;
}
const_pointer operator->() const
{
return pointer_;
}
pointer ptr()
{
return pointer_;
}
const_pointer ptr() const
{
return pointer_;
}
shape_type const & strides() const
{
return strides_;
}
MultiArrayView<dimensions, T>
arrayView() const
{
return MultiArrayView<dimensions, T>(this->shape(), strides(), ptr() - dot(this->point(), strides()));
}
template <unsigned int TARGET_INDEX>
typename CoupledHandleCast<TARGET_INDEX, CoupledHandle, index>::reference
get()
{
return vigra::get<TARGET_INDEX>(*this);
}
template <unsigned int TARGET_INDEX>
typename CoupledHandleCast<TARGET_INDEX, CoupledHandle, index>::const_reference
get() const
{
return vigra::get<TARGET_INDEX>(*this);
}
// NOTE: dangerous function - only use it when you know what you are doing
void internal_reset(const_pointer p)
{
pointer_ = const_cast<pointer>(p);
}
pointer pointer_;
shape_type strides_;
};
// CoupledHandle holding the current coordinate
// (always the end of a CoupledHandle chain)
template <int N>
class CoupledHandle<TinyVector<MultiArrayIndex, N>, void>
{
public:
static const unsigned int index = 0; // index of this member of the chain
static const unsigned int dimensions = N;
typedef typename MultiArrayShape<N>::type value_type;
typedef value_type const * pointer;
typedef value_type const * const_pointer;
typedef value_type const & reference;
typedef value_type const & const_reference;
typedef value_type shape_type;
typedef CoupledHandle<value_type, void> self_type;
CoupledHandle()
: point_(),
shape_(),
scanOrderIndex_()
{}
CoupledHandle(value_type const & shape)
: point_(),
shape_(shape),
scanOrderIndex_()
{}
CoupledHandle(typename MultiArrayShape<N+1>::type const & shape)
: point_(),
shape_(shape.begin()),
scanOrderIndex_()
{}
inline void incDim(int dim)
{
++point_[dim];
}
inline void decDim(int dim)
{
--point_[dim];
}
inline void addDim(int dim, MultiArrayIndex d)
{
point_[dim] += d;
}
inline void add(shape_type const & d)
{
point_ += d;
}
template<int DIMENSION>
inline void increment()
{
++point_[DIMENSION];
}
template<int DIMENSION>
inline void decrement()
{
--point_[DIMENSION];
}
// TODO: test if making the above a default case of the this hurts performance
template<int DIMENSION>
inline void increment(MultiArrayIndex offset)
{
point_[DIMENSION] += offset;
}
template<int DIMENSION>
inline void decrement(MultiArrayIndex offset)
{
point_[DIMENSION] -= offset;
}
void restrictToSubarray(shape_type const & start, shape_type const & end)
{
point_ = shape_type();
shape_ = end - start;
scanOrderIndex_ = 0;
}
inline void incrementIndex()
{
++scanOrderIndex_;
}
inline void decrementIndex()
{
--scanOrderIndex_;
}
inline void incrementIndex(MultiArrayIndex offset)
{
scanOrderIndex_ += offset;
}
inline void decrementIndex(MultiArrayIndex offset)
{
scanOrderIndex_ -= offset;
}
// access
MultiArrayIndex scanOrderIndex() const
{
return scanOrderIndex_;
}
// access
const_reference point() const
{
return point_;
}
// access
const_reference shape() const
{
return shape_;
}
const_reference operator*() const
{
return point_;
}
const_pointer operator->() const
{
return &point_;
}
const_pointer ptr() const
{
return &point_;
}
unsigned int borderType() const
{
return detail::BorderTypeImpl<N>::exec(point_, shape_);
}
template <unsigned int TARGET_INDEX>
typename CoupledHandleCast<TARGET_INDEX, CoupledHandle, index>::reference
get()
{
return vigra::get<TARGET_INDEX>(*this);
}
template <unsigned int TARGET_INDEX>
typename CoupledHandleCast<TARGET_INDEX, CoupledHandle, index>::const_reference
get() const
{
return vigra::get<TARGET_INDEX>(*this);
}
// NOTE: dangerous function - only use it when you know what you are doing
void internal_reset(value_type const & point)
{
point_ = point;
}
value_type point_, shape_;
MultiArrayIndex scanOrderIndex_;
};
// CoupledHandle for multi-band data
template <class T, class NEXT>
class CoupledHandle<Multiband<T>, NEXT>
: public NEXT
{
public:
typedef NEXT base_type;
typedef CoupledHandle<Multiband<T>, NEXT> self_type;
static const unsigned int index = NEXT::index + 1; // index of this member of the chain
static const unsigned int dimensions = NEXT::dimensions;
typedef MultiArrayView<1, T, StridedArrayTag> value_type;
typedef value_type * pointer;
typedef value_type const * const_pointer;
typedef value_type & reference;
typedef value_type const & const_reference;
typedef typename base_type::shape_type shape_type;
CoupledHandle()
: base_type(),
view_(),
strides_()
{}
template <class NEXT1>
CoupledHandle(CoupledHandle<Multiband<T>, NEXT1> const & h, NEXT const & next)
: base_type(next),
view_(h.view_),
strides_(h.strides_)
{}
CoupledHandle(const_reference p, shape_type const & strides, NEXT const & next)
: base_type(next),
view_(p),
strides_(strides)
{}
template <class Stride>
CoupledHandle(MultiArrayView<dimensions+1, Multiband<T>, Stride> const & v, NEXT const & next)
: base_type(next),
view_(v.bindInner(shape_type())),
strides_(v.bindOuter(0).stride())
{
vigra_precondition(v.bindOuter(0).shape() == this->shape(), "createCoupledIterator(): shape mismatch.");
}
inline void incDim(int dim)
{
view_.unsafePtr() += strides_[dim];
base_type::incDim(dim);
}
inline void decDim(int dim)
{
view_.unsafePtr() -= strides_[dim];
base_type::decDim(dim);
}
inline void addDim(int dim, MultiArrayIndex d)
{
view_.unsafePtr() += d*strides_[dim];
base_type::addDim(dim, d);
}
inline void add(shape_type const & d)
{
view_.unsafePtr() += dot(d, strides_);
base_type::add(d);
}
template<int DIMENSION>
inline void increment()
{
view_.unsafePtr() += strides_[DIMENSION];
base_type::template increment<DIMENSION>();
}
template<int DIMENSION>
inline void decrement()
{
view_.unsafePtr() -= strides_[DIMENSION];
base_type::template decrement<DIMENSION>();
}
// TODO: test if making the above a default case of the this hurts performance
template<int DIMENSION>
inline void increment(MultiArrayIndex offset)
{
view_.unsafePtr() += offset*strides_[DIMENSION];
base_type::template increment<DIMENSION>(offset);
}
template<int DIMENSION>
inline void decrement(MultiArrayIndex offset)
{
view_.unsafePtr() -= offset*strides_[DIMENSION];
base_type::template decrement<DIMENSION>(offset);
}
void restrictToSubarray(shape_type const & start, shape_type const & end)
{
view_.unsafePtr() += dot(start, strides_);
base_type::restrictToSubarray(start, end);
}
// ptr access
reference operator*()
{
return view_;
}
const_reference operator*() const
{
return view_;
}
pointer operator->()
{
return &view_;
}
const_pointer operator->() const
{
return &view_;
}
pointer ptr()
{
return &view_;
}
const_pointer ptr() const
{
return &view_;
}
shape_type const & strides() const
{
return strides_;
}
MultiArrayView<dimensions+1, Multiband<T> >
arrayView() const
{
typedef MultiArrayView<dimensions+1, T> View;
typename View::difference_type vshape(SkipInitialization), vstride(SkipInitialization);
vshape.template subarray<0, dimensions>() = this->shape();
vstride.template subarray<0, dimensions>() = strides();
vshape[dimensions] = view_.shape(0);
vstride[dimensions] = view_.stride(0);
return View(vshape, vstride, view_.data() - dot(this->point(), strides())).multiband();
}
template <unsigned int TARGET_INDEX>
typename CoupledHandleCast<TARGET_INDEX, CoupledHandle, index>::reference
get()
{
return vigra::get<TARGET_INDEX>(*this);
}
template <unsigned int TARGET_INDEX>
typename CoupledHandleCast<TARGET_INDEX, CoupledHandle, index>::const_reference
get() const
{
return vigra::get<TARGET_INDEX>(*this);
}
template <class U>
void internal_reset(U const & p)
{
vigra_fail("CoupledHandle<Multiband<T>>::internal_reset(): not implemented.");
}
value_type view_;
shape_type strides_;
};
// helper class for CoupledHandle for CunkedArray
template <unsigned int N, class T>
class IteratorChunkHandle
{
public:
typedef ChunkedArray<N, T> array_type;
typedef typename MultiArrayShape<N>::type shape_type;
IteratorChunkHandle()
: offset_(),
chunk_(0)
{}
IteratorChunkHandle(shape_type const & offset)
: offset_(offset),
chunk_(0)
{}
IteratorChunkHandle(IteratorChunkHandle const & other)
: offset_(other.offset_),
chunk_(0)
{}
IteratorChunkHandle & operator=(IteratorChunkHandle const & other)
{
offset_ = other.offset_;
chunk_ = 0;
return *this;
}
shape_type offset_;
SharedChunkHandle<N, T> * chunk_;
};
/* CoupledHandle for CunkedArray
The handle must store a pointer to a chunk because the chunk knows
about memory menagement, and to an array view because it knows about
subarrays and slices.
Perhaps we can reduce this to a single pointer or otherwise reduce
the handle memory to make it faster?
*/
template <class U, class NEXT>
class CoupledHandle<ChunkedMemory<U>, NEXT>
: public NEXT,
public IteratorChunkHandle<NEXT::dimensions, typename UnqualifiedType<U>::type>
{
public:
typedef typename UnqualifiedType<U>::type T;
typedef NEXT base_type;
typedef IteratorChunkHandle<NEXT::dimensions, T> base_type2;
typedef CoupledHandle<ChunkedMemory<U>, NEXT> self_type;
static const unsigned int index = NEXT::index + 1; // index of this member of the chain
static const unsigned int dimensions = NEXT::dimensions;
typedef typename IfBool<UnqualifiedType<U>::isConst,
ChunkedArrayBase<dimensions, T> const,
ChunkedArrayBase<dimensions, T> >::type array_type;
typedef detail::ChunkShape<dimensions, T> chunk_shape;
typedef T value_type;
typedef U * pointer;
typedef value_type const * const_pointer;
typedef U & reference;
typedef value_type const & const_reference;
typedef typename base_type::shape_type shape_type;
CoupledHandle()
: base_type(),
base_type2(),
pointer_(),
strides_(),
upper_bound_(),
array_()
{}
CoupledHandle(CoupledHandle const & other)
: base_type(other),
base_type2(other),
pointer_(other.pointer_),
strides_(other.strides_),
upper_bound_(other.upper_bound_),
array_(other.array_)
{
if(array_)
pointer_ = array_->chunkForIterator(point(), strides_, upper_bound_, this);
}
CoupledHandle(array_type const & array, NEXT const & next)
: base_type(next),
base_type2(),
pointer_(),
array_(const_cast<array_type*>(&array))
{
if(array_)
pointer_ = array_->chunkForIterator(point(), strides_, upper_bound_, this);
}
~CoupledHandle()
{
// deref the present chunk
if(array_)
array_->unrefChunk(this);
}
CoupledHandle & operator=(CoupledHandle const & other)
{
if(this != &other)
{
// deref the present chunk
if(array_)
array_->unrefChunk(this);
base_type::operator=(other);
base_type2::operator=(other);
array_ = other.array_;
if(array_)
{
pointer_ = array_->chunkForIterator(point(), strides_, upper_bound_, this);
}
else
{
pointer_ = other.pointer_;
strides_ = other.strides_;
upper_bound_ = other.upper_bound_;
}
}
return *this;
}
using base_type::point;
using base_type::shape;
inline void incDim(int dim)
{
base_type::incDim(dim);
pointer_ += strides_[dim];
if(point()[dim] == upper_bound_[dim])
{
// if(point()[dim] < shape()[dim])
pointer_ = array_->chunkForIterator(point(), strides_, upper_bound_, this);
}
}
inline void decDim(int dim)
{
base_type::decDim(dim);
pointer_ -= strides_[dim];
if(point()[dim] < upper_bound_[dim] - array_->chunk_shape_[dim])
{
// if(point()[dim] >= 0)
pointer_ = array_->chunkForIterator(point(), strides_, upper_bound_, this);
}
}
inline void addDim(int dim, MultiArrayIndex d)
{
base_type::addDim(dim, d);
if(point()[dim] < shape()[dim] && point()[dim] >= 0)
pointer_ = array_->chunkForIterator(point(), strides_, upper_bound_, this);
}
inline void add(shape_type const & d)
{
base_type::add(d);
pointer_ = array_->chunkForIterator(point(), strides_, upper_bound_, this);
}
template<int DIMENSION>
inline void increment()
{
// incDim(DIMENSION);
base_type::template increment<DIMENSION>();
pointer_ += strides_[DIMENSION];
if(point()[DIMENSION] == upper_bound_[DIMENSION])
{
if(point()[DIMENSION] > shape()[DIMENSION])
// this invariant check prevents the compiler from optimizing stupidly
// (it makes a difference of a factor of 2!)
vigra_invariant(false, "CoupledHandle<ChunkedMemory<T>>: internal error.");
else
pointer_ = array_->chunkForIterator(point(), strides_, upper_bound_, this);
}
}
template<int DIMENSION>
inline void decrement()
{
// decDim(DIMENSION);
base_type::template decrement<DIMENSION>();
pointer_ -= strides_[DIMENSION];
if(point()[DIMENSION] < upper_bound_[DIMENSION] - array_->chunk_shape_[DIMENSION])
{
if(point()[DIMENSION] < -1)
// this invariant check prevents the compiler from optimizing stupidly
// (it makes a difference of a factor of 2!)
vigra_invariant(false, "CoupledHandle<ChunkedMemory<T>>: internal error.");
else
pointer_ = array_->chunkForIterator(point(), strides_, upper_bound_, this);
}
}
template<int DIMENSION>
inline void increment(MultiArrayIndex d)
{
addDim(DIMENSION, d);
}
template<int DIMENSION>
inline void decrement(MultiArrayIndex d)
{
addDim(DIMENSION, -d);
}
void restrictToSubarray(shape_type const & start, shape_type const & end)
{
base_type::restrictToSubarray(start, end);
this->offset_ += start;
pointer_ = array_->chunkForIterator(point(), strides_, upper_bound_, this);
}
// ptr access
reference operator*()
{
return *pointer_;
}
const_reference operator*() const
{
return *pointer_;
}
pointer operator->()
{
return pointer_;
}
const_pointer operator->() const
{
return pointer_;
}
pointer ptr()
{
return pointer_;
}
const_pointer ptr() const
{
return pointer_;
}
array_type const &
arrayView() const
{
return *array_;
}
template <unsigned int TARGET_INDEX>
typename CoupledHandleCast<TARGET_INDEX, CoupledHandle, index>::reference
get()
{
return vigra::get<TARGET_INDEX>(*this);
}
template <unsigned int TARGET_INDEX>
typename CoupledHandleCast<TARGET_INDEX, CoupledHandle, index>::const_reference
get() const
{
return vigra::get<TARGET_INDEX>(*this);
}
template <class V>
void internal_reset(V const & p)
{
vigra_fail("CoupledHandle<ChunkedMemory<T>>::internal_reset(): not implemented.");
}
pointer pointer_;
shape_type strides_, upper_bound_;
array_type * array_;
};
// meta-programming helper classes to implement 'get<INDEX>(CoupledHandle)'
template <unsigned TARGET_INDEX>
struct Error__CoupledHandle_index_out_of_range;
namespace detail {
template <unsigned TARGET_INDEX, class Handle, bool isValid, unsigned int INDEX=Handle::index>
struct CoupledHandleCastImpl
{
typedef typename CoupledHandleCastImpl<TARGET_INDEX, typename Handle::base_type, isValid>::type type;
typedef typename type::value_type value_type;
typedef typename type::reference reference;
typedef typename type::const_reference const_reference;
};
template <unsigned TARGET_INDEX, class Handle, unsigned int INDEX>
struct CoupledHandleCastImpl<TARGET_INDEX, Handle, false, INDEX>
{
typedef Error__CoupledHandle_index_out_of_range<TARGET_INDEX> type;
typedef Error__CoupledHandle_index_out_of_range<TARGET_INDEX> value_type;
typedef Error__CoupledHandle_index_out_of_range<TARGET_INDEX> reference;
typedef Error__CoupledHandle_index_out_of_range<TARGET_INDEX> const_reference;
};
template <unsigned TARGET_INDEX, class Handle>
struct CoupledHandleCastImpl<TARGET_INDEX, Handle, true, TARGET_INDEX>
{
typedef Handle type;
typedef typename type::value_type value_type;
typedef typename type::reference reference;
typedef typename type::const_reference const_reference;
};
} // namespace detail
template <unsigned TARGET_INDEX, class Handle, unsigned int INDEX>
struct CoupledHandleCast
: public detail::CoupledHandleCastImpl<TARGET_INDEX, Handle, (TARGET_INDEX <= INDEX), INDEX>
{};
template <unsigned int TARGET_INDEX, class Handle>
inline
typename CoupledHandleCast<TARGET_INDEX, Handle>::type &
cast(Handle & handle)
{
return handle;
}
template <unsigned int TARGET_INDEX, class Handle>
inline
typename CoupledHandleCast<TARGET_INDEX, Handle>::type const &
cast(Handle const & handle)
{
return handle;
}
/** Returns reference to the element in the band of the handle with index TARGET_INDEX.
*/
template <unsigned int TARGET_INDEX, class Handle>
inline
typename CoupledHandleCast<TARGET_INDEX, Handle>::reference
get(Handle & handle)
{
return *cast<TARGET_INDEX>(handle);
}
/** Returns a constant reference to the element in the band of the handle with index TARGET_INDEX.
*/
template <unsigned int TARGET_INDEX, class Handle>
inline
typename CoupledHandleCast<TARGET_INDEX, Handle>::const_reference
get(Handle const & handle)
{
return *cast<TARGET_INDEX>(handle);
}
// meta-programming helper classes to infer the type of
// a CoupledHandle for a set of arrays
template <unsigned int N, class List>
struct ComposeCoupledHandle;
template <unsigned int N, class T, class TAIL>
struct ComposeCoupledHandle<N, TypeList<T, TAIL> >
{
typedef typename ComposeCoupledHandle<N, TAIL>::type BaseType;
typedef typename MultiArrayShape<N>::type shape_type;
typedef CoupledHandle<T, BaseType> type;
template <class S>
type exec(MultiArrayView<N, T, S> const & m,
shape_type const & start, shape_type const & end,
BaseType const & base)
{
return type(m.subarray(start, end).data(), m.stride(), base);
}
template <class S>
type exec(MultiArrayView<N, T, S> const & m, BaseType const & base)
{
return type(m.data(), m.stride(), base);
}
};
template <unsigned int N>
struct ComposeCoupledHandle<N, void>
{
typedef typename MultiArrayShape<N>::type shape_type;
typedef CoupledHandle<shape_type, void> type;
type exec(shape_type const & shape)
{
return type(shape);
}
type exec(shape_type const & start, shape_type const & end)
{
return type(end-start);
}
};
template <unsigned int N, class T1=void, class T2=void, class T3=void, class T4=void, class T5=void>
struct CoupledHandleType
{
// reverse the order to get the desired index order
typedef typename MakeTypeList<T5, T4, T3, T2, T1>::type TypeList;
typedef typename ComposeCoupledHandle<N, TypeList>::type type;
};
template <unsigned int N, class T1, class T2, class T3, class T4, class T5>
struct CoupledHandleType<N, Multiband<T1>, T2, T3, T4, T5>
{
// reverse the order to get the desired index order
typedef typename MakeTypeList<T5, T4, T3, T2, Multiband<T1> >::type TypeList;
typedef typename ComposeCoupledHandle<N-1, TypeList>::type type;
};
// meta-programming helper classes to implement 'zip(iterator1, iterator2)'
template <class A, class B>
struct ZipCoupledHandles;
template <class A, class Head, class Tail>
struct ZipCoupledHandles<A, CoupledHandle<Head, Tail> >
{
typedef typename ZipCoupledHandles<A, Tail>::type Next;
typedef CoupledHandle<Head, Next> type;
static type construct(A const & a, CoupledHandle<Head, Tail> const & h)
{
return type(h, ZipCoupledHandles<A, Tail>::construct(a, (Tail const &)h));
}
};
template <class A, class Shape>
struct ZipCoupledHandles<A, CoupledHandle<Shape, void> >
{
typedef A type;
static type construct(A const & a, CoupledHandle<Shape, void> const &)
{
return a;
}
};
// allow an iterator that uses CoupledHandle to specialize its
// dereferencing functions, such that
// '*iter' returns a referenc to the current point if
// the handle is just a coordinate handle
// '*iter' returns a reference to the current data element
// if the handle referes to just one array
// '*iter' returns a reference to the handle itself if it refers to
// several arrays simultaneously (i.e. is actualy a coupled handle)
template <class Handle, unsigned int INDEX=Handle::index>
struct CoupledHandleTraits
{
typedef Handle value_type;
typedef Handle & reference;
typedef Handle const & const_reference;
typedef Handle * pointer;
typedef Handle const * const_pointer;
static reference dereference(Handle & h)
{
return h;
}
static const_reference dereference(Handle const & h)
{
return h;
}
};
template <class Handle>
struct CoupledHandleTraits<Handle, 0>
{
typedef typename Handle::value_type value_type;
typedef typename Handle::reference reference;
typedef typename Handle::const_reference const_reference;
typedef typename Handle::pointer pointer;
typedef typename Handle::const_pointer const_pointer;
static reference dereference(Handle & h)
{
return *h;
}
static const_reference dereference(Handle const & h)
{
return *h;
}
};
template <class Handle>
struct CoupledHandleTraits<Handle, 1>
{
typedef typename Handle::value_type value_type;
typedef typename Handle::reference reference;
typedef typename Handle::const_reference const_reference;
typedef typename Handle::pointer pointer;
typedef typename Handle::const_pointer const_pointer;
static reference dereference(Handle & h)
{
return *h;
}
static const_reference dereference(Handle const & h)
{
return *h;
}
};
//@}
} // namespace vigra
#endif /* MULTI_HANDLE_HXX */
|