package colibri2
include Colibri2_popop_lib.Popop_stdlib.Datatype with type t := t
include Colibri2_popop_lib.Popop_stdlib.OrderedHashedType with type t := t
val pp : t Colibri2_popop_lib.Pp.pp
val hash_fold_t : t Base.Hash.folder
module M : Colibri2_popop_lib.Map_intf.PMap with type key = t
module H : Colibri2_popop_lib.Exthtbl.Hashtbl.S with type key = t
val of_one_node : Colibri2_core.Node.t -> t
Build a value that represent one node
val is_one_node : t -> Colibri2_core.Node.t option
Test if a value represents one node
val subst : t -> Colibri2_core.Node.t -> t -> t
subst p n q
return the result of the substitution of n
by q
in p
val normalize : t -> f:(Colibri2_core.Node.t -> t) -> t
norm p ~f
normalize p
using f
An abstract type to avoid translating the map to sets in nodes
val nodes : t -> data Colibri2_core.Node.M.t
nodes t
returns the node which are present in t
val solve : t -> t -> t solve_total
solve t1 t2
solve the equation t1 = t2
by returning a substitution.
val set :
Colibri2_core.Egraph.wt ->
Colibri2_core.Node.t ->
old_:t option ->
new_:t ->
unit
Called a new term equal to this node is found
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>