robot/include/rttr/variant_associative_view.cpp

/************************************************************************************
*                                                                                   *
*   Copyright (c) 2014 - 2018 Axel Menzel <info@rttr.org>                           *
*                                                                                   *
*   This file is part of RTTR (Run Time Type Reflection)                            *
*   License: MIT License                                                            *
*                                                                                   *
*   Permission is hereby granted, free of charge, to any person obtaining           *
*   a copy of this software and associated documentation files (the "Software"),    *
*   to deal in the Software without restriction, including without limitation       *
*   the rights to use, copy, modify, merge, publish, distribute, sublicense,        *
*   and/or sell copies of the Software, and to permit persons to whom the           *
*   Software is furnished to do so, subject to the following conditions:            *
*                                                                                   *
*   The above copyright notice and this permission notice shall be included in      *
*   all copies or substantial portions of the Software.                             *
*                                                                                   *
*   THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR      *
*   IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,        *
*   FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE     *
*   AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER          *
*   LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,   *
*   OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE   *
*   SOFTWARE.                                                                       *
*                                                                                   *
*************************************************************************************/


#include "rttr/variant_associative_view.h"

#include "rttr/argument.h"
#include "rttr/instance.h"

using namespace std;

namespace rttr
{

/////////////////////////////////////////////////////////////////////////////////

variant_associative_view::variant_associative_view()
{
}

/////////////////////////////////////////////////////////////////////////////////

variant_associative_view::variant_associative_view(const variant_associative_view& other)
:   m_view(other.m_view)
{

}

/////////////////////////////////////////////////////////////////////////////////

variant_associative_view::~variant_associative_view() RTTR_NOEXCEPT
{
}

/////////////////////////////////////////////////////////////////////////////////

void variant_associative_view::swap(variant_associative_view& other) RTTR_NOEXCEPT
{
    std::swap(m_view, other.m_view);
}

/////////////////////////////////////////////////////////////////////////////////

variant_associative_view& variant_associative_view::operator=(const variant_associative_view& other) RTTR_NOEXCEPT
{
    variant_associative_view(other).swap(*this);
    return *this;
}

/////////////////////////////////////////////////////////////////////////////////////////

bool variant_associative_view::is_valid() const RTTR_NOEXCEPT
{
    return m_view.get_type().is_valid();
}

/////////////////////////////////////////////////////////////////////////////////////////

variant_associative_view::operator bool() const RTTR_NOEXCEPT
{
    return m_view.get_type().is_valid();
}

/////////////////////////////////////////////////////////////////////////////////////////

type variant_associative_view::get_type() const RTTR_NOEXCEPT
{
    return m_view.get_type();
}

/////////////////////////////////////////////////////////////////////////////////////////

type variant_associative_view::get_key_type() const RTTR_NOEXCEPT
{
    return m_view.get_key_type();
}

/////////////////////////////////////////////////////////////////////////////////////////

type variant_associative_view::get_value_type() const RTTR_NOEXCEPT
{
    return m_view.get_value_type();
}

/////////////////////////////////////////////////////////////////////////////////////////

bool variant_associative_view::is_key_only_type() const RTTR_NOEXCEPT
{
    return (m_view.get_value_type().is_valid() == false && is_valid());
}

/////////////////////////////////////////////////////////////////////////////////////////

bool variant_associative_view::is_empty() const RTTR_NOEXCEPT
{
    return m_view.is_empty();
}

/////////////////////////////////////////////////////////////////////////////////////////

std::size_t variant_associative_view::get_size() const RTTR_NOEXCEPT
{
    return m_view.get_size();
}

/////////////////////////////////////////////////////////////////////////////////////////

std::pair<variant_associative_view::const_iterator, bool> variant_associative_view::insert(argument key)
{
    const_iterator itr(&m_view);

    auto success = m_view.insert(key, itr.m_itr);

    return {itr, success};
}

/////////////////////////////////////////////////////////////////////////////////////////

std::pair<variant_associative_view::const_iterator, bool> variant_associative_view::insert(argument key, argument value)
{
    const_iterator itr(&m_view);

    auto success = m_view.insert(key, value, itr.m_itr);

    return {itr, success};
}

/////////////////////////////////////////////////////////////////////////////////////////

variant_associative_view::const_iterator variant_associative_view::find(argument arg)
{
    const_iterator itr(&m_view);

    m_view.find(itr.m_itr, arg);

    return itr;
}

/////////////////////////////////////////////////////////////////////////////////////////

std::size_t variant_associative_view::erase(argument key)
{
    return m_view.erase(key);
}

/////////////////////////////////////////////////////////////////////////////////////////

void variant_associative_view::clear()
{
    m_view.clear();
}

/////////////////////////////////////////////////////////////////////////////////////////

std::pair<variant_associative_view::const_iterator, variant_associative_view::const_iterator>
variant_associative_view::equal_range(argument key)
{
    const_iterator itr_begin(&m_view);
    const_iterator itr_end(&m_view);

    m_view.equal_range(key, itr_begin.m_itr, itr_end.m_itr);


    return {itr_begin, itr_end};
}

/////////////////////////////////////////////////////////////////////////////////////////

variant_associative_view::const_iterator variant_associative_view::begin() const
{
    const_iterator itr(&m_view);

    m_view.begin(itr.m_itr);

    return itr;
}

/////////////////////////////////////////////////////////////////////////////////////////

variant_associative_view::const_iterator variant_associative_view::end() const
{
    const_iterator itr(&m_view);

    m_view.end(itr.m_itr);

    return itr;
}

/////////////////////////////////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////////////////////////////////

variant_associative_view::const_iterator::const_iterator(const detail::variant_associative_view_private* view) RTTR_NOEXCEPT
:   m_view(view)
{
}

/////////////////////////////////////////////////////////////////////////////////////////

variant_associative_view::const_iterator::~const_iterator()
{
    m_view->destroy(m_itr);
}

/////////////////////////////////////////////////////////////////////////////////////////

variant_associative_view::const_iterator::const_iterator(const const_iterator &other)
:   m_view(other.m_view),
    m_itr(other.m_itr)
{
    m_view->copy(m_itr, other.m_itr);
}

/////////////////////////////////////////////////////////////////////////////////////////

variant_associative_view::const_iterator& variant_associative_view::const_iterator::operator=(const_iterator other)
{
    swap(other);
    return *this;
}

/////////////////////////////////////////////////////////////////////////////////////////

void variant_associative_view::const_iterator::swap(const_iterator& other)
{
    std::swap(m_itr, other.m_itr);
    std::swap(m_view, other.m_view);
}

/////////////////////////////////////////////////////////////////////////////////////////

const std::pair<variant, variant> variant_associative_view::const_iterator::operator*() const
{
    return m_view->get_key_value(m_itr);
}

/////////////////////////////////////////////////////////////////////////////////////////

const variant variant_associative_view::const_iterator::get_key() const
{
    return m_view->get_key(m_itr);
}

/////////////////////////////////////////////////////////////////////////////////////////

const variant variant_associative_view::const_iterator::get_value() const
{
    return m_view->get_value(m_itr);
}

/////////////////////////////////////////////////////////////////////////////////////////

variant_associative_view::const_iterator& variant_associative_view::const_iterator::operator++()
{
    m_view->advance(m_itr, 1);
    return *this;
}

/////////////////////////////////////////////////////////////////////////////////////////

variant_associative_view::const_iterator variant_associative_view::const_iterator::operator++(int)
{
    const_iterator result(m_view);

    m_view->copy(result.m_itr, m_itr);
    m_view->advance(m_itr, 1);

    return result;
}

/////////////////////////////////////////////////////////////////////////////////////////

variant_associative_view::const_iterator& variant_associative_view::const_iterator::operator--()
{
    m_view->advance(m_itr, -1);
    return *this;
}

/////////////////////////////////////////////////////////////////////////////////////////

variant_associative_view::const_iterator variant_associative_view::const_iterator::operator--(int)
{
    const_iterator result(m_view);

    m_view->copy(result.m_itr, m_itr);
    m_view->advance(m_itr, -1);

    return result;
}

/////////////////////////////////////////////////////////////////////////////////////////

variant_associative_view::const_iterator& variant_associative_view::const_iterator::operator+=(int i)
{
    m_view->advance(m_itr, i);
    return *this;
}

/////////////////////////////////////////////////////////////////////////////////////////

variant_associative_view::const_iterator& variant_associative_view::const_iterator::operator-=(int i)
{
    m_view->advance(m_itr, -i);
    return *this;
}

/////////////////////////////////////////////////////////////////////////////////////////

variant_associative_view::const_iterator variant_associative_view::const_iterator::operator+(int i) const
{
    const_iterator result(m_view);

    m_view->copy(result.m_itr, m_itr);
    result.m_view->advance(result.m_itr, i);

    return result;
}

/////////////////////////////////////////////////////////////////////////////////////////

variant_associative_view::const_iterator variant_associative_view::const_iterator::operator-(int i) const
{
    const_iterator result(m_view);

    m_view->copy(result.m_itr, m_itr);
    result.m_view->advance(result.m_itr, -i);

    return result;
}

/////////////////////////////////////////////////////////////////////////////////////////

bool variant_associative_view::const_iterator::operator==(const const_iterator& other) const
{
    return m_view->equal(m_itr, other.m_itr);
}

/////////////////////////////////////////////////////////////////////////////////////////

bool variant_associative_view::const_iterator::operator!=(const const_iterator& other) const
{
    return !m_view->equal(m_itr, other.m_itr);
}

/////////////////////////////////////////////////////////////////////////////////////////

} // end namespace rttr