Data.LCA.Online.Naive

Naive online calculation of the the lowest common ancestor in O(h)

Documentation

data Path a

An uncompressed Path with memoized length.

Instances

Functor Path

Foldable Path

Traversable Path

Read a => Read (Path a)

Show a => Show (Path a)

empty :: Path a

The empty Path

cons :: Int -> a -> Path a -> Path a

O(1) Invariant: most operations assume that the keys k are globally unique

Extend the path with a new node ID and value.

uncons :: Path a -> Maybe (Int, a, Path a)

O(1) Extract the node ID and value from the newest node on the Path.

view :: Path a -> View Path a

O(1) Extract the node ID and value from the newest node on the Path, slightly faster than uncons.

null :: Foldable t => forall a. t a -> Bool

Test whether the structure is empty. The default implementation is optimized for structures that are similar to cons-lists, because there is no general way to do better.

length :: Foldable t => forall a. t a -> Int

Returns the size/length of a finite structure as an Int. The default implementation is optimized for structures that are similar to cons-lists, because there is no general way to do better.

isAncestorOf :: Path a -> Path b -> Bool

O(h) xs isAncestorOf ys holds when xs is a prefix starting at the root of Path ys.

lca :: Path a -> Path b -> Path a

O(h) Compute the lowest common ancestor of two paths

keep :: Int -> Path a -> Path a

O(h - k) to keep k elements of Path of length h

drop :: Int -> Path a -> Path a

O(k) to drop k elements from a Path

traverseWithKey :: Applicative f => (Int -> a -> f b) -> Path a -> f (Path b)

Traverse a Path with access to the node IDs.

toList :: Path a -> [(Int, a)]

Convert a Path to a list of (ID, value) pairs.

fromList :: [(Int, a)] -> Path a

Build a Path from a list of (ID, value) pairs.

(~=) :: Path a -> Path b -> Bool infix 4

O(1) Compare to see if two trees have the same leaf key