Data.STM.PriorityQueue.Internal.LLSLPQ

An implementation of Class based on skip-list.

Expected time complexity of deletion is O(1), while insertion still normally has logarithmic complexity.

Default maximum height of skip-list node is 16. Use explicit constructor in case the height needs to be changed.

The skip-list's nodes are implemented via fine-grained Linked List.

Documentation

data LLSLPQ k v

Abbreviation stands for Linked List (-based) Skip-List Priority Queue

Instances

PriorityQueue LLSLPQ

new' :: Ord k => Int -> STM (LLSLPQ k v)

Parameterizing constructor which determines maximum height of skip-list node.