LSST Applications g0000d66e7c+4a51730b0a,g0485b4d2cb+be65c9c1d7,g0fba68d861+eb108e5914,g1ec0fe41b4+3ea9d11450,g1fd858c14a+41d169aaf2,g2440f9efcc+8c5ae1fdc5,g35bb328faa+8c5ae1fdc5,g470b45d79c+bb7d8e732a,g4d2262a081+972b13e66a,g53246c7159+8c5ae1fdc5,g55585698de+c657de43f9,g56a49b3a55+7eddd92ad8,g60b5630c4e+c657de43f9,g67b6fd64d1+97cc007aa2,g78460c75b0+7e33a9eb6d,g786e29fd12+668abc6043,g7ac00fbb6c+088e1a4fa9,g8352419a5c+8c5ae1fdc5,g8852436030+3f3bba821f,g89139ef638+97cc007aa2,g94187f82dc+c657de43f9,g989de1cb63+97cc007aa2,g9d31334357+c657de43f9,g9f33ca652e+06d39d8afb,ga815be3f0b+8e7c4d07ad,gabe3b4be73+8856018cbb,gabf8522325+977d9fabaf,gb1101e3267+12c96a40b1,gb89ab40317+97cc007aa2,gc91f06edcd+2ffb87f22b,gcf25f946ba+3f3bba821f,gd6cbbdb0b4+1cc2750d2e,gde0f65d7ad+4ad7118dbf,ge278dab8ac+6b863515ed,ge410e46f29+97cc007aa2,gf35d7ec915+97dd712d81,gf5e32f922b+8c5ae1fdc5,gf67bdafdda+97cc007aa2,w.2025.19
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.