This module extends Base.String.
include sig ... endval bin_t : t Bin_prot.Type_class.tval bin_read_t : t Bin_prot.Read.readerval __bin_read_t__ : (int ‑> t) Bin_prot.Read.readerval bin_reader_t : t Bin_prot.Type_class.readerval bin_size_t : t Bin_prot.Size.sizerval bin_write_t : t Bin_prot.Write.writerval bin_writer_t : t Bin_prot.Type_class.writerval bin_shape_t : Bin_prot.Shape.tval typerep_of_t : t Typerep_lib.Std.Typerep.tval typename_of_t : t Typerep_lib.Std.Typename.tmodule Caseless : sig ... endinclude module type of sig ... end with type t := t with module Caseless := Base.String.Caselessmodule Caseless = Base__String.Caselessval unsafe_blit : (t, bytes) Base.Blit.blitval sub : (t, t) Base.Blit.subval subo : (t, t) Base.Blit.suboval fold_result : t ‑> init:'accum ‑> f:('accum ‑> elt ‑> ('accum, 'e) Base.Result.t) ‑> ('accum, 'e) Base.Result.tval fold_until : t ‑> init:'accum ‑> f:('accum ‑> elt ‑> ('accum, 'final) Base__.Container_intf.Continue_or_stop.t) ‑> finish:('accum ‑> 'final) ‑> 'finalval sum : (module Base.Commutative_group.S with type t = 'sum) ‑> t ‑> f:(elt ‑> 'sum) ‑> 'sumval hash_fold_t : Base.Hash.state ‑> t ‑> Base.Hash.stateval t_of_sexp : Base.Sexp.t ‑> tval sexp_of_t : t ‑> Base.Sexp.tval of_string : string ‑> tval to_string : t ‑> stringval clamp : t ‑> min:t ‑> max:t ‑> t Base.Or_error.tval comparator : (t, comparator_witness) Base.Comparator.comparatorval validate_lbound : min:t Base.Maybe_bound.t ‑> t Base.Validate.checkval validate_ubound : max:t Base.Maybe_bound.t ‑> t Base.Validate.checkval validate_bound : min:t Base.Maybe_bound.t ‑> max:t Base.Maybe_bound.t ‑> t Base.Validate.checkval pp : Base.Formatter.t ‑> t ‑> unitexternal length : t ‑> int = "%string_length" external get : t ‑> int ‑> char = "%string_safe_get" val make : int ‑> char ‑> tval init : int ‑> f:(int ‑> char) ‑> tval fill : bytes ‑> pos:int ‑> len:int ‑> char ‑> unitval contains : ?pos:int ‑> ?len:int ‑> t ‑> char ‑> boolval index : t ‑> char ‑> int optionval index_exn : t ‑> char ‑> intval rindex : t ‑> char ‑> int optionval rindex_exn : t ‑> char ‑> intval index_from : t ‑> int ‑> char ‑> int optionval index_from_exn : t ‑> int ‑> char ‑> intval rindex_from : t ‑> int ‑> char ‑> int optionval rindex_from_exn : t ‑> int ‑> char ‑> intval to_list_rev : t ‑> char listval lfindi : ?pos:int ‑> t ‑> f:(int ‑> char ‑> bool) ‑> int optionval rfindi : ?pos:int ‑> t ‑> f:(int ‑> char ‑> bool) ‑> int optionval foldi : t ‑> init:'a ‑> f:(int ‑> 'a ‑> char ‑> 'a) ‑> 'aval tr_inplace : target:char ‑> replacement:char ‑> bytes ‑> unitexternal hash : t ‑> int = "Base_hash_string" val is_empty : t ‑> boolval of_char : char ‑> tval of_char_list : char list ‑> tmodule Escaping = Base__String.Escapingslice t start stop returns a new string including elements t.(start) through
t.(stop-1), normalized Python-style with the exception that stop = 0 is treated as
stop = length t.
take_while s ~f returns the longest prefix of s satisfying for_all prefix ~f
(See lstrip to drop such a prefix)
rtake_while s ~f returns the longest suffix of s satisfying for_all suffix ~f
(See rstrip to drop such a suffix)
include Identifiable.S with type t := t and type comparator_witness := comparator_witnessinclude sig ... endval bin_t : t Bin_prot.Type_class.tval bin_read_t : t Bin_prot.Read.readerval __bin_read_t__ : (Core_kernel__.Import.int ‑> t) Bin_prot.Read.readerval bin_reader_t : t Bin_prot.Type_class.readerval bin_size_t : t Bin_prot.Size.sizerval bin_write_t : t Bin_prot.Write.writerval bin_writer_t : t Bin_prot.Type_class.writerval bin_shape_t : Bin_prot.Shape.tval hash_fold_t : Base.Hash.state ‑> t ‑> Base.Hash.stateval hash : t ‑> Base.Hash.hash_valueval t_of_sexp : Base.Sexp.t ‑> tval sexp_of_t : t ‑> Base.Sexp.tinclude Identifiable.S_common with type t := tinclude sig ... endval compare : t ‑> t ‑> Core_kernel__.Import.intval hash_fold_t : Base.Hash.state ‑> t ‑> Base.Hash.stateval hash : t ‑> Base.Hash.hash_valueval sexp_of_t : t ‑> Base.Sexp.tinclude Core_kernel__.Import.Stringable.S with type t := tval of_string : string ‑> tval to_string : t ‑> stringinclude Core_kernel__.Import.Pretty_printer.S with type t := tval pp : Base.Formatter.t ‑> t ‑> unitinclude Comparable.S_binable with type t := tinclude Core_kernel__.Comparable_intf.S_commoninclude Base.Comparable.Sinclude Base__.Comparable_intf.Polymorphic_compareascending 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 := tval comparator : (t, comparator_witness) Base.Comparator.comparatorinclude Base__.Comparable_intf.Validate with type t := tval validate_lbound : min:t Base.Maybe_bound.t ‑> t Base.Validate.checkval validate_ubound : max:t Base.Maybe_bound.t ‑> t Base.Validate.checkval validate_bound : min:t Base.Maybe_bound.t ‑> max:t Base.Maybe_bound.t ‑> t Base.Validate.checkmodule Replace_polymorphic_compare : Core_kernel__.Comparable_intf.Polymorphic_compare with type t := tinclude Core_kernel__.Comparable_intf.Map_and_set_binable with type t := t with type comparator_witness := comparator_witnessinclude Comparator.S with type t := tval comparator : (t, comparator_witness) 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 := tinclude sig ... endval hash_fold_t : Base.Hash.state ‑> t ‑> Base.Hash.stateval hash : t ‑> Base.Hash.hash_valueval hashable : t Hashtbl.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 = tval gen' : char Quickcheck.Generator.t ‑> t Quickcheck.Generator.tLike gen, but generate strings with the given distribution of characters.
val gen_with_length : int ‑> char Quickcheck.Generator.t ‑> t Quickcheck.Generator.tLike gen', but generate strings with the given length.
module Stable : sig ... endNote that string is already stable by itself, since as a primitive type it is an
integral part of the sexp / bin_io protocol. String.Stable exists only to introduce
String.Stable.Set and String.Stable.Map, and provide interface uniformity with
other stable types.