LSSTApplications
18.0.0+106,18.0.0+50,19.0.0,19.0.0+1,19.0.0+10,19.0.0+11,19.0.0+13,19.0.0+17,19.0.0+2,19.0.0-1-g20d9b18+6,19.0.0-1-g425ff20,19.0.0-1-g5549ca4,19.0.0-1-g580fafe+6,19.0.0-1-g6fe20d0+1,19.0.0-1-g7011481+9,19.0.0-1-g8c57eb9+6,19.0.0-1-gb5175dc+11,19.0.0-1-gdc0e4a7+9,19.0.0-1-ge272bc4+6,19.0.0-1-ge3aa853,19.0.0-10-g448f008b,19.0.0-12-g6990b2c,19.0.0-2-g0d9f9cd+11,19.0.0-2-g3d9e4fb2+11,19.0.0-2-g5037de4,19.0.0-2-gb96a1c4+3,19.0.0-2-gd955cfd+15,19.0.0-3-g2d13df8,19.0.0-3-g6f3c7dc,19.0.0-4-g725f80e+11,19.0.0-4-ga671dab3b+1,19.0.0-4-gad373c5+3,19.0.0-5-ga2acb9c+2,19.0.0-5-gfe96e6c+2,w.2020.01
LSSTDataManagementBasePackage
|
A specialized iterator range class for PackedIndexIterator, providing size calculation, comparison, and range-based for
support.
More...
#include <PackedIndex.h>
Public Types | |
using | iterator = PackedIndexIterator< packing > |
using | const_iterator = iterator |
using | value_type = typename iterator::value_type |
using | reference = typename iterator::reference |
using | pointer = typename iterator::pointer |
using | difference_type = typename iterator::difference_type |
using | size_type = std::size_t |
Public Member Functions | |
constexpr | PackedIndexRange (iterator first, iterator last) noexcept |
Construct from begin and end iterators. More... | |
constexpr iterator | begin () const noexcept |
Return an iterator to the start of the range. More... | |
constexpr iterator | cbegin () const noexcept |
Return an iterator to the start of the range. More... | |
constexpr iterator | end () const noexcept |
Return an iterator to one past the end of the range. More... | |
constexpr iterator | cend () const noexcept |
Return an iterator to one past the end of the range. More... | |
constexpr std::size_t | size () const noexcept |
Return the number of elements in the flattened expansion. More... | |
constexpr bool | empty () const noexcept |
Return true if the number of elements in the flattened expansion is zero. More... | |
constexpr bool | operator== (PackedIndexRange const &other) const noexcept |
Equality comparison. More... | |
constexpr bool | operator!= (PackedIndexRange const &other) const noexcept |
Inequality comparison. More... | |
Static Public Member Functions | |
static constexpr std::size_t | computeOffset (std::size_t order) noexcept |
Return the flattened offset to the start of the given order. More... | |
static constexpr std::size_t | computeSize (std::size_t order) noexcept |
Return the flattened size of an expansion with the given maximum order (inclusive). More... | |
static constexpr std::size_t | computeIndex (std::size_t nx, std::size_t ny) noexcept |
Return the flattened index for the element with the given x and y orders. More... | |
A specialized iterator range class for PackedIndexIterator, providing size calculation, comparison, and range-based for
support.
Definition at line 248 of file PackedIndex.h.
using lsst::geom::polynomials::PackedIndexRange< packing >::const_iterator = iterator |
Definition at line 252 of file PackedIndex.h.
using lsst::geom::polynomials::PackedIndexRange< packing >::difference_type = typename iterator::difference_type |
Definition at line 256 of file PackedIndex.h.
using lsst::geom::polynomials::PackedIndexRange< packing >::iterator = PackedIndexIterator<packing> |
Definition at line 251 of file PackedIndex.h.
using lsst::geom::polynomials::PackedIndexRange< packing >::pointer = typename iterator::pointer |
Definition at line 255 of file PackedIndex.h.
using lsst::geom::polynomials::PackedIndexRange< packing >::reference = typename iterator::reference |
Definition at line 254 of file PackedIndex.h.
using lsst::geom::polynomials::PackedIndexRange< packing >::size_type = std::size_t |
Definition at line 257 of file PackedIndex.h.
using lsst::geom::polynomials::PackedIndexRange< packing >::value_type = typename iterator::value_type |
Definition at line 253 of file PackedIndex.h.
|
inlinenoexcept |
|
inlinenoexcept |
Return an iterator to the start of the range.
Definition at line 281 of file PackedIndex.h.
|
inlinenoexcept |
Return an iterator to the start of the range.
Definition at line 284 of file PackedIndex.h.
|
inlinenoexcept |
Return an iterator to one past the end of the range.
Definition at line 290 of file PackedIndex.h.
|
inlinestaticnoexcept |
Return the flattened index for the element with the given x and y orders.
Definition at line 270 of file PackedIndex.h.
|
inlinestaticnoexcept |
Return the flattened offset to the start of the given order.
Definition at line 260 of file PackedIndex.h.
|
inlinestaticnoexcept |
Return the flattened size of an expansion with the given maximum order (inclusive).
Definition at line 265 of file PackedIndex.h.
|
inlinenoexcept |
Return true if the number of elements in the flattened expansion is zero.
Definition at line 296 of file PackedIndex.h.
|
inlinenoexcept |
Return an iterator to one past the end of the range.
Definition at line 287 of file PackedIndex.h.
|
inlinenoexcept |
Inequality comparison.
Definition at line 304 of file PackedIndex.h.
|
inlinenoexcept |
|
inlinenoexcept |
Return the number of elements in the flattened expansion.
Definition at line 293 of file PackedIndex.h.