LSST Applications 24.1.6,g063fba187b+56b85ce14a,g0f08755f38+df8a265115,g12f32b3c4e+891a09f10d,g1524ad2192+7a5d7b3fbd,g1653933729+a8ce1bb630,g168dd56ebc+a8ce1bb630,g28da252d5a+07cb1400be,g2bbee38e9b+ae03bbfc84,g2bc492864f+ae03bbfc84,g3156d2b45e+6e55a43351,g347aa1857d+ae03bbfc84,g35bb328faa+a8ce1bb630,g3a166c0a6a+ae03bbfc84,g3e281a1b8c+c5dd892a6c,g414038480c+6b9177ef31,g41af890bb2+8f257c4c0b,g781aacb6e4+a8ce1bb630,g7af13505b9+7137b3b17d,g80478fca09+6df6903293,g82479be7b0+091ce1d07f,g858d7b2824+df8a265115,g89c8672015+f4add4ffd5,g9125e01d80+a8ce1bb630,g9726552aa6+414189b318,ga5288a1d22+4a2bca08d7,gacef1a1666+c9a8ff65f4,gb58c049af0+d64f4d3760,gbcfae0f0a0+de1d42d831,gc28159a63d+ae03bbfc84,gcf0d15dbbd+72117bf34e,gda6a2b7d83+72117bf34e,gdaeeff99f8+1711a396fd,ge500cccec5+c8c9c9af63,ge79ae78c31+ae03bbfc84,gf0baf85859+c1f95f4921,gfa517265be+df8a265115,gfa999e8aa5+17cd334064,gfb92a5be7c+df8a265115
LSST Data Management Base Package
Loading...
Searching...
No Matches
Public Types | Public Member Functions | Static Public Member Functions | List of all members
lsst::afw::table::BoxKey< Box > Class Template Referenceabstract

A FunctorKey used to get or set a lsst::geom::Box2I or Box2D from a (min, max) pair of Point3Keys. More...

#include <aggregates.h>

Inheritance diagram for lsst::afw::table::BoxKey< Box >:
lsst::afw::table::FunctorKey< Box > lsst::afw::table::OutputFunctorKey< T > lsst::afw::table::InputFunctorKey< T >

Public Types

using Element = typename Box::Element
 Type of coordinate elements (i.e. int or double).
 
using Value
 The data type for get and set.
 

Public Member Functions

 BoxKey () noexcept=default
 Default constructor; instance will not be usable unless subsequently assigned to.
 
 BoxKey (PointKey< Element > const &min, PointKey< Element > const &max) noexcept
 Construct from a pair of PointKeys.
 
 BoxKey (SubSchema const &s)
 Construct from a subschema, assuming _min_x, _max_x, _min_y, _max_y subfields.
 
 BoxKey (BoxKey const &) noexcept=default
 
 BoxKey (BoxKey &&) noexcept=default
 
BoxKeyoperator= (BoxKey const &) noexcept=default
 
BoxKeyoperator= (BoxKey &&) noexcept=default
 
 ~BoxKey () noexcept override=default
 
std::size_t hash_value () const noexcept
 Return a hash of this object.
 
Box get (BaseRecord const &record) const override
 Get a Box from the given record.
 
void set (BaseRecord &record, Box const &value) const override
 Set a Box in the given record.
 
bool operator== (BoxKey const &other) const noexcept
 Compare the FunctorKey for equality with another, using the underlying x and y Keys.
 
bool operator!= (BoxKey const &other) const noexcept
 
bool isValid () const noexcept
 Return True if both the min and max PointKeys are valid.
 
PointKey< ElementgetMin () const noexcept
 Return the underlying min PointKey.
 
PointKey< ElementgetMax () const noexcept
 Return the underlying max PointKey.
 
virtual void set (BaseRecord &record, T const &value) const =0
 

Static Public Member Functions

static BoxKey addFields (Schema &schema, std::string const &name, std::string const &doc, std::string const &unit)
 Add _min_x, _min_y, _max_x, _max_y fields to a Schema, and return a BoxKey that points to them.
 

Detailed Description

template<typename Box>
class lsst::afw::table::BoxKey< Box >

A FunctorKey used to get or set a lsst::geom::Box2I or Box2D from a (min, max) pair of Point3Keys.

The Box2IKey and Box2DKey typedefs should be preferred to using the template name directly.

Definition at line 208 of file aggregates.h.

Member Typedef Documentation

◆ Element

template<typename Box >
using lsst::afw::table::BoxKey< Box >::Element = typename Box::Element

Type of coordinate elements (i.e. int or double).

Definition at line 211 of file aggregates.h.

◆ Value

using lsst::afw::table::FunctorKey< Box >::Value
inherited

The data type for get and set.

Definition at line 77 of file FunctorKey.h.

Constructor & Destructor Documentation

◆ BoxKey() [1/5]

template<typename Box >
lsst::afw::table::BoxKey< Box >::BoxKey ( )
defaultnoexcept

Default constructor; instance will not be usable unless subsequently assigned to.

◆ BoxKey() [2/5]

template<typename Box >
lsst::afw::table::BoxKey< Box >::BoxKey ( PointKey< Element > const & min,
PointKey< Element > const & max )
inlinenoexcept

Construct from a pair of PointKeys.

Definition at line 233 of file aggregates.h.

233: _min(min), _max(max) {}
int min
int max

◆ BoxKey() [3/5]

template<typename Box >
lsst::afw::table::BoxKey< Box >::BoxKey ( SubSchema const & s)
inline

Construct from a subschema, assuming _min_x, _max_x, _min_y, _max_y subfields.

If a schema has "a_min_x" and "a_min_x" (etc) fields, this constructor allows you to construct a BoxKey via:

BoxKey<Box> k(schema["a"]);

Definition at line 243 of file aggregates.h.

243: _min(s["min"]), _max(s["max"]) {}

◆ BoxKey() [4/5]

template<typename Box >
lsst::afw::table::BoxKey< Box >::BoxKey ( BoxKey< Box > const & )
defaultnoexcept

◆ BoxKey() [5/5]

template<typename Box >
lsst::afw::table::BoxKey< Box >::BoxKey ( BoxKey< Box > && )
defaultnoexcept

◆ ~BoxKey()

template<typename Box >
lsst::afw::table::BoxKey< Box >::~BoxKey ( )
overridedefaultnoexcept

Member Function Documentation

◆ addFields()

template<typename Box >
BoxKey< Box > lsst::afw::table::BoxKey< Box >::addFields ( Schema & schema,
std::string const & name,
std::string const & doc,
std::string const & unit )
static

Add _min_x, _min_y, _max_x, _max_y fields to a Schema, and return a BoxKey that points to them.

Parameters
[in,out]schemaSchema to add fields to.
[in]nameName prefix for all fields; suffixes above will be appended to this to form the full field names. For example, if name == "b", the fields added will be "b_min_x", "b_min_y", "b_max_x", and "b_max_y".
[in]docString used as the documentation for the fields.
[in]unitString used as the unit for all fields.

Definition at line 86 of file aggregates.cc.

87 {
88 auto minKey = PointKey<Element>::addFields(schema, schema.join(name, "min"), doc + " (minimum)", unit);
89 auto maxKey = PointKey<Element>::addFields(schema, schema.join(name, "max"), doc + " (maximum)", unit);
90 return BoxKey<Box>(minKey, maxKey);
91}
table::Schema schema
Definition python.h:134
static PointKey addFields(Schema &schema, std::string const &name, std::string const &doc, std::string const &unit)
Add a pair of _x, _y fields to a Schema, and return a PointKey that points to them.
Definition aggregates.cc:36

◆ get()

template<typename Box >
Box lsst::afw::table::BoxKey< Box >::get ( BaseRecord const & record) const
overridevirtual

Get a Box from the given record.

Implements lsst::afw::table::OutputFunctorKey< T >.

Definition at line 94 of file aggregates.cc.

94 {
95 return Box(record.get(_min), record.get(_max), /*invert=*/false);
96}

◆ getMax()

template<typename Box >
PointKey< Element > lsst::afw::table::BoxKey< Box >::getMax ( ) const
inlinenoexcept

Return the underlying max PointKey.

Definition at line 276 of file aggregates.h.

276{ return _max; }

◆ getMin()

template<typename Box >
PointKey< Element > lsst::afw::table::BoxKey< Box >::getMin ( ) const
inlinenoexcept

Return the underlying min PointKey.

Definition at line 273 of file aggregates.h.

273{ return _min; }

◆ hash_value()

template<typename Box >
std::size_t lsst::afw::table::BoxKey< Box >::hash_value ( ) const
inlinenoexcept

Return a hash of this object.

Definition at line 252 of file aggregates.h.

252 {
253 // Completely arbitrary seed
254 return cpputils::hashCombine(17, _min, _max);
255 }
std::size_t hashCombine(std::size_t seed) noexcept
Combine hashes.
Definition hashCombine.h:35

◆ isValid()

template<typename Box >
bool lsst::afw::table::BoxKey< Box >::isValid ( ) const
inlinenoexcept

Return True if both the min and max PointKeys are valid.

Definition at line 270 of file aggregates.h.

270{ return _min.isValid() && _max.isValid(); }
bool isValid() const noexcept
Return True if both the x and y Keys are valid.
Definition aggregates.h:106

◆ operator!=()

template<typename Box >
bool lsst::afw::table::BoxKey< Box >::operator!= ( BoxKey< Box > const & other) const
inlinenoexcept

Definition at line 266 of file aggregates.h.

266{ return !(*this == other); }

◆ operator=() [1/2]

template<typename Box >
BoxKey & lsst::afw::table::BoxKey< Box >::operator= ( BoxKey< Box > && )
defaultnoexcept

◆ operator=() [2/2]

template<typename Box >
BoxKey & lsst::afw::table::BoxKey< Box >::operator= ( BoxKey< Box > const & )
defaultnoexcept

◆ operator==()

template<typename Box >
bool lsst::afw::table::BoxKey< Box >::operator== ( BoxKey< Box > const & other) const
inlinenoexcept

Compare the FunctorKey for equality with another, using the underlying x and y Keys.

Definition at line 265 of file aggregates.h.

265{ return _min == other._min && _max == other._max; }

◆ set() [1/2]

template<typename Box >
void lsst::afw::table::BoxKey< Box >::set ( BaseRecord & record,
Box const & value ) const
override

Set a Box in the given record.

Definition at line 99 of file aggregates.cc.

99 {
100 _min.set(record, value.getMin());
101 _max.set(record, value.getMax());
102}
void set(BaseRecord &record, lsst::geom::Point< T, 2 > const &value) const override
Set a Point in the given record.
Definition aggregates.cc:49

◆ set() [2/2]

template<typename T >
virtual void lsst::afw::table::InputFunctorKey< T >::set ( BaseRecord & record,
T const & value ) const
pure virtualinherited

The documentation for this class was generated from the following files: