compdata-0.12: Compositional Data Types

Copyright (c) 2011 Patrick Bahr BSD3 Patrick Bahr experimental non-portable (GHC Extensions) None Haskell98

Data.Comp.Generic

Description

This module defines type generic functions and recursive schemes along the lines of the Uniplate library.

Synopsis

# Documentation

getSubterm :: (Functor g, Foldable g) => [Int] -> Term g -> Maybe (Term g) Source #

This function returns the subterm of a given term at the position specified by the given path or Nothing if the input term has no such subterm

subterms :: forall f. Foldable f => Term f -> [Term f] Source #

This function returns a list of all subterms of the given term. This function is similar to Uniplate's universe function.

subterms' :: forall f g. (Foldable f, g :<: f) => Term f -> [g (Term f)] Source #

This function returns a list of all subterms of the given term that are constructed from a particular functor.

transform :: Functor f => (Term f -> Term f) -> Term f -> Term f Source #

This function transforms every subterm according to the given function in a bottom-up manner. This function is similar to Uniplate's transform function.

transform' :: Functor f => (Term f -> Maybe (Term f)) -> Term f -> Term f Source #

transformM :: (Traversable f, Monad m) => (Term f -> m (Term f)) -> Term f -> m (Term f) Source #

Monadic version of transform.

query :: Foldable f => (Term f -> r) -> (r -> r -> r) -> Term f -> r Source #

gsize :: Foldable f => Term f -> Int Source #

size :: Foldable f => Cxt h f a -> Int Source #

This function computes the generic size of the given term, i.e. the its number of subterm occurrences.

height :: Foldable f => Cxt h f a -> Int Source #

This function computes the generic height of the given term.