LSSTApplications  1.1.2+25,10.0+13,10.0+132,10.0+133,10.0+224,10.0+41,10.0+8,10.0-1-g0f53050+14,10.0-1-g4b7b172+19,10.0-1-g61a5bae+98,10.0-1-g7408a83+3,10.0-1-gc1e0f5a+19,10.0-1-gdb4482e+14,10.0-11-g3947115+2,10.0-12-g8719d8b+2,10.0-15-ga3f480f+1,10.0-2-g4f67435,10.0-2-gcb4bc6c+26,10.0-28-gf7f57a9+1,10.0-3-g1bbe32c+14,10.0-3-g5b46d21,10.0-4-g027f45f+5,10.0-4-g86f66b5+2,10.0-4-gc4fccf3+24,10.0-40-g4349866+2,10.0-5-g766159b,10.0-5-gca2295e+25,10.0-6-g462a451+1
LSSTDataManagementBasePackage
SeedList.h
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 
31 #ifndef LSST_AP_CLUSTER_DETAIL_SEEDLIST_H
32 #define LSST_AP_CLUSTER_DETAIL_SEEDLIST_H
33 
34 #include "../../Common.h"
35 #include "KDTree.h"
36 
37 
38 namespace lsst { namespace ap { namespace cluster { namespace detail {
39 
44 template <int K, typename DataT>
45 class SeedList {
46 public:
47  SeedList(Point<K, DataT> * points, int numPoints);
48  ~SeedList();
49 
50  inline bool empty() const;
51  inline int size() const;
52  inline int capacity() const;
53  inline int pop();
54  inline void add(int i);
55  inline void update(int i, double reach);
56 
57  bool checkInvariants() const;
58 
59 private:
60  boost::scoped_array<int> _heap;
62  int _size;
64 
65  inline void siftUp(int heapIndex, int pointIndex);
66  inline void siftDown(int pointIndex);
67 };
68 
69 }}}} // namespace lsst:ap::cluster::detail
70 
71 #endif // LSST_AP_CLUSTER_DETAIL_SEEDLIST_H
void siftUp(int heapIndex, int pointIndex)
Definition: SeedList.cc:137
Low-level k-d tree class used by the OPTICS implementation.
std::vector< SourceCatalog > const cluster(SourceCatalog const &sources, ClusteringControl const &control)
Definition: clustering.cc:578
Point< K, DataT > * _points
Definition: SeedList.h:61
void update(int i, double reach)
Definition: SeedList.cc:119
SeedList(Point< K, DataT > *points, int numPoints)
Definition: SeedList.cc:40
boost::scoped_array< int > _heap
Definition: SeedList.h:60
int capacity() const
Returns the capacity of this seed list.
Definition: SeedList.cc:64
int size() const
Returns the number of entries in this seed list.
Definition: SeedList.cc:58
void siftDown(int pointIndex)
Definition: SeedList.cc:156
bool empty() const
Returns true if this seed list contains no entries.
Definition: SeedList.cc:52