Search.h File Reference

#include <pcl/Defs.h>
#include <pcl/Iterator.h>

Go to the source code of this file.

Namespaces
	pcl
	PCL root namespace.

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))