skipList.h File Reference

Skip List container implementation. More...

#include <random>
#include "comparator.h"
#include "vector.h"
#include "couple.h"

Include dependency graph for skipList.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	original::skipList< K_TYPE, V_TYPE, ALLOC, Compare >
	Skip List container implementation. More...
class	original::skipList< K_TYPE, V_TYPE, ALLOC, Compare >::skipListNode
	Internal node class for Skip List. More...
class	original::skipList< K_TYPE, V_TYPE, ALLOC, Compare >::Iterator
	Forward iterator for skipList. More...

Namespaces
namespace	original
	Main namespace for the project Original.

Detailed Description

Skip List container implementation.

Provides a probabilistic alternative to balanced trees with:

• Expected O(log n) search/insert/delete operations
• Multi-level linked list structure
• Custom comparator support
• STL-style allocator support

Key Features:

• Probabilistic balancing with O(log n) expected performance
• Simpler implementation than balanced trees
• Sorted element storage
• Customizable comparison and allocation
• Full iterator support
• Exception safety (basic guarantee)