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 C++ binding.

Browse Source
This commit is contained in:
Jonathan Beck
2009-10-13 20:04:06 +02:00
parent e492ef675c
commit a922b714c9
24 changed files with 1552 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/Array.cpp
+194
View File
@@ -0,0 +1,194 @@
/*
* 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 <stdlib.h>
#include <plist/Array.h>
#include <plist/Dictionary.h>
namespace PList
{
Array::Array() : Structure(PLIST_ARRAY)
{
_array.clear();
}
Array::Array(plist_t node) : Structure()
{
_node = node;
uint32_t size = plist_array_get_size(_node);
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:
case PLIST_UINT:
case PLIST_REAL:
case PLIST_STRING:
case PLIST_DATE:
case PLIST_DATA:
default:
_array.push_back( new Node(subnode) );
break;
}
}
}
Array::Array(Array& a)
{
plist_free(_node);
for (int it = 0; it < _array.size(); it++)
{
delete _array.at(it);
}
_array.clear();
_node = plist_copy(a.GetPlist());
uint32_t size = plist_array_get_size(_node);
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:
case PLIST_UINT:
case PLIST_REAL:
case PLIST_STRING:
case PLIST_DATE:
case PLIST_DATA:
default:
_array.push_back( new Node(subnode) );
break;
}
}
}
Array& Array::operator=(const Array& a)
{
plist_free(_node);
for (int it = 0; it < _array.size(); it++)
{
delete _array.at(it);
}
_array.clear();
_node = plist_copy(a.GetPlist());
uint32_t size = plist_array_get_size(_node);
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:
case PLIST_UINT:
case PLIST_REAL:
case PLIST_STRING:
case PLIST_DATE:
case PLIST_DATA:
default:
_array.push_back( new Node(subnode) );
break;
}
}
}
Array::~Array()
{
plist_free(_node);
for (int it = 0; it < _array.size(); it++)
{
delete _array.at(it);
}
_array.clear();
}
Node* Array::operator[](unsigned int index)
{
return _array.at(index);
}
void Array::Append(Node* node)
{
if (node)
{
plist_array_append_item(_node, node->GetPlist());
_array.push_back(node);
}
}
void Array::Insert(Node* node, unsigned int pos)
{
if (node)
{
plist_array_insert_item(_node, node->GetPlist(), pos);
std::vector<Node*>::iterator it = _array.begin();
it += pos;
_array.insert(it, node);
}
}
void Array::Remove(Node* node)
{
if (node)
{
uint32_t pos = plist_array_get_item_index(node->GetPlist());
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);
}
};