appwrite-cli 0.14.0

package/ldid/libplist/src/Dictionary.cpp

@@ -0,0 +1,182 @@
+/*
+ * Dictionary.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 <cstdlib>
+#include <plist/Dictionary.h>
+
+namespace PList
+{
+
+Dictionary::Dictionary(Node* parent) : Structure(PLIST_DICT, parent)
+{
+}
+
+static void dictionary_fill(Dictionary *_this, std::map<std::string,Node*> &map, plist_t node)
+{
+    plist_dict_iter it = NULL;
+    plist_dict_new_iter(node, &it);
+    plist_t subnode = NULL;
+    do {
+        char *key = NULL;
+        subnode = NULL;
+        plist_dict_next_item(node, it, &key, &subnode);
+        if (key && subnode)
+            map[std::string(key)] = Node::FromPlist(subnode, _this);
+        free(key);
+    } while (subnode);
+    free(it);
+}
+
+Dictionary::Dictionary(plist_t node, Node* parent) : Structure(parent)
+{
+    _node = node;
+    dictionary_fill(this, _map, _node);
+}
+
+Dictionary::Dictionary(const PList::Dictionary& d)
+{
+    for (Dictionary::iterator it = _map.begin(); it != _map.end(); it++)
+    {
+        plist_free(it->second->GetPlist());
+        delete it->second;
+    }
+    _map.clear();
+    _node = plist_copy(d.GetPlist());
+    dictionary_fill(this, _map, _node);
+}
+
+Dictionary& Dictionary::operator=(PList::Dictionary& d)
+{
+    for (Dictionary::iterator it = _map.begin(); it != _map.end(); it++)
+    {
+        plist_free(it->second->GetPlist());
+        delete it->second;
+    }
+    _map.clear();
+    _node = plist_copy(d.GetPlist());
+    dictionary_fill(this, _map, _node);
+    return *this;
+}
+
+Dictionary::~Dictionary()
+{
+    for (Dictionary::iterator it = _map.begin(); it != _map.end(); it++)
+    {
+        delete it->second;
+    }
+    _map.clear();
+}
+
+Node* Dictionary::Clone() const
+{
+    return new Dictionary(*this);
+}
+
+Node* Dictionary::operator[](const std::string& key)
+{
+    return _map[key];
+}
+
+Dictionary::iterator Dictionary::Begin()
+{
+    return _map.begin();
+}
+
+Dictionary::iterator Dictionary::End()
+{
+    return _map.end();
+}
+
+Dictionary::const_iterator Dictionary::Begin() const
+{
+    return _map.begin();
+}
+
+Dictionary::const_iterator Dictionary::End() const
+{
+    return _map.end();
+}
+
+Dictionary::iterator Dictionary::Find(const std::string& key)
+{
+    return _map.find(key);
+}
+
+Dictionary::const_iterator Dictionary::Find(const std::string& key) const
+{
+    return _map.find(key);
+}
+
+Dictionary::iterator Dictionary::Set(const std::string& key, const Node* node)
+{
+    if (node)
+    {
+        Node* clone = node->Clone();
+        UpdateNodeParent(clone);
+        plist_dict_set_item(_node, key.c_str(), clone->GetPlist());
+        delete _map[key];
+        _map[key] = clone;
+        return _map.find(key);
+    }
+    return iterator(this->_map.end());
+}
+
+Dictionary::iterator Dictionary::Set(const std::string& key, const Node& node)
+{
+    return Set(key, &node);
+}
+
+Dictionary::iterator Dictionary::Insert(const std::string& key, Node* node)
+{
+    return this->Set(key, node);
+}
+
+void Dictionary::Remove(Node* node)
+{
+    if (node)
+    {
+        char* key = NULL;
+        plist_dict_get_item_key(node->GetPlist(), &key);
+        plist_dict_remove_item(_node, key);
+        std::string skey = key;
+        free(key);
+        _map.erase(skey);
+        delete node;
+    }
+}
+
+void Dictionary::Remove(const std::string& key)
+{
+    plist_dict_remove_item(_node, key.c_str());
+    delete _map[key];
+    _map.erase(key);
+}
+
+std::string Dictionary::GetNodeKey(Node* node)
+{
+    for (iterator it = _map.begin(); it != _map.end(); ++it)
+    {
+        if (it->second == node)
+            return it->first;
+    }
+    return "";
+}
+
+}  // namespace PList

package/ldid/libplist/src/Integer.cpp

@@ -0,0 +1,73 @@
+/*
+ * Integer.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 <cstdlib>
+#include <plist/Integer.h>
+
+namespace PList
+{
+
+Integer::Integer(Node* parent) : Node(PLIST_UINT, parent)
+{
+}
+
+Integer::Integer(plist_t node, Node* parent) : Node(node, parent)
+{
+}
+
+Integer::Integer(const PList::Integer& i) : Node(PLIST_UINT)
+{
+    plist_set_uint_val(_node, i.GetValue());
+}
+
+Integer& Integer::operator=(PList::Integer& i)
+{
+    plist_free(_node);
+    _node = plist_copy(i.GetPlist());
+    return *this;
+}
+
+Integer::Integer(uint64_t i) : Node(PLIST_UINT)
+{
+    plist_set_uint_val(_node, i);
+}
+
+Integer::~Integer()
+{
+}
+
+Node* Integer::Clone() const
+{
+    return new Integer(*this);
+}
+
+void Integer::SetValue(uint64_t i)
+{
+    plist_set_uint_val(_node, i);
+}
+
+uint64_t Integer::GetValue() const
+{
+    uint64_t i = 0;
+    plist_get_uint_val(_node, &i);
+    return i;
+}
+
+}  // namespace PList

package/ldid/libplist/src/Key.cpp

@@ -0,0 +1,80 @@
+/*
+ * Key.cpp
+ *
+ * Copyright (c) 2012 Nikias Bassen, 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 <cstdlib>
+#include <plist/Key.h>
+
+namespace PList
+{
+
+Key::Key(Node* parent) : Node(PLIST_KEY, parent)
+{
+}
+
+Key::Key(plist_t node, Node* parent) : Node(node, parent)
+{
+}
+
+Key::Key(const PList::Key& k) : Node(PLIST_UINT)
+{
+    plist_set_key_val(_node, k.GetValue().c_str());
+}
+
+Key& Key::operator=(PList::Key& k)
+{
+    plist_free(_node);
+    _node = plist_copy(k.GetPlist());
+    return *this;
+}
+
+Key::Key(const std::string& s) : Node(PLIST_STRING)
+{
+    plist_set_key_val(_node, s.c_str());
+}
+
+Key::~Key()
+{
+}
+
+Node* Key::Clone() const
+{
+    return new Key(*this);
+}
+
+void Key::SetValue(const std::string& s)
+{
+    plist_set_key_val(_node, s.c_str());
+}
+
+std::string Key::GetValue() const
+{
+    char* s = NULL;
+    plist_get_key_val(_node, &s);
+    std::string ret;
+    if (s) {
+        ret = s;
+        free(s);
+    } else {
+        ret = "";
+    }
+    return ret;
+}
+
+}  // namespace PList

package/ldid/libplist/src/Makefile.am

@@ -0,0 +1,63 @@
+AM_CPPFLAGS = \
+	-I$(top_srcdir)/include \
+	-I$(top_srcdir) \
+	-I$(top_srcdir)/libcnary/include
+
+AM_CFLAGS = $(GLOBAL_CFLAGS)
+AM_LDFLAGS = $(GLOBAL_LDFLAGS)
+
+lib_LTLIBRARIES = \
+	libplist-2.0.la \
+	libplist++-2.0.la
+
+libplist_2_0_la_LIBADD = $(top_builddir)/libcnary/libcnary.la
+libplist_2_0_la_LDFLAGS = $(AM_LDFLAGS) -version-info $(LIBPLIST_SO_VERSION) -no-undefined
+libplist_2_0_la_SOURCES = \
+	base64.c base64.h \
+	bytearray.c bytearray.h \
+	strbuf.h \
+	hashtable.c hashtable.h \
+	ptrarray.c ptrarray.h \
+	time64.c time64.h \
+	time64_limits.h \
+	xplist.c \
+	bplist.c \
+	plist.c plist.h
+
+libplist___2_0_la_LIBADD = libplist-2.0.la
+libplist___2_0_la_LDFLAGS = $(AM_LDFLAGS) -version-info $(LIBPLIST_SO_VERSION) -no-undefined
+libplist___2_0_la_SOURCES = \
+	Node.cpp \
+	Structure.cpp \
+	Array.cpp \
+	Boolean.cpp \
+	Data.cpp \
+	Date.cpp \
+	Dictionary.cpp \
+	Integer.cpp \
+	Key.cpp \
+	Real.cpp \
+	String.cpp \
+	Uid.cpp \
+	$(top_srcdir)/include/plist/Node.h \
+	$(top_srcdir)/include/plist/Structure.h \
+	$(top_srcdir)/include/plist/Array.h \
+	$(top_srcdir)/include/plist/Boolean.h \
+	$(top_srcdir)/include/plist/Data.h \
+	$(top_srcdir)/include/plist/Date.h \
+	$(top_srcdir)/include/plist/Dictionary.h \
+	$(top_srcdir)/include/plist/Integer.h \
+	$(top_srcdir)/include/plist/Key.h \
+	$(top_srcdir)/include/plist/Real.h \
+	$(top_srcdir)/include/plist/String.h \
+	$(top_srcdir)/include/plist/Uid.h
+
+if WIN32
+libplist_2_0_la_LDFLAGS += -avoid-version -static-libgcc
+libplist___2_0_la_LDFLAGS += -avoid-version -static-libgcc
+endif
+
+pkgconfigdir = $(libdir)/pkgconfig
+pkgconfig_DATA = \
+	libplist-2.0.pc \
+	libplist++-2.0.pc

package/ldid/libplist/src/Node.cpp

@@ -0,0 +1,166 @@
+/*
+ * 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 <cstdlib>
+#include <plist/Node.h>
+#include <plist/Structure.h>
+#include <plist/Dictionary.h>
+#include <plist/Array.h>
+#include <plist/Boolean.h>
+#include <plist/Integer.h>
+#include <plist/Real.h>
+#include <plist/String.h>
+#include <plist/Key.h>
+#include <plist/Uid.h>
+#include <plist/Data.h>
+#include <plist/Date.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_KEY:
+        _node = plist_new_string("");
+        plist_set_key_val(_node, "");
+        break;
+    case PLIST_UID:
+	_node = plist_new_uid(0);
+	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_NONE:
+    default:
+        break;
+    }
+}
+
+Node::~Node()
+{
+	/* If the Node is in a container, let _node be cleaned up by
+	 * operations on the parent plist_t. Otherwise, duplicate frees
+	 * occur when a Node is removed from or replaced in a Dictionary.
+	 */
+	if (_parent == NULL)
+		plist_free(_node);
+    _node = NULL;
+    _parent = NULL;
+}
+
+plist_type Node::GetType() const
+{
+    if (_node)
+    {
+        return plist_get_node_type(_node);
+    }
+    return PLIST_NONE;
+}
+
+plist_t Node::GetPlist() const
+{
+    return _node;
+}
+
+Node* Node::GetParent() const
+{
+    return _parent;
+}
+
+Node* Node::FromPlist(plist_t node, Node* parent)
+{
+    Node* ret = NULL;
+    if (node)
+    {
+        plist_type type = plist_get_node_type(node);
+        switch (type)
+        {
+        case PLIST_DICT:
+            ret = new Dictionary(node, parent);
+            break;
+        case PLIST_ARRAY:
+            ret = new Array(node, parent);
+            break;
+        case PLIST_BOOLEAN:
+            ret = new Boolean(node, parent);
+            break;
+        case PLIST_UINT:
+            ret = new Integer(node, parent);
+            break;
+        case PLIST_REAL:
+            ret = new Real(node, parent);
+            break;
+        case PLIST_STRING:
+            ret = new String(node, parent);
+            break;
+        case PLIST_KEY:
+            ret = new Key(node, parent);
+            break;
+        case PLIST_UID:
+            ret = new Uid(node, parent);
+            break;
+        case PLIST_DATE:
+            ret = new Date(node, parent);
+            break;
+        case PLIST_DATA:
+            ret = new Data(node, parent);
+            break;
+        default:
+            plist_free(node);
+            break;
+        }
+    }
+    return ret;
+}
+
+}  // namespace PList

package/ldid/libplist/src/Real.cpp

@@ -0,0 +1,73 @@
+/*
+ * Real.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 <cstdlib>
+#include <plist/Real.h>
+
+namespace PList
+{
+
+Real::Real(Node* parent) : Node(PLIST_REAL, parent)
+{
+}
+
+Real::Real(plist_t node, Node* parent) : Node(node, parent)
+{
+}
+
+Real::Real(const PList::Real& d) : Node(PLIST_UINT)
+{
+    plist_set_real_val(_node, d.GetValue());
+}
+
+Real& Real::operator=(PList::Real& d)
+{
+    plist_free(_node);
+    _node = plist_copy(d.GetPlist());
+    return *this;
+}
+
+Real::Real(double d) : Node(PLIST_REAL)
+{
+    plist_set_real_val(_node, d);
+}
+
+Real::~Real()
+{
+}
+
+Node* Real::Clone() const
+{
+    return new Real(*this);
+}
+
+void Real::SetValue(double d)
+{
+    plist_set_real_val(_node, d);
+}
+
+double Real::GetValue() const
+{
+    double d = 0.;
+    plist_get_real_val(_node, &d);
+    return d;
+}
+
+}  // namespace PList

package/ldid/libplist/src/String.cpp

@@ -0,0 +1,80 @@
+/*
+ * String.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 <cstdlib>
+#include <plist/String.h>
+
+namespace PList
+{
+
+String::String(Node* parent) : Node(PLIST_STRING, parent)
+{
+}
+
+String::String(plist_t node, Node* parent) : Node(node, parent)
+{
+}
+
+String::String(const PList::String& s) : Node(PLIST_UINT)
+{
+    plist_set_string_val(_node, s.GetValue().c_str());
+}
+
+String& String::operator=(PList::String& s)
+{
+    plist_free(_node);
+    _node = plist_copy(s.GetPlist());
+    return *this;
+}
+
+String::String(const std::string& s) : Node(PLIST_STRING)
+{
+    plist_set_string_val(_node, s.c_str());
+}
+
+String::~String()
+{
+}
+
+Node* String::Clone() const
+{
+    return new String(*this);
+}
+
+void String::SetValue(const std::string& s)
+{
+    plist_set_string_val(_node, s.c_str());
+}
+
+std::string String::GetValue() const
+{
+    char* s = NULL;
+    plist_get_string_val(_node, &s);
+    std::string ret;
+    if (s) {
+        ret = s;
+        free(s);
+    } else {
+        ret = "";
+    }
+    return ret;
+}
+
+}  // namespace PList