UUIDDictionary.h

Go to the documentation of this file.

/**--------------------------------------------------------------------------------------------
Copyright (c) 2019, NDEVR LLC
tyler.parke@ndevr.org
  __    __   ____     _____ __     __  _______
 |  \  |  | |  __ \  |  ___|\ \   / / |   __  \
 |   \ |  | | |  \ \ | |___  \ \ / /  |  |__)  |
 |  . \|  | | |__/ / | |___   \ V /   |   _   /
 |  |\    |_|_____/__|_____|___\_/____|  | \  \
 |__| \__________________________________|  \__\
 
Subject to the terms of the Enterprise+ Agreement, NDEVR hereby grants 
Licensee a limited, non-exclusive, non-transferable, royalty-free license 
(without the right to sublicense) to use the API solely for the purpose of 
Licensee's internal development efforts to develop applications for which 
the API was provided.
 
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.
 
Library: Base
File: UUIDDictionary
Included in API: True
Author(s): Tyler Parke
 *-----------------------------------------------------------------------------------------**/
#pragma once
#include <NDEVR/BaseValues.h>
#include <NDEVR/Exception.h>
#include <NDEVR/Dictionary.h>
#include <unordered_map>
namespace NDEVR
{
    /*template<class t_value>
    class Dictionary<UUID, t_value>
    {
    public:
        Dictionary()
        {}
        bool hasKey(const t_key& key) const
        {
            return std::unordered_map<t_key, t_value>::find(key) != std::unordered_map<t_key, t_value>::end();
        }
 
        const t_value& get(const t_key& key) const
        {
            return std::unordered_map<t_key, t_value>::at(key);
        }
        t_value& get(const t_key& key)
        {
            lib_assert(hasKey(key), "Tried to get from Dictionary, without having key");
            return std::unordered_map<t_key, t_value>::at(key);
        }
        uint04 indexOf(const t_key& key) const
        {
            uint04 i = 0;
            for (const auto& location : *this)
            {
                if (location.first == key)
                    return i;
                i++;
            }
            return Constant<uint04>::NaN;
        }
        void removeIndex(uint04 index)
        {
            erase(std::next(std::unordered_map<t_key, t_value>::begin(), index)->first);
        }
        const t_value& getFromIndex(uint04 index) const
        {
            return std::next(std::unordered_map<t_key, t_value>::begin(), index)->second;
        }
        t_value& getFromIndex(uint04 index)
        {
            return std::next(std::unordered_map<t_key, t_value>::begin(), index)->second;
        }
        void set(const t_key& key, const t_value& value)
        {
            std::unordered_map<t_key, t_value>::at(key) = value;
        }
 
        const t_value& operator[](const t_key& key) const
        {
            lib_assert(hasKey(key), "Tried to get from Dictionary, without having key");
            return std::unordered_map<t_key, t_value>::at(key);
        }
        t_value& operator[](const t_key& key)
        {
            return (std::unordered_map<t_key, t_value>::try_emplace(_STD move(key)).first->second);
        }
        uint04 size() const
        {
            return cast<uint04>(std::unordered_map<t_key, t_value>::size());
        }
        Buffer<Buffer<Buffer<uint04>>>[260] m_lookup;
    };*/
}