package core
Module String.Caseless
Caseless compares and hashes strings ignoring case, so that for example Caseless.equal "OCaml" "ocaml" and Caseless.("apple" < "Banana") are true, and Caseless.Map, Caseless.Table lookup and Caseless.Set membership is case-insensitive.
Caseless also provides case-insensitive is_suffix and is_prefix functions, so that for example Caseless.is_suffix "OCaml" ~suffix:"AmL" and Caseless.is_prefix "OCaml" ~prefix:"oc" are true.
include module type of struct include Base.String.Caseless end
include Sexplib0.Sexpable.S with type t := Base.String.t
val t_sexp_grammar : Base.String.t Sexplib0.Sexp_grammar.tinclude Base.Comparable.S with type t := Base.String.t
include Base.Comparisons.S with type t := Base.String.t
include Base.Comparisons.Infix with type t := Base.String.t
include Base.Comparator.S with type t := Base.String.t
val is_suffix : Base.String.t -> suffix:Base.String.t -> boolval is_prefix : Base.String.t -> prefix:Base.String.t -> boolval is_substring : Base.String.t -> substring:Base.String.t -> boolval is_substring_at :
Base.String.t ->
pos:int ->
substring:Base.String.t ->
boolval substr_index :
?pos:int ->
Base.String.t ->
pattern:Base.String.t ->
int optionval substr_index_exn :
?pos:int ->
Base.String.t ->
pattern:Base.String.t ->
intval substr_index_all :
Base.String.t ->
may_overlap:bool ->
pattern:Base.String.t ->
int listval substr_replace_first :
?pos:int ->
Base.String.t ->
pattern:Base.String.t ->
with_:Base.String.t ->
Base.String.tval substr_replace_all :
Base.String.t ->
pattern:Base.String.t ->
with_:Base.String.t ->
Base.String.ttype nonrec t = Base.String.tinclude Bin_prot.Binable.S with type t := t
include Bin_prot.Binable.S_only_functions with type t := t
val bin_size_t : t Bin_prot.Size.sizerval bin_write_t : t Bin_prot.Write.writerval bin_read_t : t Bin_prot.Read.readerval __bin_read_t__ : (int -> t) Bin_prot.Read.readerThis function only needs implementation if t exposed to be a polymorphic variant. Despite what the type reads, this does *not* produce a function after reading; instead it takes the constructor tag (int) before reading and reads the rest of the variant t afterwards.
val bin_shape_t : Bin_prot.Shape.tval bin_writer_t : t Bin_prot.Type_class.writerval bin_reader_t : t Bin_prot.Type_class.readerval bin_t : t Bin_prot.Type_class.tinclude Ppx_hash_lib.Hashable.S with type t := t
include Sexplib0.Sexpable.S with type t := t
val t_of_sexp : Sexplib0.Sexp.t -> tval sexp_of_t : t -> Sexplib0.Sexp.tinclude Comparable.S_binable with type t := t
include Base.Comparable.S with type t := t
include Base.Comparisons.S with type t := t
compare t1 t2 returns 0 if t1 is equal to t2, a negative integer if t1 is less than t2, and a positive integer if t1 is greater than t2.
ascending is identical to compare. descending x y = ascending y x. These are intended to be mnemonic when used like List.sort ~compare:ascending and List.sort ~cmp:descending, since they cause the list to be sorted in ascending or descending order, respectively.
clamp_exn t ~min ~max returns t', the closest value to t such that between t' ~low:min ~high:max is true.
Raises if not (min <= max).
val clamp : t -> min:t -> max:t -> t Base.Or_error.tinclude Base.Comparator.S with type t := t
val validate_lbound : min:t Maybe_bound.t -> t Validate.checkval validate_ubound : max:t Maybe_bound.t -> t Validate.checkval validate_bound :
min:t Maybe_bound.t ->
max:t Maybe_bound.t ->
t Validate.checkmodule Replace_polymorphic_compare :
Base.Comparable.Polymorphic_compare with type t := tinclude Comparator.S
with type t := t
with type comparator_witness := comparator_witness
val comparator : (t, comparator_witness) Base.Comparator.comparatormodule Map :
Map.S_binable
with type Key.t = t
with type Key.comparator_witness = comparator_witnessmodule Set :
Set.S_binable
with type Elt.t = t
with type Elt.comparator_witness = comparator_witnessinclude Hashable.S_binable with type t := t
include Ppx_hash_lib.Hashable.S with type t := t
val hash_fold_t : Base.Hash.state -> t -> Base.Hash.stateval hash : t -> Base.Hash.hash_valueval hashable : t Base.Hashable.tmodule Table : Hashtbl.S_binable with type key = tmodule Hash_set : Hash_set.S_binable with type elt = tmodule Hash_queue : Hash_queue.S with type key = t