skiplist_test.c File Reference

#include <windows.h>
#include <stdio.h>
#include "skiplist.h"

Include dependency graph for skiplist_test.c:

Go to the source code of this file.

Functions
void	DumpSkiplist (PSKIPLIST Skiplist)
PVOID WINAPI	MyAlloc (DWORD Size)
int WINAPI	MyCompare (PVOID A, PVOID B)
void WINAPI	MyFree (PVOID Ptr)
int	main ()

Function Documentation

DumpSkiplist()

void DumpSkiplist

(

PSKIPLIST

Skiplist

)

Definition at line 13 of file skiplist_test.c.

{
    CHAR i;
    DWORD j;
    PSKIPLIST_NODE pNode;
 
    printf("======= DUMPING SKIPLIST =======\n");
 
    for (i = Skiplist->MaximumLevel + 1; --i >= 0;)
    {
        pNode = &Skiplist->Head;
        printf("H");
 
        while (pNode->Next[i])
        {
            printf("-");
 
            // By using the Distance array for painting the lines, we verify both the links and the distances for correctness.
            for (j = 1; j < pNode->Distance[i]; j++)
                printf("---");
 
            printf("%02Iu", (DWORD_PTR)pNode->Next[i]->Element);
 
            pNode = pNode->Next[i];
        }
 
        printf("\n");
    }
 
    printf("================================\n\n");
}

Referenced by main().

main()

int main

(

void

)

Definition at line 64 of file skiplist_test.c.

{
    PVOID Element;
    DWORD ElementIndex;
    DWORD i;
    SKIPLIST Skiplist;
    PSKIPLIST_NODE pNode;
 
    system("mode con cols=300");
    InitializeSkiplist(&Skiplist, MyAlloc, MyCompare, MyFree);
 
    // Insert some random elements with random numbers.
    for (i = 0; i < 40; i++)
        InsertElementSkiplist(&Skiplist, UlongToPtr(rand() % 100));
 
    // Delete all with index 0 to 29.
    for (i = 0; i < 30; i++)
        DeleteElementSkiplist(&Skiplist, UlongToPtr(i));
 
    // Insert some more random elements.
    for (i = 0; i < 40; i++)
        InsertElementSkiplist(&Skiplist, UlongToPtr(rand() % 100));
 
    // Output the third element (with zero-based index 2).
    pNode = LookupNodeByIndexSkiplist(&Skiplist, 2);
    printf("Element = %Iu for index 2\n", (DWORD_PTR)pNode->Element);
 
    // Check if an element with number 44 is in the list and output its index.
    Element = LookupElementSkiplist(&Skiplist, UlongToPtr(44), &ElementIndex);
    printf("Element = %p, ElementIndex = %lu\n\n", Element, ElementIndex);
 
    DumpSkiplist(&Skiplist);
 
    return 0;
}

MyAlloc()

PVOID WINAPI MyAlloc

(

DWORD

Size

)

Definition at line 46 of file skiplist_test.c.

{
    return HeapAlloc(GetProcessHeap(), 0, Size);
}

Referenced by main().

MyCompare()

int WINAPI MyCompare	(	PVOID	A,
		PVOID	B
	)

Definition at line 52 of file skiplist_test.c.

{
    return (DWORD_PTR)A - (DWORD_PTR)B;
}

Referenced by main().

MyFree()

void WINAPI MyFree

(

PVOID

Ptr

)

Definition at line 58 of file skiplist_test.c.

{
    HeapFree(GetProcessHeap(), 0, Ptr);
}

Referenced by main().