#include "curlcheck.h"
#include "splay.h"
static CURLcode unit_setup(void)
{
return CURLE_OK;
}
static void unit_stop(void)
{
}
static void splayprint(struct Curl_tree * t, int d, char output)
{
struct Curl_tree *node;
int i;
int count;
if(t == NULL)
return;
splayprint(t->larger, d+1, output);
for(i=0; i<d; i++)
if(output)
printf(" ");
if(output) {
printf("%ld.%ld[%d]", (long)t->key.tv_sec,
(long)t->key.tv_usec, i);
}
for(count=0, node = t->same; node; node = node->same, count++)
;
if(output) {
if(count)
printf(" [%d more]\n", count);
else
printf("\n");
}
splayprint(t->smaller, d+1, output);
}
UNITTEST_START
#define NUM_NODES 50
struct Curl_tree *root;
struct Curl_tree nodes[NUM_NODES];
int rc;
int i;
root = NULL;
for(i = 0; i < NUM_NODES; i++) {
struct timeval key;
key.tv_sec = 0;
key.tv_usec = (541*i)%1023;
nodes[i].payload = (void *)key.tv_usec;
root = Curl_splayinsert(key, root, &nodes[i]);
}
puts("Result:");
splayprint(root, 0, 1);
for(i = 0; i < NUM_NODES; i++) {
int rem = (i+7)%NUM_NODES;
printf("Tree look:\n");
splayprint(root, 0, 1);
printf("remove pointer %d, payload %ld\n", rem,
(long)(nodes[rem].payload));
rc = Curl_splayremovebyaddr(root, &nodes[rem], &root);
if(rc) {
printf("remove %d failed!\n", rem);
fail("remove");
}
}
UNITTEST_STOP