lca-0.3: O(log n) persistent on-line lowest common ancestor calculation without preprocessing

Copyright(C) 2012-2015 Edward Kmett
LicenseBSD-style (see the file LICENSE)
MaintainerEdward Kmett <ekmett@gmail.com>
Stabilityprovisional
Portabilityportable
Safe HaskellSafe
LanguageHaskell98

Data.LCA.View

Description

 

Synopsis

Documentation

data View f a Source

Provides a consistent View for peeling off the bottom node of a path.

Constructors

Root 
Node !Int a (f a) 

Instances

Functor f => Functor (View f) Source 
Foldable f => Foldable (View f) Source 
Traversable f => Traversable (View f) Source 
(Eq a, Eq (f a)) => Eq (View f a) Source 
(Ord a, Ord (f a)) => Ord (View f a) Source 
(Read a, Read (f a)) => Read (View f a) Source 
(Show a, Show (f a)) => Show (View f a) Source