searchsorted.hpp

Go to the documentation of this file.

 
#pragma once
 
#include <algorithm>
#include <iterator>
 
#include "NumCpp/Core/Enums.hpp"
#include "NumCpp/Core/Internal/StaticAsserts.hpp"
#include "NumCpp/NdArray.hpp"
 
namespace nc
{
    //============================================================================
    // Method Description:
    template<typename dtype>
    typename NdArray<dtype>::index_type
        searchsorted(const NdArray<dtype>& inArray, dtype inValue, Side side = Side::LEFT)
    {
        STATIC_ASSERT_ARITHMETIC_OR_COMPLEX(dtype);
 
        switch (side)
        {
            case Side::LEFT:
            {
                return std::distance(inArray.begin(), std::lower_bound(inArray.begin(), inArray.end(), inValue));
            }
            case Side::RIGHT:
            {
                return std::distance(inArray.begin(), std::upper_bound(inArray.begin(), inArray.end(), inValue));
            }
        }
 
        // get rid of compiler warning
        return {};
    }
        searchsorted(const NdArray<dtype>& inArray, dtype inValue, Side side = Side::LEFT) {…}
 
    //============================================================================
    // Method Description:
    template<typename dtype>
    NdArray<typename NdArray<dtype>::index_type>
        searchsorted(const NdArray<dtype>& inArray, const NdArray<dtype>& inValues, Side side = Side::LEFT)
    {
        NdArray<typename NdArray<dtype>::index_type> indices(1, inValues.size());
        std::transform(inValues.begin(),
                       inValues.end(),
                       indices.begin(),
                       [&inArray, side](const auto& value) { return searchsorted(inArray, value, side); });
        return indices;
    }
        searchsorted(const NdArray<dtype>& inArray, const NdArray<dtype>& inValues, Side side = Side::LEFT) {…}
} // namespace nc