algorithms.h

Go to the documentation of this file.

/*
 * CUGAR : Cuda Graphics Accelerator
 *
 * Copyright (c) 2011-2018, NVIDIA CORPORATION. All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *    * Redistributions of source code must retain the above copyright
 *      notice, this list of conditions and the following disclaimer.
 *    * Redistributions in binary form must reproduce the above copyright
 *      notice, this list of conditions and the following disclaimer in the
 *      documentation and/or other materials provided with the distribution.
 *    * Neither the name of the NVIDIA CORPORATION nor the
 *      names of its contributors may be used to endorse or promote products
 *      derived from this software without specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL NVIDIA CORPORATION BE LIABLE FOR ANY
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#pragma once

#include <cugar/basic/types.h>

namespace cugar {




template <typename Iterator, typename Predicate>
CUGAR_FORCEINLINE CUGAR_HOST_DEVICE Iterator find_pivot(
    Iterator        begin,
    const uint32    n,
    const Predicate predicate)
{
    // if the range has a size of zero, let's just return the intial element
    if (n == 0)
        return begin;

    // check whether this segment contains only 0s or only 1s
    if (predicate( begin[0] ) == predicate( begin[n-1] ))
        return predicate( begin[0] ) ? begin + n : begin;

    // perform a binary search over the given range
    uint32 count = n;

    while (count > 0)
    {
        const uint32 count2 = count / 2;

        Iterator mid = begin + count2;

        if (predicate( *mid ) == false)
            begin = ++mid, count -= count2 + 1;
        else
            count = count2;
    }
    return begin;
}

template <typename Iterator, typename Value, typename index_type>
CUGAR_FORCEINLINE CUGAR_HOST_DEVICE Iterator lower_bound(
    const Value         x,
    Iterator            begin,
    const index_type    n)
{
    // if the range has a size of zero, let's just return the intial element
    if (n == 0)
        return begin;

    // check whether this segment is all left or right of x
    if (x < begin[0])
        return begin;

    if (begin[n-1] < x)
        return begin + n;

    // perform a binary search over the given range
    index_type count = n;

    while (count > 0)
    {
        const index_type count2 = count / 2;

        Iterator mid = begin + count2;

        if (*mid < x)
            begin = ++mid, count -= count2 + 1;
        else
            count = count2;
    }
    return begin;
}

template <typename Iterator, typename Value, typename index_type>
CUGAR_FORCEINLINE CUGAR_HOST_DEVICE Iterator upper_bound(
    const Value         x,
    Iterator            begin,
    const index_type    n)
{
    // if the range has a size of zero, let's just return the intial element
    //if (n == 0)
    //    return begin;

    // check whether this segment is all left or right of x
    //if (x < begin[0])
    //    return begin;

    //if (begin[n-1] <= x)
    //    return begin + n;
    
    index_type count = n;
 
    while (count > 0)
    {
        const index_type step = count / 2;

        Iterator it = begin + step;

        if (!(x < *it))
        {
            begin = ++it;
            count -= step + 1;
        }
        else
            count = step;
    }
    return begin;
}

template <typename Iterator, typename Value, typename index_type>
CUGAR_FORCEINLINE CUGAR_HOST_DEVICE index_type lower_bound_index(
    const Value         x,
    Iterator            begin,
    const index_type    n)
{
    return uint32( lower_bound( x, begin, n ) - begin );
}

template <typename Iterator, typename Value, typename index_type>
CUGAR_FORCEINLINE CUGAR_HOST_DEVICE index_type upper_bound_index(
    const Value         x,
    Iterator            begin,
    const index_type    n)
{
    return index_type( upper_bound( x, begin, n ) - begin );
}

template <
    typename input_iterator1,
    typename input_iterator2,
    typename output_iterator>
CUGAR_FORCEINLINE CUGAR_HOST_DEVICE 
void merge(
    input_iterator1    first1,
    input_iterator1    end1,
    input_iterator2    first2,
    input_iterator2    end2,
    output_iterator    output)
{
    while (first1 != end1 &&
           first2 != end2)
    {
        if (*first2 < *first1)
        {
            *output = *first2;

            ++first2;
        }
        else
        {
            *output = *first1;

            ++first1;
        }

        ++output;
    }

    while (first1 != end1)
    {
        *output = *first1;

        ++first1;
        ++output;
    }

    while (first2 != end2)
    {
        *output = *first2;

        ++first2;
        ++output;
    }
}

template <
    typename key_iterator1,
    typename key_iterator2,
    typename value_iterator1,
    typename value_iterator2,
    typename key_iterator,
    typename value_iterator>
CUGAR_FORCEINLINE CUGAR_HOST_DEVICE 
void merge_by_key(
    key_iterator1      first1,
    key_iterator1      end1,
    key_iterator2      first2,
    key_iterator2      end2,
    value_iterator1    values1,
    value_iterator2    values2,
    key_iterator       output_keys,
    value_iterator     output_values)
{
    while (first1 != end1 &&
           first2 != end2)
    {
        if (*first2 < *first1)
        {
            *output_keys   = *first2;
            *output_values = *values2;

            ++first2;
            ++values2;
        }
        else
        {
            *output_keys   = *first1;
            *output_values = *values1;

            ++first1;
            ++values1;
        }

        ++output_keys;
        ++output_values;
    }

    while (first1 != end1)
    {
        *output_keys   = *first1;
        *output_values = *values1;

        ++first1;
        ++values1;
        ++output_keys;
        ++output_values;
    }

    while (first2 != end2)
    {
        *output_keys   = *first2;
        *output_values = *values2;

        ++first2;
        ++values2;
        ++output_keys;
        ++output_values;
    }
}


} // namespace cugar