int main()
{
int arr[] = {3, 6, 9, 2, 11, 1, 4}, i;
skiplist list;
skiplist_init(&list);
printf("Insert:--------------------\n");
for (i = 0; i < sizeof(arr)/sizeof(arr[0]); i++) {
skiplist_insert(&list, arr[i], arr[i]);
}
skiplist_dump(&list);
printf("Search:--------------------\n");
int keys[] = {3, 4, 7, 10, 111};
for (i = 0; i < sizeof(keys)/sizeof(keys[0]); i++) {
snode *x = skiplist_search(&list, keys[i]);
if (x) {
printf("key = %d, value = %d\n", keys[i], x->value);
} else {
printf("key = %d, not fuound\n", keys[i]);
}
}
printf("Search:--------------------\n");
skiplist_delete(&list, 3);
skiplist_delete(&list, 9);
skiplist_dump(&list);
return 0;
}
int
main(void)
{
int i;
int *key = malloc(N * sizeof(int));
if (key == NULL) {
exit(-1);
}
struct skiplist *list = skiplist_new();
if (list == NULL) {
exit(-1);
}
printf("Test start!\n");
printf("Add %d nodes...\n", N);
/* Insert test */
srandom(time(NULL));
for (i = 0; i < N; i++) {
int value = key[i] = (int)random();
skiplist_add(list, key[i], value);
}
#ifdef SKIPLIST_DEBUG
skiplist_dump(list);
#endif
/* Search test */
printf("Now search each node...\n");
for (i = 0; i < N; i++) {
int value = skiplist_search(list, key[i]);
if (value != -1) {
#ifdef SKIPLIST_DEBUG
printf("key:0x%08x value:0x%08x\n", key[i], value);
#endif
} else {
printf("Not found:0x%08x\n", key[i]);
}
}
/* Delete test */
printf("Now remove all nodes...\n");
for (i = 0; i < N; i++) {
skiplist_remove(list, key[i]);
}
#ifdef SKIPLIST_DEBUG
skiplist_dump(list);
#endif
printf("End of Test.\n");
skiplist_delete(list);
return 0;
}
static int __init skiplist_init(void)
{
int i;
struct timeval start, end;
struct skiplist *list;
struct skipnode *node;
int res = 0;
int *key = kmalloc(N * sizeof(int), GFP_KERNEL);
if (key == NULL) {
printk("-ENOMEM\n");
return -1;
}
printk("Starting initialization...\n");
list = skiplist_create();
if (list == NULL) {
printk("-ENOMEM\n");
return -1;
}
printk("Started initialization...\n");
printk("Test start!\n");
/* Test 01 */
printk("Test 01: adding and search %d nodes testing!\n", N);
printk("Add %d nodes...\n", N);
do_gettimeofday(&start);
for (i = 0; i < N; i++) {
int value = key[i] = i;
skiplist_insert(list, key[i], value);
}
do_gettimeofday(&end);
printk("time span:% ldms\n", (end.tv_sec - start.tv_sec)*1000 + (end.tv_usec - start.tv_usec)/1000);
#ifdef SKIPLIST_DEBUG
skiplist_dump(list);
#endif
/* Search test */
printk("Now search %d node...\n", N);
do_gettimeofday(&start);
for (i = 0; i < N; i++) {
struct skipnode *node = skiplist_search(list, key[i]);
if (node != NULL) {
#ifdef SKIPLIST_DEBUG
printk("key:%d value:%d\n", node->key, node->value);
#endif
} else {
printk("Not found:%d\n", key[i]);
res = 1;
break;
}
}
do_gettimeofday(&end);
printk("time span:% ldms\n", (end.tv_sec - start.tv_sec)*1000 + (end.tv_usec - start.tv_usec)/1000);
if (res) {
printk("Test 01: failed!\n");
goto out_clean;
} else {
printk("Test 01: success!\n");
}
/* Test 02 */
printk("Test 02: search single node (%d/2) testing!\n", N);
node = skiplist_search(list, N/2);
if (node && node->value == N/2) {
printk("Test 02: Success!\n");
} else {
printk("Test 02: Failed!\n");
res = 1;
goto out_clean;
}
/* Test 03 */
printk("Test 03: remove single node (%d/2) testing!\n", N);
skiplist_remove(list, N/2);
node = skiplist_search(list, N/2);
if (!node) {
printk("Test 03: Success!\n");
} else {
printk("Test 03: Failed (key:%d)!\n", node->key);
res = 1;
goto out_clean;
}
/* Test 04 */
printk("Test 04: search single node equal or great than (%d/2) testing!\n", N);
printk("Test 04: case 1: no equal node (%d/2) \n", N);
node = skiplist_search_first_eq_big(list, N/2);
if (!node || node->value != (N/2 + 1)) {
printk("Test 04: Failed!\n");
res = 1;
goto out_clean;
}
printk("Test 04: case 2: has equal node (%d/2 + 1) \n", N);
node = skiplist_search_first_eq_big(list, N/2 + 1);
if (node && node->value == (N/2 + 1)) {
printk("Test 04: Success!\n");
} else {
printk("Test 04: Failed!\n");
res = 1;
goto out_clean;
}
/* Test 05 */
res = 0;
printk("Test 05: remove all nodes\n");
for (i = 0; i < N; i++) {
skiplist_remove(list, key[i]);
}
for (i = 0; i < N; i++) {
node = skiplist_search(list, key[i]);
if (node) {
res = 1;
break;
}
}
if (res)
printk("Test 05: Failed!\n");
else
printk("Test 05: Success!\n");
#ifdef SKIPLIST_DEBUG
skiplist_dump(list);
#endif
printk("End of Test.\n");
out_clean:
skiplist_destroy(list);
return 0;
}
int
main(void)
{
int i;
struct timeval start, end;
int *key = (int *)malloc(N * sizeof(int));
if (key == NULL) {
exit(-1);
}
struct skiplist *list = skiplist_new();
if (list == NULL) {
exit(-1);
}
printf("Test start!\n");
printf("Add %d nodes...\n", N);
/* Insert test */
srandom(time(NULL));
gettimeofday(&start, NULL);
for (i = 0; i < N; i++) {
int value = key[i] = (int)random();
skiplist_insert(list, key[i], value);
}
gettimeofday(&end, NULL);
printf("time span: %ldms\n", (end.tv_sec - start.tv_sec)*1000 + (end.tv_usec - start.tv_usec)/1000);
#ifdef SKIPLIST_DEBUG
skiplist_dump(list);
#endif
/* Search test 1 */
printf("Now search each node by key...\n");
gettimeofday(&start, NULL);
for (i = 0; i < N; i++) {
struct skipnode *node = skiplist_search_by_key(list, key[i]);
if (node != NULL) {
#ifdef SKIPLIST_DEBUG
printf("key:0x%08x value:0x%08x\n", node->key, node->value);
#endif
} else {
printf("Not found:0x%08x\n", key[i]);
}
#ifdef SKIPLIST_DEBUG
printf("key rank:%d\n", skiplist_key_rank(list, key[i]));
#else
//skiplist_key_rank(list, key[i]);
#endif
}
gettimeofday(&end, NULL);
printf("time span: %ldms\n", (end.tv_sec - start.tv_sec)*1000 + (end.tv_usec - start.tv_usec)/1000);
/* Search test 2 */
printf("Now search each node by rank...\n");
gettimeofday(&start, NULL);
for (i = 0; i < N; i++) {
struct skipnode *node = skiplist_search_by_rank(list, i + 1);
if (node != NULL) {
#ifdef SKIPLIST_DEBUG
printf("rank:%d value:0x%08x\n", i + 1, node->value);
#endif
} else {
printf("Not found:%d\n", i + 1);
}
}
gettimeofday(&end, NULL);
printf("time span: %ldms\n", (end.tv_sec - start.tv_sec)*1000 + (end.tv_usec - start.tv_usec)/1000);
/* Delete test */
printf("Now remove all nodes...\n");
gettimeofday(&start, NULL);
for (i = 0; i < N; i++) {
skiplist_remove(list, key[i]);
}
gettimeofday(&end, NULL);
printf("time span: %ldms\n", (end.tv_sec - start.tv_sec)*1000 + (end.tv_usec - start.tv_usec)/1000);
#ifdef SKIPLIST_DEBUG
skiplist_dump(list);
#endif
printf("End of Test.\n");
skiplist_delete(list);
return 0;
}
