Class for keeping track of the closest N KDPoint objects by distance. More...

#include <KDPointList.hh>

Inheritance diagram for numeric::kdtree::KDPointList:

Collaboration diagram for numeric::kdtree::KDPointList:

Public Types
typedef utility::vector1 < KDPointOP >::iterator	iterator
typedef utility::vector1 < KDPointOP >::const_iterator	const_iterator
Public Member Functions
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.
void	show (std::ostream &out) const

Detailed Description

Class for keeping track of the closest N KDPoint objects by distance.

Member Typedef Documentation

typedef utility::vector1< KDPointOP >::const_iterator numeric::kdtree::KDPointList::const_iterator

typedef utility::vector1< KDPointOP >::iterator numeric::kdtree::KDPointList::iterator

Constructor & Destructor Documentation

numeric::kdtree::KDPointList::KDPointList ( numeric::Size const n_to_keep )

Member Function Documentation

utility::vector1< KDPointOP >::const_iterator numeric::kdtree::KDPointList::begin ( ) const

Referenced by merge().

utility::vector1< KDPointOP >::iterator numeric::kdtree::KDPointList::begin ( )

numeric::Real numeric::kdtree::KDPointList::distance_cutoff ( ) const

Referenced by numeric::kdtree::nearest_neighbors(), and worst_distance().

void numeric::kdtree::KDPointList::distance_cutoff ( numeric::Real const cutoff )

utility::vector1< KDPointOP >::iterator numeric::kdtree::KDPointList::end ( )

utility::vector1< KDPointOP >::const_iterator numeric::kdtree::KDPointList::end ( ) const

Referenced by merge(), and show().

void numeric::kdtree::KDPointList::insert ( KDPointOP pt )

Referenced by merge(), and numeric::kdtree::nearest_neighbors().

numeric::Size numeric::kdtree::KDPointList::max_values ( ) const

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 make_symmdef_file_denovo::pos, and size().

void numeric::kdtree::KDPointList::show ( std::ostream & out ) const

References end(), and size().

numeric::Size numeric::kdtree::KDPointList::size ( ) const

Referenced by operator[](), and show().

utility::vector1< KDPointOP > numeric::kdtree::KDPointList::sorted_values ( )