|
LSST Applications g00274db5b6+edbf708997,g00d0e8bbd7+edbf708997,g199a45376c+5137f08352,g1fd858c14a+1d4b6db739,g262e1987ae+f4d9505c4f,g29ae962dfc+7156fb1a53,g2cef7863aa+73c82f25e4,g35bb328faa+edbf708997,g3e17d7035e+5b3adc59f5,g3fd5ace14f+852fa6fbcb,g47891489e3+6dc8069a4c,g53246c7159+edbf708997,g64539dfbff+9f17e571f4,g67b6fd64d1+6dc8069a4c,g74acd417e5+ae494d68d9,g786e29fd12+af89c03590,g7ae74a0b1c+a25e60b391,g7aefaa3e3d+536efcc10a,g7cc15d900a+d121454f8d,g87389fa792+a4172ec7da,g89139ef638+6dc8069a4c,g8d7436a09f+28c28d8d6d,g8ea07a8fe4+db21c37724,g92c671f44c+9f17e571f4,g98df359435+b2e6376b13,g99af87f6a8+b0f4ad7b8d,gac66b60396+966efe6077,gb88ae4c679+7dec8f19df,gbaa8f7a6c5+38b34f4976,gbf99507273+edbf708997,gc24b5d6ed1+9f17e571f4,gca7fc764a6+6dc8069a4c,gcc769fe2a4+97d0256649,gd7ef33dd92+6dc8069a4c,gdab6d2f7ff+ae494d68d9,gdbb4c4dda9+9f17e571f4,ge410e46f29+6dc8069a4c,geaed405ab2+e194be0d2b,w.2025.47
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.