sorting.h File Reference

#include <algorithm>

Namespaces
	tigl
	The CTiglShapeCache class acts as a storage for all kinds of intermediate shape results in order to improve speed of reoccurent calculations.

Functions
template<class ForwardIterator , class UnaryPredicate >
void	tigl::follow_sort (ForwardIterator begin, ForwardIterator end, UnaryPredicate follows)
template<class ForwardIterator >
void	tigl::rotate_right (ForwardIterator begin, ForwardIterator last)