Robotics Library  0.7.0
KdtreeBoundingBoxNearestNeighbors.h
Go to the documentation of this file.
1 //
2 // Copyright (c) 2009, Markus Rickert
3 // All rights reserved.
4 //
5 // Redistribution and use in source and binary forms, with or without
6 // modification, are permitted provided that the following conditions are met:
7 //
8 // * Redistributions of source code must retain the above copyright notice,
9 // this list of conditions and the following disclaimer.
10 // * Redistributions in binary form must reproduce the above copyright notice,
11 // this list of conditions and the following disclaimer in the documentation
12 // and/or other materials provided with the distribution.
13 //
14 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
15 // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
18 // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
19 // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
20 // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
21 // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
22 // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
23 // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
24 // POSSIBILITY OF SUCH DAMAGE.
25 //
26 
27 #ifndef RL_PLAN_KDTREEBOUNDINGBOXNEARESTNEIGHBORS_H
28 #define RL_PLAN_KDTREEBOUNDINGBOXNEARESTNEIGHBORS_H
29 
31 
32 #include "NearestNeighbors.h"
33 
34 namespace rl
35 {
36  namespace plan
37  {
38  class Model;
39 
41  {
42  public:
44 
46 
47  void clear();
48 
49  bool empty() const;
50 
51  ::boost::optional< ::std::size_t> getChecks() const;
52 
53  ::std::size_t getNodeDataMax() const;
54 
55  ::std::vector<NearestNeighbors::Neighbor> nearest(const NearestNeighbors::Value& query, const ::std::size_t& k, const bool& sorted = true) const;
56 
57  void push(const NearestNeighbors::Value& value);
58 
59  void setChecks(const ::boost::optional< ::std::size_t>& checks);
60 
61  void setNodeDataMax(const ::std::size_t& nodeDataMax);
62 
63  ::std::size_t size() const;
64 
65  protected:
66 
67  private:
69  };
70  }
71 }
72 
73 #endif // RL_PLAN_KDTREEBOUNDINGBOXNEARESTNEIGHBORS_H
void clear()
Definition: KdtreeBoundingBoxNearestNeighbors.cpp:45
Definition: Metric.h:46
KdtreeBoundingBoxNearestNeighbors(Model *model)
Definition: KdtreeBoundingBoxNearestNeighbors.cpp:34
Definition: NearestNeighbors.h:41
::std::vector< NearestNeighbors::Neighbor > nearest(const NearestNeighbors::Value &query, const ::std::size_t &k, const bool &sorted=true) const
Definition: KdtreeBoundingBoxNearestNeighbors.cpp:69
void setChecks(const ::boost::optional< ::std::size_t > &checks)
Definition: KdtreeBoundingBoxNearestNeighbors.cpp:81
::boost::optional< ::std::size_t > getChecks() const
Definition: KdtreeBoundingBoxNearestNeighbors.cpp:57
k-d tree.
Definition: KdtreeBoundingBoxNearestNeighbors.h:56
Definition: Model.h:41
void push(const NearestNeighbors::Value &value)
Definition: KdtreeBoundingBoxNearestNeighbors.cpp:75
Robotics Library.
Definition: AnalogInput.cpp:29
::std::size_t getNodeDataMax() const
Definition: KdtreeBoundingBoxNearestNeighbors.cpp:63
Definition: KdtreeBoundingBoxNearestNeighbors.h:40
bool empty() const
Definition: KdtreeBoundingBoxNearestNeighbors.cpp:51
void setNodeDataMax(const ::std::size_t &nodeDataMax)
Definition: KdtreeBoundingBoxNearestNeighbors.cpp:87
::std::size_t size() const
Definition: KdtreeBoundingBoxNearestNeighbors.cpp:93
::rl::math::KdtreeBoundingBoxNearestNeighbors< Metric > container
Definition: KdtreeBoundingBoxNearestNeighbors.h:68
virtual ~KdtreeBoundingBoxNearestNeighbors()
Definition: KdtreeBoundingBoxNearestNeighbors.cpp:40