LSST Applications
21.0.0-172-gfb10e10a+18fedfabac,22.0.0+297cba6710,22.0.0+80564b0ff1,22.0.0+8d77f4f51a,22.0.0+a28f4c53b1,22.0.0+dcf3732eb2,22.0.1-1-g7d6de66+2a20fdde0d,22.0.1-1-g8e32f31+297cba6710,22.0.1-1-geca5380+7fa3b7d9b6,22.0.1-12-g44dc1dc+2a20fdde0d,22.0.1-15-g6a90155+515f58c32b,22.0.1-16-g9282f48+790f5f2caa,22.0.1-2-g92698f7+dcf3732eb2,22.0.1-2-ga9b0f51+7fa3b7d9b6,22.0.1-2-gd1925c9+bf4f0e694f,22.0.1-24-g1ad7a390+a9625a72a8,22.0.1-25-g5bf6245+3ad8ecd50b,22.0.1-25-gb120d7b+8b5510f75f,22.0.1-27-g97737f7+2a20fdde0d,22.0.1-32-gf62ce7b1+aa4237961e,22.0.1-4-g0b3f228+2a20fdde0d,22.0.1-4-g243d05b+871c1b8305,22.0.1-4-g3a563be+32dcf1063f,22.0.1-4-g44f2e3d+9e4ab0f4fa,22.0.1-42-gca6935d93+ba5e5ca3eb,22.0.1-5-g15c806e+85460ae5f3,22.0.1-5-g58711c4+611d128589,22.0.1-5-g75bb458+99c117b92f,22.0.1-6-g1c63a23+7fa3b7d9b6,22.0.1-6-g50866e6+84ff5a128b,22.0.1-6-g8d3140d+720564cf76,22.0.1-6-gd805d02+cc5644f571,22.0.1-8-ge5750ce+85460ae5f3,master-g6e05de7fdc+babf819c66,master-g99da0e417a+8d77f4f51a,w.2021.48
LSST Data Management Base Package
|
Defines the fields and offsets for a table. More...
#include <Schema.h>
Public Types | |
enum | ComparisonFlags { EQUAL_KEYS = 0x01 , EQUAL_NAMES = 0x02 , EQUAL_DOCS = 0x04 , EQUAL_UNITS = 0x08 , EQUAL_FIELDS = 0x0F , EQUAL_ALIASES = 0x10 , IDENTICAL = 0x1F } |
Bit flags used when comparing schemas. More... | |
Public Member Functions | |
std::string | join (std::string const &a, std::string const &b) const |
Join strings using the field delimiter appropriate for this Schema. More... | |
std::string | join (std::string const &a, std::string const &b, std::string const &c) const |
std::string | join (std::string const &a, std::string const &b, std::string const &c, std::string const &d) const |
template<typename T > | |
SchemaItem< T > | find (std::string const &name) const |
Find a SchemaItem in the Schema by name. More... | |
template<typename T > | |
SchemaItem< T > | find (Key< T > const &key) const |
Find a SchemaItem in the Schema by key. More... | |
template<typename F > | |
void | findAndApply (std::string const &name, F &&func) const |
Find a SchemaItem by name and run a functor on it. More... | |
SubSchema | operator[] (std::string const &name) const |
Look up a (possibly incomplete) name in the Schema. More... | |
std::set< std::string > | getNames (bool topOnly=false) const |
Return a set of field names in the schema. More... | |
std::size_t | getRecordSize () const |
Return the raw size of a record in bytes. More... | |
std::size_t | getFieldCount () const |
The total number of fields. More... | |
std::size_t | getFlagFieldCount () const |
The number of Flag fields. More... | |
std::size_t | getNonFlagFieldCount () const |
The number of non-Flag fields. More... | |
template<typename T > | |
Key< T > | addField (Field< T > const &field, bool doReplace=false) |
Add a new field to the Schema, and return the associated Key. More... | |
template<typename T > | |
Key< T > | addField (std::string const &name, std::string const &doc, std::string const &units="", FieldBase< T > const &base=FieldBase< T >(), bool doReplace=false) |
Add a new field to the Schema, and return the associated Key. More... | |
template<typename T > | |
Key< T > | addField (std::string const &name, std::string const &doc, FieldBase< T > const &base, bool doReplace=false) |
Add a new field to the Schema, and return the associated Key. More... | |
template<typename T > | |
void | replaceField (Key< T > const &key, Field< T > const &field) |
Replace the Field (name/description) for an existing Key. More... | |
template<typename F > | |
void | forEach (F &func) const |
Apply a functor to each SchemaItem in the Schema. More... | |
template<typename F > | |
void | forEach (F const &func) const |
bool | operator== (Schema const &other) const |
Equality comparison. More... | |
bool | operator!= (Schema const &other) const |
std::size_t | hash_value () const noexcept |
Return a hash of this object. More... | |
int | compare (Schema const &other, int flags=EQUAL_KEYS) const |
Do a detailed equality comparison of two schemas. More... | |
int | contains (Schema const &other, int flags=EQUAL_KEYS) const |
Test whether the given schema is a subset of this. More... | |
template<typename T > | |
int | contains (SchemaItem< T > const &item, int flags=EQUAL_KEYS) const |
Return true if the given item is in this schema. More... | |
std::shared_ptr< AliasMap > | getAliasMap () const |
Return the map of aliases. More... | |
void | setAliasMap (std::shared_ptr< AliasMap > aliases) |
Set the alias map. More... | |
void | disconnectAliases () |
Sever the connection between this schema and any others with which it shares aliases. More... | |
Schema () | |
Construct an empty Schema. More... | |
Schema (Schema const &other) | |
Copy constructor. More... | |
Schema (Schema &&other) | |
Schema & | operator= (Schema const &other) |
Schema & | operator= (Schema &&other) |
~Schema () | |
Static Public Member Functions | |
static Schema | readFits (std::string const &filename, int hdu=fits::DEFAULT_HDU) |
Construct from reading a FITS file. More... | |
static Schema | readFits (fits::MemFileManager &manager, int hdu=fits::DEFAULT_HDU) |
static Schema | readFits (fits::Fits &fitsfile) |
static Schema | fromFitsMetadata (daf::base::PropertyList &header, bool stripMetadata=true) |
Construct from reading a FITS header. More... | |
Static Public Attributes | |
static int const | VERSION = detail::SchemaImpl::VERSION |
Friends | |
class | detail::Access |
class | SubSchema |
std::ostream & | operator<< (std::ostream &os, Schema const &schema) |
Stringification. More... | |
Defines the fields and offsets for a table.
Schema behaves like a container of SchemaItem objects, mapping a descriptive Field object with the Key object used to access record and ColumnView values. A Schema is the most important ingredient in creating a table.
Because offsets for fields are assigned when the field is added to the Schema, Schemas do not support removing fields, though they do allow renaming.
Field names in Schemas are expected to be underscore-separated names (e.g. 'a_b_c', but see Field Names for the full conventions, including when to use underscores vs. CamelCase). The SubSchema class and Schema::operator[] provide a heirarchical interface to these names, but are implemented entirely as string splitting/joining operations that ultimately forward to member functions that operate on the fully-qualified field name, so there is no requirement that names be separated by underscores, and no performance advantage to using a SubSchema.
A SchemaMapper object can be used to define a relationship between two Schemas to be used when copying values from one table to another or loading/saving selected fields to disk.
Schema uses copy-on-write, and hence should always be held by value rather than smart pointer. When creating a Python interface, functions that return Schema by const reference should be converted to return by value (returnCopy) to ensure proper memory management and encapsulation.
Bit flags used when comparing schemas.
All quantities are compared in insertion order, so if two schemas have the same fields added in opposite order, they will not be considered equal.
Definition at line 65 of file Schema.h.
lsst::afw::table::Schema::Schema | ( | ) |
|
default |
Copy constructor.
|
default |
Key< T > lsst::afw::table::Schema::addField | ( | Field< T > const & | field, |
bool | doReplace = false |
||
) |
Add a new field to the Schema, and return the associated Key.
The offsets of fields are determined by the order they are added, but may be not contiguous (the Schema may add padding to align fields, and how much padding is considered an implementation detail).
If doReplace is true and the field exists, it will be replaced instead of throwing an exception.
Definition at line 479 of file Schema.cc.
|
inline |
Add a new field to the Schema, and return the associated Key.
This is simply a convenience wrapper, equivalent to:
addField(Field<T>(name, doc, base), doReplace)
Definition at line 194 of file Schema.h.
|
inline |
int lsst::afw::table::Schema::compare | ( | Schema const & | other, |
int | flags = EQUAL_KEYS |
||
) | const |
Do a detailed equality comparison of two schemas.
See ComparisonFlags for a description of the possible return values
[in] | other | The other schema to compare to. |
[in] | flags | Which types of comparisions to perform. Flag bits not present here will never be returned. |
Definition at line 509 of file Schema.cc.
int lsst::afw::table::Schema::contains | ( | Schema const & | other, |
int | flags = EQUAL_KEYS |
||
) | const |
Test whether the given schema is a subset of this.
This function behaves very similarly to compare(), but ignores fields that are present in this but absent in other.
Definition at line 490 of file Schema.cc.
int lsst::afw::table::Schema::contains | ( | SchemaItem< T > const & | item, |
int | flags = EQUAL_KEYS |
||
) | const |
Return true if the given item is in this schema.
The flags must include the EQUAL_KEYS bit, and if the item cannot be found by key no bits will be set on return.
Definition at line 529 of file Schema.cc.
void lsst::afw::table::Schema::disconnectAliases | ( | ) |
SchemaItem< T > lsst::afw::table::Schema::find | ( | Key< T > const & | key | ) | const |
Find a SchemaItem in the Schema by key.
Keys corresponding to named subfields are accepted, and will return a SchemaItem whose field is copied from the parent field with only the name changed. Keys corresponding to unnamed subfields (such as array elements) are not accepted.
Definition at line 474 of file Schema.cc.
SchemaItem< T > lsst::afw::table::Schema::find | ( | std::string const & | name | ) | const |
Find a SchemaItem in the Schema by name.
Names corresponding to named subfields are accepted, and will return a SchemaItem whose field is copied from the parent field with only the name changed.
Definition at line 467 of file Schema.cc.
|
inline |
Find a SchemaItem by name and run a functor on it.
Names corresponding to named subfields are not accepted. The given functor must have an overloaded function call operator that accepts any SchemaItem type (the same as a functor provided to forEach).
Definition at line 117 of file Schema.h.
|
inline |
Apply a functor to each SchemaItem in the Schema.
The functor must have a templated or sufficiently overloaded operator() that supports SchemaItems of all supported field types - even those that are not present in this particular Schema.
Fields will be processed in the order they were added to the schema.
Definition at line 214 of file Schema.h.
|
inline |
|
static |
|
inline |
|
inline |
The total number of fields.
Definition at line 152 of file Schema.h.
|
inline |
The number of Flag fields.
Definition at line 155 of file Schema.h.
std::set< std::string > lsst::afw::table::Schema::getNames | ( | bool | topOnly = false | ) | const |
Return a set of field names in the schema.
If topOnly==true, return a unique list of only the part of the names before the first underscore. For example, if the full list of field names is ['a_b_c', 'a_d', 'e_f'], topOnly==true will return ['a', 'e'].
Returns an instance of Python's builtin set in Python.
Aliases are not returned.
Definition at line 464 of file Schema.cc.
|
inline |
The number of non-Flag fields.
Definition at line 158 of file Schema.h.
|
inline |
Return the raw size of a record in bytes.
Definition at line 149 of file Schema.h.
|
noexcept |
Return a hash of this object.
Definition at line 520 of file Schema.cc.
std::string lsst::afw::table::Schema::join | ( | std::string const & | a, |
std::string const & | b | ||
) | const |
|
inline |
Definition at line 78 of file Schema.h.
|
inline |
|
inline |
Definition at line 236 of file Schema.h.
|
inline |
Equality comparison.
Schemas are considered equal according the standard equality operator if their sequence of keys are identical (same types with the same offsets); names and descriptions of fields are not considered. For a more precise comparison, use compare() or contains().
Definition at line 235 of file Schema.h.
|
inline |
Look up a (possibly incomplete) name in the Schema.
See SubSchema for more information.
This member function should generally only be used on "finished" Schemas; modifying a Schema after a SubSchema to it has been constructed will not allow the proxy to track the additions, and will invoke the copy-on-write mechanism of the Schema itself.
Definition at line 464 of file Schema.h.
|
static |
Definition at line 442 of file Schema.cc.
|
static |
Definition at line 436 of file Schema.cc.
|
static |
Construct from reading a FITS file.
Reads from the nominated 'hdu' (0=PHU which cannot be a catalog, afw::fits::DEFAULT_HDU is a special value meaning read from the first HDU with NAXIS != 0).
Definition at line 430 of file Schema.cc.
void lsst::afw::table::Schema::replaceField | ( | Key< T > const & | key, |
Field< T > const & | field | ||
) |
Replace the Field (name/description) for an existing Key.
Definition at line 485 of file Schema.cc.
void lsst::afw::table::Schema::setAliasMap | ( | std::shared_ptr< AliasMap > | aliases | ) |
Set the alias map.
This resets the internal pointer to the alias map, disconnecting this schema from any others it shares aliases with.
Passing a null pointer is equivalent to passing an empty map.
|
friend |
|
friend |
|
static |