LSSTApplications  8.0.0.0+107,8.0.0.1+13,9.1+18,9.2,master-g084aeec0a4,master-g0aced2eed8+6,master-g15627eb03c,master-g28afc54ef9,master-g3391ba5ea0,master-g3d0fb8ae5f,master-g4432ae2e89+36,master-g5c3c32f3ec+17,master-g60f1e072bb+1,master-g6a3ac32d1b,master-g76a88a4307+1,master-g7bce1f4e06+57,master-g8ff4092549+31,master-g98e65bf68e,master-ga6b77976b1+53,master-gae20e2b580+3,master-gb584cd3397+53,master-gc5448b162b+1,master-gc54cf9771d,master-gc69578ece6+1,master-gcbf758c456+22,master-gcec1da163f+63,master-gcf15f11bcc,master-gd167108223,master-gf44c96c709
LSSTDataManagementBasePackage
Results.cc
Go to the documentation of this file.
1 // -*- lsst-c++ -*-
2 
3 /*
4  * LSST Data Management System
5  * Copyright 2008, 2009, 2010 LSST Corporation.
6  *
7  * This product includes software developed by the
8  * LSST Project (http://www.lsst.org/).
9  *
10  * This program is free software: you can redistribute it and/or modify
11  * it under the terms of the GNU General Public License as published by
12  * the Free Software Foundation, either version 3 of the License, or
13  * (at your option) any later version.
14  *
15  * This program is distributed in the hope that it will be useful,
16  * but WITHOUT ANY WARRANTY; without even the implied warranty of
17  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18  * GNU General Public License for more details.
19  *
20  * You should have received a copy of the LSST License Statement and
21  * the GNU General Public License along with this program. If not,
22  * see <http://www.lsstcorp.org/LegalNotices/>.
23  */
24 
25 
33 #include "lsst/ap/Results.h"
34 
35 
36 // -- PersistableMatchPairVector ----------------
37 
39  lsst::daf::base::Citizen(typeid(*this)),
40  _matchPairs()
41 {}
42 
43 
45  lsst::daf::base::Citizen(typeid(*this)),
46  _matchPairs(matchPairs)
47 {}
48 
49 
51 
53  if (_matchPairs.size() != other.size()) {
54  return false;
55  }
56  return std::equal(_matchPairs.begin(), _matchPairs.end(), other.begin());
57 }
58 
59 
60 // -- PersistableIdPairVector ----------------
61 
63  lsst::daf::base::Citizen(typeid(*this)),
64  _idPairs()
65 {}
66 
67 
69  lsst::daf::base::Citizen(typeid(*this)),
70  _idPairs(idPairs)
71 {}
72 
73 
75 
77  if (_idPairs.size() != other.size()) {
78  return false;
79  }
80  return std::equal(_idPairs.begin(), _idPairs.end(), other.begin());
81 }
82 
83 
84 // -- IdVector ----------------
85 
87  lsst::daf::base::Citizen(typeid(*this)),
88  _ids()
89 {}
90 
91 
93  lsst::daf::base::Citizen(typeid(*this)),
94  _ids(ids)
95 {}
96 
97 
99 
101  if (_ids.size() != other.size()) {
102  return false;
103  }
104  return std::equal(_ids.begin(), _ids.end(), other.begin());
105 }
106 
std::vector< boost::int64_t > IdVector
A list of integer ids.
Definition: Results.h:127
std::vector< MatchPair > MatchPairVector
A list of MatchPair instances.
Definition: Results.h:123
bool operator==(IdPairVector const &other) const
Definition: Results.cc:76
bool operator==(IdVector const &other) const
Definition: Results.cc:100
std::vector< IdPair > IdPairVector
A list of IdPair instances.
Definition: Results.h:125
bool operator==(MatchPairVector const &other) const
Definition: Results.cc:52
< unspecified-expression-type > equal(ExpressionBase< Operand > const &operand, Scalar const &scalar)
Definition: operators.h:796
Persistable vectors for association pipeline results.