Loading [MathJax]/extensions/tex2jax.js
LSST Applications g04dff08e69+fafbcb10e2,g0d33ba9806+e09a96fa4e,g0fba68d861+cc01b48236,g1e78f5e6d3+fb95f9dda6,g1ec0fe41b4+f536777771,g1fd858c14a+ae46bc2a71,g35bb328faa+fcb1d3bbc8,g4af146b050+dd94f3aad7,g4d2262a081+7ee6f976aa,g53246c7159+fcb1d3bbc8,g5a012ec0e7+b20b785ecb,g60b5630c4e+e09a96fa4e,g6273192d42+bf8cfc5e62,g67b6fd64d1+4086c0989b,g78460c75b0+2f9a1b4bcd,g786e29fd12+cf7ec2a62a,g7b71ed6315+fcb1d3bbc8,g87b7deb4dc+831c06c8fc,g8852436030+54b48a5987,g89139ef638+4086c0989b,g9125e01d80+fcb1d3bbc8,g94187f82dc+e09a96fa4e,g989de1cb63+4086c0989b,g9f33ca652e+64be6d9d51,g9f7030ddb1+d11454dffd,ga2b97cdc51+e09a96fa4e,gabe3b4be73+1e0a283bba,gabf8522325+fa80ff7197,gb1101e3267+23605820ec,gb58c049af0+f03b321e39,gb89ab40317+4086c0989b,gcf25f946ba+54b48a5987,gd6cbbdb0b4+af3c3595f5,gd9a9a58781+fcb1d3bbc8,gde0f65d7ad+15f2daff9d,ge278dab8ac+d65b3c2b70,ge410e46f29+4086c0989b,gf67bdafdda+4086c0989b,v29.0.0.rc5
LSST Data Management Base Package
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Modules Pages
SortedCatalog.h
Go to the documentation of this file.
1// -*- lsst-c++ -*-
2/*
3 * LSST Data Management System
4 * Copyright 2008, 2009, 2010, 2011 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_SortedCatalog_h_INCLUDED
24#define AFW_TABLE_SortedCatalog_h_INCLUDED
25
27#include "lsst/afw/table/fwd.h"
29
30namespace lsst {
31namespace afw {
32namespace table {
33
41template <typename RecordT>
42class SortedCatalogT : public CatalogT<RecordT> {
43 using Base = CatalogT<RecordT>;
44
45public:
46 using Record = RecordT;
47 using Table = typename Record::Table;
48
49 using iterator = typename Base::iterator;
51
52 using Base::isSorted;
53 using Base::sort;
54 using Base::find;
55
56 SortedCatalogT(SortedCatalogT const&) = default;
60 ~SortedCatalogT() = default;
61
63 bool isSorted() const { return this->isSorted(Table::getIdKey()); }
64
66 void sort() { this->sort(Table::getIdKey()); }
67
69
77 iterator find(RecordId id) { return this->find(id, Table::getIdKey()); }
78 const_iterator find(RecordId id) const { return this->find(id, Table::getIdKey()); }
80
88
90 explicit SortedCatalogT(Schema const& schema) : Base(schema) {}
91
102 template <typename InputIterator>
103 SortedCatalogT(std::shared_ptr<Table> const& table, InputIterator first, InputIterator last,
104 bool deep = false)
105 : Base(table, first, last, deep) {}
106
113 template <typename OtherRecordT>
114 SortedCatalogT(SortedCatalogT<OtherRecordT> const& other) : Base(other) {}
115
126 static SortedCatalogT readFits(std::string const& filename, int hdu = fits::DEFAULT_HDU, int flags = 0) {
127 return io::FitsReader::apply<SortedCatalogT>(filename, hdu, flags);
128 }
129
141 int flags = 0) {
142 return io::FitsReader::apply<SortedCatalogT>(manager, hdu, flags);
143 }
144
152 static SortedCatalogT readFits(fits::Fits& fitsfile, int flags = 0) {
153 return io::FitsReader::apply<SortedCatalogT>(fitsfile, flags);
154 }
155
161 SortedCatalogT<RecordT> subset(ndarray::Array<bool const, 1> const& mask) const {
162 return SortedCatalogT(Base::subset(mask));
163 }
164
170 return SortedCatalogT(Base::subset(startd, stopd, step));
171 }
172
173protected:
174 explicit SortedCatalogT(Base const& other) : Base(other) {}
175};
176} // namespace table
177} // namespace afw
178} // namespace lsst
179
180#endif // !AFW_TABLE_SortedCatalog_h_INCLUDED
A simple struct that combines the two arguments that must be passed to most cfitsio routines and cont...
Definition fits.h:308
Lifetime-management for memory that goes into FITS memory files.
Definition fits.h:125
iterator find(typename Field< T >::Value const &value, Key< T > const &key)
Return an iterator to the record with the given value.
Definition Catalog.h:762
CatalogIterator< typename Internal::iterator > iterator
Definition Catalog.h:110
CatalogIterator< typename Internal::const_iterator > const_iterator
Definition Catalog.h:111
CatalogT< RecordT > subset(ndarray::Array< bool const, 1 > const &mask) const
Return the subset of a catalog corresponding to the True values of the given mask array.
Definition Catalog.h:184
CatalogT(std::shared_ptr< Table > const &table=std::shared_ptr< Table >())
Construct a catalog from a table (or nothing).
Definition Catalog.h:124
void sort(Key< T > const &key)
Sort the catalog in-place by the field with the given key.
Definition Catalog.h:755
bool isSorted(Key< T > const &key) const
Return true if the catalog is in ascending order according to the given key.
Definition Catalog.h:748
Defines the fields and offsets for a table.
Definition Schema.h:51
bool isSorted() const
Return true if the vector is in ascending ID order.
typename Base::const_iterator const_iterator
SortedCatalogT(SortedCatalogT &&)=default
SortedCatalogT & operator=(SortedCatalogT &&)=default
SortedCatalogT & operator=(SortedCatalogT const &)=default
SortedCatalogT subset(std::ptrdiff_t startd, std::ptrdiff_t stopd, std::ptrdiff_t step) const
Shallow copy a subset of another SortedCatalog.
iterator find(RecordId id)
Return an iterator to the record with the given ID.
SortedCatalogT(std::shared_ptr< Table > const &table, InputIterator first, InputIterator last, bool deep=false)
Construct a vector from a table and an iterator range.
static SortedCatalogT readFits(fits::Fits &fitsfile, int flags=0)
Read a FITS binary table from a file object already at the correct extension.
SortedCatalogT(SortedCatalogT const &)=default
const_iterator find(RecordId id) const
SortedCatalogT(std::shared_ptr< Table > const &table=std::shared_ptr< Table >())
Construct a vector from a table (or nothing).
SortedCatalogT< RecordT > subset(ndarray::Array< bool const, 1 > const &mask) const
Return the subset of a catalog corresponding to the True values of the given mask array.
static SortedCatalogT readFits(fits::MemFileManager &manager, int hdu=fits::DEFAULT_HDU, int flags=0)
Read a FITS binary table from a RAM file.
void sort()
Sort the vector in-place by ID.
static SortedCatalogT readFits(std::string const &filename, int hdu=fits::DEFAULT_HDU, int flags=0)
Read a FITS binary table from a regular file.
SortedCatalogT(SortedCatalogT< OtherRecordT > const &other)
Shallow copy constructor from a container containing a related record type.
SortedCatalogT(Schema const &schema)
Construct a vector from a schema, creating a table with Table::make(schema).
static ContainerT apply(afw::fits::Fits &fits, int ioFlags, std::shared_ptr< InputArchive > archive=std::shared_ptr< InputArchive >())
Create a new Catalog by reading a FITS binary table.
Definition FitsReader.h:71
const int DEFAULT_HDU
Specify that the default HDU should be read.
std::int64_t RecordId
Type used for unique IDs for records.
Definition misc.h:21