Map.h

Go to the documentation of this file.

#ifndef MAP_H
#define MAP_H
 
#include "Platform.h"
#include "Pair.h"
 
namespace dyno
{
    template <typename MKey, typename T>
    class Map
    {
    public:
        using iterator = Pair<MKey, T>*;
 
        DYN_FUNC Map();
 
        DYN_FUNC void reserve(Pair<MKey, T>* buf, uint maxSize)
        {
            m_pairs = buf;
            m_maxSize = maxSize;
        }
        
        DYN_FUNC iterator find(MKey key);
 
        DYN_FUNC inline iterator begin() { return m_pairs; }
 
        DYN_FUNC inline iterator end() { return m_pairs + m_size; }
 
        DYN_FUNC void clear();
 
        DYN_FUNC uint size();
 
        DYN_FUNC iterator insert(Pair<MKey, T> pair);
        DYN_FUNC bool empty();
 
        DYN_FUNC void assign(Pair<MKey, T>* beg, int num, int buffer_size)
        {
            m_pairs = beg;
            m_size = num;
            m_maxSize = buffer_size;
        }
 
        DYN_FUNC Pair<MKey, T>& operator [] (unsigned int id) {
            return m_pairs[id];
        }
 
        DYN_FUNC const Pair<MKey, T>& operator [] (unsigned int id) const {
            return m_pairs[id];
        }
 
        DYN_FUNC int erase(const T val);
        DYN_FUNC void erase(iterator val_ptr);
 
    private:
        uint m_size = 0;
 
        Pair<MKey, T>* m_pairs = nullptr;
        uint m_maxSize = 0;
    };
}
 
#include "Map.inl"
 
#endif // MAP_H