![]() |
Shadowrun: Awakened 29 September 2011 - Build 871
|
#include "parallel_for.h"#include "blocked_range.h"#include <algorithm>#include <iterator>#include <functional>
Include dependency graph for Third Party Tech/TBB/tbb30_20100406oss_win/tbb30_20100406oss/include/tbb/parallel_sort.h:
This graph shows which files directly or indirectly include this file:Go to the source code of this file.
Namespaces | |
| namespace | tbb |
The namespace tbb contains all components of the library. | |
Functions | |
parallel_sort | |
See also requirements on iterators for parallel_sort. | |
| void | tbb::parallel_sort (RandomAccessIterator begin, RandomAccessIterator end, const Compare &comp) |
| Sorts the data in [begin,end) using the given comparator. | |
| void | tbb::parallel_sort (RandomAccessIterator begin, RandomAccessIterator end) |
Sorts the data in [begin,end) with a default comparator std::less<RandomAccessIterator> | |
| void | tbb::parallel_sort (T *begin, T *end) |
Sorts the data in the range [begin,end) with a default comparator std::less<T> | |
Copyright © 2007-2010 by The Shadowrun: Awakened Team. This work is licensed under the GNU Lesser General Public License 3.