aboutsummaryrefslogtreecommitdiffstats
path: root/lib/concepts
diff options
context:
space:
mode:
authorMarcos Magueta <maguetamarcos@gmail.com>2026-09-23 03:35:36 -0300
committerMarcos Magueta <maguetamarcos@gmail.com>2026-09-23 03:35:36 -0300
commit28c55a730d9a0a19a62d85c166dc879aebd7b772 (patch)
tree25ebdd2f526078047574f28b03b53828eaeb9b33 /lib/concepts
parent882511dc8c0abded18ba6abdca64938db2652771 (diff)
downloadRNT-28c55a730d9a0a19a62d85c166dc879aebd7b772.tar.gz
RNT-28c55a730d9a0a19a62d85c166dc879aebd7b772.zip
remove dead API
Diffstat (limited to 'lib/concepts')
-rw-r--r--lib/concepts/Cardinality.ml9
-rw-r--r--lib/concepts/Cardinality.mli6
-rw-r--r--lib/concepts/Mode.ml7
-rw-r--r--lib/concepts/Mode.mli4
4 files changed, 0 insertions, 26 deletions
diff --git a/lib/concepts/Cardinality.ml b/lib/concepts/Cardinality.ml
index a87f9c8..d878aa9 100644
--- a/lib/concepts/Cardinality.ml
+++ b/lib/concepts/Cardinality.ml
@@ -10,16 +10,7 @@ let compare a b =
let equal a b = compare a b = Utilities.Ordering.Equal
let leq a b = compare a b <> Utilities.Ordering.Greater
-let join a b = if leq a b then b else a
let meet a b = if leq a b then a else b
-
-let product a b =
- match a, b with
- | Empty, _ | _, Empty -> Empty
- | Countable, _ | _, Countable -> Countable
- | Finite, _ | _, Finite -> Finite
- | Bounded n, Bounded m -> if n > max_int / m then Finite else bounded (n * m)
-
let exhaustible = function Countable -> false | Empty | Bounded _ | Finite -> true
let to_string = function
diff --git a/lib/concepts/Cardinality.mli b/lib/concepts/Cardinality.mli
index c9a5d6d..d345bce 100644
--- a/lib/concepts/Cardinality.mli
+++ b/lib/concepts/Cardinality.mli
@@ -4,12 +4,6 @@ val bounded : int -> t
val compare : t -> t -> Utilities.Ordering.t
val equal : t -> t -> bool
val leq : t -> t -> bool
-val join : t -> t -> t
val meet : t -> t -> t
-
-(** the class of a generator run under every binding produced by
- another, which is how the classes of the generators chosen by an
- analysis combine. *)
-val product : t -> t -> t
val exhaustible : t -> bool
val to_string : t -> string
diff --git a/lib/concepts/Mode.ml b/lib/concepts/Mode.ml
index fc3ef84..b7aa814 100644
--- a/lib/concepts/Mode.ml
+++ b/lib/concepts/Mode.ml
@@ -7,15 +7,8 @@ type t = mode list
let attributes_of_list = BatSet.String.of_list
let attributes_of_map map = BatMap.String.keys map |> BatSet.String.of_enum
let decides_when bound = {bound= attributes_of_list bound; affords= Decides}
-
-let generates_when bound cardinality =
- {bound= attributes_of_list bound; affords= Generates cardinality}
-
let enumerable cardinality = {bound= BatSet.String.empty; affords= Generates cardinality}
-let empty = []
-let declare mode declaration = mode :: declaration
let of_list modes = modes
-let to_list declaration = declaration
let generation declaration bound =
List.fold_left
diff --git a/lib/concepts/Mode.mli b/lib/concepts/Mode.mli
index 018eeb2..6a906d1 100644
--- a/lib/concepts/Mode.mli
+++ b/lib/concepts/Mode.mli
@@ -13,12 +13,8 @@ type t
val attributes_of_list : attribute list -> attributes
val attributes_of_map : 'a BatMap.String.t -> attributes
val decides_when : attribute list -> mode
-val generates_when : attribute list -> Cardinality.t -> mode
val enumerable : Cardinality.t -> mode
-val empty : t
-val declare : mode -> t -> t
val of_list : mode list -> t
-val to_list : t -> mode list
(** the tightest class declared for generating under [bound]. A mode
declared for fewer bound attributes applies to more, since the