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
|
/*
* Node.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 <stdlib.h>
#include <plist/Node.h>
#include <plist/Structure.h>
namespace PList
{
Node::Node(Node* parent) : _parent(parent)
{
}
Node::Node(plist_t node, Node* parent) : _node(node), _parent(parent)
{
}
Node::Node(plist_type type, Node* parent) : _parent(parent)
{
_node = NULL;
switch(type) {
case PLIST_BOOLEAN:
_node = plist_new_bool(0);
break;
case PLIST_UINT:
_node = plist_new_uint(0);
break;
case PLIST_REAL:
_node = plist_new_real(0.);
break;
case PLIST_STRING:
_node = plist_new_string("");
break;
case PLIST_DATA:
_node = plist_new_data(NULL,0);
break;
case PLIST_DATE:
_node = plist_new_date(0,0);
break;
case PLIST_ARRAY:
_node = plist_new_array();
break;
case PLIST_DICT:
_node = plist_new_dict();
break;
case PLIST_KEY:
case PLIST_NONE:
default:
break;
}
}
Node::~Node()
{
plist_free(_node);
_node = NULL;
_parent = NULL;
}
plist_type Node::GetType()
{
if (_node)
{
return plist_get_node_type(_node);
}
return PLIST_NONE;
}
plist_t Node::GetPlist()
{
return _node;
}
Node* Node::GetParent()
{
return _parent;
}
void Node::SetParent(Node* parent)
{
//Unlink node first
if ( NULL != _parent )
{
plist_type type = plist_get_node_type(_parent);
if (PLIST_ARRAY ==type || PLIST_DICT == type )
{
Structure* s = static_cast<Structure*>(_parent);
s->Remove(this);
}
}
_parent = parent;
}
};
|
