| TerraLib 4.1

- Main Page
- Related Pages
- Modules
- Namespaces
- Classes
- Files
- Examples

Functions
Partition Algorithms

## Functions

template<class CONTAINER , class COMPFUNCTOR >
void | TeSAM::TeHoareFind (CONTAINER &A, const unsigned int &kthElement, const unsigned int &firstElement, const unsigned int &lastElement, const COMPFUNCTOR &compFunctor)
| This function partition the conteiner 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)
template<class CONTAINER , class LESSTHANX , class LESSTHANY >
void | TeSAM::kdsort (CONTAINER &dataSet, const unsigned int &first, const unsigned int &last, const char &level, const LESSTHANX &lessThanCompFunctorByX, const LESSTHANY &lessThanCompFunctorByY)
| Partition the conteiner like a bidimensional K-d Tree using Hoare algorithms.

## Detailed Description

Partition Algorithms.

## Function Documentation

template<class CONTAINER , class LESSTHANX , class LESSTHANY >

void TeSAM::kdsort | ( | CONTAINER & | dataSet,
|  | const unsigned int & | first,
|  | const unsigned int & | last,
|  | const char & | level,
|  | const LESSTHANX & | lessThanCompFunctorByX,
|  | const LESSTHANY & | lessThanCompFunctorByY
| ) |  |

Partition the conteiner like a bidimensional K-d Tree using Hoare algorithms.

template<class CONTAINER , class COMPFUNCTOR >

void TeSAM::TeHoareFind | ( | CONTAINER & | A,
|  | const unsigned int & | kthElement,
|  | const unsigned int & | firstElement,
|  | const unsigned int & | lastElement,
|  | const COMPFUNCTOR & | compFunctor
| ) |  |

This function partition the conteiner 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)

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines