LSST Applications 27.0.0,g0265f82a02+469cd937ee,g02d81e74bb+21ad69e7e1,g1470d8bcf6+cbe83ee85a,g2079a07aa2+e67c6346a6,g212a7c68fe+04a9158687,g2305ad1205+94392ce272,g295015adf3+81dd352a9d,g2bbee38e9b+469cd937ee,g337abbeb29+469cd937ee,g3939d97d7f+72a9f7b576,g487adcacf7+71499e7cba,g50ff169b8f+5929b3527e,g52b1c1532d+a6fc98d2e7,g591dd9f2cf+df404f777f,g5a732f18d5+be83d3ecdb,g64a986408d+21ad69e7e1,g858d7b2824+21ad69e7e1,g8a8a8dda67+a6fc98d2e7,g99cad8db69+f62e5b0af5,g9ddcbc5298+d4bad12328,ga1e77700b3+9c366c4306,ga8c6da7877+71e4819109,gb0e22166c9+25ba2f69a1,gb6a65358fc+469cd937ee,gbb8dafda3b+69d3c0e320,gc07e1c2157+a98bf949bb,gc120e1dc64+615ec43309,gc28159a63d+469cd937ee,gcf0d15dbbd+72a9f7b576,gdaeeff99f8+a38ce5ea23,ge6526c86ff+3a7c1ac5f1,ge79ae78c31+469cd937ee,gee10cc3b42+a6fc98d2e7,gf1cff7945b+21ad69e7e1,gfbcc870c63+9a11dc8c8f
LSST Data Management Base Package
|
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. | |
constexpr iterator | begin () const noexcept |
Return an iterator to the start of the range. | |
constexpr iterator | cbegin () const noexcept |
Return an iterator to the start of the range. | |
constexpr iterator | end () const noexcept |
Return an iterator to one past the end of the range. | |
constexpr iterator | cend () const noexcept |
Return an iterator to one past the end of the range. | |
constexpr std::size_t | size () const noexcept |
Return the number of elements in the flattened expansion. | |
constexpr bool | empty () const noexcept |
Return true if the number of elements in the flattened expansion is zero. | |
constexpr bool | operator== (PackedIndexRange const &other) const noexcept |
Equality comparison. | |
constexpr bool | operator!= (PackedIndexRange const &other) const noexcept |
Inequality comparison. | |
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. | |
static constexpr std::size_t | computeSize (std::size_t order) noexcept |
Return the flattened size of an expansion with the given maximum order (inclusive). | |
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. | |
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.
|
inlineconstexprnoexcept |
Construct from begin and end iterators.
Definition at line 275 of file PackedIndex.h.
|
inlineconstexprnoexcept |
Return an iterator to the start of the range.
Definition at line 281 of file PackedIndex.h.
|
inlineconstexprnoexcept |
Return an iterator to the start of the range.
Definition at line 284 of file PackedIndex.h.
|
inlineconstexprnoexcept |
Return an iterator to one past the end of the range.
Definition at line 290 of file PackedIndex.h.
|
inlinestaticconstexprnoexcept |
Return the flattened index for the element with the given x and y orders.
Definition at line 270 of file PackedIndex.h.
|
inlinestaticconstexprnoexcept |
Return the flattened offset to the start of the given order.
Definition at line 260 of file PackedIndex.h.
|
inlinestaticconstexprnoexcept |
Return the flattened size of an expansion with the given maximum order (inclusive).
Definition at line 265 of file PackedIndex.h.
|
inlineconstexprnoexcept |
Return true if the number of elements in the flattened expansion is zero.
Definition at line 296 of file PackedIndex.h.
|
inlineconstexprnoexcept |
Return an iterator to one past the end of the range.
Definition at line 287 of file PackedIndex.h.
|
inlineconstexprnoexcept |
Inequality comparison.
Definition at line 304 of file PackedIndex.h.
|
inlineconstexprnoexcept |
Equality comparison.
Definition at line 299 of file PackedIndex.h.
|
inlineconstexprnoexcept |
Return the number of elements in the flattened expansion.
Definition at line 293 of file PackedIndex.h.