PCL
|
Functions | |
template<class FI , class T > | |
FI | pcl::BinarySearch (FI i, FI j, const T &v) noexcept |
template<class FI , class T , class BP > | |
FI | pcl::BinarySearch (FI i, FI j, const T &v, BP p) noexcept(noexcept(p)) |
template<class FI , class T , class BP1 , class BP2 > | |
FI | pcl::BinarySearch (FI i, FI j, const T &v, BP1 p1, BP2 p2) noexcept(noexcept(p1) &&noexcept(p2)) |
template<class FI , class T > | |
FI | pcl::BinarySearchLast (FI i, FI j, const T &v) noexcept |
template<class FI , class T , class BP > | |
FI | pcl::BinarySearchLast (FI i, FI j, const T &v, BP p) noexcept(noexcept(p)) |
template<class FI , class T > | |
FI | pcl::InsertionPoint (FI i, FI j, const T &v) noexcept |
template<class FI , class T , class BP > | |
FI | pcl::InsertionPoint (FI i, FI j, const T &v, BP p) noexcept(noexcept(p)) |
template<class FI , class T > | |
FI | pcl::LinearSearch (FI i, FI j, const T &v) noexcept |
template<class FI , class T , class BP > | |
FI | pcl::LinearSearch (FI i, FI j, const T &v, BP p) noexcept(noexcept(p)) |
template<class BI , class T > | |
BI | pcl::LinearSearchLast (BI i, BI j, const T &v) noexcept |
template<class BI , class T , class BP > | |
BI | pcl::LinearSearchLast (BI i, BI j, const T &v, BP p) noexcept(noexcept(p)) |
template<class FI1 , class FI2 > | |
FI1 | pcl::Search (FI1 i1, FI1 j1, FI2 i2, FI2 j2) noexcept |
template<class FI1 , class FI2 , class BP > | |
FI1 | pcl::Search (FI1 i1, FI1 j1, FI2 i2, FI2 j2, BP p) noexcept(noexcept(p)) |
template<class BI1 , class FI2 > | |
BI1 | pcl::SearchLast (BI1 i1, BI1 j1, FI2 i2, FI2 j2) noexcept |
template<class BI1 , class FI2 , class BP > | |
BI1 | pcl::SearchLast (BI1 i1, BI1 j1, FI2 i2, FI2 j2, BP p) noexcept(noexcept(p)) |
Template formal parameters:
FI Forward iterator
BI Bidirectional iterator
RI Random access iterator
UP Unary predicate
BP Binary predicate
T Item type
F Function
|
inlinenoexcept |
Generic binary search algorithm.
Returns the first iterator k in the range [i,j) such that *k == v. Returns j if no such occurrence of v is found.
The sequence [i,j) must be ordered in ascending order: for every pair a,b in [i,j) such that i precedes j, *j < *i must be false.
Definition at line 170 of file Search.h.
Referenced by pcl::JPLEphemeris::ConstantValue(), pcl::EphemerisFile::ConstantValue(), and pcl::EphemerisFile::IsConstantAvailable().
|
inlinenoexcept |
Generic binary search algorithm.
Returns the first iterator k in the range [i,j) such that both p( *k, v ) and p( v, *k ) are false. Returns j if no such occurrence of v is found.
The sequence [i,j) must be ordered in ascending order: for every pair a,b in [i,j) such that i precedes j, p( *j, *i ) must be false.
|
inlinenoexcept |
Generic binary search algorithm.
Returns the first iterator k in the range [i,j) such that both p1( *k, v ) and p2( v, *k ) are false. Returns j if no such occurrence of v is found.
The sequence [i,j) must be ordered in ascending order: for every pair a,b in [i,j) such that i precedes j, both p1( *j, *i ) and p2( *j, *i ) must be false.
|
inlinenoexcept |
Generic binary search algorithm (last occurrence).
Returns the last iterator k in the range [i,j) such that *k == v. Returns j if no such occurrence of v is found.
The sequence [i,j) must be ordered in ascending order: for every pair a,b in [i,j) such that i precedes j, *j < *i must be false.
|
inlinenoexcept |
Generic binary search algorithm (last occurrence).
Returns the last iterator k in the range [i,j) such that both p( *k, v ) and p( v, *k ) are false. Returns j if no such occurrence of v is found.
The sequence [i,j) must be ordered in ascending order: for every pair a,b in [i,j) such that i precedes j, p( *j, *i ) must be false.
|
inlinenoexcept |
Generic insertion point algorithm.
Returns an iterator k in the range [i,j) such that:
The sequence [i,j) must be ordered in ascending order: for every pair a,b in [i,j) such that i precedes j, *j < *i must be false.
The resulting iterator k corresponds to a location where the value v could be inserted in the [i,j) sequence without breaking the existing order of values, as defined by operator <.
Definition at line 326 of file Search.h.
Referenced by pcl::SortedArray< Node * >::Add(), and pcl::IndirectSortedArray< T, A >::Add().
|
inlinenoexcept |
Generic insertion point algorithm.
Returns an iterator k in the range [i,j) such that:
The sequence [i,j) must be ordered in ascending order: for every pair a,b in [i,j) such that i precedes j, p( *j, *i ) must be false.
The resulting iterator k corresponds to a location where the value v could be inserted in the [i,j) sequence without breaking the existing order of values, as defined by the binary predicate p.
|
inlinenoexcept |
Generic linear search algorithm.
Returns the first iterator k in the range [i,j) such that *k == v. Returns j if no such occurrence of v is found.
Definition at line 91 of file Search.h.
Referenced by pcl::GenericVector< sample *>::Contains(), pcl::GenericMatrix< coefficient >::Contains(), pcl::GenericVector< sample *>::Find(), pcl::GenericMatrix< coefficient >::Find(), and pcl::ReferenceArray< XMLNode >::Search().
|
inlinenoexcept |
|
inlinenoexcept |
Generic linear search algorithm (last occurrence).
Returns the last iterator k in the range [i,j) such that *k == v. Returns j if no such occurrence of v is found.
Definition at line 129 of file Search.h.
Referenced by pcl::GenericVector< sample *>::FindLast(), pcl::GenericMatrix< coefficient >::FindLast(), and pcl::ReferenceArray< XMLNode >::SearchLast().
|
inlinenoexcept |
|
inlinenoexcept |
Returns the starting iterator of the first subsequence within the range [i1,j1) that is identical to the sequence [i2,j2) when compared element by element, or j1 if no such subsequence is found.
Definition at line 397 of file Search.h.
References pcl::Distance().
Referenced by pcl::ReferenceArray< XMLNode >::Contains(), pcl::XPSD::SearchData< StarData >::ResetSearchResults(), pcl::Array< GenericVector< T > >::SearchSubset(), pcl::IndirectArray< MetaObject >::SearchSubset(), and pcl::ReferenceArray< XMLNode >::SearchSubset().
|
inlinenoexcept |
Returns the starting iterator of the first subsequence within the range [i1,j1) that corresponds to the sequence [i2,j2) when the binary predicate p is applied element by element, or j1 if no such subsequence is found.
Definition at line 423 of file Search.h.
References pcl::Distance().
|
inlinenoexcept |
Returns the starting iterator of the last subsequence within the range [i1,j1) that is identical to the sequence [i2,j2) when compared element by element, or j1 if no such subsequence is found.
Definition at line 449 of file Search.h.
References pcl::Distance().
Referenced by pcl::Array< GenericVector< T > >::SearchLastSubset(), pcl::IndirectArray< MetaObject >::SearchLastSubset(), and pcl::ReferenceArray< XMLNode >::SearchLastSubset().
|
inlinenoexcept |
Returns the starting iterator of the last subsequence within the range [i1,j1) that corresponds to the sequence [i2,j2) when the binary predicate p is applied element by element, or j1 if no such subsequence is found.
Definition at line 481 of file Search.h.
References pcl::Distance().