Format sources to ANSI style using AStyle (astyle --style=ansi).

13 files changed, 880 insertions, 878 deletions

diff --git a/include/plist/Array.h b/include/plist/Array.h
index 8fd07cd..b81e6b1 100644
--- a/include/plist/Array.h
+++ b/include/plist/Array.h
@@ -8,15 +8,15 @@
  * 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 
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
 #ifndef PLIST__ARRAY_H
@@ -30,23 +30,23 @@ namespace PList
 
 class Array : public Structure
 {
-    public :
-        Array(Node* parent = NULL);
-        Array(plist_t node, Node* parent = NULL);
-	Array(Array& a);
-	Array& operator=(Array& a);
-	virtual ~Array();
-
-	Node* Clone();
-
-	Node* operator[](unsigned int index);
-	void Append(Node* node);
-	void Insert(Node* node, unsigned int pos);
-	void Remove(Node* node);
-	void Remove(unsigned int pos);
-	
-    private :
-	std::vector<Node*> _array;
+public :
+    Array(Node* parent = NULL);
+    Array(plist_t node, Node* parent = NULL);
+    Array(Array& a);
+    Array& operator=(Array& a);
+    virtual ~Array();
+
+    Node* Clone();
+
+    Node* operator[](unsigned int index);
+    void Append(Node* node);
+    void Insert(Node* node, unsigned int pos);
+    void Remove(Node* node);
+    void Remove(unsigned int pos);
+
+private :
+    std::vector<Node*> _array;
 };
 
 };
diff --git a/include/plist/Boolean.h b/include/plist/Boolean.h
index 149f8da..731eb9e 100644
--- a/include/plist/Boolean.h
+++ b/include/plist/Boolean.h
@@ -8,15 +8,15 @@
  * 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 
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
 #ifndef PLIST__BOOLEAN_H
@@ -29,18 +29,18 @@ namespace PList
 
 class Boolean : public Node
 {
-    public :
-        Boolean(Node* parent = NULL);
-        Boolean(plist_t node, Node* parent = NULL);
-	Boolean(Boolean& b);
-	Boolean& operator=(Boolean& b);
-	Boolean(bool b);
-	virtual ~Boolean();
-
-	Node* Clone();
-
-	void SetValue(bool b);
-	bool GetValue();
+public :
+    Boolean(Node* parent = NULL);
+    Boolean(plist_t node, Node* parent = NULL);
+    Boolean(Boolean& b);
+    Boolean& operator=(Boolean& b);
+    Boolean(bool b);
+    virtual ~Boolean();
+
+    Node* Clone();
+
+    void SetValue(bool b);
+    bool GetValue();
 };
 
 };
diff --git a/include/plist/Data.h b/include/plist/Data.h
index 59a0096..f8ae715 100644
--- a/include/plist/Data.h
+++ b/include/plist/Data.h
@@ -8,15 +8,15 @@
  * 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 
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
 #ifndef PLIST__DATA_H
@@ -30,18 +30,18 @@ namespace PList
 
 class Data : public Node
 {
-    public :
-        Data(Node* parent = NULL);
-        Data(plist_t node, Node* parent = NULL);
-	Data(Data& d);
-	Data& operator=(Data& d);
-	Data(const std::vector<char>& buff);
-	virtual ~Data();
-
-	Node* Clone();
-
-	void SetValue(const std::vector<char>& buff);
-	std::vector<char> GetValue();
+public :
+    Data(Node* parent = NULL);
+    Data(plist_t node, Node* parent = NULL);
+    Data(Data& d);
+    Data& operator=(Data& d);
+    Data(const std::vector<char>& buff);
+    virtual ~Data();
+
+    Node* Clone();
+
+    void SetValue(const std::vector<char>& buff);
+    std::vector<char> GetValue();
 };
 
 };
diff --git a/include/plist/Date.h b/include/plist/Date.h
index 9c092ea..dc12233 100644
--- a/include/plist/Date.h
+++ b/include/plist/Date.h
@@ -8,15 +8,15 @@
  * 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 
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
 #ifndef PLIST__DATE_H
@@ -34,18 +34,18 @@ namespace PList
 
 class Date : public Node
 {
-    public :
-        Date(Node* parent = NULL);
-        Date(plist_t node, Node* parent = NULL);
-	Date(Date& d);
-	Date& operator=(Date& d);
-	Date(timeval t);
-	virtual ~Date();
-
-	Node* Clone();
-
-	void SetValue(timeval t);
-	timeval GetValue();
+public :
+    Date(Node* parent = NULL);
+    Date(plist_t node, Node* parent = NULL);
+    Date(Date& d);
+    Date& operator=(Date& d);
+    Date(timeval t);
+    virtual ~Date();
+
+    Node* Clone();
+
+    void SetValue(timeval t);
+    timeval GetValue();
 };
 
 };
diff --git a/include/plist/Dictionary.h b/include/plist/Dictionary.h
index 38604c8..e43d29e 100644
--- a/include/plist/Dictionary.h
+++ b/include/plist/Dictionary.h
@@ -8,15 +8,15 @@
  * 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 
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
 #ifndef PLIST__DICTIONARY_H
@@ -31,27 +31,27 @@ namespace PList
 
 class Dictionary : public Structure
 {
-    public :
-        Dictionary(Node* parent = NULL);
-        Dictionary(plist_t node, Node* parent = NULL);
-	Dictionary(Dictionary& d);
-	Dictionary& operator=(Dictionary& d);
-	virtual ~Dictionary();
-
-	Node* Clone();
-
-	typedef std::map<std::string,Node*>::iterator iterator;
-	
-	Node* operator[](const std::string& key);
-	iterator Begin();
-	iterator End();
-	iterator Find(const std::string& key);
-	iterator Insert(const std::string& key, Node* node);
-	void Remove(Node* node);
-	void Remove(const std::string& key);
-	
-    private :
-	std::map<std::string,Node*> _map;
+public :
+    Dictionary(Node* parent = NULL);
+    Dictionary(plist_t node, Node* parent = NULL);
+    Dictionary(Dictionary& d);
+    Dictionary& operator=(Dictionary& d);
+    virtual ~Dictionary();
+
+    Node* Clone();
+
+    typedef std::map<std::string,Node*>::iterator iterator;
+
+    Node* operator[](const std::string& key);
+    iterator Begin();
+    iterator End();
+    iterator Find(const std::string& key);
+    iterator Insert(const std::string& key, Node* node);
+    void Remove(Node* node);
+    void Remove(const std::string& key);
+
+private :
+    std::map<std::string,Node*> _map;
 
 
 };
diff --git a/include/plist/Integer.h b/include/plist/Integer.h
index fefcea1..7cdf0df 100644
--- a/include/plist/Integer.h
+++ b/include/plist/Integer.h
@@ -8,15 +8,15 @@
  * 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 
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
 #ifndef PLIST__INTEGER_H
@@ -29,18 +29,18 @@ namespace PList
 
 class Integer : public Node
 {
-    public :
-        Integer(Node* parent = NULL);
-        Integer(plist_t node, Node* parent = NULL);
-	Integer(Integer& i);
-	Integer& operator=(Integer& i);
-	Integer(uint64_t i);
-	virtual ~Integer();
-
-	Node* Clone();
-
-	void SetValue(uint64_t i);
-	uint64_t GetValue();
+public :
+    Integer(Node* parent = NULL);
+    Integer(plist_t node, Node* parent = NULL);
+    Integer(Integer& i);
+    Integer& operator=(Integer& i);
+    Integer(uint64_t i);
+    virtual ~Integer();
+
+    Node* Clone();
+
+    void SetValue(uint64_t i);
+    uint64_t GetValue();
 };
 
 };
diff --git a/include/plist/Node.h b/include/plist/Node.h
index 6e5411a..7ea6ed9 100644
--- a/include/plist/Node.h
+++ b/include/plist/Node.h
@@ -8,15 +8,15 @@
  * 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 
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
 #ifndef PLIST__NODE_H
@@ -29,22 +29,22 @@ namespace PList
 
 class Node
 {
-    public :
-	virtual ~Node();
-
-	virtual Node* Clone() = 0;
-	Node * GetParent();
-        void SetParent(Node* parent);
-
-	plist_type GetType();
-	plist_t GetPlist();
-	
-    protected:
-        Node(Node* parent = NULL);
-        Node(plist_t node, Node* parent = NULL);
-        Node(plist_type type, Node* parent = NULL);
-	plist_t _node;
-        Node* _parent;
+public :
+    virtual ~Node();
+
+    virtual Node* Clone() = 0;
+    Node * GetParent();
+    void SetParent(Node* parent);
+
+    plist_type GetType();
+    plist_t GetPlist();
+
+protected:
+    Node(Node* parent = NULL);
+    Node(plist_t node, Node* parent = NULL);
+    Node(plist_type type, Node* parent = NULL);
+    plist_t _node;
+    Node* _parent;
 };
 
 };
diff --git a/include/plist/Real.h b/include/plist/Real.h
index 755842e..7d6f8e2 100644
--- a/include/plist/Real.h
+++ b/include/plist/Real.h
@@ -8,15 +8,15 @@
  * 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 
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
 #ifndef PLIST__REAL_H
@@ -29,18 +29,18 @@ namespace PList
 
 class Real : public Node
 {
-    public :
-        Real(Node* parent = NULL);
-        Real(plist_t node, Node* parent = NULL);
-	Real(Real& d);
-	Real& operator=(Real& d);
-	Real(double d);
-	virtual ~Real();
-
-	Node* Clone();
-
-	void SetValue(double d);
-	double GetValue();
+public :
+    Real(Node* parent = NULL);
+    Real(plist_t node, Node* parent = NULL);
+    Real(Real& d);
+    Real& operator=(Real& d);
+    Real(double d);
+    virtual ~Real();
+
+    Node* Clone();
+
+    void SetValue(double d);
+    double GetValue();
 };
 
 };
diff --git a/include/plist/String.h b/include/plist/String.h
index 58b8619..bd8680d 100644
--- a/include/plist/String.h
+++ b/include/plist/String.h
@@ -8,15 +8,15 @@
  * 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 
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
 #ifndef PLIST__STRING_H
@@ -30,18 +30,18 @@ namespace PList
 
 class String : public Node
 {
-    public :
-        String(Node* parent = NULL);
-        String(plist_t node, Node* parent = NULL);
-	String(String& s);
-	String& operator=(String& s);
-	String(const std::string& s);
-	virtual ~String();
-
-	Node* Clone();
-
-	void SetValue(const std::string& s);
-	std::string GetValue();
+public :
+    String(Node* parent = NULL);
+    String(plist_t node, Node* parent = NULL);
+    String(String& s);
+    String& operator=(String& s);
+    String(const std::string& s);
+    virtual ~String();
+
+    Node* Clone();
+
+    void SetValue(const std::string& s);
+    std::string GetValue();
 };
 
 };
diff --git a/include/plist/Structure.h b/include/plist/Structure.h
index 239a8b8..66d9293 100644
--- a/include/plist/Structure.h
+++ b/include/plist/Structure.h
@@ -8,15 +8,15 @@
  * 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 
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
 #ifndef PLIST__STRUCTURE_H
@@ -31,23 +31,23 @@ namespace PList
 
 class Structure : public Node
 {
-    public :
-	virtual ~Structure();
+public :
+    virtual ~Structure();
+
+    uint32_t GetSize();
 
-	uint32_t GetSize();
+    std::string ToXml();
+    std::vector<char> ToBin();
 
-	std::string ToXml();
-	std::vector<char> ToBin();
+    virtual void Remove(Node* node) = 0;
 
-        virtual void Remove(Node* node) = 0;
-	
-    protected:
-        Structure(Node* parent = NULL);
-        Structure(plist_type type, Node* parent = NULL);
+protected:
+    Structure(Node* parent = NULL);
+    Structure(plist_type type, Node* parent = NULL);
 
-    private:
-	Structure(Structure& s);
-	Structure& operator=(const Structure& s);
+private:
+    Structure(Structure& s);
+    Structure& operator=(const Structure& s);
 };
 
 };
diff --git a/include/plist/Utils.h b/include/plist/Utils.h
index 4cf6003..52503a0 100644
--- a/include/plist/Utils.h
+++ b/include/plist/Utils.h
@@ -8,15 +8,15 @@
  * 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 
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
 #ifndef PLIST__UTILS_H
@@ -27,17 +27,17 @@
 
 namespace PList
 {
-    class Utils
-    {
-	public:
-            static Node* FromPlist(plist_t node, Node* parent = NULL);
-	    static Structure* FromXml(const std::string& xml);
-	    static Structure* FromBin(const std::vector<char>& bin);
+class Utils
+{
+public:
+    static Node* FromPlist(plist_t node, Node* parent = NULL);
+    static Structure* FromXml(const std::string& xml);
+    static Structure* FromBin(const std::vector<char>& bin);
 
-	private:
-	    Utils();
-	    ~Utils();
-    };
+private:
+    Utils();
+    ~Utils();
+};
 };
 
 #endif // PLIST__UTILS_H
diff --git a/include/plist/plist++.h b/include/plist/plist++.h
index 7d59e68..79181c5 100644
--- a/include/plist/plist++.h
+++ b/include/plist/plist++.h
@@ -8,15 +8,15 @@
  * 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 
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
 #ifndef LIBPLISTXX_H
diff --git a/include/plist/plist.h b/include/plist/plist.h
index 699a0d6..d3f0836 100644
--- a/include/plist/plist.h
+++ b/include/plist/plist.h
@@ -8,22 +8,23 @@
  * 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 
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
 #ifndef LIBPLIST_H
 #define LIBPLIST_H
 
 #ifdef __cplusplus
-extern "C" {
+extern "C"
+{
 #endif
 
 #ifdef _MSC_VER
@@ -37,705 +38,706 @@ extern "C" {
     typedef unsigned __int32 uint32_t;
     typedef unsigned __int64 uint64_t;
 
-    #ifdef plist_EXPORTS
-        #define PLIST_API  __declspec( dllexport )
-    #else
-        #define PLIST_API  __declspec( dllimport )
-    #endif
+#ifdef plist_EXPORTS
+#define PLIST_API  __declspec( dllexport )
+#else
+#define PLIST_API  __declspec( dllimport )
+#endif
 #else
-    #include <stdint.h>
-    #define PLIST_API
+#include <stdint.h>
+#define PLIST_API
 #endif
 
 #include <sys/types.h>
 #include <stdarg.h>
 
-/**
- * \mainpage libplist : A library to handle Apple Property Lists
- * \defgroup PublicAPI Public libplist API
- */
-/*@{*/
-
-
-/**
- * The basic plist abstract data type.
- */
-	typedef void *plist_t;
-
-/**
- * The plist dictionary iterator.
- */
-	typedef void *plist_dict_iter;
-
-/**
- * The enumeration of plist node types.
- */
-	typedef enum {
-		PLIST_BOOLEAN,	/**< Boolean, scalar type */
-		PLIST_UINT,	/**< Unsigned integer, scalar type */
-		PLIST_REAL,	/**< Real, scalar type */
-		PLIST_STRING,	/**< ASCII string, scalar type */
-		PLIST_ARRAY,	/**< Ordered array, structured type */
-		PLIST_DICT,	/**< Unordered dictionary (key/value pair), structured type */
-		PLIST_DATE,	/**< Date, scalar type */
-		PLIST_DATA,	/**< Binary data, scalar type */
-		PLIST_KEY,	/**< Key in dictionaries (ASCII String), scalar type */
-		PLIST_NONE	/**< No type */
-	} plist_type;
-
-
-/********************************************
- *                                          *
- *          Creation & Destruction          *
- *                                          *
- ********************************************/
-
-/**
- * Create a new root plist_t type #PLIST_DICT
- *
- * @return the created plist
- * @sa #plist_type
- */
-	PLIST_API plist_t plist_new_dict(void);
-
-/**
- * Create a new root plist_t type #PLIST_ARRAY
- *
- * @return the created plist
- * @sa #plist_type
- */
-	PLIST_API plist_t plist_new_array(void);
-
-/**
- * Create a new plist_t type #PLIST_STRING
- *
- * @param val the sting value, encoded in UTF8.
- * @return the created item
- * @sa #plist_type
- */
-	PLIST_API plist_t plist_new_string(const char *val);
-
-/**
- * Create a new plist_t type #PLIST_BOOLEAN
- *
- * @param val the boolean value, 0 is false, other values are true.
- * @return the created item
- * @sa #plist_type
- */
-	PLIST_API plist_t plist_new_bool(uint8_t val);
-
-/**
- * Create a new plist_t type #PLIST_UINT
- *
- * @param val the unsigned integer value
- * @return the created item
- * @sa #plist_type
- */
-	PLIST_API plist_t plist_new_uint(uint64_t val);
-
-/**
- * Create a new plist_t type #PLIST_REAL
- *
- * @param val the real value
- * @return the created item
- * @sa #plist_type
- */
-	PLIST_API plist_t plist_new_real(double val);
-
-/**
- * Create a new plist_t type #PLIST_DATA
- *
- * @param val the binary buffer
- * @param length the length of the buffer
- * @return the created item
- * @sa #plist_type
- */
-	PLIST_API plist_t plist_new_data(const char *val, uint64_t length);
-
-/**
- * Create a new plist_t type #PLIST_DATE
- *
- * @param sec the number of seconds since 01/01/2001
- * @param usec the number of microseconds
- * @return the created item
- * @sa #plist_type
- */
-	PLIST_API plist_t plist_new_date(int32_t sec, int32_t usec);
-
-/**
- * Destruct a plist_t node and all its children recursively
- *
- * @param plist the plist to free
- */
-	PLIST_API void plist_free(plist_t plist);
-
-/**
- * Return a copy of passed node and it's children
- *
- * @param plist the plist to copy
- * @return copied plist
- */
-	PLIST_API plist_t plist_copy(plist_t node);
-
-
-/********************************************
- *                                          *
- *            Array functions               *
- *                                          *
- ********************************************/
-
-/**
- * Get size of a #PLIST_ARRAY node.
- *
- * @param node the node of type #PLIST_ARRAY
- * @return size of the #PLIST_ARRAY node
- */
-	PLIST_API uint32_t plist_array_get_size(plist_t node);
-
-/**
- * Get the nth item in a #PLIST_ARRAY node.
- *
- * @param node the node of type #PLIST_ARRAY
- * @param n the index of the item to get. Range is [0, array_size[
- * @return the nth item or NULL if node is not of type #PLIST_ARRAY
- */
-	PLIST_API plist_t plist_array_get_item(plist_t node, uint32_t n);
-
-/**
- * Get the index of an item. item must be a member of a #PLIST_ARRAY node.
- *
- * @param node the node
- * @return the node index
- */
-	PLIST_API uint32_t plist_array_get_item_index(plist_t node);
-
-/**
- * Set the nth item in a #PLIST_ARRAY node.
- * The previous item at index n will be freed using #plist_free
- *
- * @param node the node of type #PLIST_ARRAY
- * @param item the new item at index n
- * @param n the index of the item to get. Range is [0, array_size[. Assert if n is not in range.
- */
-	PLIST_API void plist_array_set_item(plist_t node, plist_t item, uint32_t n);
-
-/**
- * Append a new item at the end of a #PLIST_ARRAY node.
- *
- * @param node the node of type #PLIST_ARRAY
- * @param item the new item
- */
-	PLIST_API void plist_array_append_item(plist_t node, plist_t item);
-
-/**
- * Insert a new item at position n in a #PLIST_ARRAY node.
- *
- * @param node the node of type #PLIST_ARRAY
- * @param item the new item to insert
- * @param n The position at which the node will be stored. Range is [0, array_size[. Assert if n is not in range.
- */
-	PLIST_API void plist_array_insert_item(plist_t node, plist_t item, uint32_t n);
-
-/**
- * Remove an existing position in a #PLIST_ARRAY node.
- * Removed position will be freed using #plist_free
- *
- * @param node the node of type #PLIST_ARRAY
- * @param n The position to remove. Range is [0, array_size[. Assert if n is not in range.
- */
-	PLIST_API void plist_array_remove_item(plist_t node, uint32_t n);
-
-/********************************************
- *                                          *
- *         Dictionary functions             *
- *                                          *
- ********************************************/
-
-/**
- * Get size of a #PLIST_DICT node.
- *
- * @param node the node of type #PLIST_DICT
- * @return size of the #PLIST_DICT node
- */
-	PLIST_API uint32_t plist_dict_get_size(plist_t node);
-
-/**
- * Create iterator of a #PLIST_DICT node.
- * The allocated iterator shoult be freed with tandard free function
- *
- * @param node the node of type #PLIST_DICT
- * @param iter iterator of the #PLIST_DICT node
- */
-	PLIST_API void plist_dict_new_iter(plist_t node, plist_dict_iter *iter);
-
-/**
- * Increment iterator of a #PLIST_DICT node.
- *
- * @param node the node of type #PLIST_DICT
- * @param iter iterator of the dictionary
- * @param key a location to store the key, or NULL.
- * @param val a location to store the value, or NULL.
- */
-	PLIST_API void plist_dict_next_item(plist_t node, plist_dict_iter iter, char **key, plist_t *val);
-
-/**
- * Get key associated to an item. Item must be member of a dictionary
- *
- * @param node the node
- * @param key a location to store the key.
- */
-	PLIST_API void plist_dict_get_item_key(plist_t node, char **key);
-
-/**
- * Get the nth item in a #PLIST_DICT node.
- *
- * @param node the node of type #PLIST_DICT
- * @param key the identifier of the item to get.
- * @return the item or NULL if node is not of type #PLIST_DICT
- */
-	PLIST_API plist_t plist_dict_get_item(plist_t node, const char* key);
-
-/**
- * Set item identified by key in a #PLIST_DICT node.
- * The previous item at index n will be freed using #plist_free
- *
- * @param node the node of type #PLIST_DICT
- * @param item the new item associated to key
- * @param key the identifier of the item to get. Assert if identifier is not present.
- */
-	PLIST_API void plist_dict_set_item(plist_t node, const char* key, plist_t item);
-
-/**
- * Insert a new item at position n in a #PLIST_DICT node.
- *
- * @param node the node of type #PLIST_DICT
- * @param item the new item to insert
- * @param key The identifier of the item to insert. Assert if identifier already present.
- */
-	PLIST_API void plist_dict_insert_item(plist_t node, const char* key, plist_t item);
-
-/**
- * Remove an existing position in a #PLIST_DICT node.
- * Removed position will be freed using #plist_free
- *
- * @param node the node of type #PLIST_DICT
- * @param key The identifier of the item to remove. Assert if identifier is not present.
- */
-	PLIST_API void plist_dict_remove_item(plist_t node, const char* key);
-
-
-/********************************************
- *                                          *
- *                Getters                   *
- *                                          *
- ********************************************/
-
-/**
- * Get the parent of a node
- *
- * @param node the parent (NULL if node is root)
- */
-	PLIST_API plist_t plist_get_parent(plist_t node);
-
-/**
- * Get the #plist_type of a node.
- *
- * @param node the node
- * @return the type of the node
- */
-	PLIST_API plist_type plist_get_node_type(plist_t node);
-
-/**
- * Get the value of a #PLIST_KEY node.
- * This function does nothing if node is not of type #PLIST_KEY
- *
- * @param node the node
- * @param val a pointer to a C-string. This function allocates the memory,
- *            caller is responsible for freeing it.
- */
-	PLIST_API void plist_get_key_val(plist_t node, char **val);
-
-/**
- * Get the value of a #PLIST_STRING node.
- * This function does nothing if node is not of type #PLIST_STRING
- *
- * @param node the node
- * @param val a pointer to a C-string. This function allocates the memory,
- *            caller is responsible for freeing it. Data is UTF-8 encoded.
- */
-	PLIST_API void plist_get_string_val(plist_t node, char **val);
-
-/**
- * Get the value of a #PLIST_BOOLEAN node.
- * This function does nothing if node is not of type #PLIST_BOOLEAN
- *
- * @param node the node
- * @param val a pointer to a uint8_t variable.
- */
-	PLIST_API void plist_get_bool_val(plist_t node, uint8_t * val);
-
-/**
- * Get the value of a #PLIST_UINT node.
- * This function does nothing if node is not of type #PLIST_UINT
- *
- * @param node the node
- * @param val a pointer to a uint64_t variable.
- */
-	PLIST_API void plist_get_uint_val(plist_t node, uint64_t * val);
-
-/**
- * Get the value of a #PLIST_REAL node.
- * This function does nothing if node is not of type #PLIST_REAL
- *
- * @param node the node
- * @param val a pointer to a double variable.
- */
-	PLIST_API void plist_get_real_val(plist_t node, double *val);
-
-/**
- * Get the value of a #PLIST_DATA node.
- * This function does nothing if node is not of type #PLIST_DATA
- *
- * @param node the node
- * @param val a pointer to an unallocated char buffer. This function allocates the memory,
- *            caller is responsible for freeing it.
- */
-	PLIST_API void plist_get_data_val(plist_t node, char **val, uint64_t * length);
-
-/**
- * Get the value of a #PLIST_DATE node.
- * This function does nothing if node is not of type #PLIST_DATE
- *
- * @param node the node
- * @param sec a pointer to an int32_t variable. Represents the number of seconds since 01/01/2001.
- * @param usec a pointer to an int32_t variable. Represents the number of microseconds
- */
-	PLIST_API void plist_get_date_val(plist_t node, int32_t * sec, int32_t * usec);
-
-
-/********************************************
- *                                          *
- *                Setters                   *
- *                                          *
- ********************************************/
-
-/**
- * Forces type of node. Changing type of structured nodes is only allowed if node is empty.
- * Reset value of node;
- * @param node the node
- * @param type the key value
- */
-	PLIST_API void plist_set_type(plist_t node, plist_type type);
-
-/**
- * Set the value of a node.
- * Forces type of node to #PLIST_KEY
- *
- * @param node the node
- * @param val the key value
- */
-	PLIST_API void plist_set_key_val(plist_t node, const char *val);
-
-/**
- * Set the value of a node.
- * Forces type of node to #PLIST_STRING
- *
- * @param node the node
- * @param val the string value
- */
-	PLIST_API void plist_set_string_val(plist_t node, const char *val);
-
-/**
- * Set the value of a node.
- * Forces type of node to #PLIST_BOOLEAN
- *
- * @param node the node
- * @param val the boolean value
- */
-	PLIST_API void plist_set_bool_val(plist_t node, uint8_t val);
-
-/**
- * Set the value of a node.
- * Forces type of node to #PLIST_UINT
- *
- * @param node the node
- * @param val the unsigned integer value
- */
-	PLIST_API void plist_set_uint_val(plist_t node, uint64_t val);
-
-/**
- * Set the value of a node.
- * Forces type of node to #PLIST_REAL
- *
- * @param node the node
- * @param val the real value
- */
-	PLIST_API void plist_set_real_val(plist_t node, double val);
-
-/**
- * Set the value of a node.
- * Forces type of node to #PLIST_DATA
- *
- * @param node the node
- * @param val the binary buffer
- * @param length the length of the buffer
- */
-	PLIST_API void plist_set_data_val(plist_t node, const char *val, uint64_t length);
-
-/**
- * Set the value of a node.
- * Forces type of node to #PLIST_DATE
- *
- * @param node the node
- * @param sec the number of seconds since 01/01/2001
- * @param usec the number of microseconds
- */
-	PLIST_API void plist_set_date_val(plist_t node, int32_t sec, int32_t usec);
-
-
-/********************************************
- *                                          *
- *            Import & Export               *
- *                                          *
- ********************************************/
-
-/**
- * Export the #plist_t structure to XML format.
- *
- * @param plist the root node to export
- * @param plist_xml a pointer to a C-string. This function allocates the memory,
- *            caller is responsible for freeing it. Data is UTF-8 encoded.
- * @param length a pointer to an uint32_t variable. Represents the length of the allocated buffer.
- */
-	PLIST_API void plist_to_xml(plist_t plist, char **plist_xml, uint32_t * length);
-
-/**
- * Export the #plist_t structure to binary format.
- *
- * @param plist the root node to export
- * @param plist_bin a pointer to a char* buffer. This function allocates the memory,
- *            caller is responsible for freeing it.
- * @param length a pointer to an uint32_t variable. Represents the length of the allocated buffer.
- */
-	PLIST_API void plist_to_bin(plist_t plist, char **plist_bin, uint32_t * length);
-
-/**
- * Import the #plist_t structure from XML format.
- *
- * @param plist_xml a pointer to the xml buffer.
- * @param length length of the buffer to read.
- * @param plist a pointer to the imported plist.
- */
-	PLIST_API void plist_from_xml(const char *plist_xml, uint32_t length, plist_t * plist);
-
-/**
- * Import the #plist_t structure from binary format.
- *
- * @param plist_bin a pointer to the xml buffer.
- * @param length length of the buffer to read.
- * @param plist a pointer to the imported plist.
- */
-	PLIST_API void plist_from_bin(const char *plist_bin, uint32_t length, plist_t * plist);
-
-
-/********************************************
- *                                          *
- *                 Utils                    *
- *                                          *
- ********************************************/
-
-/**
- * Get a node from its path. Each path element depends on the associated father node type.
- * For Dictionaries, var args are casted to const char*, for arrays, var args are caster to uint32_t
- * Search is breath first order.
- *
- * @param plist the node to access result from.
- * @param length length of the path to access
- * @return the value to access.
- */
-	PLIST_API plist_t plist_access_path(plist_t plist, uint32_t length, ...);
-
-/**
- * Variadic version of #plist_access_path.
- *
- * @param plist the node to access result from.
- * @param length length of the path to access
- * @param v list of array's index and dic'st key
- * @return the value to access.
- */
-	PLIST_API plist_t plist_access_pathv(plist_t plist, uint32_t length, va_list v);
-
-/**
- * Compare two node values
- *
- * @param node_l left node to compare
- * @param node_r rigth node to compare
- * @return TRUE is type and value match, FALSE otherwise.
- */
-	PLIST_API char plist_compare_node_value(plist_t node_l, plist_t node_r);
+    /**
+     * \mainpage libplist : A library to handle Apple Property Lists
+     * \defgroup PublicAPI Public libplist API
+     */
+    /*@{*/
+
+
+    /**
+     * The basic plist abstract data type.
+     */
+    typedef void *plist_t;
+
+    /**
+     * The plist dictionary iterator.
+     */
+    typedef void *plist_dict_iter;
+
+    /**
+     * The enumeration of plist node types.
+     */
+    typedef enum
+    {
+        PLIST_BOOLEAN,	/**< Boolean, scalar type */
+        PLIST_UINT,	/**< Unsigned integer, scalar type */
+        PLIST_REAL,	/**< Real, scalar type */
+        PLIST_STRING,	/**< ASCII string, scalar type */
+        PLIST_ARRAY,	/**< Ordered array, structured type */
+        PLIST_DICT,	/**< Unordered dictionary (key/value pair), structured type */
+        PLIST_DATE,	/**< Date, scalar type */
+        PLIST_DATA,	/**< Binary data, scalar type */
+        PLIST_KEY,	/**< Key in dictionaries (ASCII String), scalar type */
+        PLIST_NONE	/**< No type */
+    } plist_type;
+
+
+    /********************************************
+     *                                          *
+     *          Creation & Destruction          *
+     *                                          *
+     ********************************************/
+
+    /**
+     * Create a new root plist_t type #PLIST_DICT
+     *
+     * @return the created plist
+     * @sa #plist_type
+     */
+    PLIST_API plist_t plist_new_dict(void);
+
+    /**
+     * Create a new root plist_t type #PLIST_ARRAY
+     *
+     * @return the created plist
+     * @sa #plist_type
+     */
+    PLIST_API plist_t plist_new_array(void);
+
+    /**
+     * Create a new plist_t type #PLIST_STRING
+     *
+     * @param val the sting value, encoded in UTF8.
+     * @return the created item
+     * @sa #plist_type
+     */
+    PLIST_API plist_t plist_new_string(const char *val);
+
+    /**
+     * Create a new plist_t type #PLIST_BOOLEAN
+     *
+     * @param val the boolean value, 0 is false, other values are true.
+     * @return the created item
+     * @sa #plist_type
+     */
+    PLIST_API plist_t plist_new_bool(uint8_t val);
+
+    /**
+     * Create a new plist_t type #PLIST_UINT
+     *
+     * @param val the unsigned integer value
+     * @return the created item
+     * @sa #plist_type
+     */
+    PLIST_API plist_t plist_new_uint(uint64_t val);
+
+    /**
+     * Create a new plist_t type #PLIST_REAL
+     *
+     * @param val the real value
+     * @return the created item
+     * @sa #plist_type
+     */
+    PLIST_API plist_t plist_new_real(double val);
+
+    /**
+     * Create a new plist_t type #PLIST_DATA
+     *
+     * @param val the binary buffer
+     * @param length the length of the buffer
+     * @return the created item
+     * @sa #plist_type
+     */
+    PLIST_API plist_t plist_new_data(const char *val, uint64_t length);
+
+    /**
+     * Create a new plist_t type #PLIST_DATE
+     *
+     * @param sec the number of seconds since 01/01/2001
+     * @param usec the number of microseconds
+     * @return the created item
+     * @sa #plist_type
+     */
+    PLIST_API plist_t plist_new_date(int32_t sec, int32_t usec);
+
+    /**
+     * Destruct a plist_t node and all its children recursively
+     *
+     * @param plist the plist to free
+     */
+    PLIST_API void plist_free(plist_t plist);
+
+    /**
+     * Return a copy of passed node and it's children
+     *
+     * @param plist the plist to copy
+     * @return copied plist
+     */
+    PLIST_API plist_t plist_copy(plist_t node);
+
+
+    /********************************************
+     *                                          *
+     *            Array functions               *
+     *                                          *
+     ********************************************/
+
+    /**
+     * Get size of a #PLIST_ARRAY node.
+     *
+     * @param node the node of type #PLIST_ARRAY
+     * @return size of the #PLIST_ARRAY node
+     */
+    PLIST_API uint32_t plist_array_get_size(plist_t node);
+
+    /**
+     * Get the nth item in a #PLIST_ARRAY node.
+     *
+     * @param node the node of type #PLIST_ARRAY
+     * @param n the index of the item to get. Range is [0, array_size[
+     * @return the nth item or NULL if node is not of type #PLIST_ARRAY
+     */
+    PLIST_API plist_t plist_array_get_item(plist_t node, uint32_t n);
+
+    /**
+     * Get the index of an item. item must be a member of a #PLIST_ARRAY node.
+     *
+     * @param node the node
+     * @return the node index
+     */
+    PLIST_API uint32_t plist_array_get_item_index(plist_t node);
+
+    /**
+     * Set the nth item in a #PLIST_ARRAY node.
+     * The previous item at index n will be freed using #plist_free
+     *
+     * @param node the node of type #PLIST_ARRAY
+     * @param item the new item at index n
+     * @param n the index of the item to get. Range is [0, array_size[. Assert if n is not in range.
+     */
+    PLIST_API void plist_array_set_item(plist_t node, plist_t item, uint32_t n);
+
+    /**
+     * Append a new item at the end of a #PLIST_ARRAY node.
+     *
+     * @param node the node of type #PLIST_ARRAY
+     * @param item the new item
+     */
+    PLIST_API void plist_array_append_item(plist_t node, plist_t item);
+
+    /**
+     * Insert a new item at position n in a #PLIST_ARRAY node.
+     *
+     * @param node the node of type #PLIST_ARRAY
+     * @param item the new item to insert
+     * @param n The position at which the node will be stored. Range is [0, array_size[. Assert if n is not in range.
+     */
+    PLIST_API void plist_array_insert_item(plist_t node, plist_t item, uint32_t n);
+
+    /**
+     * Remove an existing position in a #PLIST_ARRAY node.
+     * Removed position will be freed using #plist_free
+     *
+     * @param node the node of type #PLIST_ARRAY
+     * @param n The position to remove. Range is [0, array_size[. Assert if n is not in range.
+     */
+    PLIST_API void plist_array_remove_item(plist_t node, uint32_t n);
+
+    /********************************************
+     *                                          *
+     *         Dictionary functions             *
+     *                                          *
+     ********************************************/
+
+    /**
+     * Get size of a #PLIST_DICT node.
+     *
+     * @param node the node of type #PLIST_DICT
+     * @return size of the #PLIST_DICT node
+     */
+    PLIST_API uint32_t plist_dict_get_size(plist_t node);
+
+    /**
+     * Create iterator of a #PLIST_DICT node.
+     * The allocated iterator shoult be freed with tandard free function
+     *
+     * @param node the node of type #PLIST_DICT
+     * @param iter iterator of the #PLIST_DICT node
+     */
+    PLIST_API void plist_dict_new_iter(plist_t node, plist_dict_iter *iter);
+
+    /**
+     * Increment iterator of a #PLIST_DICT node.
+     *
+     * @param node the node of type #PLIST_DICT
+     * @param iter iterator of the dictionary
+     * @param key a location to store the key, or NULL.
+     * @param val a location to store the value, or NULL.
+     */
+    PLIST_API void plist_dict_next_item(plist_t node, plist_dict_iter iter, char **key, plist_t *val);
+
+    /**
+     * Get key associated to an item. Item must be member of a dictionary
+     *
+     * @param node the node
+     * @param key a location to store the key.
+     */
+    PLIST_API void plist_dict_get_item_key(plist_t node, char **key);
+
+    /**
+     * Get the nth item in a #PLIST_DICT node.
+     *
+     * @param node the node of type #PLIST_DICT
+     * @param key the identifier of the item to get.
+     * @return the item or NULL if node is not of type #PLIST_DICT
+     */
+    PLIST_API plist_t plist_dict_get_item(plist_t node, const char* key);
+
+    /**
+     * Set item identified by key in a #PLIST_DICT node.
+     * The previous item at index n will be freed using #plist_free
+     *
+     * @param node the node of type #PLIST_DICT
+     * @param item the new item associated to key
+     * @param key the identifier of the item to get. Assert if identifier is not present.
+     */
+    PLIST_API void plist_dict_set_item(plist_t node, const char* key, plist_t item);
+
+    /**
+     * Insert a new item at position n in a #PLIST_DICT node.
+     *
+     * @param node the node of type #PLIST_DICT
+     * @param item the new item to insert
+     * @param key The identifier of the item to insert. Assert if identifier already present.
+     */
+    PLIST_API void plist_dict_insert_item(plist_t node, const char* key, plist_t item);
+
+    /**
+     * Remove an existing position in a #PLIST_DICT node.
+     * Removed position will be freed using #plist_free
+     *
+     * @param node the node of type #PLIST_DICT
+     * @param key The identifier of the item to remove. Assert if identifier is not present.
+     */
+    PLIST_API void plist_dict_remove_item(plist_t node, const char* key);
+
+
+    /********************************************
+     *                                          *
+     *                Getters                   *
+     *                                          *
+     ********************************************/
+
+    /**
+     * Get the parent of a node
+     *
+     * @param node the parent (NULL if node is root)
+     */
+    PLIST_API plist_t plist_get_parent(plist_t node);
+
+    /**
+     * Get the #plist_type of a node.
+     *
+     * @param node the node
+     * @return the type of the node
+     */
+    PLIST_API plist_type plist_get_node_type(plist_t node);
+
+    /**
+     * Get the value of a #PLIST_KEY node.
+     * This function does nothing if node is not of type #PLIST_KEY
+     *
+     * @param node the node
+     * @param val a pointer to a C-string. This function allocates the memory,
+     *            caller is responsible for freeing it.
+     */
+    PLIST_API void plist_get_key_val(plist_t node, char **val);
+
+    /**
+     * Get the value of a #PLIST_STRING node.
+     * This function does nothing if node is not of type #PLIST_STRING
+     *
+     * @param node the node
+     * @param val a pointer to a C-string. This function allocates the memory,
+     *            caller is responsible for freeing it. Data is UTF-8 encoded.
+     */
+    PLIST_API void plist_get_string_val(plist_t node, char **val);
+
+    /**
+     * Get the value of a #PLIST_BOOLEAN node.
+     * This function does nothing if node is not of type #PLIST_BOOLEAN
+     *
+     * @param node the node
+     * @param val a pointer to a uint8_t variable.
+     */
+    PLIST_API void plist_get_bool_val(plist_t node, uint8_t * val);
+
+    /**
+     * Get the value of a #PLIST_UINT node.
+     * This function does nothing if node is not of type #PLIST_UINT
+     *
+     * @param node the node
+     * @param val a pointer to a uint64_t variable.
+     */
+    PLIST_API void plist_get_uint_val(plist_t node, uint64_t * val);
+
+    /**
+     * Get the value of a #PLIST_REAL node.
+     * This function does nothing if node is not of type #PLIST_REAL
+     *
+     * @param node the node
+     * @param val a pointer to a double variable.
+     */
+    PLIST_API void plist_get_real_val(plist_t node, double *val);
+
+    /**
+     * Get the value of a #PLIST_DATA node.
+     * This function does nothing if node is not of type #PLIST_DATA
+     *
+     * @param node the node
+     * @param val a pointer to an unallocated char buffer. This function allocates the memory,
+     *            caller is responsible for freeing it.
+     */
+    PLIST_API void plist_get_data_val(plist_t node, char **val, uint64_t * length);
+
+    /**
+     * Get the value of a #PLIST_DATE node.
+     * This function does nothing if node is not of type #PLIST_DATE
+     *
+     * @param node the node
+     * @param sec a pointer to an int32_t variable. Represents the number of seconds since 01/01/2001.
+     * @param usec a pointer to an int32_t variable. Represents the number of microseconds
+     */
+    PLIST_API void plist_get_date_val(plist_t node, int32_t * sec, int32_t * usec);
+
+
+    /********************************************
+     *                                          *
+     *                Setters                   *
+     *                                          *
+     ********************************************/
+
+    /**
+     * Forces type of node. Changing type of structured nodes is only allowed if node is empty.
+     * Reset value of node;
+     * @param node the node
+     * @param type the key value
+     */
+    PLIST_API void plist_set_type(plist_t node, plist_type type);
+
+    /**
+     * Set the value of a node.
+     * Forces type of node to #PLIST_KEY
+     *
+     * @param node the node
+     * @param val the key value
+     */
+    PLIST_API void plist_set_key_val(plist_t node, const char *val);
+
+    /**
+     * Set the value of a node.
+     * Forces type of node to #PLIST_STRING
+     *
+     * @param node the node
+     * @param val the string value
+     */
+    PLIST_API void plist_set_string_val(plist_t node, const char *val);
+
+    /**
+     * Set the value of a node.
+     * Forces type of node to #PLIST_BOOLEAN
+     *
+     * @param node the node
+     * @param val the boolean value
+     */
+    PLIST_API void plist_set_bool_val(plist_t node, uint8_t val);
+
+    /**
+     * Set the value of a node.
+     * Forces type of node to #PLIST_UINT
+     *
+     * @param node the node
+     * @param val the unsigned integer value
+     */
+    PLIST_API void plist_set_uint_val(plist_t node, uint64_t val);
+
+    /**
+     * Set the value of a node.
+     * Forces type of node to #PLIST_REAL
+     *
+     * @param node the node
+     * @param val the real value
+     */
+    PLIST_API void plist_set_real_val(plist_t node, double val);
+
+    /**
+     * Set the value of a node.
+     * Forces type of node to #PLIST_DATA
+     *
+     * @param node the node
+     * @param val the binary buffer
+     * @param length the length of the buffer
+     */
+    PLIST_API void plist_set_data_val(plist_t node, const char *val, uint64_t length);
+
+    /**
+     * Set the value of a node.
+     * Forces type of node to #PLIST_DATE
+     *
+     * @param node the node
+     * @param sec the number of seconds since 01/01/2001
+     * @param usec the number of microseconds
+     */
+    PLIST_API void plist_set_date_val(plist_t node, int32_t sec, int32_t usec);
+
+
+    /********************************************
+     *                                          *
+     *            Import & Export               *
+     *                                          *
+     ********************************************/
+
+    /**
+     * Export the #plist_t structure to XML format.
+     *
+     * @param plist the root node to export
+     * @param plist_xml a pointer to a C-string. This function allocates the memory,
+     *            caller is responsible for freeing it. Data is UTF-8 encoded.
+     * @param length a pointer to an uint32_t variable. Represents the length of the allocated buffer.
+     */
+    PLIST_API void plist_to_xml(plist_t plist, char **plist_xml, uint32_t * length);
+
+    /**
+     * Export the #plist_t structure to binary format.
+     *
+     * @param plist the root node to export
+     * @param plist_bin a pointer to a char* buffer. This function allocates the memory,
+     *            caller is responsible for freeing it.
+     * @param length a pointer to an uint32_t variable. Represents the length of the allocated buffer.
+     */
+    PLIST_API void plist_to_bin(plist_t plist, char **plist_bin, uint32_t * length);
+
+    /**
+     * Import the #plist_t structure from XML format.
+     *
+     * @param plist_xml a pointer to the xml buffer.
+     * @param length length of the buffer to read.
+     * @param plist a pointer to the imported plist.
+     */
+    PLIST_API void plist_from_xml(const char *plist_xml, uint32_t length, plist_t * plist);
+
+    /**
+     * Import the #plist_t structure from binary format.
+     *
+     * @param plist_bin a pointer to the xml buffer.
+     * @param length length of the buffer to read.
+     * @param plist a pointer to the imported plist.
+     */
+    PLIST_API void plist_from_bin(const char *plist_bin, uint32_t length, plist_t * plist);
+
+
+    /********************************************
+     *                                          *
+     *                 Utils                    *
+     *                                          *
+     ********************************************/
+
+    /**
+     * Get a node from its path. Each path element depends on the associated father node type.
+     * For Dictionaries, var args are casted to const char*, for arrays, var args are caster to uint32_t
+     * Search is breath first order.
+     *
+     * @param plist the node to access result from.
+     * @param length length of the path to access
+     * @return the value to access.
+     */
+    PLIST_API plist_t plist_access_path(plist_t plist, uint32_t length, ...);
+
+    /**
+     * Variadic version of #plist_access_path.
+     *
+     * @param plist the node to access result from.
+     * @param length length of the path to access
+     * @param v list of array's index and dic'st key
+     * @return the value to access.
+     */
+    PLIST_API plist_t plist_access_pathv(plist_t plist, uint32_t length, va_list v);
+
+    /**
+     * Compare two node values
+     *
+     * @param node_l left node to compare
+     * @param node_r rigth node to compare
+     * @return TRUE is type and value match, FALSE otherwise.
+     */
+    PLIST_API char plist_compare_node_value(plist_t node_l, plist_t node_r);
 
 
 //DEPRECATED API BELOW
 
-/*@}*/
-/**
- * \defgroup DeprecatedAPI Deprecated libplist API
- */
-/*@{*/
-
-/********************************************
- *                                          *
- *            Tree navigation               *
- *                                          *
- ********************************************/
-
-/**
- * Get the first child of a node
- *
- * @param node the first child
- */
-	PLIST_API plist_t plist_get_first_child(plist_t node);
-
-/**
- * Get the next sibling of a node
- *
- * @param node the next sibling
- */
-	PLIST_API plist_t plist_get_next_sibling(plist_t node);
-
-/**
- * Get the previous sibling of a node
- *
- * @param node the previous sibling
- */
-	PLIST_API plist_t plist_get_prev_sibling(plist_t node);
-
-/**
- * Get the nth child of a #PLIST_ARRAY node.
- *
- * @param node the node of type #PLIST_ARRAY
- * @param n the index of the child to get. Range is [0, array_size[
- * @return the nth children or NULL if node is not of type #PLIST_ARRAY
- */
-	PLIST_API plist_t plist_get_array_nth_el(plist_t node, uint32_t n);
-
-/**
- * Get the child of a #PLIST_DICT node from the associated key value.
- *
- * @param node the node of type #PLIST_DICT
- * @param key the key associated to the requested value
- * @return the key associated value or NULL if node is not of type #PLIST_DICT
- */
-	PLIST_API plist_t plist_get_dict_el_from_key(plist_t node, const char *key);
-
-
-/********************************************
- *                                          *
- *                Setters                   *
- *                                          *
- ********************************************/
-
-/**
- * Add a subnode to a node. The node must be of a structured type
- * (ie #PLIST_DICT or #PLIST_ARRAY). This function fails silently
- * if subnode already has a father.
- *
- * @param node the node to add a children to
- * @param subnode the children node
- */
-	PLIST_API void plist_add_sub_node(plist_t node, plist_t subnode);
-
-/**
- * Add a subnode of type #PLIST_KEY to a node. The node must be of a structured type
- * (ie #PLIST_DICT or #PLIST_ARRAY).
- *
- * @param node the node to add a children to
- * @param val the key value encoded as an ASCII string (must be null terminated)
- */
-	PLIST_API void plist_add_sub_key_el(plist_t node, const char *val);
-
-/**
- * Add a subnode of type #PLIST_STRING to a node. The node must be of a structured type
- * (ie #PLIST_DICT or #PLIST_ARRAY).
- *
- * @param node the node to add a children to
- * @param val the string value encoded as an ASCII or UTF-8 string (must be null terminated)
- */
-	PLIST_API void plist_add_sub_string_el(plist_t node, const char *val);
-
-/**
- * Add a subnode of type #PLIST_BOOLEAN to a node. The node must be of a structured type
- * (ie #PLIST_DICT or #PLIST_ARRAY).
- *
- * @param node the node to add a children to
- * @param val the boolean value (TRUE or FALSE)
- */
-	PLIST_API void plist_add_sub_bool_el(plist_t node, uint8_t val);
-
-/**
- * Add a subnode of type #PLIST_UINT to a node. The node must be of a structured type
- * (ie #PLIST_DICT or #PLIST_ARRAY).
- *
- * @param node the node to add a children to
- * @param val the unsigned integer value
- */
-	PLIST_API void plist_add_sub_uint_el(plist_t node, uint64_t val);
-
-/**
- * Add a subnode of type #PLIST_REAL to a node. The node must be of a structured type
- * (ie #PLIST_DICT or #PLIST_ARRAY).
- *
- * @param node the node to add a children to
- * @param val the real value
- */
-	PLIST_API void plist_add_sub_real_el(plist_t node, double val);
-
-/**
- * Add a subnode of type #PLIST_DATA to a node. The node must be of a structured type
- * (ie #PLIST_DICT or #PLIST_ARRAY).
- *
- * @param node the node to add a children to
- * @param val the binary buffer
- * @param length the length of the buffer
- */
-	PLIST_API void plist_add_sub_data_el(plist_t node, const char *val, uint64_t length);
-
-/**
- * Add a subnode of type #PLIST_DATE to a node. The node must be of a structured type
- * (ie #PLIST_DICT or #PLIST_ARRAY).
- *
- * @param node the node to add a children to
- * @param sec the number of seconds since 01/01/2001
- * @param usec the number of microseconds
- */
-	PLIST_API void plist_add_sub_date_el(plist_t node, int32_t sec, int32_t usec);
-
-
-/********************************************
- *                                          *
- *                 Utils                    *
- *                                          *
- ********************************************/
-
-/**
- * Find the first encountered #PLIST_KEY node mathing that key.
- * Search is breath first order.
- *
- * @param plist the root node of the plist structure.
- * @param value the ASCII Key to match.
- */
-	PLIST_API plist_t plist_find_node_by_key(plist_t plist, const char *value);
-
-/**
- * Find the first encountered #PLIST_STRING node mathing that string.
- * Search is breath first order.
- *
- * @param plist the root node of the plist structure.
- * @param value the ASCII String to match.
- */
-	PLIST_API plist_t plist_find_node_by_string(plist_t plist, const char *value);
-
-/*@}*/
+    /*@}*/
+    /**
+     * \defgroup DeprecatedAPI Deprecated libplist API
+     */
+    /*@{*/
+
+    /********************************************
+     *                                          *
+     *            Tree navigation               *
+     *                                          *
+     ********************************************/
+
+    /**
+     * Get the first child of a node
+     *
+     * @param node the first child
+     */
+    PLIST_API plist_t plist_get_first_child(plist_t node);
+
+    /**
+     * Get the next sibling of a node
+     *
+     * @param node the next sibling
+     */
+    PLIST_API plist_t plist_get_next_sibling(plist_t node);
+
+    /**
+     * Get the previous sibling of a node
+     *
+     * @param node the previous sibling
+     */
+    PLIST_API plist_t plist_get_prev_sibling(plist_t node);
+
+    /**
+     * Get the nth child of a #PLIST_ARRAY node.
+     *
+     * @param node the node of type #PLIST_ARRAY
+     * @param n the index of the child to get. Range is [0, array_size[
+     * @return the nth children or NULL if node is not of type #PLIST_ARRAY
+     */
+    PLIST_API plist_t plist_get_array_nth_el(plist_t node, uint32_t n);
+
+    /**
+     * Get the child of a #PLIST_DICT node from the associated key value.
+     *
+     * @param node the node of type #PLIST_DICT
+     * @param key the key associated to the requested value
+     * @return the key associated value or NULL if node is not of type #PLIST_DICT
+     */
+    PLIST_API plist_t plist_get_dict_el_from_key(plist_t node, const char *key);
+
+
+    /********************************************
+     *                                          *
+     *                Setters                   *
+     *                                          *
+     ********************************************/
+
+    /**
+     * Add a subnode to a node. The node must be of a structured type
+     * (ie #PLIST_DICT or #PLIST_ARRAY). This function fails silently
+     * if subnode already has a father.
+     *
+     * @param node the node to add a children to
+     * @param subnode the children node
+     */
+    PLIST_API void plist_add_sub_node(plist_t node, plist_t subnode);
+
+    /**
+     * Add a subnode of type #PLIST_KEY to a node. The node must be of a structured type
+     * (ie #PLIST_DICT or #PLIST_ARRAY).
+     *
+     * @param node the node to add a children to
+     * @param val the key value encoded as an ASCII string (must be null terminated)
+     */
+    PLIST_API void plist_add_sub_key_el(plist_t node, const char *val);
+
+    /**
+     * Add a subnode of type #PLIST_STRING to a node. The node must be of a structured type
+     * (ie #PLIST_DICT or #PLIST_ARRAY).
+     *
+     * @param node the node to add a children to
+     * @param val the string value encoded as an ASCII or UTF-8 string (must be null terminated)
+     */
+    PLIST_API void plist_add_sub_string_el(plist_t node, const char *val);
+
+    /**
+     * Add a subnode of type #PLIST_BOOLEAN to a node. The node must be of a structured type
+     * (ie #PLIST_DICT or #PLIST_ARRAY).
+     *
+     * @param node the node to add a children to
+     * @param val the boolean value (TRUE or FALSE)
+     */
+    PLIST_API void plist_add_sub_bool_el(plist_t node, uint8_t val);
+
+    /**
+     * Add a subnode of type #PLIST_UINT to a node. The node must be of a structured type
+     * (ie #PLIST_DICT or #PLIST_ARRAY).
+     *
+     * @param node the node to add a children to
+     * @param val the unsigned integer value
+     */
+    PLIST_API void plist_add_sub_uint_el(plist_t node, uint64_t val);
+
+    /**
+     * Add a subnode of type #PLIST_REAL to a node. The node must be of a structured type
+     * (ie #PLIST_DICT or #PLIST_ARRAY).
+     *
+     * @param node the node to add a children to
+     * @param val the real value
+     */
+    PLIST_API void plist_add_sub_real_el(plist_t node, double val);
+
+    /**
+     * Add a subnode of type #PLIST_DATA to a node. The node must be of a structured type
+     * (ie #PLIST_DICT or #PLIST_ARRAY).
+     *
+     * @param node the node to add a children to
+     * @param val the binary buffer
+     * @param length the length of the buffer
+     */
+    PLIST_API void plist_add_sub_data_el(plist_t node, const char *val, uint64_t length);
+
+    /**
+     * Add a subnode of type #PLIST_DATE to a node. The node must be of a structured type
+     * (ie #PLIST_DICT or #PLIST_ARRAY).
+     *
+     * @param node the node to add a children to
+     * @param sec the number of seconds since 01/01/2001
+     * @param usec the number of microseconds
+     */
+    PLIST_API void plist_add_sub_date_el(plist_t node, int32_t sec, int32_t usec);
+
+
+    /********************************************
+     *                                          *
+     *                 Utils                    *
+     *                                          *
+     ********************************************/
+
+    /**
+     * Find the first encountered #PLIST_KEY node mathing that key.
+     * Search is breath first order.
+     *
+     * @param plist the root node of the plist structure.
+     * @param value the ASCII Key to match.
+     */
+    PLIST_API plist_t plist_find_node_by_key(plist_t plist, const char *value);
+
+    /**
+     * Find the first encountered #PLIST_STRING node mathing that string.
+     * Search is breath first order.
+     *
+     * @param plist the root node of the plist structure.
+     * @param value the ASCII String to match.
+     */
+    PLIST_API plist_t plist_find_node_by_string(plist_t plist, const char *value);
+
+    /*@}*/
 
 
 #ifdef __cplusplus