-
Notifications
You must be signed in to change notification settings - Fork 7
/
string_map.h
167 lines (139 loc) · 5.44 KB
/
string_map.h
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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
///////////////////////////////////////////////////////////////////////////////
// Copyright (c) Electronic Arts Inc. All rights reserved.
///////////////////////////////////////////////////////////////////////////////
#ifndef EASTL_STRING_MAP_H
#define EASTL_STRING_MAP_H
#if defined(EASTL_PRAGMA_ONCE_SUPPORTED)
#pragma once
#endif
#include <eastl/map.h>
#include <eastl/string.h>
namespace eastl
{
template<typename T, typename Predicate = str_less<const char*>, typename Allocator = EASTLAllocatorType>
class string_map : public eastl::map<const char*, T, Predicate, Allocator>
{
public:
typedef eastl::map<const char*, T, Predicate, Allocator> base;
typedef string_map<T, Predicate, Allocator> this_type;
typedef typename base::base_type::allocator_type allocator_type;
typedef typename base::base_type::insert_return_type insert_return_type;
typedef typename base::base_type::iterator iterator;
typedef typename base::base_type::reverse_iterator reverse_iterator;
typedef typename base::base_type::const_iterator const_iterator;
typedef typename base::base_type::size_type size_type;
typedef typename base::base_type::key_type key_type;
typedef typename base::base_type::value_type value_type;
typedef typename base::mapped_type mapped_type;
string_map(const allocator_type& allocator = allocator_type()) : base(allocator) {}
string_map(const string_map& src, const allocator_type& allocator = allocator_type());
~string_map();
void clear();
this_type& operator=(const this_type& x);
insert_return_type insert(const char* key, const T& value);
insert_return_type insert(const char* key);
iterator erase(iterator position);
size_type erase(const char* key);
mapped_type& operator[](const char* key);
private:
char* strduplicate(const char* str);
// Not implemented right now
// insert_return_type insert(const value_type& value);
// iterator insert(iterator position, const value_type& value);
// reverse_iterator erase(reverse_iterator position);
// reverse_iterator erase(reverse_iterator first, reverse_iterator last);
// void erase(const key_type* first, const key_type* last);
};
template<typename T, typename Predicate, typename Allocator>
string_map<T, Predicate, Allocator>::string_map(const string_map& src, const allocator_type& allocator) : base(allocator)
{
for (const_iterator i=src.begin(), e=src.end(); i!=e; ++i)
base::base_type::insert(eastl::makePair(strduplicate(i->first), i->second));
}
template<typename T, typename Predicate, typename Allocator>
string_map<T, Predicate, Allocator>::~string_map()
{
clear();
}
template<typename T, typename Predicate, typename Allocator>
void
string_map<T, Predicate, Allocator>::clear()
{
allocator_type& allocator = base::base_type::getAllocator();
for (const_iterator i=base::base_type::begin(), e=base::base_type::end(); i!=e; ++i)
allocator.deallocate((void*)i->first, 0);
base::base_type::clear();
}
template<typename T, typename Predicate, typename Allocator>
typename string_map<T, Predicate, Allocator>::this_type&
string_map<T, Predicate, Allocator>::operator=(const this_type& x)
{
allocator_type allocator = base::base_type::getAllocator();
this->~this_type();
new (this) this_type(x, allocator);
return *this;
}
template<typename T, typename Predicate, typename Allocator>
typename string_map<T, Predicate, Allocator>::insert_return_type
string_map<T, Predicate, Allocator>::insert(const char* key)
{
return insert(key, mapped_type());
}
template<typename T, typename Predicate, typename Allocator>
typename string_map<T, Predicate, Allocator>::insert_return_type
string_map<T, Predicate, Allocator>::insert(const char* key, const T& value)
{
EASTL_ASSERT(key);
iterator i = base::base_type::find(key);
if (i != base::base_type::end())
{
insert_return_type ret;
ret.first = i;
ret.second = false;
return ret;
}
return base::base_type::insert(eastl::makePair(strduplicate(key), value));
}
template<typename T, typename Predicate, typename Allocator>
typename string_map<T, Predicate, Allocator>::iterator
string_map<T, Predicate, Allocator>::erase(iterator position)
{
const char* key = position->first;
iterator result = base::base_type::erase(position);
base::base_type::getAllocator().deallocate((void*)key, 0);
return result;
}
template<typename T, typename Predicate, typename Allocator>
typename string_map<T, Predicate, Allocator>::size_type
string_map<T, Predicate, Allocator>::erase(const char* key)
{
const iterator it(base::base_type::find(key));
if(it != base::base_type::end())
{
erase(it);
return 1;
}
return 0;
}
template<typename T, typename Predicate, typename Allocator>
typename string_map<T, Predicate, Allocator>::mapped_type&
string_map<T, Predicate, Allocator>::operator[](const char* key)
{
using base_value_type = typename base::base_type::value_type;
EASTL_ASSERT(key);
iterator i = base::base_type::find(key);
if (i != base::base_type::end())
return i->second;
return base::base_type::insert(base_value_type(pair_first_construct, strduplicate(key))).first->second;
}
template<typename T, typename Predicate, typename Allocator>
char*
string_map<T, Predicate, Allocator>::strduplicate(const char* str)
{
size_t len = strlen(str);
char* result = (char*)base::base_type::getAllocator().allocate(len + 1);
memcpy(result, str, len+1);
return result;
}
}
#endif