reactos/sdk/lib/skiplist/CMakeLists.txt


# The library
add_definitions(-DSKIPLIST_LEVELS=16)
add_library(skiplist16 skiplist.c)
add_dependencies(skiplist16 psdk)

# The Test program
add_executable(skiplist_test skiplist_test.c)
target_link_libraries(skiplist_test skiplist16)
set_module_type(skiplist_test win32cui)
add_importlibs(skiplist_test msvcrt kernel32 ntdll)
[SKIPLIST] Add my implementation of an efficient Skiplist. A Skiplist can do insertion, deletion and lookups in O(log N) on average just like balanced trees. It features simpler algorithms though due to purely relying on probabilistic balancing at insertion and not on rebalancing with every modification. This simple structure allowed me to implement some additions on top of the standard algorithms: * Storing distances between elements on each level to efficiently return the index of the element in the Skiplist when doing a lookup. * InsertTailElementSkiplist to explicitly insert an element at the end of the Skiplist. This needs no comparisons and is useful when you can be sure that the new element would be inserted at the end (e.g. for a new print job in the queue with default priority). More features are easily possible, but for now I limited features on those needed for my Local Spooler work. Some references on Skiplists: * ftp://ftp.cs.umd.edu/pub/skipLists/skiplists.pdf * http://drum.lib.umd.edu/bitstream/1903/544/2/CS-TR-2286.1.pdf svn path=/branches/colins-printing-for-freedom/; revision=68191 2015-06-19 10:27:46 +00:00
			`# The library`
			`add_definitions(-DSKIPLIST_LEVELS=16)`
			`add_library(skiplist16 skiplist.c)`
[SKIPLIST] Add a missing dependency to psdk for the skiplist code. Work in this branch continues as long as Trunk still serves a purpose for the 0.4.0 release. svn path=/branches/colins-printing-for-freedom/; revision=70502 2016-01-06 02:31:14 +00:00			`add_dependencies(skiplist16 psdk)`
[SKIPLIST] Add my implementation of an efficient Skiplist. A Skiplist can do insertion, deletion and lookups in O(log N) on average just like balanced trees. It features simpler algorithms though due to purely relying on probabilistic balancing at insertion and not on rebalancing with every modification. This simple structure allowed me to implement some additions on top of the standard algorithms: * Storing distances between elements on each level to efficiently return the index of the element in the Skiplist when doing a lookup. * InsertTailElementSkiplist to explicitly insert an element at the end of the Skiplist. This needs no comparisons and is useful when you can be sure that the new element would be inserted at the end (e.g. for a new print job in the queue with default priority). More features are easily possible, but for now I limited features on those needed for my Local Spooler work. Some references on Skiplists: * ftp://ftp.cs.umd.edu/pub/skipLists/skiplists.pdf * http://drum.lib.umd.edu/bitstream/1903/544/2/CS-TR-2286.1.pdf svn path=/branches/colins-printing-for-freedom/; revision=68191 2015-06-19 10:27:46 +00:00
			`# The Test program`
			`add_executable(skiplist_test skiplist_test.c)`
			`target_link_libraries(skiplist_test skiplist16)`
			`set_module_type(skiplist_test win32cui)`
			`add_importlibs(skiplist_test msvcrt kernel32 ntdll)`
No results found.