PCL

Functions  
template<class RI >  
RI  pcl::Select (RI i, RI j, distance_type k) 
template<class RI , class BP >  
RI  pcl::Select (RI i, RI j, distance_type k, BP p) 

inline 
Generic quick selection algorithm.
Given a range defined by two random access iterators [i,j) and a distance k, such that ji > k, returns an iterator t whose associated value is the kth element in the sorted sequence [i,j) in ascending order.
For example, the following call:
will return the median of the distribution of elements in the [i,j) sequence: the central value for which the probabilities that a greater and a lesser element exist are equal.
References
Definition at line 165 of file Selection.h.
References pcl::ItemType().
Referenced by pcl::GenericVector< sample *>::OrderStatistic(), and pcl::TreeBox::Node::Unselect().

inline 
Generic quick selection algorithm.
Given a range defined by two random access iterators [i,j) and a distance k, such that ji > k, returns an iterator t whose associated value is the kth element in the sorted sequence [i,j) in ascending order. Element comparison is given by a binary predicate p such that p( a, b ) is true for any pair a, b of elements such that a precedes b.
See Select( RI, RI, distance_type ) for more information.
Definition at line 238 of file Selection.h.
References pcl::ItemType().