Module Numbers.Int
include Ocaml_utils.Identifiable.S with type t = int
module T :
Ocaml_utils.Identifiable.Thing with type t = Ocaml_utils.Numbers.Int.tinclude Ocaml_utils.Identifiable.Thing
with type t := Ocaml_utils.Numbers.Int.T.t
include Stdlib.Hashtbl.HashedType with type t := Ocaml_utils.Numbers.Int.T.t
val equal : Ocaml_utils.Numbers.Int.T.t -> Ocaml_utils.Numbers.Int.T.t -> boolThe equality predicate used to compare keys.
val hash : Ocaml_utils.Numbers.Int.T.t -> intA hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include
- (
(=),hash) for comparing objects by structure (provided objects do not contain floats) - (
(fun x y -> compare x y = 0),hash) for comparing objects by structure and handlingStdlib.nancorrectly - (
(==),hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
include Stdlib.Map.OrderedType with type t := Ocaml_utils.Numbers.Int.T.t
val compare : Ocaml_utils.Numbers.Int.T.t -> Ocaml_utils.Numbers.Int.T.t -> intA total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.
val output : Stdlib.out_channel -> Ocaml_utils.Numbers.Int.T.t -> unitval print : Stdlib.Format.formatter -> Ocaml_utils.Numbers.Int.T.t -> unitmodule Set :
Ocaml_utils.Identifiable.Set with module T := Ocaml_utils.Numbers.Int.Tmodule Map :
Ocaml_utils.Identifiable.Map with module T := Ocaml_utils.Numbers.Int.Tmodule Tbl :
Ocaml_utils.Identifiable.Tbl with module T := Ocaml_utils.Numbers.Int.Tval zero_to_n : int -> Ocaml_utils.Numbers.Int.Set.tzero_to_n n is the set of numbers {0, ..., n} (inclusive).