Map.h

/*
This file is part of Hummingbird, a modern user interface library.

Copyright (c) 2012-2017 Coherent Labs AD and/or its licensors. All
rights reserved in all media.

The coded instructions, statements, computer programs, and/or related
material (collectively the "Data") in these files contain confidential
and unpublished information proprietary Coherent Labs and/or its
licensors, which is protected by United States of America federal
copyright law and by international treaties.

This software or source code is supplied under the terms of a license
agreement and nondisclosure agreement with Coherent Labs AD and may
not be copied, disclosed, or exploited except in accordance with the
terms of that agreement. The Data may not be disclosed or distributed to
third parties, in whole or in part, without the prior written consent of
Coherent Labs AD.

COHERENT LABS MAKES NO REPRESENTATION ABOUT THE SUITABILITY OF THIS
SOURCE CODE FOR ANY PURPOSE. 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, NONINFRINGEMENT, AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER, ITS AFFILIATES,
PARENT COMPANIES, LICENSORS, SUPPLIERS, OR CONTRIBUTORS 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 OR PERFORMANCE OF THIS SOFTWARE OR SOURCE CODE,
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#pragma once

namespace cohtml
{
template <typename Key, typename Value, typename Comparator, typename Allocator>
void CoherentBindInternal(Binder* binder,
                          std::map<Key, Value, Comparator, Allocator>& value)
{
    binder->MapBegin(value.size());
    typedef typename std::map
        <Key, Value, Comparator, Allocator>::const_iterator Iterator;

    Iterator end = value.end();
    for (Iterator i = value.begin(); i != end; ++i)
    {
        CoherentBindInternal(binder, i->first);
        CoherentBindInternal(binder, i->second);
    }

    binder->MapEnd();
}

template <typename Key, typename Value, typename Comparator, typename Allocator>
void CoherentBindInternal(Binder* binder,
                          const std::map
                          <Key, Value, Comparator, Allocator>& value)
{
    binder->MapBegin(value.size());
    typedef typename std::map
        <Key, Value, Comparator, Allocator>::const_iterator Iterator;

    Iterator end = value.end();
    for (Iterator i = value.begin(); i != end; ++i)
    {
        CoherentBindInternal(binder, i->first);
        CoherentBindInternal(binder, i->second);
    }

    binder->MapEnd();
}

template <typename Key, typename Value, typename Comparator, typename Allocator>
void CoherentReadInternal(Binder* binder,
                          std::map<Key, Value, Comparator, Allocator>& value)
{
    size_t size = binder->ReadMapBegin();

    typedef typename std::map
        <Key, Value, Comparator, Allocator>::value_type ValueType;

    for (size_t i = 0; i < size; ++i)
    {
        Key key;
        Value mapValue;
        binder->ReadKeyValuePair();
        CoherentReadInternal(binder, key);
        CoherentReadInternal(binder, mapValue);

        value.insert(ValueType(key, mapValue));
    }

    binder->ReadMapEnd();
}
}