summaryrefslogtreecommitdiff
path: root/test/rbtree.c
diff options
context:
space:
mode:
authorDaniel Silverstone <dsilvers@netsurf-browser.org>2009-02-14 19:18:33 +0000
committerDaniel Silverstone <dsilvers@netsurf-browser.org>2009-02-14 19:18:33 +0000
commitbf44aeaf5cd7f03d3bd842c8046b7346c5035f06 (patch)
tree896fcb86e24952dfea9fa1414fdd3c59e509fa9b /test/rbtree.c
parent0323c5c6f9f6d27b7aab2ac5da0b98e6468a4d72 (diff)
downloadlibparserutils-bf44aeaf5cd7f03d3bd842c8046b7346c5035f06.tar.gz
libparserutils-bf44aeaf5cd7f03d3bd842c8046b7346c5035f06.tar.bz2
Remove dict, hash and rbtree from libparserutils
svn path=/trunk/libparserutils/; revision=6512
Diffstat (limited to 'test/rbtree.c')
-rw-r--r--test/rbtree.c88
1 files changed, 0 insertions, 88 deletions
diff --git a/test/rbtree.c b/test/rbtree.c
deleted file mode 100644
index ac27964..0000000
--- a/test/rbtree.c
+++ /dev/null
@@ -1,88 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include "utils/rbtree.h"
-
-#include "testutils.h"
-
-static void *myrealloc(void *ptr, size_t len, void *pw)
-{
- UNUSED(pw);
-
- return realloc(ptr, len);
-}
-
-static int mycmp(const void *a, const void *b)
-{
- return ((intptr_t) a) - ((intptr_t) b);
-}
-
-int main(int argc, char **argv)
-{
- parserutils_rbtree *tree;
-
- UNUSED(argc);
- UNUSED(argv);
-
- assert(parserutils_rbtree_create(mycmp, myrealloc, NULL, &tree) ==
- PARSERUTILS_OK);
-
-#define N 40000
-#define G 307
-//#define N 400
-//#define G 7
-
- printf("Inserting %d items\n", N);
-
- for (int i = G, count = 1; i != 0; i = (i + G) % N, count++) {
- void *old;
- assert(parserutils_rbtree_insert(tree,
- (char *) NULL + i, (char *) NULL + i,
- &old) == PARSERUTILS_OK);
-
- if ((count % 10000) == 0)
- printf("%d\n", count);
- }
-
- printf("Removing %d items\n", N/2);
-
- for (int i = 1, count = 1; i < N; i += 2, count++) {
- void *key, *value;
- assert(parserutils_rbtree_delete(tree, (char *) NULL + i,
- &key, &value) == PARSERUTILS_OK);
- if ((count % 10000) == 0)
- printf("%d\n", count);
- }
-
- printf("Finding %d items\n", N/2);
-
- for (int i = 2, count = 1; i < N; i += 2, count++) {
- void *value = NULL;
- assert(parserutils_rbtree_find(tree, (char *) NULL + i,
- &value) == PARSERUTILS_OK);
- assert(value != NULL && value == (char *) NULL + i);
- if ((count % 10000) == 0)
- printf("%d\n", count);
- }
-
- printf("Verifying & removing %d items\n", N/2);
-
- for (int i = 1, count = 1; i < N; i += 2, count++) {
- void *key, *value = NULL;
- assert(parserutils_rbtree_find(tree, (char *) NULL + i,
- &value) == PARSERUTILS_OK);
- assert(value == NULL);
- assert(parserutils_rbtree_delete(tree, (char *) NULL + i,
- &key, &value) == PARSERUTILS_OK);
- if ((count % 10000) == 0)
- printf("%d\n", count);
- }
-
- parserutils_rbtree_destroy(tree, NULL, NULL);
-
- printf("PASS\n");
-
- return 0;
-}
-