Data.Struct.Label

Documentation

data Label s

Logarithmic time list labeling solution

Instances

Struct Label

Defined in Data.Struct.Internal.Label

Methods

struct :: Dict (Coercible (Label s) (Object s))

Eq (Label s)

Defined in Data.Struct.Internal.Label

Methods

(==) :: Label s -> Label s -> Bool

(/=) :: Label s -> Label s -> Bool

new :: PrimMonad m => m (Label (PrimState m))

O(1). Create a new labeling structure. Labels from different list labeling structures are incomparable.

insertAfter :: PrimMonad m => Label (PrimState m) -> m (Label (PrimState m))

O(log n) amortized. Insert a new label after a given label.

delete :: PrimMonad m => Label (PrimState m) -> m ()

O(1). Remove a label

least :: PrimMonad m => Label (PrimState m) -> m (Label (PrimState m))

O(n). Retrieve the least label

greatest :: PrimMonad m => Label (PrimState m) -> m (Label (PrimState m))

O(n). Retrieve the greatest label

cutAfter :: PrimMonad m => Label (PrimState m) -> m ()

O(1). Split off all labels after the current label.

cutBefore :: PrimMonad m => Label (PrimState m) -> m ()

O(1). Split off all labels before the current label.

compareM :: PrimMonad m => Label (PrimState m) -> Label (PrimState m) -> m Ordering

O(1). Compare two labels for ordering.