admin/libimobiledevice-libplist
1
0
Fork 0
mirror of https://github.com/libimobiledevice/libplist synced 2026-06-08 15:29:34 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add Set/Get Parent and a helper to create a Node from a plist_t.

Browse Source
This commit is contained in:
Jonathan Beck
2009-10-26 18:41:15 +01:00
parent bef50c0873
commit c1363bea10
22 changed files with 113 additions and 245 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/Array.cpp
+8 -99
View File
@@ -20,23 +20,17 @@
#include <stdlib.h>
#include <plist/Array.h>
#include <plist/Dictionary.h>
#include <plist/Boolean.h>
#include <plist/Integer.h>
#include <plist/Real.h>
#include <plist/String.h>
#include <plist/Date.h>
#include <plist/Data.h>
#include <plist/Utils.h>
namespace PList
{
Array::Array() : Structure(PLIST_ARRAY)
Array::Array(Node* parent) : Structure(PLIST_ARRAY, parent)
{
_array.clear();
}
Array::Array(plist_t node) : Structure()
Array::Array(plist_t node, Node* parent) : Structure(parent)
{
_node = node;
uint32_t size = plist_array_get_size(_node);
@@ -44,36 +38,7 @@ Array::Array(plist_t node) : Structure()
for (uint32_t i = 0; i < size; i++)
{
plist_t subnode = plist_array_get_item(_node, i);
plist_type subtype = plist_get_node_type(subnode);
switch(subtype)
{
case PLIST_DICT:
_array.push_back( new Dictionary(subnode) );
break;
case PLIST_ARRAY:
_array.push_back( new Array(subnode) );
break;
case PLIST_BOOLEAN:
_array.push_back( new Boolean(subnode) );
break;
case PLIST_UINT:
_array.push_back( new Integer(subnode) );
break;
case PLIST_REAL:
_array.push_back( new Real(subnode) );
break;
case PLIST_STRING:
_array.push_back( new String(subnode) );
break;
case PLIST_DATE:
_array.push_back( new Date(subnode) );
break;
case PLIST_DATA:
_array.push_back( new Data(subnode) );
break;
default:
break;
}
_array.push_back( Utils::FromPlist(subnode, this) );
}
}
@@ -86,36 +51,7 @@ Array::Array(PList::Array& a) : Structure()
for (uint32_t i = 0; i < size; i++)
{
plist_t subnode = plist_array_get_item(_node, i);
plist_type subtype = plist_get_node_type(subnode);
switch(subtype)
{
case PLIST_DICT:
_array.push_back( new Dictionary(subnode) );
break;
case PLIST_ARRAY:
_array.push_back( new Array(subnode) );
break;
case PLIST_BOOLEAN:
_array.push_back( new Boolean(subnode) );
break;
case PLIST_UINT:
_array.push_back( new Integer(subnode) );
break;
case PLIST_REAL:
_array.push_back( new Real(subnode) );
break;
case PLIST_STRING:
_array.push_back( new String(subnode) );
break;
case PLIST_DATE:
_array.push_back( new Date(subnode) );
break;
case PLIST_DATA:
_array.push_back( new Data(subnode) );
break;
default:
break;
}
_array.push_back( Utils::FromPlist(subnode, this) );
}
}
@@ -134,36 +70,7 @@ Array& Array::operator=(PList::Array& a)
for (uint32_t i = 0; i < size; i++)
{
plist_t subnode = plist_array_get_item(_node, i);
plist_type subtype = plist_get_node_type(subnode);
switch(subtype)
{
case PLIST_DICT:
_array.push_back( new Dictionary(subnode) );
break;
case PLIST_ARRAY:
_array.push_back( new Array(subnode) );
break;
case PLIST_BOOLEAN:
_array.push_back( new Boolean(subnode) );
break;
case PLIST_UINT:
_array.push_back( new Integer(subnode) );
break;
case PLIST_REAL:
_array.push_back( new Real(subnode) );
break;
case PLIST_STRING:
_array.push_back( new String(subnode) );
break;
case PLIST_DATE:
_array.push_back( new Date(subnode) );
break;
case PLIST_DATA:
_array.push_back( new Data(subnode) );
break;
default:
break;
}
_array.push_back( Utils::FromPlist(subnode, this) );
}
}
@@ -191,6 +98,7 @@ void Array::Append(Node* node)
if (node)
{
Node* clone = node->Clone();
clone->SetParent(this);
plist_array_append_item(_node, clone->GetPlist());
_array.push_back(clone);
}
@@ -201,6 +109,7 @@ void Array::Insert(Node* node, unsigned int pos)
if (node)
{
Node* clone = node->Clone();
clone->SetParent(this);
plist_array_insert_item(_node, clone->GetPlist(), pos);
std::vector<Node*>::iterator it = _array.begin();
it += pos;