LSST Applications g0265f82a02+0e5473021a,g02d81e74bb+bd2ed33bd6,g1470d8bcf6+c6d6eb38e2,g14a832a312+9d12ad093c,g2079a07aa2+86d27d4dc4,g2305ad1205+91a32aca49,g295015adf3+88246b6574,g2bbee38e9b+0e5473021a,g337abbeb29+0e5473021a,g3ddfee87b4+c34e8be1fa,g487adcacf7+85dcfbcc36,g50ff169b8f+96c6868917,g52b1c1532d+585e252eca,g591dd9f2cf+ea1711114f,g5a732f18d5+53520f316c,g64a986408d+bd2ed33bd6,g858d7b2824+bd2ed33bd6,g8a8a8dda67+585e252eca,g99cad8db69+016a06b37a,g9ddcbc5298+9a081db1e4,ga1e77700b3+15fc3df1f7,ga8c6da7877+ef4e3a5875,gb0e22166c9+60f28cb32d,gb6a65358fc+0e5473021a,gba4ed39666+c2a2e4ac27,gbb8dafda3b+b6d7b42999,gc120e1dc64+f745648b3a,gc28159a63d+0e5473021a,gcf0d15dbbd+c34e8be1fa,gdaeeff99f8+f9a426f77a,ge6526c86ff+508d0e0a30,ge79ae78c31+0e5473021a,gee10cc3b42+585e252eca,gf18bd8381d+8d59551888,gf1cff7945b+bd2ed33bd6,w.2024.16
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.