LSST Applications  21.0.0-147-g0e635eb1+1acddb5be5,22.0.0+052faf71bd,22.0.0+1ea9a8b2b2,22.0.0+6312710a6c,22.0.0+729191ecac,22.0.0+7589c3a021,22.0.0+9f079a9461,22.0.1-1-g7d6de66+b8044ec9de,22.0.1-1-g87000a6+536b1ee016,22.0.1-1-g8e32f31+6312710a6c,22.0.1-10-gd060f87+016f7cdc03,22.0.1-12-g9c3108e+df145f6f68,22.0.1-16-g314fa6d+c825727ab8,22.0.1-19-g93a5c75+d23f2fb6d8,22.0.1-19-gb93eaa13+aab3ef7709,22.0.1-2-g8ef0a89+b8044ec9de,22.0.1-2-g92698f7+9f079a9461,22.0.1-2-ga9b0f51+052faf71bd,22.0.1-2-gac51dbf+052faf71bd,22.0.1-2-gb66926d+6312710a6c,22.0.1-2-gcb770ba+09e3807989,22.0.1-20-g32debb5+b8044ec9de,22.0.1-23-gc2439a9a+fb0756638e,22.0.1-3-g496fd5d+09117f784f,22.0.1-3-g59f966b+1e6ba2c031,22.0.1-3-g849a1b8+f8b568069f,22.0.1-3-gaaec9c0+c5c846a8b1,22.0.1-32-g5ddfab5d3+60ce4897b0,22.0.1-4-g037fbe1+64e601228d,22.0.1-4-g8623105+b8044ec9de,22.0.1-5-g096abc9+d18c45d440,22.0.1-5-g15c806e+57f5c03693,22.0.1-7-gba73697+57f5c03693,master-g6e05de7fdc+c1283a92b8,master-g72cdda8301+729191ecac,w.2021.39
LSST Data Management Base Package
arrays.h
Go to the documentation of this file.
1 // -*- lsst-c++ -*-
2 /*
3  * LSST Data Management System
4  * Copyright 2008-2014 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 #ifndef AFW_TABLE_arrays_h_INCLUDED
24 #define AFW_TABLE_arrays_h_INCLUDED
25 
26 #include "lsst/utils/hashCombine.h"
27 
29 #include "lsst/afw/table/Schema.h"
30 
31 namespace lsst {
32 namespace afw {
33 namespace table {
34 
42 template <typename T>
43 class ArrayKey : public FunctorKey<ndarray::Array<T const, 1, 1> >,
44  public ReferenceFunctorKey<ndarray::ArrayRef<T, 1, 1> >,
45  public ConstReferenceFunctorKey<ndarray::ArrayRef<T const, 1, 1> > {
46 public:
61  static ArrayKey addFields(Schema& schema, std::string const& name, std::string const& doc,
62  std::string const& unit, std::vector<T> const& docData);
63 
74  static ArrayKey addFields(Schema& schema, std::string const& name, std::string const& doc,
75  std::string const& unit, size_t size);
76 
78  ArrayKey() noexcept : _begin(), _size(0) {}
79 
81  explicit ArrayKey(std::vector<Key<T> > const& keys);
82 
89  explicit ArrayKey(Key<Array<T> > const& other) noexcept;
90 
99  explicit ArrayKey(SubSchema const& s);
100 
101  ArrayKey(ArrayKey const&) noexcept;
102  ArrayKey(ArrayKey&&) noexcept;
103  ArrayKey& operator=(ArrayKey const&) noexcept;
104  ArrayKey& operator=(ArrayKey&&) noexcept;
105  ~ArrayKey() noexcept override;
106 
108  std::size_t getSize() const noexcept { return _size; }
109 
111  ndarray::Array<T const, 1, 1> get(BaseRecord const& record) const override;
112 
114  void set(BaseRecord& record, ndarray::Array<T const, 1, 1> const& value) const override;
115 
117  ndarray::ArrayRef<T, 1, 1> getReference(BaseRecord& record) const override;
118 
120  ndarray::ArrayRef<T const, 1, 1> getConstReference(BaseRecord const& record) const override;
121 
123  bool operator==(ArrayKey<T> const& other) const noexcept {
125  return other._begin == _begin && other._size == _size;
126  }
127  bool operator!=(ArrayKey<T> const& other) const noexcept { return !operator==(other); }
129 
131  std::size_t hash_value() const noexcept {
132  // Completely arbitrary seed
133  return utils::hashCombine(17, _begin, _size);
134  }
135 
137  bool isValid() const noexcept { return _begin.isValid(); }
138 
140  Key<T> operator[](std::size_t i) const;
141 
143  ArrayKey slice(std::size_t begin, std::size_t end) const;
144 
145 private:
146  ArrayKey(Key<T> const& begin, std::size_t size) noexcept : _begin(begin), _size(size) {}
147 
148  Key<T> _begin;
149  std::size_t _size;
150 };
151 } // namespace table
152 } // namespace afw
153 } // namespace lsst
154 
155 namespace std {
156 template <typename T>
160  size_t operator()(argument_type const& obj) const noexcept { return obj.hash_value(); }
161 };
162 } // namespace std
163 
164 #endif // !AFW_TABLE_arrays_h_INCLUDED
table::Key< std::string > name
Definition: Amplifier.cc:116
int end
table::Schema schema
Definition: python.h:134
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
ArrayKey(ArrayKey &&) noexcept
ndarray::Array< T const, 1, 1 > get(BaseRecord const &record) const override
Get an array from the given record.
Definition: arrays.cc:109
ArrayKey(ArrayKey const &) noexcept
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
std::size_t hash_value() const noexcept
Return a hash of this object.
Definition: arrays.h:131
std::size_t getSize() const noexcept
Return the number of elements in the array.
Definition: arrays.h:108
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
bool isValid() const noexcept
Return True if the FunctorKey contains valid scalar keys.
Definition: arrays.h:137
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
bool operator!=(ArrayKey< T > const &other) const noexcept
Definition: arrays.h:127
ndarray::ArrayRef< T, 1, 1 > getReference(BaseRecord &record) const override
Get non-const reference array from the given record.
Definition: arrays.cc:123
bool operator==(ArrayKey< T > const &other) const noexcept
Compare the FunctorKey for equality with another, using the underlying scalar Keys.
Definition: arrays.h:124
Base class for all records.
Definition: BaseRecord.h:31
Base class for objects that can return a const reference to part of a record, but are not a true Key.
Definition: FunctorKey.h:109
Convenience base class that combines the OutputFunctorKey and InputFunctorKey.
Definition: FunctorKey.h:74
A class used as a handle to a particular field in a table.
Definition: Key.h:53
Base class for objects that can return a non-const reference to part of a record, but are not a true ...
Definition: FunctorKey.h:91
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
std::size_t hashCombine(std::size_t seed) noexcept
Combine hashes.
Definition: hashCombine.h:35
afw::table::Key< afw::table::Array< Scalar > > ArrayKey
Definition: common.h:48
A base class for image defects.
STL namespace.
size_t operator()(argument_type const &obj) const noexcept
Definition: arrays.h:160