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.
110 lines
3.0 KiB
110 lines
3.0 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.
|
||
|
|
*/
|
||
|
|
|
||
|
|
|
||
|
|
/*! \file unique_by_key.h
|
||
|
|
* \brief Sequential implementations of unique_by_key algorithms.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#pragma once
|
||
|
|
|
||
|
|
#include <thrust/detail/config.h>
|
||
|
|
#include <thrust/iterator/iterator_traits.h>
|
||
|
|
#include <thrust/pair.h>
|
||
|
|
|
||
|
|
namespace thrust
|
||
|
|
{
|
||
|
|
namespace system
|
||
|
|
{
|
||
|
|
namespace detail
|
||
|
|
{
|
||
|
|
namespace internal
|
||
|
|
{
|
||
|
|
namespace scalar
|
||
|
|
{
|
||
|
|
|
||
|
|
template<typename InputIterator1,
|
||
|
|
typename InputIterator2,
|
||
|
|
typename OutputIterator1,
|
||
|
|
typename OutputIterator2,
|
||
|
|
typename BinaryPredicate>
|
||
|
|
thrust::pair<OutputIterator1,OutputIterator2>
|
||
|
|
unique_by_key_copy(InputIterator1 keys_first,
|
||
|
|
InputIterator1 keys_last,
|
||
|
|
InputIterator2 values_first,
|
||
|
|
OutputIterator1 keys_output,
|
||
|
|
OutputIterator2 values_output,
|
||
|
|
BinaryPredicate binary_pred)
|
||
|
|
{
|
||
|
|
typedef typename thrust::iterator_traits<InputIterator1>::value_type InputKeyType;
|
||
|
|
typedef typename thrust::iterator_traits<OutputIterator2>::value_type OutputValueType;
|
||
|
|
|
||
|
|
if(keys_first != keys_last)
|
||
|
|
{
|
||
|
|
InputKeyType temp_key = *keys_first;
|
||
|
|
OutputValueType temp_value = *values_first;
|
||
|
|
|
||
|
|
for(++keys_first, ++values_first;
|
||
|
|
keys_first != keys_last;
|
||
|
|
++keys_first, ++values_first)
|
||
|
|
{
|
||
|
|
InputKeyType key = *keys_first;
|
||
|
|
OutputValueType value = *values_first;
|
||
|
|
|
||
|
|
if(!binary_pred(temp_key, key))
|
||
|
|
{
|
||
|
|
*keys_output = temp_key;
|
||
|
|
*values_output = temp_value;
|
||
|
|
|
||
|
|
++keys_output;
|
||
|
|
++values_output;
|
||
|
|
|
||
|
|
temp_key = key;
|
||
|
|
temp_value = value;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
*keys_output = temp_key;
|
||
|
|
*values_output = temp_value;
|
||
|
|
|
||
|
|
++keys_output;
|
||
|
|
++values_output;
|
||
|
|
}
|
||
|
|
|
||
|
|
return thrust::make_pair(keys_output, values_output);
|
||
|
|
} // end unique_by_key_copy()
|
||
|
|
|
||
|
|
|
||
|
|
template<typename ForwardIterator1,
|
||
|
|
typename ForwardIterator2,
|
||
|
|
typename BinaryPredicate>
|
||
|
|
thrust::pair<ForwardIterator1,ForwardIterator2>
|
||
|
|
unique_by_key(ForwardIterator1 keys_first,
|
||
|
|
ForwardIterator1 keys_last,
|
||
|
|
ForwardIterator2 values_first,
|
||
|
|
BinaryPredicate binary_pred)
|
||
|
|
{
|
||
|
|
// unique_by_key_copy() permits in-situ operation
|
||
|
|
return thrust::system::detail::internal::scalar::unique_by_key_copy(keys_first, keys_last, values_first, keys_first, values_first, binary_pred);
|
||
|
|
} // end unique_by_key()
|
||
|
|
|
||
|
|
} // end namespace scalar
|
||
|
|
} // end namespace internal
|
||
|
|
} // end namespace detail
|
||
|
|
} // end namespace system
|
||
|
|
} // end namespace thrust
|
||
|
|
|