Generics.MultiRec.Transformations.Explicit

Documentation

diff :: forall phi ix. Transform phi => phi ix -> ix -> ix -> Transformation phi

Find a set of insertions to transform the first into the second tree

apply :: forall phi ix. Transform phi => phi ix -> ix -> Transformation phi -> Maybe ix

Apply the transformation to the given tree

type Transformation phi = [AnyInsert phi]

data AnyInsert phi where

Constructors

AnyInsert :: phi ix -> Path -> HFix (WithRef phi) ix -> AnyInsert phi

data WithRef phi f a

Constructors

InR (PF phi f a)

Ref Path

type Path = [Int]

class (Fam phi, Children phi (PF phi), CountI phi (PF phi), HFunctor phi (PF phi), SEq phi (PF phi), ExtractN phi (PF phi), MapN phi (PF phi), EqS phi, HEq phi (PF phi), HOrd phi (PF phi), OrdI phi) => Transform phi

class OrdI phi where

Comparing index of different types

Methods

compareI :: phi ix -> phi ix' -> Ordering

indexI :: phi ix -> Int

class HasRef phi where

Associated Types

type RefRep phi ix

Methods

toRef :: phi ix -> HFix (WithRef phi) ix -> RefRep phi ix

fromRef :: phi ix -> RefRep phi ix -> HFix (WithRef phi) ix

type NiceTransformation phi = [NiceInsert phi]

data NiceInsert phi where

Constructors

NiceInsert :: phi ix -> Path -> RefRep phi ix -> NiceInsert phi

toNiceTransformation :: HasRef phi => Transformation phi -> NiceTransformation phi

fromNiceTransformation :: HasRef phi => NiceTransformation phi -> Transformation phi