LSST Applications 27.0.0,g0265f82a02+469cd937ee,g02d81e74bb+21ad69e7e1,g1470d8bcf6+cbe83ee85a,g2079a07aa2+e67c6346a6,g212a7c68fe+04a9158687,g2305ad1205+94392ce272,g295015adf3+81dd352a9d,g2bbee38e9b+469cd937ee,g337abbeb29+469cd937ee,g3939d97d7f+72a9f7b576,g487adcacf7+71499e7cba,g50ff169b8f+5929b3527e,g52b1c1532d+a6fc98d2e7,g591dd9f2cf+df404f777f,g5a732f18d5+be83d3ecdb,g64a986408d+21ad69e7e1,g858d7b2824+21ad69e7e1,g8a8a8dda67+a6fc98d2e7,g99cad8db69+f62e5b0af5,g9ddcbc5298+d4bad12328,ga1e77700b3+9c366c4306,ga8c6da7877+71e4819109,gb0e22166c9+25ba2f69a1,gb6a65358fc+469cd937ee,gbb8dafda3b+69d3c0e320,gc07e1c2157+a98bf949bb,gc120e1dc64+615ec43309,gc28159a63d+469cd937ee,gcf0d15dbbd+72a9f7b576,gdaeeff99f8+a38ce5ea23,ge6526c86ff+3a7c1ac5f1,ge79ae78c31+469cd937ee,gee10cc3b42+a6fc98d2e7,gf1cff7945b+21ad69e7e1,gfbcc870c63+9a11dc8c8f
LSST Data Management Base Package
Loading...
Searching...
No Matches
arrays.cc
Go to the documentation of this file.
1// -*- lsst-c++ -*-
2/*
3 * LSST Data Management System
4 * Copyright 2008-2016 LSST Corporation.
5 *
6 * This product includes software developed by the
7 * LSST Project (http://www.lsst.org/).
8 *
9 * This program is free software: you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation, either version 3 of the License, or
12 * (at your option) any later version.
13 *
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
18 *
19 * You should have received a copy of the LSST License Statement and
20 * the GNU General Public License along with this program. If not,
21 * see <http://www.lsstcorp.org/LegalNotices/>.
22 */
23
24#include <string>
25
29
30namespace lsst {
31namespace afw {
32namespace table {
33
34template <typename T>
36 std::string const &unit, std::vector<T> const &docData) {
38 if (docData.empty()) return result;
39 result._size = docData.size();
40 result._begin = schema.addField<T>(
41 schema.join(name, "0"), // we use getPrefix in order to get the version-dependent delimiter
42 (boost::format(doc) % docData.front()).str(), unit);
43 for (std::size_t i = 1; i < result._size; ++i) {
44 schema.addField<T>(schema.join(name, std::to_string(i)), (boost::format(doc) % docData[i]).str(),
45 unit);
46 }
47 return result;
48}
49
50template <typename T>
52 std::string const &unit, size_t size) {
54 if (size == 0) return result;
55 result._size = size;
56 result._begin = schema.addField<T>(
57 schema.join(name, "0"), // we use getPrefix in order to get the version-dependent delimiter
58 doc, unit);
59 for (std::size_t i = 1; i < result._size; ++i) {
60 schema.addField<T>(schema.join(name, std::to_string(i)), doc, unit);
61 }
62 return result;
63}
64
65template <typename T>
66ArrayKey<T>::ArrayKey(std::vector<Key<T> > const &keys) : _begin(), _size(keys.size()) {
67 if (keys.empty()) return;
68 _begin = keys.front();
69 for (std::size_t i = 1; i < _size; ++i) {
70 if (keys[i].getOffset() - _begin.getOffset() != (i * sizeof(T))) {
72 "Keys passed to ArrayKey constructor are not contiguous");
73 }
74 }
75}
76
77template <typename T>
78ArrayKey<T>::ArrayKey(Key<Array<T> > const &other) noexcept : _begin(other[0]), _size(other.getSize()) {}
79
80template <typename T>
81ArrayKey<T>::ArrayKey(SubSchema const &s) : _begin(s["0"]), _size(1) {
82 Key<T> current;
83 while (true) {
84 try {
85 current = s[std::to_string(_size)];
87 return;
88 }
89 if (current.getOffset() - _begin.getOffset() != (_size * sizeof(T))) {
91 "Keys discovered in Schema are not contiguous");
92 }
93 ++_size;
94 }
95}
96
97template <typename T>
98ArrayKey<T>::ArrayKey(ArrayKey const &) noexcept = default;
99template <typename T>
101template <typename T>
102ArrayKey<T> &ArrayKey<T>::operator=(ArrayKey const &) noexcept = default;
103template <typename T>
104ArrayKey<T> &ArrayKey<T>::operator=(ArrayKey &&) noexcept = default;
105template <typename T>
106ArrayKey<T>::~ArrayKey() noexcept = default;
107
108template <typename T>
109ndarray::Array<T const, 1, 1> ArrayKey<T>::get(BaseRecord const &record) const {
110 return ndarray::external(record.getElement(_begin), ndarray::makeVector(_size), ndarray::ROW_MAJOR,
111 record.getManager());
112}
113
114template <typename T>
115void ArrayKey<T>::set(BaseRecord &record, ndarray::Array<T const, 1, 1> const &value) const {
116 LSST_THROW_IF_NE(value.template getSize<0>(), static_cast<std::size_t>(_size),
118 "Size of input array (%d) does not match size of array field (%d)");
119 std::copy(value.begin(), value.end(), record.getElement(_begin));
121
122template <typename T>
123ndarray::ArrayRef<T, 1, 1> ArrayKey<T>::getReference(BaseRecord &record) const {
124 return ndarray::external(record.getElement(_begin), ndarray::makeVector(_size), ndarray::ROW_MAJOR,
125 record.getManager());
126}
127
128template <typename T>
129ndarray::ArrayRef<T const, 1, 1> ArrayKey<T>::getConstReference(BaseRecord const &record) const {
130 return ndarray::external(record.getElement(_begin), ndarray::makeVector(_size), ndarray::ROW_MAJOR,
131 record.getManager());
132}
133
134template <typename T>
136 if (i >= _size) {
137 throw LSST_EXCEPT(pex::exceptions::LengthError, "ArrayKey index does not fit within valid range");
138 }
139 return detail::Access::makeKey<T>(_begin.getOffset() + i * sizeof(T));
141
142template <typename T>
144 if (begin >= end || end > _size) {
146 "ArrayKey slice range does not fit within valid range");
147 }
148 return ArrayKey((*this)[begin], end - begin);
149}
150
151template class ArrayKey<float>;
152template class ArrayKey<double>;
153} // namespace table
154} // namespace afw
155} // namespace lsst
py::object result
Definition _schema.cc:429
int end
#define LSST_EXCEPT(type,...)
Create an exception with a given type.
Definition Exception.h:48
#define LSST_THROW_IF_NE(N1, N2, EXC_CLASS, MSG)
Check whether the given values are equal, and throw an LSST Exception if they are not.
Definition asserts.h:38
Tag types used to declare specialized field types.
Definition misc.h:31
A FunctorKey used to get or set a ndarray::Array from a sequence of scalar Keys.
Definition arrays.h:45
Key< T > operator[](std::size_t i) const
Return a scalar Key for an element of the array.
Definition arrays.cc:135
void set(BaseRecord &record, ndarray::Array< T const, 1, 1 > const &value) const override
Set an array in the given record.
Definition arrays.cc:115
ArrayKey slice(std::size_t begin, std::size_t end) const
Return a FunctorKey corresponding to a range of elements.
Definition arrays.cc:143
ndarray::ArrayRef< T const, 1, 1 > getConstReference(BaseRecord const &record) const override
Get const reference array from the given record.
Definition arrays.cc:129
ArrayKey() noexcept
Default constructor; instance will not be usable unless subsequently assigned to.
Definition arrays.h:78
static ArrayKey addFields(Schema &schema, std::string const &name, std::string const &doc, std::string const &unit, std::vector< T > const &docData)
Add an array of fields to a Schema, and return an ArrayKey that points to them.
Definition arrays.cc:35
ndarray::ArrayRef< T, 1, 1 > getReference(BaseRecord &record) const override
Get non-const reference array from the given record.
Definition arrays.cc:123
Base class for all records.
Definition BaseRecord.h:31
Field< T >::Element * getElement(Key< T > const &key)
Return a pointer to the underlying elements of a field (non-const).
Definition BaseRecord.h:93
ndarray::Manager::Ptr getManager() const
Definition BaseRecord.h:200
A class used as a handle to a particular field in a table.
Definition Key.h:53
Defines the fields and offsets for a table.
Definition Schema.h:51
A proxy type for name lookups in a Schema.
Definition Schema.h:367
Reports invalid arguments.
Definition Runtime.h:66
Reports attempts to exceed implementation-defined length limits for some classes.
Definition Runtime.h:76
Reports attempts to access elements using an invalid key.
Definition Runtime.h:151
T copy(T... args)
T to_string(T... args)