MySKL implements a skip list data structure (invented in 1990 by William Pugh) by means of that we can implement a fast kind of lists. In a such data structure, primary operations such as insertion, deleting and searching, have almost the same complexity as in AVL trees, but the former is easier to implement and thus maintain.
it is written in C, compatible with C++ and compilable both under Linux and Windows it can be either compiled as a shared or static library on Linux; as a DLL on Win it manages memory with care: no memory leak found while tested with Valgrind it represents data as a couple : this takes some advantages it can deal with generic data types
Copyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.