LSST Applications g070148d5b3+33e5256705,g0d53e28543+25c8b88941,g0da5cf3356+2dd1178308,g1081da9e2a+62d12e78cb,g17e5ecfddb+7e422d6136,g1c76d35bf8+ede3a706f7,g295839609d+225697d880,g2e2c1a68ba+cc1f6f037e,g2ffcdf413f+853cd4dcde,g38293774b4+62d12e78cb,g3b44f30a73+d953f1ac34,g48ccf36440+885b902d19,g4b2f1765b6+7dedbde6d2,g5320a0a9f6+0c5d6105b6,g56b687f8c9+ede3a706f7,g5c4744a4d9+ef6ac23297,g5ffd174ac0+0c5d6105b6,g6075d09f38+66af417445,g667d525e37+2ced63db88,g670421136f+2ced63db88,g71f27ac40c+2ced63db88,g774830318a+463cbe8d1f,g7876bc68e5+1d137996f1,g7985c39107+62d12e78cb,g7fdac2220c+0fd8241c05,g96f01af41f+368e6903a7,g9ca82378b8+2ced63db88,g9d27549199+ef6ac23297,gabe93b2c52+e3573e3735,gb065e2a02a+3dfbe639da,gbc3249ced9+0c5d6105b6,gbec6a3398f+0c5d6105b6,gc9534b9d65+35b9f25267,gd01420fc67+0c5d6105b6,geee7ff78d7+a14128c129,gf63283c776+ede3a706f7,gfed783d017+0c5d6105b6,w.2022.47
LSST Data Management Base Package
Loading...
Searching...
No Matches
BaseColumnView.cc
Go to the documentation of this file.
1#include "boost/preprocessor/seq/for_each.hpp"
2#include "boost/preprocessor/tuple/to_seq.hpp"
3
6
7namespace lsst {
8namespace afw {
9namespace table {
10
11// =============== BitsColumn implementation ================================================================
12
13namespace {
14
15struct MatchKey {
16 bool operator()(SchemaItem<Flag> const &item) const { return item.key == target; }
17
18 explicit MatchKey(Key<Flag> const &t) : target(t) {}
19
20 Key<Flag> const &target;
21};
22
23struct MatchName {
24 bool operator()(SchemaItem<Flag> const &item) const { return item.field.getName() == target; }
25
26 explicit MatchName(std::string const &t) : target(t) {}
27
28 std::string const &target;
29};
30
31} // namespace
32
34 SizeT r = std::find_if(_items.begin(), _items.end(), MatchKey(key)) - _items.begin();
35 if (std::size_t(r) == _items.size()) {
37 (boost::format("'%s' not found in BitsColumn") % key).str());
38 }
39 return r;
40}
41
43 SizeT r = std::find_if(_items.begin(), _items.end(), MatchName(name)) - _items.begin();
44 if (std::size_t(r) == _items.size()) {
46 (boost::format("'%s' not found in BitsColumn") % name).str());
47 }
48 return r;
49}
50
51BitsColumn::BitsColumn(std::size_t size) : _array(ndarray::allocate(size)) { _array.deep() = SizeT(0); }
52
53// =============== BaseColumnView private Impl object =======================================================
54
56 std::size_t recordCount; // number of records
57 void *buf; // pointer to the beginning of the first record's data
58 std::shared_ptr<BaseTable> table; // table that owns the records
59 ndarray::Manager::Ptr manager; // manages lifetime of 'buf'
60
61 Impl(std::shared_ptr<BaseTable> const &table_, size_t recordCount_, void *buf_,
62 ndarray::Manager::Ptr const &manager_)
63 : recordCount(recordCount_), buf(buf_), table(table_), manager(manager_) {}
64};
65
66// =============== BaseColumnView member function implementations ===========================================
67
69
70template <typename T>
71typename ndarray::ArrayRef<T, 1> const BaseColumnView::operator[](Key<T> const &key) const {
72 if (!key.isValid()) {
73 throw LSST_EXCEPT(
75 "Key is not valid (if this is a SourceCatalog, make sure slot aliases have been set up).");
76 }
77 return ndarray::external(reinterpret_cast<T *>(reinterpret_cast<char *>(_impl->buf) + key.getOffset()),
78 ndarray::makeVector(_impl->recordCount),
79 ndarray::makeVector(_impl->table->getSchema().getRecordSize() / sizeof(T)),
80 _impl->manager);
81}
82
83template <typename T>
84typename ndarray::ArrayRef<T, 2, 1> const BaseColumnView::operator[](Key<Array<T> > const &key) const {
85 if (!key.isValid()) {
86 throw LSST_EXCEPT(
88 "Key is not valid (if this is a SourceCatalog, make sure slot aliases have been set up).");
89 }
90 if (key.isVariableLength()) {
91 throw LSST_EXCEPT(pex::exceptions::LogicError, "Cannot get columns for variable-length array fields");
92 }
93 return ndarray::external(
94 reinterpret_cast<T *>(reinterpret_cast<char *>(_impl->buf) + key.getOffset()),
95 ndarray::makeVector(_impl->recordCount, key.getSize()),
96 ndarray::makeVector(_impl->table->getSchema().getRecordSize() / sizeof(T), std::size_t(1)),
97 _impl->manager);
98}
99
100ndarray::result_of::vectorize<detail::FlagExtractor, ndarray::Array<Field<Flag>::Element const, 1> >::type
102 if (!key.isValid()) {
103 throw LSST_EXCEPT(
105 "Key is not valid (if this is a SourceCatalog, make sure slot aliases have been set up).");
106 }
107 return ndarray::vectorize(detail::FlagExtractor(key),
108 ndarray::Array<Field<Flag>::Element const, 1>(ndarray::external(
109 reinterpret_cast<Field<Flag>::Element *>(
110 reinterpret_cast<char *>(_impl->buf) + key.getOffset()),
111 ndarray::makeVector(_impl->recordCount),
112 ndarray::makeVector(_impl->table->getSchema().getRecordSize() /
113 sizeof(Field<Flag>::Element)),
114 _impl->manager)));
115}
116
119 ndarray::ArrayRef<BitsColumn::SizeT, 1, 1> array = result._array.deep();
120 if (keys.size() > sizeof(BitsColumn::SizeT)) {
122 (boost::format("Too many keys passed to getBits(); %d > %d.") % keys.size() %
123 sizeof(BitsColumn::SizeT))
124 .str());
125 }
126 BitsColumn::SizeT const size = keys.size(); // just for unsigned/signed comparisons
127 for (BitsColumn::SizeT i = 0; i < size; ++i) {
128 array |= (BitsColumn::SizeT(1) << i) * (*this)[keys[i]];
129 result._items.push_back(getSchema().find(keys[i]));
130 }
131 return result;
132}
133
134namespace {
135
136struct ExtractFlagItems {
137 template <typename T>
138 void operator()(SchemaItem<T> const &) const {}
139
140 void operator()(SchemaItem<Flag> const &item) const { items->push_back(item); }
141
143};
144
145} // namespace
146
149 ExtractFlagItems func = {&result._items};
150 getSchema().forEach(func);
151 if (result._items.size() > sizeof(BitsColumn::SizeT)) {
153 (boost::format("Too many Flag keys in schema; %d > %d.") % result._items.size() %
154 sizeof(BitsColumn::SizeT))
155 .str());
156 }
157 ndarray::ArrayRef<BitsColumn::SizeT, 1, 1> array = result._array.deep();
158 BitsColumn::SizeT const size = result._items.size(); // just for unsigned/signed comparisons
159 for (BitsColumn::SizeT i = 0; i < size; ++i) {
160 array |= (BitsColumn::SizeT(1) << i) * (*this)[result._items[i].key];
161 }
162 return result;
163}
164
169
170// needs to be in source file so it can (implicitly) call Impl's (implicit) dtor
172
174 ndarray::Manager::Ptr const &manager)
175 : _impl(std::make_shared<Impl>(table, recordCount, buf, manager)) {}
176
177// =============== Explicit instantiations ==================================================================
178
179#define INSTANTIATE_COLUMNVIEW_SCALAR(r, data, elem) \
180 template ndarray::ArrayRef<elem, 1> const BaseColumnView::operator[](Key<elem> const &) const;
181
184
185#define INSTANTIATE_COLUMNVIEW_ARRAY(r, data, elem) \
186 template ndarray::ArrayRef<elem, 2, 1> const BaseColumnView::operator[](Key<Array<elem> > const &) const;
187
190} // namespace table
191} // namespace afw
192} // namespace lsst
py::object result
Definition: _schema.cc:429
table::Key< std::string > name
Definition: Amplifier.cc:116
#define INSTANTIATE_COLUMNVIEW_SCALAR(r, data, elem)
Key< Flag > const & target
#define INSTANTIATE_COLUMNVIEW_ARRAY(r, data, elem)
std::vector< SchemaItem< Flag > > * items
table::Key< int > type
Definition: Detector.cc:163
#define LSST_EXCEPT(type,...)
Create an exception with a given type.
Definition: Exception.h:48
Tag types used to declare specialized field types.
Definition: misc.h:31
Column-wise view into a sequence of records that have been allocated contiguously.
BaseColumnView & operator=(BaseColumnView const &)
BitsColumn getBits(std::vector< Key< Flag > > const &keys) const
Return an integer array with the given Flag fields repacked into individual bits.
Schema getSchema() const
Return the schema that defines the fields.
BaseColumnView(BaseColumnView const &)
BitsColumn getAllBits() const
Return an integer array with all Flag fields repacked into individual bits.
std::shared_ptr< BaseTable > getTable() const
Return the table that owns the records.
ndarray::ArrayRef< T, 1 > const operator[](Key< T > const &key) const
Return a 1-d array corresponding to a scalar field (or subfield).
A packed representation of a collection of Flag field columns.
SizeT getBit(Key< Flag > const &key) const
A class used as a handle to a particular field in a table.
Definition: Key.h:53
std::size_t getOffset() const noexcept
Return the offset (in bytes) of this field within a record.
Definition: Key.h:87
bool isValid() const noexcept
Return true if the key was initialized to valid offset.
Definition: Key.h:97
void forEach(F &func) const
Apply a functor to each SchemaItem in the Schema.
Definition: Schema.h:214
SchemaItem< T > find(std::string const &name) const
Find a SchemaItem in the Schema by name.
Definition: Schema.cc:467
Reports attempts to exceed implementation-defined length limits for some classes.
Definition: Runtime.h:76
Reports errors in the logical structure of the program.
Definition: Runtime.h:46
Reports attempts to access elements using an invalid key.
Definition: Runtime.h:151
T find_if(T... args)
BOOST_PP_SEQ_FOR_EACH(INSTANTIATE_COLUMNVIEW_SCALAR, _, BOOST_PP_TUPLE_TO_SEQ(AFW_TABLE_SCALAR_FIELD_TYPE_N, AFW_TABLE_SCALAR_FIELD_TYPE_TUPLE)) BOOST_PP_SEQ_FOR_EACH(INSTANTIATE_COLUMNVIEW_ARRAY
STL namespace.
std::shared_ptr< BaseTable > table
Impl(std::shared_ptr< BaseTable > const &table_, size_t recordCount_, void *buf_, ndarray::Manager::Ptr const &manager_)
typename FieldBase< T >::Element Element
Type used to store field data in the table (a field may have multiple elements).
Definition: Field.h:26
A simple pair-like struct for mapping a Field (name and description) with a Key (used for actual data...
Definition: SchemaImpl.h:22
Functor to compute a flag bit, used to create an ndarray expression template for flag columns.
#define AFW_TABLE_ARRAY_FIELD_TYPE_TUPLE
Definition: types.h:35
#define AFW_TABLE_ARRAY_FIELD_TYPE_N
Definition: types.h:33
#define AFW_TABLE_SCALAR_FIELD_TYPE_TUPLE
Definition: types.h:30
#define AFW_TABLE_SCALAR_FIELD_TYPE_N
Definition: types.h:27