![]() |
Rosetta Utilities
2014.16.56682
|
Class for keeping track of the closest N KDPoint objects by distance. More...
#include <KDPointList.hh>
Public Types | |
| typedef utility::vector1 < KDPointOP >::iterator | iterator |
| typedef utility::vector1 < KDPointOP >::const_iterator | const_iterator |
Public Types inherited from utility::pointer::ReferenceCount | |
| typedef platform::Size | Size |
| typedef platform::Size | size_type |
Public Member Functions | |
| virtual | ~KDPointList () |
| Automatically generated virtual destructor for class deriving directly from ReferenceCount. More... | |
| const_iterator | begin () const |
| const_iterator | end () const |
| iterator | begin () |
| iterator | end () |
| KDPointList (numeric::Size const n_to_keep) | |
| void | insert (KDPointOP pt) |
| numeric::Real | worst_distance () const |
| KDPointOP | operator[] (numeric::Size const pos) const |
| numeric::Size | size () const |
| numeric::Size | max_values () const |
| numeric::Real | distance_cutoff () const |
| void | distance_cutoff (numeric::Real const cutoff) |
| utility::vector1< KDPointOP > | sorted_values () |
| void | merge (KDPointList const &other) |
| merge another KDPointList with this KDPointList. This calls insert which is a little slow, and is a candidate for optimization if the insert() method shows up in profiling. More... | |
| void | show (std::ostream &out) const |
Public Member Functions inherited from utility::pointer::ReferenceCount | |
| void | ctor () |
| virtual | ~ReferenceCount () |
| Destructor. More... | |
| Size | ref_count () const |
| Reference count. More... | |
Private Member Functions | |
| void | update_heap_ () |
| void | update_size_ () |
Private Attributes | |
| numeric::Size | max_vals_ |
| numeric::Real | distance_cutoff_ |
| utility::vector1< KDPointOP > | container_ |
Additional Inherited Members | |
Protected Member Functions inherited from utility::pointer::ReferenceCount | |
| ReferenceCount () | |
| Default constructor. More... | |
| ReferenceCount (ReferenceCount const &) | |
| Copy constructor. More... | |
| ReferenceCount & | operator= (ReferenceCount const &) |
| Copy assignment. More... | |
Class for keeping track of the closest N KDPoint objects by distance.
|
virtual |
Automatically generated virtual destructor for class deriving directly from ReferenceCount.
Auto-generated virtual destructor
| numeric::kdtree::KDPointList::KDPointList | ( | numeric::Size const | n_to_keep | ) |
| utility::vector1< KDPointOP >::const_iterator numeric::kdtree::KDPointList::begin | ( | ) | const |
References container_.
Referenced by merge().
| utility::vector1< KDPointOP >::iterator numeric::kdtree::KDPointList::begin | ( | ) |
References container_.
| numeric::Real numeric::kdtree::KDPointList::distance_cutoff | ( | ) | const |
References distance_cutoff_.
Referenced by numeric::kdtree::nearest_neighbors(), and worst_distance().
| void numeric::kdtree::KDPointList::distance_cutoff | ( | numeric::Real const | cutoff | ) |
References basic::options::OptionKeys::cp::cutoff, and distance_cutoff_.
| utility::vector1< KDPointOP >::const_iterator numeric::kdtree::KDPointList::end | ( | ) | const |
References container_.
| utility::vector1< KDPointOP >::iterator numeric::kdtree::KDPointList::end | ( | ) |
References container_.
| void numeric::kdtree::KDPointList::insert | ( | KDPointOP | pt | ) |
References container_, update_heap_(), and update_size_().
Referenced by merge(), and numeric::kdtree::nearest_neighbors().
| numeric::Size numeric::kdtree::KDPointList::max_values | ( | ) | const |
References max_vals_.
Referenced by numeric::kdtree::nearest_neighbors(), and worst_distance().
| void numeric::kdtree::KDPointList::merge | ( | KDPointList const & | other | ) |
merge another KDPointList with this KDPointList. This calls insert which is a little slow, and is a candidate for optimization if the insert() method shows up in profiling.
References begin(), end(), and insert().
Referenced by numeric::kdtree::nearest_neighbors().
| KDPointOP numeric::kdtree::KDPointList::operator[] | ( | numeric::Size const | pos | ) | const |
References container_, and size().
| void numeric::kdtree::KDPointList::show | ( | std::ostream & | out | ) | const |
References container_, end(), and size().
| numeric::Size numeric::kdtree::KDPointList::size | ( | ) | const |
References container_.
Referenced by operator[](), and show().
| utility::vector1< KDPointOP > numeric::kdtree::KDPointList::sorted_values | ( | ) |
References container_.
|
private |
References container_.
Referenced by insert().
|
private |
References container_, and max_vals_.
Referenced by insert().
| numeric::Real numeric::kdtree::KDPointList::worst_distance | ( | ) | const |
References container_, distance_cutoff(), max_values(), and min().
Referenced by numeric::kdtree::nearest_neighbors().
|
private |
Referenced by begin(), end(), insert(), operator[](), show(), size(), sorted_values(), update_heap_(), update_size_(), and worst_distance().
|
private |
Referenced by distance_cutoff().
|
private |
Referenced by max_values(), and update_size_().
1.8.7