appwrite-cli 17.2.1 → 17.3.0

package/ldid/libplist/libcnary/include/object.h

@@ -1,41 +0,0 @@
-/*
- * object.h
- *
- *  Created on: Mar 8, 2011
- *      Author: posixninja
- *
- * Copyright (c) 2011 Joshua Hill. 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
- */
-
-#ifndef OBJECT_H_
-#define OBJECT_H_
-
-#ifndef TRUE
-#define TRUE 1
-#endif
-
-#ifndef FALSE
-#define FALSE 0
-#endif
-
-typedef struct object_t {
-	void* value;
-	unsigned int type;
-	unsigned int size;
-} object_t;
-
-#endif /* OBJECT_H_ */

package/ldid/libplist/libcnary/node.c

@@ -1,216 +0,0 @@
-/*
- * node.c
- *
- *  Created on: Mar 7, 2011
- *      Author: posixninja
- *
- * Copyright (c) 2011 Joshua Hill. 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 <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include "node.h"
-#include "node_list.h"
-
-void node_destroy(node_t* node) {
-	if(!node) return;
-
-	if (node->children && node->children->count > 0) {
-		node_t* ch;
-		while ((ch = node->children->begin)) {
-			node_list_remove(node->children, ch);
-			node_destroy(ch);
-		}
-	}
-	node_list_destroy(node->children);
-	node->children = NULL;
-
-	free(node);
-}
-
-node_t* node_create(node_t* parent, void* data) {
-	int error = 0;
-
-	node_t* node = (node_t*) malloc(sizeof(node_t));
-	if(node == NULL) {
-		return NULL;
-	}
-	memset(node, '\0', sizeof(node_t));
-
-	node->data = data;
-	node->next = NULL;
-	node->prev = NULL;
-	node->count = 0;
-	node->parent = NULL;
-	node->children = NULL;
-
-	// Pass NULL to create a root node
-	if(parent != NULL) {
-		// This is a child node so attach it to it's parent
-		error = node_attach(parent, node);
-		if(error < 0) {
-			// Unable to attach nodes
-			printf("ERROR: %d \"Unable to attach nodes\"\n", error);
-			node_destroy(node);
-			return NULL;
-		}
-	}
-
-	return node;
-}
-
-int node_attach(node_t* parent, node_t* child) {
-	if (!parent || !child) return -1;
-	child->parent = parent;
-	if(!parent->children) {
-		parent->children = node_list_create();
-	}
-	int res = node_list_add(parent->children, child);
-	if (res == 0) {
-		parent->count++;
-	}
-	return res;
-}
-
-int node_detach(node_t* parent, node_t* child) {
-	if (!parent || !child) return -1;
-	int node_index = node_list_remove(parent->children, child);
-	if (node_index >= 0) {
-		parent->count--;
-	}
-	return node_index;
-}
-
-int node_insert(node_t* parent, unsigned int node_index, node_t* child)
-{
-	if (!parent || !child) return -1;
-	child->parent = parent;
-	if(!parent->children) {
-		parent->children = node_list_create();
-	}
-	int res = node_list_insert(parent->children, node_index, child);
-	if (res == 0) {
-		parent->count++;
-	}
-	return res;
-}
-
-static void _node_debug(node_t* node, unsigned int depth) {
-	unsigned int i = 0;
-	node_t* current = NULL;
-	for(i = 0; i < depth; i++) {
-		printf("\t");
-	}
-	if(!node->parent) {
-		printf("ROOT\n");
-	}
-
-	if(!node->children && node->parent) {
-		printf("LEAF\n");
-	} else {
-		if(node->parent) {
-			printf("NODE\n");
-		}
-		for (current = node_first_child(node); current; current = node_next_sibling(current)) {
-			_node_debug(current, depth+1);
-		}
-	}
-
-}
-
-void node_debug(node_t* node)
-{
-	_node_debug(node, 0);
-}
-
-unsigned int node_n_children(struct node_t* node)
-{
-	if (!node) return 0;
-	return node->count;
-}
-
-node_t* node_nth_child(struct node_t* node, unsigned int n)
-{
-	if (!node || !node->children || !node->children->begin) return NULL;
-	unsigned int node_index = 0;
-	int found = 0;
-	node_t *ch;
-	for (ch = node_first_child(node); ch; ch = node_next_sibling(ch)) {
-		if (node_index++ == n) {
-			found = 1;
-			break;
-		}
-	}
-	if (!found) {
-		return NULL;
-	}
-	return ch;
-}
-
-node_t* node_first_child(struct node_t* node)
-{
-	if (!node || !node->children) return NULL;
-	return node->children->begin;
-}
-
-node_t* node_prev_sibling(struct node_t* node)
-{
-	if (!node) return NULL;
-	return node->prev;
-}
-
-node_t* node_next_sibling(struct node_t* node)
-{
-	if (!node) return NULL;
-	return node->next;
-}
-
-int node_child_position(struct node_t* parent, node_t* child)
-{
-	if (!parent || !parent->children || !parent->children->begin || !child) return -1;
-	int node_index = 0;
-	int found = 0;
-	node_t *ch;
-	for (ch = node_first_child(parent); ch; ch = node_next_sibling(ch)) {
-		if (ch == child) {
-			found = 1;
-			break;
-		}
-		node_index++;
-	}
-	if (!found) {
-		return -1;
-	}
-	return node_index;
-}
-
-node_t* node_copy_deep(node_t* node, copy_func_t copy_func)
-{
-	if (!node) return NULL;
-	void *data = NULL;
-	if (copy_func) {
-		data = copy_func(node->data);
-	}
-	node_t* copy = node_create(NULL, data);
-	node_t* ch;
-	for (ch = node_first_child(node); ch; ch = node_next_sibling(ch)) {
-		node_t* cc = node_copy_deep(ch, copy_func);
-		node_attach(copy, cc);
-	}
-	return copy;
-}

package/ldid/libplist/libcnary/node_list.c

@@ -1,157 +0,0 @@
-/*
- * node_list.c
- *
- *  Created on: Mar 8, 2011
- *      Author: posixninja
- *
- * Copyright (c) 2011 Joshua Hill. 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 <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include "node.h"
-#include "node_list.h"
-
-void node_list_destroy(node_list_t* list) {
-	free(list);
-}
-
-node_list_t* node_list_create() {
-	node_list_t* list = (node_list_t*) malloc(sizeof(node_list_t));
-	if(list == NULL) {
-		return NULL;
-	}
-	memset(list, '\0', sizeof(node_list_t));
-
-	// Initialize structure
-	list->begin = NULL;
-	list->end = NULL;
-	list->count = 0;
-	return list;
-}
-
-int node_list_add(node_list_t* list, node_t* node) {
-	if (!list || !node) return -1;
-
-	// Find the last element in the list
-	node_t* last = list->end;
-
-	// Setup our new node as the new last element
-	node->next = NULL;
-	node->prev = last;
-
-	// Set the next element of our old "last" element
-	if (last) {
-		// but only if the node list is not empty
-		last->next = node;
-	} else {
-		// otherwise this is the start of the list
-		list->begin = node;
-	}
-
-	// Set the lists prev to the new last element
-	list->end = node;
-
-	// Increment our node count for this list
-	list->count++;
-	return 0;
-}
-
-int node_list_insert(node_list_t* list, unsigned int node_index, node_t* node) {
-	if (!list || !node) return -1;
-	if (node_index >= list->count) {
-		return node_list_add(list, node);
-	}
-
-	// Get the first element in the list
-	node_t* cur = list->begin;
-
-	unsigned int pos = 0;
-	node_t* prev = NULL;
-
-	if (node_index > 0) {
-		while (pos < node_index) {
-			prev = cur;
-			cur = cur->next;
-			pos++;
-		}
-	}
-
-	if (prev) {
-		// Set previous node
-		node->prev = prev;
-		// Set next node of our new node to next node of the previous node
-		node->next = prev->next;
-		// Set next node of previous node to our new node
-		prev->next = node;
-	} else {
-		node->prev = NULL;
-		// get old first element in list
-		node->next = list->begin;
-		// set new node as first element in list
-		list->begin = node;
-	}
-
-	if (node->next == NULL) {
-		// Set the lists prev to the new last element
-		list->end = node;
-	} else {
-		// set prev of the new next element to our node
-		node->next->prev = node;
-	}
-
-	// Increment our node count for this list
-	list->count++;
-	return 0;
-}
-
-int node_list_remove(node_list_t* list, node_t* node) {
-	if (!list || !node) return -1;
-	if (list->count == 0) return -1;
-
-	int node_index = 0;
-	node_t* n;
-	for (n = list->begin; n; n = n->next) {
-		if (node == n) {
-			node_t* newnode = node->next;
-			if (node->prev) {
-				node->prev->next = newnode;
-				if (newnode) {
-					newnode->prev = node->prev;
-				} else {
-					// last element in the list
-					list->end = node->prev;
-				}
-			} else {
-				// we just removed the first element
-				if (newnode) {
-					newnode->prev = NULL;
-				} else {
-					list->end = NULL;
-				}
-				list->begin = newnode;
-			}
-			list->count--;
-			return node_index;
-		}
-		node_index++;
-	}
-	return -1;
-}
-

package/ldid/libplist/m4/ac_pkg_cython.m4

@@ -1,67 +0,0 @@
-
-AC_DEFUN([AC_PROG_CYTHON],[
-        AC_PATH_PROG([CYTHON],[cython])
-        if test -z "$CYTHON" ; then
-                AC_MSG_WARN([cannot find 'cython' program. You should look at http://www.cython.org] or install your distribution specific cython package.)
-                CYTHON=false
-        elif test -n "$1" ; then
-                AC_MSG_CHECKING([for Cython version])
-                [cython_version=`$CYTHON --version 2>&1 | sed 's/Cython version \(.*\)$/\1/g'`]
-                AC_MSG_RESULT([$cython_version])
-
-                # Setup extra version string for parsing
-                [cython_version_stripped=`echo $cython_version | sed 's/\([0-9]\+\)\.\([0-9]\+\)[^\.]*\(\.\([0-9]\+\)\)\?.*/0\1.0\2.0\4/g'`]
-                if test -n "$cython_version" ; then
-                        # Calculate the required version number components
-                        [required=$1]
-                        [required_major=`echo $required | sed 's/[^0-9].*//'`]
-                        if test -z "$required_major" ; then
-                                [required_major=0]
-                        fi
-                        [required=`echo $required | sed 's/[0-9]*[^0-9]//'`]
-                        [required_minor=`echo $required | sed 's/[^0-9].*//'`]
-                        if test -z "$required_minor" ; then
-                                [required_minor=0]
-                        fi
-                        [required=`echo $required | sed 's/[0-9]*[^0-9]//'`]
-                        [required_patch=`echo $required | sed 's/[^0-9].*//'`]
-                        if test -z "$required_patch" ; then
-                                [required_patch=0]
-                        fi
-
-                        # Calculate the available version number components
-                        [available=$cython_version_stripped]
-                        [available_major=`echo $available | sed 's/[^0-9].*//'`]
-                        if test -z "$available_major" ; then
-                                [available_major=0]
-                        fi
-                        [available=`echo $available | sed 's/[0-9]*[^0-9]//'`]
-                        [available_minor=`echo $available | sed 's/[^0-9].*//'`]
-                        if test -z "$available_minor" ; then
-                                [available_minor=0]
-                        fi
-                        [available=`echo $available | sed 's/[0-9]*[^0-9]//'`]
-                        [available_patch=`echo $available | sed 's/[^0-9].*//'`]
-                        if test -z "$available_patch" ; then
-                                [available_patch=0]
-                        fi
-
-                        if test $available_major -gt $required_major || \
-                                ( test $available_major -eq $required_major && \
-                                      test $available_minor -gt $required_minor ) || \
-                                ( test $available_major -eq $required_major && \
-                                        test $available_minor -eq $required_minor && \
-                                        test $available_patch -ge $required_patch ) ; then
-
-                                AC_MSG_NOTICE([Cython executable is '$CYTHON'])
-                        else
-                                AC_MSG_WARN([Cython version >= $1 is required.  You have $cython_version.  You should look at http://www.cython.org])
-                                CYTHON='echo "Error: Cython version >= $1 is required.  You have '"$cython_version"'.  You should look at http://www.cython.org" ; false'
-                        fi
-                else
-                        AC_MSG_WARN([cannot determine Cython version])
-                        CYTHON=false
-                fi
-        fi
-        AC_SUBST([CYTHON_LIB])
-])

package/ldid/libplist/m4/as-compiler-flag.m4

@@ -1,62 +0,0 @@
-dnl as-compiler-flag.m4 0.1.0
-
-dnl autostars m4 macro for detection of compiler flags
-
-dnl David Schleef <ds@schleef.org>
-
-dnl $Id: as-compiler-flag.m4,v 1.1 2005/12/15 23:35:19 ds Exp $
-
-dnl AS_COMPILER_FLAG(CFLAGS, ACTION-IF-ACCEPTED, [ACTION-IF-NOT-ACCEPTED])
-dnl Tries to compile with the given CFLAGS.
-dnl Runs ACTION-IF-ACCEPTED if the compiler can compile with the flags,
-dnl and ACTION-IF-NOT-ACCEPTED otherwise.
-
-AC_DEFUN([AS_COMPILER_FLAG],
-[
-  AC_MSG_CHECKING([to see if compiler understands $1])
-
-  save_CFLAGS="$CFLAGS"
-  CFLAGS="$CFLAGS $1"
-
-  AC_TRY_COMPILE([ ], [], [flag_ok=yes], [flag_ok=no])
-  CFLAGS="$save_CFLAGS"
-
-  if test "X$flag_ok" = Xyes ; then
-    m4_ifvaln([$2],[$2])
-    true
-  else
-    m4_ifvaln([$3],[$3])
-    true
-  fi
-  AC_MSG_RESULT([$flag_ok])
-])
-
-dnl AS_COMPILER_FLAGS(VAR, FLAGS)
-dnl Tries to compile with the given CFLAGS.
-
-AC_DEFUN([AS_COMPILER_FLAGS],
-[
-  list=$2
-  flags_supported=""
-  flags_unsupported=""
-  AC_MSG_CHECKING([for supported compiler flags])
-  for each in $list
-  do
-    save_CFLAGS="$CFLAGS"
-    CFLAGS="$CFLAGS $each"
-    AC_TRY_COMPILE([ ], [], [flag_ok=yes], [flag_ok=no])
-    CFLAGS="$save_CFLAGS"
-
-    if test "X$flag_ok" = Xyes ; then
-      flags_supported="$flags_supported $each"
-    else
-      flags_unsupported="$flags_unsupported $each"
-    fi
-  done
-  AC_MSG_RESULT([$flags_supported])
-  if test "X$flags_unsupported" != X ; then
-    AC_MSG_WARN([unsupported compiler flags: $flags_unsupported])
-  fi
-  $1="$$1 $flags_supported"
-])
-