You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
162 lines
5.6 KiB
162 lines
5.6 KiB
11 years ago
|
/*
|
||
|
* Copyright 2008-2012 NVIDIA Corporation
|
||
|
*
|
||
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
||
|
* you may not use this file except in compliance with the License.
|
||
|
* You may obtain a copy of the License at
|
||
|
*
|
||
|
* http://www.apache.org/licenses/LICENSE-2.0
|
||
|
*
|
||
|
* Unless required by applicable law or agreed to in writing, software
|
||
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
||
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||
|
* See the License for the specific language governing permissions and
|
||
|
* limitations under the License.
|
||
|
*/
|
||
|
|
||
|
|
||
|
#include <thrust/reverse.h>
|
||
|
#include <thrust/detail/type_traits.h>
|
||
|
#include <thrust/iterator/iterator_traits.h>
|
||
|
#include <thrust/system/detail/internal/scalar/stable_merge_sort.h>
|
||
|
#include <thrust/system/detail/internal/scalar/stable_primitive_sort.h>
|
||
|
|
||
|
namespace thrust
|
||
|
{
|
||
|
namespace system
|
||
|
{
|
||
|
namespace detail
|
||
|
{
|
||
|
namespace internal
|
||
|
{
|
||
|
namespace scalar
|
||
|
{
|
||
|
namespace sort_detail
|
||
|
{
|
||
|
|
||
|
////////////////////
|
||
|
// Primitive Sort //
|
||
|
////////////////////
|
||
|
|
||
|
template<typename RandomAccessIterator,
|
||
|
typename StrictWeakOrdering>
|
||
|
void stable_sort(RandomAccessIterator first,
|
||
|
RandomAccessIterator last,
|
||
|
StrictWeakOrdering comp,
|
||
|
thrust::detail::true_type)
|
||
|
{
|
||
|
thrust::system::detail::internal::scalar::stable_primitive_sort(first, last);
|
||
|
|
||
|
// if comp is greater<T> then reverse the keys
|
||
|
typedef typename thrust::iterator_traits<RandomAccessIterator>::value_type KeyType;
|
||
|
const static bool reverse = thrust::detail::is_same<StrictWeakOrdering, typename thrust::greater<KeyType> >::value;
|
||
|
|
||
|
if (reverse)
|
||
|
thrust::reverse(first, last);
|
||
|
}
|
||
|
|
||
|
template<typename RandomAccessIterator1,
|
||
|
typename RandomAccessIterator2,
|
||
|
typename StrictWeakOrdering>
|
||
|
void stable_sort_by_key(RandomAccessIterator1 first1,
|
||
|
RandomAccessIterator1 last1,
|
||
|
RandomAccessIterator2 first2,
|
||
|
StrictWeakOrdering comp,
|
||
|
thrust::detail::true_type)
|
||
|
{
|
||
|
// if comp is greater<T> then reverse the keys and values
|
||
|
typedef typename thrust::iterator_traits<RandomAccessIterator1>::value_type KeyType;
|
||
|
const static bool reverse = thrust::detail::is_same<StrictWeakOrdering, typename thrust::greater<KeyType> >::value;
|
||
|
|
||
|
// note, we also have to reverse the (unordered) input to preserve stability
|
||
|
if (reverse)
|
||
|
{
|
||
|
thrust::reverse(first1, last1);
|
||
|
thrust::reverse(first2, first2 + (last1 - first1));
|
||
|
}
|
||
|
|
||
|
thrust::system::detail::internal::scalar::stable_primitive_sort_by_key(first1, last1, first2);
|
||
|
|
||
|
if (reverse)
|
||
|
{
|
||
|
thrust::reverse(first1, last1);
|
||
|
thrust::reverse(first2, first2 + (last1 - first1));
|
||
|
}
|
||
|
}
|
||
|
|
||
|
////////////////
|
||
|
// Merge Sort //
|
||
|
////////////////
|
||
|
|
||
|
template<typename RandomAccessIterator,
|
||
|
typename StrictWeakOrdering>
|
||
|
void stable_sort(RandomAccessIterator first,
|
||
|
RandomAccessIterator last,
|
||
|
StrictWeakOrdering comp,
|
||
|
thrust::detail::false_type)
|
||
|
{
|
||
|
thrust::system::detail::internal::scalar::stable_merge_sort(first, last, comp);
|
||
|
}
|
||
|
|
||
|
template<typename RandomAccessIterator1,
|
||
|
typename RandomAccessIterator2,
|
||
|
typename StrictWeakOrdering>
|
||
|
void stable_sort_by_key(RandomAccessIterator1 first1,
|
||
|
RandomAccessIterator1 last1,
|
||
|
RandomAccessIterator2 first2,
|
||
|
StrictWeakOrdering comp,
|
||
|
thrust::detail::false_type)
|
||
|
{
|
||
|
thrust::system::detail::internal::scalar::stable_merge_sort_by_key(first1, last1, first2, comp);
|
||
|
}
|
||
|
|
||
|
|
||
|
} // end namespace sort_detail
|
||
|
|
||
|
template<typename RandomAccessIterator,
|
||
|
typename StrictWeakOrdering>
|
||
|
void stable_sort(RandomAccessIterator first,
|
||
|
RandomAccessIterator last,
|
||
|
StrictWeakOrdering comp)
|
||
|
{
|
||
|
typedef typename thrust::iterator_traits<RandomAccessIterator>::value_type KeyType;
|
||
|
static const bool use_primitive_sort = thrust::detail::is_arithmetic<KeyType>::value &&
|
||
|
(thrust::detail::is_same<StrictWeakOrdering, typename thrust::less<KeyType> >::value ||
|
||
|
thrust::detail::is_same<StrictWeakOrdering, typename thrust::greater<KeyType> >::value);
|
||
|
|
||
|
// supress unused variable warning
|
||
|
(void) use_primitive_sort;
|
||
|
|
||
|
thrust::system::detail::internal::scalar::sort_detail::stable_sort
|
||
|
(first, last, comp,
|
||
|
thrust::detail::integral_constant<bool, use_primitive_sort>());
|
||
|
}
|
||
|
|
||
|
template<typename RandomAccessIterator1,
|
||
|
typename RandomAccessIterator2,
|
||
|
typename StrictWeakOrdering>
|
||
|
void stable_sort_by_key(RandomAccessIterator1 first1,
|
||
|
RandomAccessIterator1 last1,
|
||
|
RandomAccessIterator2 first2,
|
||
|
StrictWeakOrdering comp)
|
||
|
{
|
||
|
typedef typename thrust::iterator_traits<RandomAccessIterator1>::value_type KeyType;
|
||
|
static const bool use_primitive_sort = thrust::detail::is_arithmetic<KeyType>::value &&
|
||
|
(thrust::detail::is_same<StrictWeakOrdering, typename thrust::less<KeyType> >::value ||
|
||
|
thrust::detail::is_same<StrictWeakOrdering, typename thrust::greater<KeyType> >::value);
|
||
|
|
||
|
// supress unused variable warning
|
||
|
(void) use_primitive_sort;
|
||
|
|
||
|
thrust::system::detail::internal::scalar::sort_detail::stable_sort_by_key
|
||
|
(first1, last1, first2, comp,
|
||
|
thrust::detail::integral_constant<bool, use_primitive_sort>());
|
||
|
}
|
||
|
|
||
|
} // end namespace scalar
|
||
|
} // end namespace internal
|
||
|
} // end namespace detail
|
||
|
} // end namespace system
|
||
|
} // end namespace thrust
|
||
|
|