std_unordered_set.h

Go to the documentation of this file.

/**
    @file
    @author  Alexander Sherikov
 
    @copyright 2026 Alexander Sherikov, Licensed under the Apache License, Version 2.0.
    (see @ref LICENSE or http://www.apache.org/licenses/LICENSE-2.0)
 
    @brief
*/
 
#pragma once
 
#include <unordered_set>
#include "../internal/helpers.h"
 
 
namespace ariles2
{
    template <class... t_Args>
    bool isMissing(const std::unordered_set<t_Args...> &entry)
    {
        return (entry.empty());
    }
}  // namespace ariles2
 
 
namespace ariles2
{
    namespace read
    {
        template <class t_Visitor, class... t_Args>
        void apply_read(
                t_Visitor &visitor,
                std::unordered_set<t_Args...> &entry,
                const typename t_Visitor::Parameters &param)
        {
            CPPUT_TRACE_FUNCTION;
            const std::size_t size = visitor.startArray();
            entry.clear();
            for (std::size_t i = 0; i < size; ++i)
            {
                typename std::unordered_set<t_Args...>::value_type value;
                visitor.visitArrayElement(value, param);
                entry.insert(std::move(value));
            }
            visitor.endArray();
        }
    }  // namespace read
}  // namespace ariles2
 
 
namespace ariles2
{
    namespace write
    {
        template <class t_Visitor, class... t_Args>
        void apply_write(
                t_Visitor &writer,
                const std::unordered_set<t_Args...> &entry,
                const typename t_Visitor::Parameters &param)
        {
            CPPUT_TRACE_FUNCTION;
            writer.startArray(entry.size(), param.compact_arrays_);
            for (const typename std::unordered_set<t_Args...>::value_type &value : entry)
            {
                writer.visitArrayElement(value, param);
            }
            writer.endArray();
        }
    }  // namespace write
}  // namespace ariles2
 
 
namespace ariles2
{
    namespace compare
    {
        template <class t_Visitor, class... t_Args>
        void apply_compare(
                t_Visitor &visitor,
                const std::unordered_set<t_Args...> &left,
                const std::unordered_set<t_Args...> &right,
                const typename t_Visitor::Parameters &param)
        {
            CPPUT_TRACE_FUNCTION;
 
            visitor.equal_ &= (left.size() == right.size());
 
            if (visitor.equal_ && !left.empty())
            {
                for (const typename std::unordered_set<t_Args...>::value_type &left_value : left)
                {
                    typename std::unordered_set<t_Args...>::const_iterator right_it = right.find(left_value);
                    if (right_it == right.end())
                    {
                        visitor.equal_ = false;
                        break;
                    }
                    apply_compare(visitor, left_value, *right_it, param);
                }
            }
        }
    }  // namespace compare
}  // namespace ariles2
 
 
namespace ariles2
{
    namespace defaults
    {
        template <class t_Visitor, class... t_Args>
        void apply_defaults(
                const t_Visitor & /*visitor*/,
                std::unordered_set<t_Args...> &entry,
                const typename t_Visitor::Parameters & /*param*/)
        {
            CPPUT_TRACE_FUNCTION;
            entry.clear();
        }
    }  // namespace defaults
}  // namespace ariles2
 
 
 
namespace ariles2
{
    namespace process
    {
        template <class t_Visitor, class... t_Args>
        void apply_process(
                const t_Visitor &visitor,
                std::unordered_set<t_Args...> &entry,
                const typename t_Visitor::Parameters &param)
        {
            CPPUT_TRACE_FUNCTION;
            for (typename std::unordered_set<t_Args...>::const_reference value : entry)
            {
                apply_process(visitor, value, param);
            }
        }
    }  // namespace process
}  // namespace ariles2
 
 
namespace ariles2
{
    namespace copyfrom
    {
        template <class t_Visitor, class... t_LeftArgs, class... t_RightArgs>
        void apply_copyfrom(
                t_Visitor &visitor,
                std::unordered_set<t_LeftArgs...> &left,
                const std::unordered_set<t_RightArgs...> &right,
                const typename t_Visitor::Parameters &param)
        {
            CPPUT_TRACE_FUNCTION;
 
            left.clear();
            for (const typename std::unordered_set<t_RightArgs...>::value_type &right_value : right)
            {
                typename std::unordered_set<t_LeftArgs...>::value_type left_value;
                apply_copyfrom(visitor, left_value, right_value, param);
                left.insert(std::move(left_value));
            }
        }
    }  // namespace copyfrom
 
 
    namespace copyto
    {
        template <class t_Visitor, class... t_LeftArgs, class... t_RightArgs>
        void apply_copyto(
                t_Visitor &visitor,
                const std::unordered_set<t_LeftArgs...> &left,
                std::unordered_set<t_RightArgs...> &right,
                const typename t_Visitor::Parameters &param)
        {
            CPPUT_TRACE_FUNCTION;
 
            right.clear();
            for (const typename std::unordered_set<t_LeftArgs...>::value_type &left_value : left)
            {
                typename std::unordered_set<t_RightArgs...>::value_type right_value;
                apply_copyto(visitor, left_value, right_value, param);
                right.insert(std::move(right_value));
            }
        }
    }  // namespace copyto
}  // namespace ariles2