dynamic_storage.h

main 68 lines · 2.1 KB Raw
Alex Alex Commit Client Upload Part 2 19/10/2026 00:06
1/*
2 * Copyright (c) 2010-2017 OTClient <https://github.com/edubart/otclient>
3 *
4 * Permission is hereby granted, free of charge, to any person obtaining a copy
5 * of this software and associated documentation files (the "Software"), to deal
6 * in the Software without restriction, including without limitation the rights
7 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
8 * copies of the Software, and to permit persons to whom the Software is
9 * furnished to do so, subject to the following conditions:
10 *
11 * The above copyright notice and this permission notice shall be included in
12 * all copies or substantial portions of the Software.
13 *
14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
17 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
18 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
19 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
20 * THE SOFTWARE.
21 */
22
23#ifndef STDEXT_DYNAMICSTORAGE_H
24#define STDEXT_DYNAMICSTORAGE_H
25
26#include "types.h"
27#include "any.h"
28#include <unordered_map>
29
30namespace stdext {
31
32template<typename Key>
33class dynamic_storage {
34public:
35 template<typename T> void set(const Key& k, const T& value) {
36 if(m_data.size() <= k)
37 m_data.resize(k+1);
38 m_data[k] = value;
39 }
40 bool remove(const Key& k) {
41 if(m_data.size() < k)
42 return false;
43 if(m_data[k].empty())
44 return false;
45 m_data[k] = any();
46 return true;
47 }
48 template<typename T> T get(const Key& k) const { return has(k) ? any_cast<T>(m_data[k]) : T(); }
49 bool has(const Key& k) const { return k < m_data.size() && !m_data[k].empty(); }
50
51 std::size_t size() const {
52 std::size_t count = 0;
53 for(std::size_t i=0;i<m_data.size();++i)
54 if(!m_data[i].empty())
55 count++;
56 return count;
57 }
58
59 void clear() { m_data.clear(); }
60
61private:
62 std::vector<any> m_data;
63};
64
65}
66
67#endif
68
Top