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
|
/*
* Array.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 <plist/Array.h>
#include <algorithm>
#include <climits>
#include <cstdlib>
namespace PList
{
Array::Array(Node* parent) : Structure(PLIST_ARRAY, parent)
{
_array.clear();
}
static void array_fill(Array *_this, std::vector<Node*> &array, plist_t node)
{
plist_array_iter iter = NULL;
plist_array_new_iter(node, &iter);
plist_t subnode;
do {
subnode = NULL;
plist_array_next_item(node, iter, &subnode);
array.push_back( Node::FromPlist(subnode, _this) );
} while (subnode);
free(iter);
}
Array::Array(plist_t node, Node* parent) : Structure(parent)
{
_node = node;
array_fill(this, _array, _node);
}
Array::Array(const PList::Array& a)
{
_array.clear();
_node = plist_copy(a.GetPlist());
array_fill(this, _array, _node);
}
Array& Array::operator=(const PList::Array& a)
{
plist_free(_node);
for (size_t it = 0; it < _array.size(); it++) {
delete _array.at(it);
}
_array.clear();
_node = plist_copy(a.GetPlist());
array_fill(this, _array, _node);
return *this;
}
Array::~Array()
{
for (size_t it = 0; it < _array.size(); it++) {
delete (_array.at(it));
}
_array.clear();
}
Node* Array::Clone() const
{
return new Array(*this);
}
Node* Array::operator[](unsigned int array_index)
{
return _array.at(array_index);
}
void Array::Append(Node* node)
{
if (node)
{
Node* clone = node->Clone();
UpdateNodeParent(clone);
plist_array_append_item(_node, clone->GetPlist());
_array.push_back(clone);
}
}
void Array::Insert(Node* node, unsigned int pos)
{
if (node)
{
Node* clone = node->Clone();
UpdateNodeParent(clone);
plist_array_insert_item(_node, clone->GetPlist(), pos);
std::vector<Node*>::iterator it = _array.begin();
it += pos;
_array.insert(it, clone);
}
}
void Array::Remove(Node* node)
{
if (node)
{
uint32_t pos = plist_array_get_item_index(node->GetPlist());
if (pos == UINT_MAX) {
return;
}
plist_array_remove_item(_node, pos);
std::vector<Node*>::iterator it = _array.begin();
it += pos;
_array.erase(it);
delete node;
}
}
void Array::Remove(unsigned int pos)
{
plist_array_remove_item(_node, pos);
std::vector<Node*>::iterator it = _array.begin();
it += pos;
delete _array.at(pos);
_array.erase(it);
}
unsigned int Array::GetNodeIndex(Node* node) const
{
std::vector<Node*>::const_iterator it = std::find(_array.begin(), _array.end(), node);
return std::distance (_array.begin(), it);
}
} // namespace PList
|
