/usr/include/TiledArray/range.h is in libtiledarray-dev 0.4.4-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 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 | /*
* This file is a part of TiledArray.
* Copyright (C) 2013 Virginia Tech
*
* 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 3 of the License, or
* (at your option) any later version.
*
* 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, see <http://www.gnu.org/licenses/>.
*
*/
#ifndef TILEDARRAY_RANGE_H__INCLUDED
#define TILEDARRAY_RANGE_H__INCLUDED
#include <TiledArray/range_iterator.h>
#include <TiledArray/size_array.h>
#include <functional>
namespace TiledArray {
// Forward declaration of TiledArray components.
class Permutation;
/// Range data of an N-dimensional tensor.
class Range {
public:
typedef Range Range_; ///< This object type
typedef std::size_t size_type; ///< Size type
typedef std::vector<size_type> index; ///< Coordinate index type
typedef index index_type; ///< Coordinate index type, to conform Tensor Working Group spec
typedef detail::SizeArray<size_type> size_array; ///< Size array type
typedef index extent_type; ///< Range extent type, to conform Tensor Working Group spec
typedef std::size_t ordinal_type; ///< Ordinal type, to conform Tensor Working Group spec
typedef detail::RangeIterator<index, Range_> const_iterator; ///< Coordinate iterator
friend class detail::RangeIterator<index, Range_>;
private:
struct Enabler {};
/// Initialize range arrays
/// Use \c buffer to set the buffers for range arrays.
/// \param buffer The buffer that will holds \c 4*n elements
/// \param n The size of each of the range arrays
/// \note If the range arrays reference a valid buffer, then calling this
/// function will cause a memory leak.
void init_arrays(size_type* const buffer, const size_type n) {
start_.set(buffer, n);
finish_.set(start_.end(), n);
size_.set(finish_.end(), n);
weight_.set(size_.end(), n);
}
/// Allocate and initialize range arrays
/// \param n The size of each of the range arrays
/// \throw std::bad_alloc When memory allocation fails
void alloc_arrays(const size_type n) { init_arrays(new size_type[n << 2], n); }
/// Reallocate and reinitialize range arrays
/// If <tt>dim() != n</tt>, then a new buffer is allocated and it is used to
/// reinitialize the range arrays. If \c n is zero, the range arrays are set
/// to zero sized arrays.
/// deallocated and the range arrays are set to zero size arrays.
/// \param n The new size for the range arrays
void realloc_arrays(const size_type n) {
if(dim() != n) {
delete_arrays();
size_type* const buffer = (n > 0ul ? new size_type[n << 2] : NULL);
init_arrays(buffer, n);
}
}
/// delete array memory
/// \throw nothing
void delete_arrays() { delete [] start_.data(); }
template <typename Index>
void compute_range_data(const size_type n, const Index& start, const Index& finish) {
// Set the volume seed
volume_ = 1ul;
// Compute range data
for(int i = n - 1; i >= 0; --i) {
TA_ASSERT(start[i] < finish[i]);
start_[i] = start[i];
finish_[i] = finish[i];
size_[i] = finish[i] - start[i];
weight_[i] = volume_;
volume_ *= size_[i];
}
}
template <typename Index>
void compute_range_data(const size_type n, const Index& size) {
// Set the volume seed
volume_ = 1ul;
// Compute range data
for(int i = n - 1; i >= 0; --i) {
TA_ASSERT(size[i] > 0ul);
start_[i] = 0ul;
finish_[i] = size_[i] = size[i];
weight_[i] = volume_;
volume_ *= size[i];
}
}
public:
/// Default constructor
/// Construct a range with size and dimensions equal to zero.
Range() :
start_(), finish_(), size_(), weight_(), volume_(0ul)
{ }
/// Constructor defined by an upper and lower bound
/// \tparam Index An array type
/// \param start The lower bound of the N-dimensional range
/// \param finish The upper bound of the N-dimensional range
/// \throw TiledArray::Exception When the size of \c start is not equal to
/// that of \c finish.
/// \throw TiledArray::Exception When start[i] >= finish[i]
/// \throw std::bad_alloc When memory allocation fails.
template <typename Index>
Range(const Index& start, const Index& finish,
typename std::enable_if<! std::is_integral<Index>::value, Enabler>::type = Enabler()) :
start_(), finish_(), size_(), weight_(), volume_(0ul)
{
const size_type n = detail::size(start);
TA_ASSERT(n == detail::size(finish));
if(n > 0ul) {
// Initialize array memory
alloc_arrays(n);
compute_range_data(n, start, finish);
}
}
/// Range constructor from size array
/// \tparam SizeArray An array type
/// \param size An array with the size of each dimension
/// \throw std::bad_alloc When memory allocation fails.
template <typename SizeArray>
explicit Range(const SizeArray& size) :
start_(), finish_(), size_(), weight_(), volume_(0ul)
{
const size_type n = detail::size(size);
if(n) {
// Initialize array memory
alloc_arrays(n);
compute_range_data(n, size);
}
}
/// Range constructor from a pack of sizes for each dimension
/// \tparam Sizes A pack of unsigned integers
/// \param size0 The size of dimensions 0
/// \param sizes A pack of sizes for dimensions 1+
/// \throw std::bad_alloc When memory allocation fails.
template<typename... Sizes>
explicit Range(const size_type& size0, const Sizes&... sizes) :
start_(), finish_(), size_(), weight_(), volume_(0ul)
{
const size_type n = sizeof...(sizes) + 1;
// Initialize array memory
alloc_arrays(n);
size_type range_extent[n] = {size0, static_cast<size_type>(sizes)...};
compute_range_data(n, range_extent);
}
/// Copy Constructor
/// \param other The range to be copied
/// \throw std::bad_alloc When memory allocation fails.
Range(const Range_& other) :
start_(), finish_(), size_(), weight_(), volume_(other.volume_)
{
const size_type n = other.dim();
if(n > 0ul) {
alloc_arrays(n);
memcpy(start_.data(), other.start_.begin(), (sizeof(size_type) << 2) * n);
}
}
/// Permuting copy constructor
/// \param perm The permutation applied to other
/// \param other The range to be permuted and copied
/// \throw std::bad_alloc When memory allocation fails.
Range(const Permutation& perm, const Range_& other) :
start_(), finish_(), size_(), weight_(), volume_(0ul)
{
TA_ASSERT(perm.dim() == other.dim());
const size_type n = other.dim();
if(n > 0ul) {
alloc_arrays(n);
if(perm) {
const size_type* restrict const other_start = other.start().data();
const size_type* restrict const other_finish = other.finish().data();
const size_type* restrict const other_size = other.size().data();
size_type* restrict const start = start_.data();
size_type* restrict const finish = finish_.data();
size_type* restrict const size = size_.data();
// Copy the permuted start, finish, and size to this range.
for(size_type i = 0ul; i < n; ++i) {
const size_type pi = perm[i];
start[pi] = other_start[i];
finish[pi] = other_finish[i];
size[pi] = other_size[i];
}
// Compute weight and volume
volume_ = 1ul;
size_type* restrict const weight = weight_.data();
for(int i = n - 1; i >= 0; --i) {
weight[i] = volume_;
volume_ *= size[i];
}
} else {
// Simple copy will due.
memcpy(start_.data(), other.start_.data(), (sizeof(size_type) << 2) * n);
volume_ = other.volume_;
}
}
}
/// Destructor
~Range() { delete_arrays(); }
/// Copy assignment operator
/// \param other The range to be copied
/// \return A reference to this object
/// \throw std::bad_alloc When memory allocation fails.
Range_& operator=(const Range_& other) {
const size_type n = other.dim();
realloc_arrays(n);
memcpy(start_.data(), other.start_.begin(), (sizeof(size_type) << 2) * n);
volume_ = other.volume();
return *this;
}
/// Dimension accessor
/// \return The number of dimensions of this range
/// \throw nothing
unsigned int dim() const { return size_.size(); }
/// Provided to conform to the Tensor Working Group specification
/// \return The rank (number of dimensions) of this range
/// \throw nothing
unsigned int rank() const { return dim(); }
/// Range start coordinate accessor
/// \return A \c size_array that contains the lower bound of this range
/// \throw nothing
const size_array& start() const { return start_; }
/// Range lower bound accessor
/// Provided to conform to the Tensor Working Group specification
/// \return A \c size_array that contains the lower bound of this range
/// \throw nothing
const size_array& lobound() const { return start_; }
/// Range finish coordinate accessor
/// \return A \c size_array that contains the upper bound of this range
/// \throw nothing
const size_array& finish() const { return finish_; }
/// Range upper bound accessor
/// Provided to conform to the Tensor Working Group specification
/// \return A \c size_array that contains the upper bound of this range
/// \throw nothing
const size_array& upbound() const { return finish_; }
/// Range size accessor
/// \return A \c size_array that contains the sizes of each dimension
/// \throw nothing
const size_array& size() const { return size_; }
/// similar to size(), provided to satisfy the requirements of Tensor Working Group specification
/// \return A \c extent_type that contains the extent of each dimension
/// \throw nothing
extent_type extent() const { return extent_type(size_.begin(), size_.end()); }
/// Range weight accessor
/// \return A \c size_array that contains the strides of each dimension
/// \throw nothing
const size_array& weight() const { return weight_; }
/// Range volume accessor
/// \return The total number of elements in the range.
/// \throw nothing
size_type volume() const { return volume_; }
/// alias to volume() to conform to the Tensor Working Group specification
/// \return The total number of elements in the range.
/// \throw nothing
size_type area() const { return volume(); }
/// Index iterator factory
/// The iterator dereferences to an index. The order of iteration matches
/// the data layout of a dense tensor.
/// \return An iterator that holds the start element index of a tensor
/// \throw nothing
const_iterator begin() const { return const_iterator(start_, this); }
/// Index iterator factory
/// The iterator dereferences to an index. The order of iteration matches
/// the data layout of a dense tensor.
/// \return An iterator that holds the finish element index of a tensor
/// \throw nothing
const_iterator end() const { return const_iterator(finish_, this); }
/// Check the coordinate to make sure it is within the range.
/// \tparam Index The coordinate index array type
/// \param index The coordinate index to check for inclusion in the range
/// \return \c true when \c i \c >= \c start and \c i \c < \c f, otherwise
/// \c false
/// \throw TildedArray::Exception When the dimension of this range is not
/// equal to the size of the index.
template <typename Index>
typename std::enable_if<! std::is_integral<Index>::value, bool>::type
includes(const Index& index) const {
TA_ASSERT(detail::size(index) == dim());
const unsigned int end = dim();
for(unsigned int i = 0ul; i < end; ++i)
if((index[i] < start_[i]) || (index[i] >= finish_[i]))
return false;
return true;
}
/// Check the ordinal index to make sure it is within the range.
/// \param i The ordinal index to check for inclusion in the range
/// \return \c true when \c i \c >= \c 0 and \c i \c < \c volume
/// \throw nothing
template <typename Ordinal>
typename std::enable_if<std::is_integral<Ordinal>::value, bool>::type
includes(Ordinal i) const {
return include_ordinal_(i);
}
private:
template <std::size_t N>
static constexpr bool includes_helper() { return true; }
template <std::size_t N, typename Index1, typename... Index>
typename std::enable_if<std::is_integral<Index1>::value, bool>::type
includes_helper(const Index1& index1, const Index&... index) const {
constexpr std::size_t i = N - sizeof...(Index) - 1;
return (static_cast<size_type>(index1) >= start_[i])
&& (static_cast<size_type>(index1) < finish_[i])
&& includes_helper<N>(index...);
}
public:
template <typename... Index>
typename std::enable_if<(sizeof...(Index) > 1ul), size_type>::type
includes(const Index&... index) const {
TA_ASSERT(sizeof...(Index) == dim());
return includes_helper<sizeof...(Index)>(index...);
}
/// Permute this range
/// \param perm The permutation to be applied to this range
/// \return A reference to this range
/// \throw TildedArray::Exception When the dimension of this range is not
/// equal to the dimension of the permutation.
/// \throw std::bad_alloc When memory allocation fails.
Range_& operator ^=(const Permutation& perm) {
const size_type n = dim();
TA_ASSERT(perm.dim() == n);
if(n > 1ul) {
// Create a permuted copy of start and finish
const size_type* restrict const start =
static_cast<size_type*>(memcpy(new size_type[n << 1], start_.data(), (sizeof(size_type) << 1) * n));
const size_type* restrict const finish = start + n;
size_type* restrict const this_start = start_.data();
size_type* restrict const this_finish = finish_.data();
size_type* restrict const this_size = size_.data();
for(size_type i = 0ul; i < n; ++i) {
const size_type pi = perm[i];
this_start[pi] = start[i];
this_finish[pi] = finish[i];
this_size[pi] = finish[i] - start[i];
}
volume_ = 1ul;
size_type* restrict const this_weight = weight_.data();
for(int i = n - 1; i >= 0; --i) {
this_weight[i] = volume_;
volume_ *= this_size[i];
}
// Cleanup old memory.
delete [] start;
}
return *this;
}
/// Resize range to a new upper and lower bound
/// \tparam Index An array type
/// \param start The lower bounds of the N-dimensional range
/// \param finish The upper bound of the N-dimensional range
/// \throw TiledArray::Exception When the size of \c start is not equal to
/// that of \c finish.
/// \throw TiledArray::Exception When start[i] >= finish[i]
/// \throw std::bad_alloc When memory allocation fails.
template <typename Index>
Range_& resize(const Index& start, const Index& finish) {
const size_type n = detail::size(start);
TA_ASSERT(n == detail::size(finish));
// Reallocate memory for range arrays
realloc_arrays(n);
if(n > 0ul)
compute_range_data(n, start, finish);
else
volume_ = 0ul;
return *this;
}
/// calculate the ordinal index of \c i
/// This function is just a pass-through so the user can call \c ord() on
/// a template parameter that can be a coordinate index or an integral.
/// \param index Ordinal index
/// \return \c index (unchanged)
/// \throw When \c index is not included in this range
size_type ord(const size_type index) const {
TA_ASSERT(includes(index));
return index;
}
/// calculate the ordinal index of \c i
/// Convert a coordinate index to an ordinal index.
/// \tparam Index A coordinate index type (array type)
/// \param index The index to be converted to an ordinal index
/// \return The ordinal index of \c index
/// \throw When \c index is not included in this range.
template <typename Index>
typename std::enable_if<! std::is_integral<Index>::value, size_type>::type
ord(const Index& index) const {
TA_ASSERT(detail::size(index) == dim());
TA_ASSERT(includes(index));
size_type o = 0;
const unsigned int end = dim();
for(unsigned int i = 0ul; i < end; ++i)
o += (index[i] - start_[i]) * weight_[i];
return o;
}
private:
template <std::size_t N>
static constexpr size_type ord_helper() { return 0ul; }
template <std::size_t N, typename Index1, typename... Index>
typename std::enable_if<std::is_integral<Index1>::value, size_type>::type
ord_helper(const Index1& index1, const Index&... index) const {
constexpr std::size_t i = N - sizeof...(Index) - 1;
return (index1 - start_[i]) * weight_[i] + ord_helper<N>(index...);
}
public:
template <typename... Index>
typename std::enable_if<(sizeof...(Index) > 1ul), size_type>::type
ord(const Index&... index) const {
TA_ASSERT(sizeof...(Index) == dim());
return ord_helper<sizeof...(Index)>(index...);
}
/// alias to ord<Index>(), to conform with the Tensor Working Group spec \sa ord()
template <typename... Index>
size_type ordinal(const Index&... index) const { return ord(index...); }
/// calculate the coordinate index of the ordinal index, \c index.
/// Convert an ordinal index to a coordinate index.
/// \param index Ordinal index
/// \return The index of the ordinal index
/// \throw TiledArray::Exception When \c index is not included in this range
/// \throw std::bad_alloc When memory allocation fails
index idx(size_type index) const {
// Check that index is contained by range.
TA_ASSERT(includes(index));
const unsigned int end = dim();
// Construct result coordinate index object and allocate its memory.
Range_::index result(end, 0);
// Get pointers to the data
size_type * restrict const result_data = & result.front();
size_type const * restrict const weight = weight_.data();
size_type const * restrict const start = start_.data();
// Compute the coordinate index of o in range.
for(unsigned int i = 0u; i < end; ++i) {
const size_type weight_i = weight[i];
const size_type start_i = start[i];
// Compute result index element i
const size_type result_i = (index / weight_i) + start_i;
index %= weight_i;
// Store result
result_data[i] = result_i;
}
return result;
}
/// calculate the index of \c i
/// This function is just a pass-through so the user can call \c idx() on
/// a template parameter that can be an index or a size_type.
/// \param i The index
/// \return \c i (unchanged)
template <typename Index>
typename std::enable_if<! std::is_integral<Index>::value, const index&>::type
idx(const Index& i) const {
TA_ASSERT(includes(i));
return i;
}
template <typename Archive>
typename std::enable_if<madness::archive::is_input_archive<Archive>::value>::type
serialize(const Archive& ar) {
// Get number of dimensions
size_type n = 0ul;
ar & n;
// Get range data
realloc_arrays(n);
ar & madness::archive::wrap(start_.data(), n << 2) & volume_;
}
template <typename Archive>
typename std::enable_if<madness::archive::is_output_archive<Archive>::value>::type
serialize(const Archive& ar) const {
const size_type n = dim();
ar & n & madness::archive::wrap(start_.data(), n << 2) & volume_;
}
void swap(Range_& other) {
// Get temp data
size_type* temp_start = start_.data();
const size_type n = start_.size();
// Swap data
init_arrays(other.start_.data(), other.start_.size());
other.init_arrays(temp_start, n);
std::swap(volume_, other.volume_);
}
private:
/// Check that a signed integral value is include in this range
/// \tparam Index A signed integral type
/// \param i The ordinal index to check
/// \return \c true when <tt>i >= 0</tt> and <tt>i < volume_</tt>, otherwise
/// \c false.
template <typename Index>
typename std::enable_if<std::is_signed<Index>::value, bool>::type
include_ordinal_(Index i) const { return (i >= Index(0)) && (i < Index(volume_)); }
/// Check that an unsigned integral value is include in this range
/// \tparam Index An unsigned integral type
/// \param i The ordinal index to check
/// \return \c true when <tt>i < volume_</tt>, otherwise \c false.
template <typename Index>
typename std::enable_if<! std::is_signed<Index>::value, bool>::type
include_ordinal_(Index i) const { return i < volume_; }
/// Increment the coordinate index \c i in this range
/// \param[in,out] i The coordinate index to be incremented
/// \throw TiledArray::Exception When the dimension of i is not equal to
/// that of this range
/// \throw TiledArray::Exception When \c i or \c i+n is outside this range
void increment(index& i) const {
TA_ASSERT(includes(i));
for(int d = int(dim()) - 1; d >= 0; --d) {
// increment coordinate
++i[d];
// break if done
if(i[d] < finish_[d])
return;
// Reset current index to start value.
i[d] = start_[d];
}
// if the current location was set to start then it was at the end and
// needs to be reset to equal finish.
std::copy(finish_.begin(), finish_.end(), i.begin());
}
/// Advance the coordinate index \c i by \c n in this range
/// \param[in,out] i The coordinate index to be advanced
/// \param n The distance to advance \c i
/// \throw TiledArray::Exception When the dimension of i is not equal to
/// that of this range
/// \throw TiledArray::Exception When \c i or \c i+n is outside this range
void advance(index& i, std::ptrdiff_t n) const {
TA_ASSERT(includes(i));
const size_type o = ord(i) + n;
TA_ASSERT(includes(o));
i = idx(o);
}
/// Compute the distance between the coordinate indices \c first and \c last
/// \param first The starting position in the range
/// \param last The ending position in the range
/// \return The difference between first and last, in terms of range positions
/// \throw TiledArray::Exception When the dimension of \c first or \c last
/// is not equal to that of this range
/// \throw TiledArray::Exception When \c first or \c last is outside this range
std::ptrdiff_t distance_to(const index& first, const index& last) const {
TA_ASSERT(includes(first));
TA_ASSERT(includes(last));
return ord(last) - ord(first);
}
size_array start_; ///< Tile origin
size_array finish_; ///< Tile upper bound
size_array size_; ///< Dimension sizes
size_array weight_; ///< Dimension weights (strides)
size_type volume_; ///< Total number of elements
}; // class Range
/// Exchange the values of the give two ranges.
inline void swap(Range& r0, Range& r1) { // no throw
r0.swap(r1);
}
/// Create a permuted range
/// \param perm The permutation to be applied to the range
/// \param r The range to be permuted
/// \return A permuted copy of \c r.
inline Range operator ^(const Permutation& perm, const Range& r) {
return Range(perm, r);
}
/// No permutation function
/// This function is used to allow generic code for \c Permutation or
/// \c NoPermutation code.
/// \param r The range not to be permuted
/// \return A const reference to \c r
inline const Range& operator ^(const detail::NoPermutation&, const Range& r) {
return r;
}
/// Range equality comparison
/// \param r1 The first range to be compared
/// \param r2 The second range to be compared
/// \return \c true when \c r1 represents the same range as \c r2, otherwise
/// \c false.
inline bool operator ==(const Range& r1, const Range& r2) {
return ((r1.start() == r2.start()) && (r1.finish() == r2.finish()));
}
/// Range inequality comparison
/// \param r1 The first range to be compared
/// \param r2 The second range to be compared
/// \return \c true when \c r1 does not represent the same range as \c r2,
/// otherwise \c false.
inline bool operator !=(const Range& r1, const Range& r2) {
return ! operator ==(r1, r2);
}
/// Range output operator
/// \param os The output stream that will be used to print \c r
/// \param r The range to be printed
/// \return A reference to the output stream
inline std::ostream& operator<<(std::ostream& os, const Range& r) {
os << "[ ";
detail::print_array(os, r.start());
os << ", ";
detail::print_array(os, r.finish());
os << " )";
return os;
}
} // namespace TiledArray
#endif // TILEDARRAY_RANGE_H__INCLUDED
|