Partition algorithms. More...
Go to the source code of this file.
Namespaces | |
| te | |
| TerraLib. | |
| te::sam | |
| This is the namespace for the TerraLib Spatial Access Methods module. | |
| te::sam::kdtree | |
| This is the namespace for the K-d Tree Spatial Access Method. | |
Functions | |
| template<class CONTAINER , class COMPFUNCTOR > | |
| void | te::sam::kdtree::HoareFind (CONTAINER &A, const std::size_t &kthElement, const std::size_t &firstElement, const std::size_t &lastElement, const COMPFUNCTOR &compFunctor) |
| This function partition the container in two parts: k-1 elements to the left (elements less than or equals to k-th element) and the right part with all other elements (elements greater than or equal to k-th element). More... | |
| template<class CONTAINER , class LESSTHANX , class LESSTHANY > | |
| void | te::sam::kdtree::kdsort (CONTAINER &dataSet, const std::size_t &first, const std::size_t &last, const char &level, const LESSTHANX &lessThanCompFunctorByX, const LESSTHANY &lessThanCompFunctorByY) |
| This partition the container like a bidimensional K-d Tree using Hoare algorithms. More... | |
Partition algorithms.
Definition in file Partition.h.