summaryrefslogtreecommitdiff
path: root/src/common/Dynamic/ObjectRegistry.h
blob: cab00ee08e282f79f27b1f2e72c4be44e6d48c0c (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
/*
 * Copyright (C) 2016+     AzerothCore <www.azerothcore.org>, released under GNU GPL v2 license, you may redistribute it and/or modify it under version 2 of the License, or (at your option), any later version.
 * Copyright (C) 2008-2016 TrinityCore <http://www.trinitycore.org/>
 * Copyright (C) 2005-2009 MaNGOS <http://getmangos.com/>
 */

#ifndef ACORE_OBJECTREGISTRY_H
#define ACORE_OBJECTREGISTRY_H

#include "Define.h"
#include <string>
#include <vector>
#include <map>
#include <unordered_map>

/** ObjectRegistry holds all registry item of the same type
 */
template<class T, class Key = std::string>
class ObjectRegistry
{
public:
    typedef std::map<Key, T*> RegistryMapType;

    /// Returns a registry item
    const T* GetRegistryItem(Key key) const
    {
        typename RegistryMapType::const_iterator iter = i_registeredObjects.find(key);
        return ( iter == i_registeredObjects.end() ? nullptr : iter->second );
    }

    static ObjectRegistry<T, Key>* instance()
    {
        static ObjectRegistry<T, Key>* instance = new ObjectRegistry<T, Key>();
        return instance;
    }

    /// Inserts a registry item
    bool InsertItem(T* obj, Key key, bool override = false)
    {
        typename RegistryMapType::iterator iter = i_registeredObjects.find(key);
        if ( iter != i_registeredObjects.end() )
        {
            if ( !override )
                return false;
            delete iter->second;
            i_registeredObjects.erase(iter);
        }

        i_registeredObjects[key] = obj;
        return true;
    }

    /// Removes a registry item
    void RemoveItem(Key key, bool delete_object = true)
    {
        typename RegistryMapType::iterator iter = i_registeredObjects.find(key);
        if ( iter != i_registeredObjects.end() )
        {
            if ( delete_object )
                delete iter->second;
            i_registeredObjects.erase(iter);
        }
    }

    /// Returns true if registry contains an item
    bool HasItem(Key key) const
    {
        return (i_registeredObjects.find(key) != i_registeredObjects.end());
    }

    /// Inefficiently return a vector of registered items
    unsigned int GetRegisteredItems(std::vector<Key>& l) const
    {
        unsigned int sz = l.size();
        l.resize(sz + i_registeredObjects.size());
        for (typename RegistryMapType::const_iterator iter = i_registeredObjects.begin(); iter != i_registeredObjects.end(); ++iter)
            l[sz++] = iter->first;
        return i_registeredObjects.size();
    }

    /// Return the map of registered items
    RegistryMapType const& GetRegisteredItems() const
    {
        return i_registeredObjects;
    }

    ObjectRegistry() { }
    ~ObjectRegistry()
    {
        for (typename RegistryMapType::iterator iter = i_registeredObjects.begin(); iter != i_registeredObjects.end(); ++iter)
            delete iter->second;
        i_registeredObjects.clear();
    }
private:
    RegistryMapType i_registeredObjects;
};

#endif