find_duplicates.hpp

Go to the documentation of this file.

 
#pragma once
 
#include <complex>
#include <unordered_set>
 
#include "NumCpp/Core/Internal/StaticAsserts.hpp"
#include "NumCpp/Core/Internal/StdComplexOperators.hpp"
#include "NumCpp/Functions/sort.hpp"
#include "NumCpp/NdArray.hpp"
 
namespace nc
{
    //============================================================================
    // Method Description:
    template<typename dtype>
    NdArray<dtype> find_duplicates(const NdArray<dtype>& inArray)
    {
        STATIC_ASSERT_ARITHMETIC(dtype);
 
        auto repeats = std::unordered_set<dtype>{};
        auto count   = std::unordered_set<dtype>{};
 
        for (const auto& value : inArray)
        {
            if (count.count(value) > 0)
            {
                repeats.insert(value);
            }
            else
            {
                count.insert(value);
            }
        }
 
        return sort(NdArray<dtype>{ repeats.begin(), repeats.end() });
    }
 
    //============================================================================
    // Method Description:
    template<typename dtype>
    NdArray<std::complex<dtype>> find_duplicates(const NdArray<std::complex<dtype>>& inArray)
    {
        STATIC_ASSERT_ARITHMETIC(dtype);
 
        auto repeats = std::unordered_set<std::complex<dtype>, ComplexHash<dtype>>{};
        auto count   = std::unordered_set<std::complex<dtype>, ComplexHash<dtype>>{};
 
        for (const auto& value : inArray)
        {
            if (count.count(value) > 0)
            {
                repeats.insert(value);
            }
            else
            {
                count.insert(value);
            }
        }
 
        return sort(NdArray<std::complex<dtype>>{ repeats.begin(), repeats.end() });
    }
} // namespace nc