LSST Applications g04e9c324dd+8c5ae1fdc5,g134cb467dc+b203dec576,g18429d2f64+358861cd2c,g199a45376c+0ba108daf9,g1fd858c14a+dd066899e3,g262e1987ae+ebfced1d55,g29ae962dfc+72fd90588e,g2cef7863aa+aef1011c0b,g35bb328faa+8c5ae1fdc5,g3fd5ace14f+b668f15bc5,g4595892280+3897dae354,g47891489e3+abcf9c3559,g4d44eb3520+fb4ddce128,g53246c7159+8c5ae1fdc5,g67b6fd64d1+abcf9c3559,g67fd3c3899+1f72b5a9f7,g74acd417e5+cb6b47f07b,g786e29fd12+668abc6043,g87389fa792+8856018cbb,g89139ef638+abcf9c3559,g8d7436a09f+bcf525d20c,g8ea07a8fe4+9f5ccc88ac,g90f42f885a+6054cc57f1,g97be763408+06f794da49,g9dd6db0277+1f72b5a9f7,ga681d05dcb+7e36ad54cd,gabf8522325+735880ea63,gac2eed3f23+abcf9c3559,gb89ab40317+abcf9c3559,gbf99507273+8c5ae1fdc5,gd8ff7fe66e+1f72b5a9f7,gdab6d2f7ff+cb6b47f07b,gdc713202bf+1f72b5a9f7,gdfd2d52018+8225f2b331,ge365c994fd+375fc21c71,ge410e46f29+abcf9c3559,geaed405ab2+562b3308c0,gf9a733ac38+8c5ae1fdc5,w.2025.35
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: