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
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
|
/*
* Dictionary.cpp
*
* Copyright (c) 2009 Jonathan Beck All Rights Reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <cstdlib>
#include <plist/Dictionary.h>
namespace PList
{
Dictionary::Dictionary(Node* parent) : Structure(PLIST_DICT, parent)
{
}
static void dictionary_fill(Dictionary *_this, std::map<std::string,Node*> &map, plist_t node)
{
plist_dict_iter it = NULL;
plist_dict_new_iter(node, &it);
plist_t subnode = NULL;
do {
char *key = NULL;
subnode = NULL;
plist_dict_next_item(node, it, &key, &subnode);
if (key && subnode)
map[std::string(key)] = Node::FromPlist(subnode, _this);
delete key;
} while (subnode);
free(it);
}
Dictionary::Dictionary(plist_t node, Node* parent) : Structure(parent)
{
_node = node;
dictionary_fill(this, _map, _node);
}
Dictionary::Dictionary(const PList::Dictionary& d)
{
for (Dictionary::iterator it = _map.begin(); it != _map.end(); it++)
{
plist_free(it->second->GetPlist());
delete it->second;
}
_map.clear();
_node = plist_copy(d.GetPlist());
dictionary_fill(this, _map, _node);
}
Dictionary& Dictionary::operator=(const PList::Dictionary& d)
{
for (Dictionary::iterator it = _map.begin(); it != _map.end(); it++)
{
plist_free(it->second->GetPlist());
delete it->second;
}
_map.clear();
_node = plist_copy(d.GetPlist());
dictionary_fill(this, _map, _node);
return *this;
}
Dictionary::~Dictionary()
{
for (Dictionary::iterator it = _map.begin(); it != _map.end(); it++)
{
delete it->second;
}
_map.clear();
}
Node* Dictionary::Clone() const
{
return new Dictionary(*this);
}
Node* Dictionary::operator[](const std::string& key)
{
return _map[key];
}
Dictionary::iterator Dictionary::Begin()
{
return _map.begin();
}
Dictionary::iterator Dictionary::begin()
{
return _map.begin();
}
Dictionary::iterator Dictionary::End()
{
return _map.end();
}
Dictionary::iterator Dictionary::end()
{
return _map.end();
}
Dictionary::const_iterator Dictionary::Begin() const
{
return _map.begin();
}
Dictionary::const_iterator Dictionary::begin() const
{
return _map.begin();
}
Dictionary::const_iterator Dictionary::End() const
{
return _map.end();
}
Dictionary::const_iterator Dictionary::end() const
{
return _map.end();
}
const size_t Dictionary::size() const {
return _map.size();
}
Dictionary::iterator Dictionary::Find(const std::string& key)
{
return _map.find(key);
}
Dictionary::const_iterator Dictionary::Find(const std::string& key) const
{
return _map.find(key);
}
Dictionary::iterator Dictionary::Set(const std::string& key, const Node* node)
{
if (node)
{
Node* clone = node->Clone();
UpdateNodeParent(clone);
plist_dict_set_item(_node, key.c_str(), clone->GetPlist());
delete _map[key];
_map[key] = clone;
return _map.find(key);
}
return iterator(this->_map.end());
}
Dictionary::iterator Dictionary::Set(const std::string& key, const Node& node)
{
return Set(key, &node);
}
Dictionary::iterator Dictionary::Insert(const std::string& key, Node* node)
{
return this->Set(key, node);
}
void Dictionary::Remove(Node* node)
{
if (node)
{
char* key = NULL;
plist_dict_get_item_key(node->GetPlist(), &key);
plist_dict_remove_item(_node, key);
std::string skey = key;
delete key;
_map.erase(skey);
delete node;
}
}
void Dictionary::Remove(const std::string& key)
{
plist_dict_remove_item(_node, key.c_str());
delete _map[key];
_map.erase(key);
}
std::string Dictionary::GetNodeKey(Node* node)
{
for (iterator it = _map.begin(); it != _map.end(); ++it)
{
if (it->second == node)
return it->first;
}
return "";
}
} // namespace PList
|
