summaryrefslogtreecommitdiffstats
path: root/libcnary/node_iterator.c
diff options
context:
space:
mode:
authorGravatar Nikias Bassen2018-12-10 02:20:24 +0100
committerGravatar Nikias Bassen2018-12-10 02:22:15 +0100
commit4de329327ce4aa175e8496d1bff8604bffb6c574 (patch)
tree0c5fce7e138756a2479acab5a3098fa12ea6971b /libcnary/node_iterator.c
parent71dd25e14616bd261c3b6c80ff990cd1078266f6 (diff)
downloadlibplist-4de329327ce4aa175e8496d1bff8604bffb6c574.tar.gz
libplist-4de329327ce4aa175e8496d1bff8604bffb6c574.tar.bz2
Remove node_iterator and operate on node list directly to improve memory usage
Diffstat (limited to 'libcnary/node_iterator.c')
-rw-r--r--libcnary/node_iterator.c80
1 files changed, 0 insertions, 80 deletions
diff --git a/libcnary/node_iterator.c b/libcnary/node_iterator.c
deleted file mode 100644
index e629b73..0000000
--- a/libcnary/node_iterator.c
+++ /dev/null
@@ -1,80 +0,0 @@
-/*
- * node_iterator.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"
-#include "node_iterator.h"
-
-void node_iterator_destroy(node_iterator_t* iterator) {
- if(iterator) {
- free(iterator);
- }
-}
-
-node_iterator_t* node_iterator_create(node_list_t* list) {
- node_iterator_t* iterator = (node_iterator_t*) malloc(sizeof(node_iterator_t));
- if(iterator == NULL) {
- return NULL;
- }
- memset(iterator, '\0', sizeof(node_iterator_t));
-
- iterator->count = 0;
- iterator->position = 0;
-
- iterator->end = NULL;
- iterator->begin = NULL;
- iterator->value = NULL;
-
- iterator->list = NULL;
- iterator->next = node_iterator_next;
- iterator->bind = node_iterator_bind;
-
-
- if(list != NULL) {
- iterator->bind(iterator, list);
- }
-
- return iterator;
-}
-
-node_t* node_iterator_next(node_iterator_t* iterator) {
- node_t* node = iterator->value;
- if (node) {
- iterator->value = node->next;
- }
- iterator->position++;
- return node;
-}
-
-int node_iterator_bind(node_iterator_t* iterator, node_list_t* list) {
- iterator->position = 0;
- iterator->end = list->end;
- iterator->count = list->count;
- iterator->begin = list->begin;
- iterator->value = list->begin;
- return 0;
-}