-
Notifications
You must be signed in to change notification settings - Fork 1
/
ta.mli
68 lines (52 loc) · 1.41 KB
/
ta.mli
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
type atom = int
val atom_of_string: string -> atom
val string_of_atom: atom -> string
type t
val hash: t -> int
val equal: t -> t -> bool
val compare: t -> t -> int
(** Boolean combinations *)
val any: t
val empty: t
val inter: t -> t -> t
val union: t -> t -> t
val diff: t -> t -> t
val neg: t -> t
val is_trivially_empty: t -> bool
val is_trivially_any: t -> bool
type node
val eps: t
val fst: node -> t (** Any pair whose first component is as given. *)
val snd: node -> t (** Any pair whose second component is as given. *)
val elt: atom -> node -> node -> t
val anyelt: node -> node -> t
val tag: atom -> t
val nottag: atom -> t
val noneps: t
val tag_in: Pt.Set.t -> t
val tag_not_in: Pt.Set.t -> t
(** Delayed creation. *)
val mk: unit -> node
val def: node -> t -> unit
val get: node -> t
val uid: node -> int
val is_defined: t -> bool
val is_defined_node: node -> bool
(** Emptyness check. *)
exception Undefined
val is_empty: t -> bool
val is_any: t -> bool
val subset: t -> t -> bool
val disjoint: t -> t -> bool
val is_equal: t -> t -> bool
type v = Eps | Elt of atom * v * v
val is_in: v -> t -> bool
val dnf_neg_pair: atom -> t -> (t * t) list
val dnf_neg_all: t -> Pt.Set.t * (t * t) list * (atom * (t * t) list) list
val print: Format.formatter -> t -> unit
val sample: t -> v
val random_sample: t -> v
val print_v: Format.formatter -> v -> unit
val singleton: v -> t
val normalize: t -> t
val normalize2: t -> t