Data.Queue.Indexed.Splay

Size-indexed splay heaps.

Documentation

data Splay n a where

A size-indexed splay heap. Based on this.

Constructors

Leaf :: Splay 0 a

Node :: a -> !(Splay n a) -> !(Splay m a) -> Splay ((1 + n) + m) a

Instances

Ord a => MeldableIndexedQueue Splay a

Methods

merge :: Splay n a -> Splay m a -> Splay (n + m) a

Ord a => IndexedQueue Splay a

Methods

empty :: Splay 0 a

minView :: Splay (1 + n) a -> (a, Splay n a)

singleton :: a -> Splay 1 a

insert :: a -> Splay n a -> Splay (1 + n) a

minViewMay :: Splay n a -> ((Nat ~ n) 0 -> b) -> (forall m. (Nat ~ (1 + m)) n => a -> Splay m a -> b) -> b

NFData a => NFData (Splay n a)

Methods

rnf :: Splay n a -> ()