LSST Applications g00d0e8bbd7+8c5ae1fdc5,g013ef56533+603670b062,g083dd6704c+2e189452a7,g199a45376c+0ba108daf9,g1c5cce2383+bc9f6103a4,g1fd858c14a+cd69ed4fc1,g210f2d0738+c4742f2e9e,g262e1987ae+612fa42d85,g29ae962dfc+83d129e820,g2cef7863aa+aef1011c0b,g35bb328faa+8c5ae1fdc5,g3fd5ace14f+5eaa884f2a,g47891489e3+e32160a944,g53246c7159+8c5ae1fdc5,g5b326b94bb+dcc56af22d,g64539dfbff+c4742f2e9e,g67b6fd64d1+e32160a944,g74acd417e5+c122e1277d,g786e29fd12+668abc6043,g87389fa792+8856018cbb,g88cb488625+47d24e4084,g89139ef638+e32160a944,g8d7436a09f+d14b4ff40a,g8ea07a8fe4+b212507b11,g90f42f885a+e1755607f3,g97be763408+34be90ab8c,g98df359435+ec1fa61bf1,ga2180abaac+8c5ae1fdc5,ga9e74d7ce9+43ac651df0,gbf99507273+8c5ae1fdc5,gc2a301910b+c4742f2e9e,gca7fc764a6+e32160a944,gd7ef33dd92+e32160a944,gdab6d2f7ff+c122e1277d,gdb1e2cdc75+1b18322db8,ge410e46f29+e32160a944,ge41e95a9f2+c4742f2e9e,geaed405ab2+0d91c11c6d,w.2025.44
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: