Module ConditionDom.Path

type t' =

1. | Root
2. | Append of t * Literal.t
3. | Join of {
   1. a : t;
   2. b : t;
   3. ancestor : t;
   }

and t = {

1. id : int;
2. content : t';
3. depth : int;

}

val root : t

val pretty : Stdlib.Format.formatter -> t -> unit

val equal : t -> t -> bool

val count : int Stdlib.ref

val tail : t -> t

val nearest_common_ancestor : t -> t -> t

val is_prefix : t -> t -> bool

val inter : t -> t -> t

val disjoint : t -> t -> bool

module AppendHash : sig ... end

module JoinHash : sig ... end

val weakhash_default_size : int

val tag_ref : int Stdlib.ref

val append_table : AppendHash.t

val join_table : JoinHash.t

val append : t -> Literal.t -> AppendHash.data

val join : t -> t -> JoinHash.data

val union : t -> t -> JoinHash.data

val of_literal : Literal.t -> AppendHash.data