Generics.Regular.Transformations.Explicit

Documentation

diff :: forall a. Transform a => a -> a -> Transformation a

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

apply :: Transform a => Transformation a -> a -> Maybe a

Apply the edits to the given tree

type Transformation a = [(Path, Fix (WithRef a))]

data WithRef a b

Constructors

InR (PF a b)

Ref Path

Instances

Functor (PF a) => Functor (WithRef a)

type Path = [Int]

class (Regular a, Children (PF a), CountI (PF a), Functor (PF a), SEq (PF a), ExtractN (PF a), MapN (PF a), GMap (PF a), GOrd (PF a), Eq (PF a)) => Transform a

class HasRef a where

Associated Types

type RefRep a

Methods

toRef :: WithRef a (RefRep a) -> RefRep a

fromRef :: RefRep a -> WithRef a (RefRep a)

type NiceTransformation a = [(Path, RefRep a)]

toNiceTransformation :: (Functor (PF a), HasRef a) => Transformation a -> NiceTransformation a

fromNiceTransformation :: (Functor (PF a), HasRef a) => NiceTransformation a -> Transformation a