LSST Applications g00d0e8bbd7+edbf708997,g03191d30f7+9ce8016dbd,g1955dfad08+0bd186d245,g199a45376c+5137f08352,g1fd858c14a+a888a50aa2,g262e1987ae+45f9aba685,g29ae962dfc+1c7d47a24f,g2cef7863aa+73c82f25e4,g35bb328faa+edbf708997,g3fd5ace14f+eed17d2c67,g47891489e3+6dc8069a4c,g53246c7159+edbf708997,g64539dfbff+c4107e45b5,g67b6fd64d1+6dc8069a4c,g74acd417e5+f452e9c21a,g786e29fd12+af89c03590,g7ae74a0b1c+a25e60b391,g7aefaa3e3d+2025e9ce17,g7cc15d900a+2d158402f9,g87389fa792+a4172ec7da,g89139ef638+6dc8069a4c,g8d4809ba88+c4107e45b5,g8d7436a09f+e96c132b44,g8ea07a8fe4+db21c37724,g98df359435+aae6d409c1,ga2180abaac+edbf708997,gac66b60396+966efe6077,gb632fb1845+88945a90f8,gbaa8f7a6c5+38b34f4976,gbf99507273+edbf708997,gca7fc764a6+6dc8069a4c,gd7ef33dd92+6dc8069a4c,gda68eeecaf+7d1e613a8d,gdab6d2f7ff+f452e9c21a,gdbb4c4dda9+c4107e45b5,ge410e46f29+6dc8069a4c,ge41e95a9f2+c4107e45b5,geaed405ab2+e194be0d2b,w.2025.47
LSST Data Management Base Package
Loading...
Searching...
No Matches
lsst::geom::polynomials::Index2d Struct Reference

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.
 

Detailed Description

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.

Constructor & Destructor Documentation

◆ Index2d() [1/2]

lsst::geom::polynomials::Index2d::Index2d ( )
inlineconstexprnoexcept

Construct an index with zero entries.

Definition at line 72 of file PackedIndex.h.

72: flat(0), nx(0), ny(0) {}
std::size_t nx
Index into the 1-d function for nx.
Definition PackedIndex.h:90
std::size_t ny
Index into the 1-d functoin for ny.
Definition PackedIndex.h:91
std::size_t flat
Index into the flattened 2-d function.
Definition PackedIndex.h:89

◆ Index2d() [2/2]

lsst::geom::polynomials::Index2d::Index2d ( std::size_t flat_,
std::size_t nx_,
std::size_t ny_ )
inlineconstexprnoexcept

Construct with the provided values.

Definition at line 75 of file PackedIndex.h.

75 :
76 flat(flat_), nx(nx_), ny(ny_)
77 {}

Member Function Documentation

◆ operator!=()

bool lsst::geom::polynomials::Index2d::operator!= ( Index2d const & other) const
inlineconstexprnoexcept

Inequality comparison.

Definition at line 85 of file PackedIndex.h.

85 {
86 return !(*this == other);
87 }

◆ operator==()

bool lsst::geom::polynomials::Index2d::operator== ( Index2d const & other) const
inlineconstexprnoexcept

Equality comparison.

Definition at line 80 of file PackedIndex.h.

80 {
81 return flat == other.flat && nx == other.nx && ny == other.ny;
82 }

Member Data Documentation

◆ flat

std::size_t lsst::geom::polynomials::Index2d::flat

Index into the flattened 2-d function.

Definition at line 89 of file PackedIndex.h.

◆ nx

std::size_t lsst::geom::polynomials::Index2d::nx

Index into the 1-d function for nx.

Definition at line 90 of file PackedIndex.h.

◆ ny

std::size_t lsst::geom::polynomials::Index2d::ny

Index into the 1-d functoin for ny.

Definition at line 91 of file PackedIndex.h.


The documentation for this struct was generated from the following file: