LSST Applications g04a91732dc+947087dcbc,g07dc498a13+80b84b0d75,g0fba68d861+a26a980d89,g1409bbee79+80b84b0d75,g1a7e361dbc+80b84b0d75,g1fd858c14a+03b042d3d6,g21d47ad084+632b13585d,g35bb328faa+fcb1d3bbc8,g42c1b31a95+a1301e4c20,g4e0f332c67+5d362be553,g51f2318141+1948851dd1,g53246c7159+fcb1d3bbc8,g60b5630c4e+fd725c9d16,g78460c75b0+2f9a1b4bcd,g786e29fd12+cf7ec2a62a,g7b71ed6315+fcb1d3bbc8,g7c8978a71e+355b33a9a3,g8852436030+7873239873,g89139ef638+80b84b0d75,g8d6b6b353c+fd725c9d16,g9125e01d80+fcb1d3bbc8,g989de1cb63+80b84b0d75,g9f33ca652e+6bac20c5b8,ga9baa6287d+fd725c9d16,ga9e4eb89a6+77c085a8dc,gaaedd4e678+80b84b0d75,gabe3b4be73+1e0a283bba,gb1101e3267+2cbc8cba0c,gb58c049af0+f03b321e39,gb90eeb9370+a6b07a1956,gcf25f946ba+7873239873,gd315a588df+027f18374d,gd6cbbdb0b4+c8606af20c,gd9a9a58781+fcb1d3bbc8,gde0f65d7ad+e67ac685b1,ge278dab8ac+932305ba37,ge82c20c137+76d20ab76d,gf0ff2d8333+fd725c9d16,w.2025.08
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.