order-maintenance-0.1.1.1: Algorithms for the order maintenance problem with a safe interface

Safe Haskell	None
Language	Haskell2010

Data.Order.Raw

Documentation

type RawOrder a s = STRef s (OrderCell a s) Source #

type family OrderCell a s Source #

type RawElement a s = STRef s (ElementCell a s) Source #

type family ElementCell a s Source #

data RawAlgorithm a s Source #

Constructors

Fields

newOrder :: ST s (RawOrder a s)
compareElements :: RawOrder a s -> RawElement a s -> RawElement a s -> ST s Ordering
newMinimum :: RawOrder a s -> ST s (RawElement a s)
newMaximum :: RawOrder a s -> ST s (RawElement a s)
newAfter :: RawOrder a s -> RawElement a s -> ST s (RawElement a s)
newBefore :: RawOrder a s -> RawElement a s -> ST s (RawElement a s)
delete :: RawOrder a s -> RawElement a s -> ST s ()