Main Page | Modules | Namespace List | Class Hierarchy | Class List | File List | Namespace Members | Class Members | Related Pages

tbb::internal::quick_sort_range< RandomAccessIterator, Compare > Struct Template Reference
[Algorithms]

Range used in quicksort to split elements into subranges based on a value. More...

#include <parallel_sort.h>

List of all members.

Public Member Functions

 quick_sort_range (RandomAccessIterator begin_, size_t size_, const Compare &comp_)
bool empty () const
bool is_divisible () const
 quick_sort_range (quick_sort_range &range, split)

Public Attributes

const Compare & comp
RandomAccessIterator begin
size_t size

Static Public Attributes

const size_t grainsize = 500


Detailed Description

template<typename RandomAccessIterator, typename Compare>
struct tbb::internal::quick_sort_range< RandomAccessIterator, Compare >

Range used in quicksort to split elements into subranges based on a value.

The split operation selects a splitter and places all elements less than or equal to the value in the first range and the remaining elements in the second range.


The documentation for this struct was generated from the following file:

Copyright © 2005-2008 Intel Corporation. All Rights Reserved.

Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are registered trademarks or trademarks of Intel Corporation or its subsidiaries in the United States and other countries.

* Other names and brands may be claimed as the property of others.