LSST Applications g063fba187b+cac8b7c890,g0f08755f38+6aee506743,g1653933729+a8ce1bb630,g168dd56ebc+a8ce1bb630,g1a2382251a+b4475c5878,g1dcb35cd9c+8f9bc1652e,g20f6ffc8e0+6aee506743,g217e2c1bcf+73dee94bd0,g28da252d5a+1f19c529b9,g2bbee38e9b+3f2625acfc,g2bc492864f+3f2625acfc,g3156d2b45e+6e55a43351,g32e5bea42b+1bb94961c2,g347aa1857d+3f2625acfc,g35bb328faa+a8ce1bb630,g3a166c0a6a+3f2625acfc,g3e281a1b8c+c5dd892a6c,g3e8969e208+a8ce1bb630,g414038480c+5927e1bc1e,g41af890bb2+8a9e676b2a,g7af13505b9+809c143d88,g80478fca09+6ef8b1810f,g82479be7b0+f568feb641,g858d7b2824+6aee506743,g89c8672015+f4add4ffd5,g9125e01d80+a8ce1bb630,ga5288a1d22+2903d499ea,gb58c049af0+d64f4d3760,gc28159a63d+3f2625acfc,gcab2d0539d+b12535109e,gcf0d15dbbd+46a3f46ba9,gda6a2b7d83+46a3f46ba9,gdaeeff99f8+1711a396fd,ge79ae78c31+3f2625acfc,gef2f8181fd+0a71e47438,gf0baf85859+c1f95f4921,gfa517265be+6aee506743,gfa999e8aa5+17cd334064,w.2024.51
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.