flann::cuda::heap Namespace Reference

Functions
template<class GreaterThan , class RandomAccessIterator >
__host__ __device__ void	sift_down (RandomAccessIterator array, size_t begin, size_t length, GreaterThan c=GreaterThan())
template<class GreaterThan , class RandomAccessIterator >
__host__ __device__ void	make_heap (RandomAccessIterator begin, size_t length, GreaterThan c=GreaterThan())
template<class GreaterThan , class RandomAccessIterator >
__host__ __device__ bool	is_heap (RandomAccessIterator begin, size_t length, GreaterThan c=GreaterThan())
template<class GreaterThan , class RandomAccessIterator , class RandomAccessIterator2 >
__host__ __device__ void	sift_down (RandomAccessIterator key, RandomAccessIterator2 value, size_t begin, size_t length, GreaterThan c=GreaterThan())
template<class GreaterThan , class RandomAccessIterator , class RandomAccessIterator2 >
__host__ __device__ void	make_heap (RandomAccessIterator key, RandomAccessIterator2 value, size_t length, GreaterThan c=GreaterThan())

Function Documentation

is_heap()

template<class GreaterThan , class RandomAccessIterator >

__host__ __device__ bool flann::cuda::heap::is_heap	(	RandomAccessIterator	begin,
		size_t	length,
		GreaterThan	c = GreaterThan()
	)

verifies if the array is a max-heap if c is a less-than comparator, it will verify if it is a min-heap

Definition at line 87 of file heap.h.

References length().

make_heap() [1/2]

template<class GreaterThan , class RandomAccessIterator >

__host__ __device__ void flann::cuda::heap::make_heap	(	RandomAccessIterator	begin,
		size_t	length,
		GreaterThan	c = GreaterThan()
	)

creates a max-heap in the array beginning at begin of length "length" if c is a less-than comparator, it will create a min-heap

Definition at line 73 of file heap.h.

References length(), and sift_down().

Referenced by flann::KNNResultSet2< DistanceType >::addPoint(), flann::KNNRadiusResultSet< DistanceType >::addPoint(), flann::cuda::KnnResultSet< DistanceType, useHeap >::finish(), flann::cuda::RadiusKnnResultSet< DistanceType, useHeap >::finish(), flann::cuda::KnnRadiusResultSet< DistanceType, useHeap >::finish(), flann::cuda::RadiusResultSet< DistanceType >::finish(), flann::cuda::KnnResultSet< DistanceType, useHeap >::insert(), flann::cuda::RadiusKnnResultSet< DistanceType, useHeap >::insert(), and flann::cuda::KnnRadiusResultSet< DistanceType, useHeap >::insert().

make_heap() [2/2]

template<class GreaterThan , class RandomAccessIterator , class RandomAccessIterator2 >

__host__ __device__ void flann::cuda::heap::make_heap	(	RandomAccessIterator	key,
		RandomAccessIterator2	value,
		size_t	length,
		GreaterThan	c = GreaterThan()
	)

creates a max-heap in the array beginning at begin of length "length" if c is a less-than comparator, it will create a min-heap

Definition at line 125 of file heap.h.

References length(), and sift_down().

sift_down() [1/2]

template<class GreaterThan , class RandomAccessIterator >

__host__ __device__ void flann::cuda::heap::sift_down	(	RandomAccessIterator	array,
		size_t	begin,
		size_t	length,
		GreaterThan	c = GreaterThan()
	)

moves an element down the heap until all children are smaller than the element if c is a less-than comparator, it do this until all children are larger

Definition at line 50 of file heap.h.

References length(), and flann::cuda::swap().

Referenced by flann::cuda::KnnResultSet< DistanceType, useHeap >::finish(), flann::cuda::RadiusKnnResultSet< DistanceType, useHeap >::finish(), flann::cuda::KnnRadiusResultSet< DistanceType, useHeap >::finish(), flann::cuda::RadiusResultSet< DistanceType >::finish(), flann::cuda::KnnResultSet< DistanceType, useHeap >::insert(), flann::cuda::RadiusKnnResultSet< DistanceType, useHeap >::insert(), flann::cuda::KnnRadiusResultSet< DistanceType, useHeap >::insert(), and make_heap().

sift_down() [2/2]

template<class GreaterThan , class RandomAccessIterator , class RandomAccessIterator2 >

__host__ __device__ void flann::cuda::heap::sift_down	(	RandomAccessIterator	key,
		RandomAccessIterator2	value,
		size_t	begin,
		size_t	length,
		GreaterThan	c = GreaterThan()
	)

moves an element down the heap until all children are smaller than the element if c is a less-than comparator, it do this until all children are larger

Definition at line 101 of file heap.h.

References length(), and flann::cuda::swap().