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.
149 lines
3.6 KiB
149 lines
3.6 KiB
/* |
|
* 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. |
|
*/ |
|
|
|
#pragma once |
|
|
|
#include <thrust/detail/config.h> |
|
|
|
#include <thrust/iterator/iterator_traits.h> |
|
#include <thrust/detail/function.h> |
|
#include <thrust/system/detail/internal/scalar/copy_backward.h> |
|
|
|
namespace thrust |
|
{ |
|
namespace system |
|
{ |
|
namespace detail |
|
{ |
|
namespace internal |
|
{ |
|
namespace scalar |
|
{ |
|
|
|
template <typename RandomAccessIterator, |
|
typename StrictWeakOrdering> |
|
void insertion_sort(RandomAccessIterator first, |
|
RandomAccessIterator last, |
|
StrictWeakOrdering comp) |
|
{ |
|
typedef typename thrust::iterator_value<RandomAccessIterator>::type value_type; |
|
|
|
if (first == last) return; |
|
|
|
// wrap comp |
|
thrust::detail::host_function< |
|
StrictWeakOrdering, |
|
bool |
|
> wrapped_comp(comp); |
|
|
|
for(RandomAccessIterator i = first + 1; i != last; ++i) |
|
{ |
|
value_type tmp = *i; |
|
|
|
if (wrapped_comp(tmp, *first)) |
|
{ |
|
// tmp is the smallest value encountered so far |
|
thrust::system::detail::internal::scalar::copy_backward(first, i, i + 1); |
|
|
|
*first = tmp; |
|
} |
|
else |
|
{ |
|
// tmp is not the smallest value, can avoid checking for j == first |
|
RandomAccessIterator j = i; |
|
RandomAccessIterator k = i - 1; |
|
|
|
while(wrapped_comp(tmp, *k)) |
|
{ |
|
*j = *k; |
|
j = k; |
|
--k; |
|
} |
|
|
|
*j = tmp; |
|
} |
|
} |
|
} |
|
|
|
template <typename RandomAccessIterator1, |
|
typename RandomAccessIterator2, |
|
typename StrictWeakOrdering> |
|
void insertion_sort_by_key(RandomAccessIterator1 first1, |
|
RandomAccessIterator1 last1, |
|
RandomAccessIterator2 first2, |
|
StrictWeakOrdering comp) |
|
{ |
|
typedef typename thrust::iterator_value<RandomAccessIterator1>::type value_type1; |
|
typedef typename thrust::iterator_value<RandomAccessIterator2>::type value_type2; |
|
|
|
if (first1 == last1) return; |
|
|
|
// wrap comp |
|
thrust::detail::host_function< |
|
StrictWeakOrdering, |
|
bool |
|
> wrapped_comp(comp); |
|
|
|
RandomAccessIterator1 i1 = first1 + 1; |
|
RandomAccessIterator2 i2 = first2 + 1; |
|
|
|
for(; i1 != last1; ++i1, ++i2) |
|
{ |
|
value_type1 tmp1 = *i1; |
|
value_type2 tmp2 = *i2; |
|
|
|
if (wrapped_comp(tmp1, *first1)) |
|
{ |
|
// tmp is the smallest value encountered so far |
|
thrust::system::detail::internal::scalar::copy_backward(first1, i1, i1 + 1); |
|
thrust::system::detail::internal::scalar::copy_backward(first2, i2, i2 + 1); |
|
|
|
*first1 = tmp1; |
|
*first2 = tmp2; |
|
} |
|
else |
|
{ |
|
// tmp is not the smallest value, can avoid checking for j == first |
|
RandomAccessIterator1 j1 = i1; |
|
RandomAccessIterator1 k1 = i1 - 1; |
|
|
|
RandomAccessIterator2 j2 = i2; |
|
RandomAccessIterator2 k2 = i2 - 1; |
|
|
|
while(wrapped_comp(tmp1, *k1)) |
|
{ |
|
*j1 = *k1; |
|
*j2 = *k2; |
|
|
|
j1 = k1; |
|
j2 = k2; |
|
|
|
--k1; |
|
--k2; |
|
} |
|
|
|
*j1 = tmp1; |
|
*j2 = tmp2; |
|
} |
|
} |
|
} |
|
|
|
} // end namespace scalar |
|
} // end namespace internal |
|
} // end namespace detail |
|
} // end namespace system |
|
} // end namespace thrust |
|
|
|
|