assocarr.h
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // this used to be a custom map type, now replaced with just a wrapper around std::unordered_map. | ||
| 2 | |||
| 3 | #pragma once | ||
| 4 | |||
| 5 | #include <initializer_list> | ||
| 6 | #include <unordered_map> | ||
| 7 | #include "libstr.h" | ||
| 8 | |||
| 9 | template<typename right> | ||
| 10 | class assocarr { | ||
| 11 | private: | ||
| 12 | |||
| 13 | std::unordered_map<string, right> storage; | ||
| 14 | |||
| 15 | public: | ||
| 16 | |||
| 17 | 40414 | bool exists(const char* key) const | |
| 18 | { | ||
| 19 | 40414 | return storage.find(key) != storage.end(); | |
| 20 | } | ||
| 21 | |||
| 22 | 21497 | right& find(const char* key) | |
| 23 | { | ||
| 24 | 21497 | return storage.find(key)->second; | |
| 25 | } | ||
| 26 | |||
| 27 | 9064 | right& create(const char* key) | |
| 28 | { | ||
| 29 | 9064 | return storage[key]; | |
| 30 | } | ||
| 31 | |||
| 32 | 201 | void remove(const char* key) | |
| 33 | { | ||
| 34 | 201 | storage.erase(key); | |
| 35 | 201 | } | |
| 36 | |||
| 37 | 3215 | void reset() | |
| 38 | { | ||
| 39 | 3215 | storage.clear(); | |
| 40 | 3215 | } | |
| 41 | |||
| 42 | 335 | assocarr() | |
| 43 | 335 | { | |
| 44 | 335 | } | |
| 45 | |||
| 46 | assocarr(std::initializer_list<std::pair<const char*, right>> list) | ||
| 47 | { | ||
| 48 | for (auto& it : list) { | ||
| 49 | storage.insert(std::move(it)); | ||
| 50 | } | ||
| 51 | } | ||
| 52 | |||
| 53 | ✗ | right& operator[](const char* key) | |
| 54 | { | ||
| 55 | ✗ | return create(key); | |
| 56 | } | ||
| 57 | |||
| 58 | //void(*func)(const char * key, right& value) | ||
| 59 | 3204 | template<typename T> void each(T func) | |
| 60 | { | ||
| 61 | 7774 | for (auto& it : storage) { | |
| 62 | 4570 | func(it.first, it.second); | |
| 63 | } | ||
| 64 | 3204 | } | |
| 65 | |||
| 66 | }; | ||
| 67 |