Data.Container.SubTerm

Definitions

interface MOrd : Type -> Type

  Like Ord, but with a comparison that can fail
  Can be thought of as computing whether a term is a subterm of another term,
  or as computing common prefixes/subpaths in a tree

Parameters: a
Constraints: Eq a
Constructor: 

MkMOrd

Methods:

mcompare : a -> a -> Maybe Ordering

Implementations:

MOrd (BinTreePos b)

MOrd (BinTreePosNode b)

MOrd (BinTreePosLeaf b)

Ord a => MOrd a

mcompare : MOrd a => a -> a -> Maybe Ordering

Totality: total
Visibility: public export

isSubTerm : MOrd a => a -> a -> Bool

Totality: total
Visibility: public export