Hilbert_sort_d<Traits, PolicyTag>

Navigation: Up Table of Contents Package Overview Bibliography Index Title Acknowledging CGAL

CGAL::Hilbert_sort_d<Traits, PolicyTag>

Definition

The function object Hilbert_sort_d<Traits, PolicyTag> sorts iterator ranges of Traits::Point_d along a Hilbert curve by recursively subdividing at the median or the middle depending on the PolicyTag.

Requirements

Traits is a model for SpatialSortingTraits_d.

Creation

Hilbert_sort_d<Traits, PolicyTag> o ( const Traits &traits = Traits());
	constructs an instance with traits as traits class instance.

Operations

template <class RandomAccessIterator>

void

o.operator() ( RandomAccessIterator begin, RandomAccessIterator end) const

sorts the range [begin, end).

Requirement:

RandomAccessIterator::value_type equals to Traits::Point_d.

Next: Multiscale_sort<Sort>

Navigation: Up Table of Contents Package Overview Bibliography Index Title Acknowledging CGAL

CGAL Open Source Project. Release 4.1. 23 October 2012.