org.anc.util

Class SkipList<T extends Comparable<T>>

java.lang.Object

org.anc.util.SkipList<T>

All Implemented Interfaces:

Iterable<T>

public class SkipList<T extends Comparable<T>>
extends Object
implements Iterable<T>

Experimental.

A skip list is a linked list with additonal links that skip over N elements in the list. This permits linear searches of the list to skip N nodes when looking for the desired node. Once the section of the list containing the desired node is located a linear search of those N nodes is performed.

Note: only every Nth node contains the "skip link".

Version:

1.0

Author:

Keith Suderman

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
class	SkipList.SkipNode<T1>

Constructor Summary

Constructors

Constructor and Description
SkipList()

Method Summary

Modifier and Type	Method and Description
void	add(T item)
protected void	addToBlock(SkipList.SkipNode<T> block, T item)
void	clear()
void	delete(SkipList.SkipNode<T> node)
SkipList.SkipNode<T>	find(T item)
protected SkipList.SkipNode<T>	findBlock(T item) Return the late node such that the item stored at that node is <= the item we are looking for.
T	get(T item)
Iterator<T>	iterator()
static void	main(String[] args)
void	print()
void	remove(T item)
void	replace(T item)
long	size()
protected void	split(SkipList.SkipNode<T> block)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Detail

SkipList

public SkipList()

Method Detail

size

public long size()

clear

public void clear()

add

public void add(T item)

replace

public void replace(T item)

get

public T get(T item)

find

public SkipList.SkipNode<T> find(T item)

remove

public void remove(T item)

delete

public void delete(SkipList.SkipNode<T> node)

iterator

public Iterator<T> iterator()

Specified by:

iterator in interface Iterable<T extends Comparable<T>>

findBlock

protected SkipList.SkipNode<T> findBlock(T item)

Return the late node such that the item stored at that node is <= the item we are looking for. Performs a linear search of the list using the skip nodes.

Parameters:

item - T The item being searched for.

Returns:

SkipNode The last node in the list such that the item in that node is <= the item we are looking for.

addToBlock

protected void addToBlock(SkipList.SkipNode<T> block,
                          T item)

split

protected void split(SkipList.SkipNode<T> block)

print

public void print()

main

public static void main(String[] args)