LSST Applications g013ef56533+d2224463a4,g199a45376c+0ba108daf9,g19c4beb06c+9f335b2115,g1fd858c14a+2459ca3e43,g210f2d0738+2d3d333a78,g262e1987ae+abbb004f04,g2825c19fe3+eedc38578d,g29ae962dfc+0cb55f06ef,g2cef7863aa+aef1011c0b,g35bb328faa+8c5ae1fdc5,g3fd5ace14f+19c3a54948,g47891489e3+501a489530,g4cdb532a89+a047e97985,g511e8cfd20+ce1f47b6d6,g53246c7159+8c5ae1fdc5,g54cd7ddccb+890c8e1e5d,g5fd55ab2c7+951cc3f256,g64539dfbff+2d3d333a78,g67b6fd64d1+501a489530,g67fd3c3899+2d3d333a78,g74acd417e5+0ea5dee12c,g786e29fd12+668abc6043,g87389fa792+8856018cbb,g89139ef638+501a489530,g8d7436a09f+5ea4c44d25,g8ea07a8fe4+81eaaadc04,g90f42f885a+34c0557caf,g9486f8a5af+165c016931,g97be763408+d5e351dcc8,gbf99507273+8c5ae1fdc5,gc2a301910b+2d3d333a78,gca7fc764a6+501a489530,gce8aa8abaa+8c5ae1fdc5,gd7ef33dd92+501a489530,gdab6d2f7ff+0ea5dee12c,ge410e46f29+501a489530,geaed405ab2+e3b4b2a692,gf9a733ac38+8c5ae1fdc5,w.2025.41
LSST Data Management Base Package
|
A custom tuple that relates the indices of two 1-d functions for x and y to the flattened index for the 2-d function they form. More...
#include <PackedIndex.h>
Public Member Functions | |
constexpr | Index2d () noexcept |
Construct an index with zero entries. | |
constexpr | Index2d (std::size_t flat_, std::size_t nx_, std::size_t ny_) noexcept |
Construct with the provided values. | |
constexpr bool | operator== (Index2d const &other) const noexcept |
Equality comparison. | |
constexpr bool | operator!= (Index2d const &other) const noexcept |
Inequality comparison. | |
Public Attributes | |
std::size_t | flat |
Index into the flattened 2-d function. | |
std::size_t | nx |
Index into the 1-d function for nx. | |
std::size_t | ny |
Index into the 1-d functoin for ny. | |
A custom tuple that relates the indices of two 1-d functions for x and y to the flattened index for the 2-d function they form.
The packing algorithm is not specified by Index2d itself; it is intended to be a common data structure for other classes that define possibly different algorithms (e.g. PackedIndexIterator).
Definition at line 69 of file PackedIndex.h.
|
inlineconstexprnoexcept |
Construct an index with zero entries.
Definition at line 72 of file PackedIndex.h.
|
inlineconstexprnoexcept |
Construct with the provided values.
Definition at line 75 of file PackedIndex.h.
|
inlineconstexprnoexcept |
Inequality comparison.
Definition at line 85 of file PackedIndex.h.
|
inlineconstexprnoexcept |
Equality comparison.
Definition at line 80 of file PackedIndex.h.
std::size_t lsst::geom::polynomials::Index2d::flat |
Index into the flattened 2-d function.
Definition at line 89 of file PackedIndex.h.
std::size_t lsst::geom::polynomials::Index2d::nx |
Index into the 1-d function for nx.
Definition at line 90 of file PackedIndex.h.
std::size_t lsst::geom::polynomials::Index2d::ny |
Index into the 1-d functoin for ny.
Definition at line 91 of file PackedIndex.h.