package b0
Install
dune-project
Dependency
Authors
Maintainers
Sources
sha512=00a6868b4dfa34565d0141b335622a81a0e8d5b9e3c6dfad025dabfa3df2db2a1302b492953bbbce30c3a4406c324fcec25250a00b38f6d18a69e15605e3b07e
doc/b0.std/B0_std/String/index.html
Module B0_std.String
Strings.
Stdlib String
include module type of String
Strings
make n c is a string of length n with each index holding the character c.
init n f is a string of length n with index i holding the character f i (called in increasing index order).
get s i is the character at index i in s. This is the same as writing s.[i].
Return a new string that contains the same bytes as the given byte sequence.
Return a new byte sequence that contains the same bytes as the given string.
Same as Bytes.blit_string which should be preferred.
Concatenating
Note. The Stdlib.(^) binary operator concatenates two strings.
concat sep ss concatenates the list of strings ss, inserting the separator string sep between each.
Predicates and comparisons
compare s0 s1 sorts s0 and s1 in lexicographical order. compare behaves like Stdlib.compare on strings but may be more efficient.
contains_from s start c is true if and only if c appears in s after position start.
rcontains_from s stop c is true if and only if c appears in s before position stop+1.
contains s c is String.contains_from s 0 c.
Extracting substrings
sub s pos len is a string of length len, containing the substring of s that starts at position pos and has length len.
split_on_char sep s is the list of all (possibly empty) substrings of s that are delimited by the character sep. If s is empty, the result is the singleton list [""].
The function's result is specified by the following invariants:
- The list is not empty.
- Concatenating its elements using
sepas a separator returns a string equal to the input (concat (make 1 sep) (split_on_char sep s) = s). - No string in the result contains the
sepcharacter.
Transforming
map f s is the string resulting from applying f to all the characters of s in increasing order.
mapi f s is like map but the index of the character is also passed to f.
fold_left f x s computes f (... (f (f x s.[0]) s.[1]) ...) s.[n-1], where n is the length of the string s.
fold_right f s x computes f s.[0] (f s.[1] ( ... (f s.[n-1] x) ...)), where n is the length of the string s.
trim s is s without leading and trailing whitespace. Whitespace characters are: ' ', '\x0C' (form feed), '\n', '\r', and '\t'.
escaped s is s with special characters represented by escape sequences, following the lexical conventions of OCaml.
All characters outside the US-ASCII printable range [0x20;0x7E] are escaped, as well as backslash (0x2F) and double-quote (0x22).
The function Scanf.unescaped is a left inverse of escaped, i.e. Scanf.unescaped (escaped s) = s for any string s (unless escaped s fails).
uppercase_ascii s is s with all lowercase letters translated to uppercase, using the US-ASCII character set.
lowercase_ascii s is s with all uppercase letters translated to lowercase, using the US-ASCII character set.
capitalize_ascii s is s with the first character set to uppercase, using the US-ASCII character set.
uncapitalize_ascii s is s with the first character set to lowercase, using the US-ASCII character set.
Traversing
iter f s applies function f in turn to all the characters of s. It is equivalent to f s.[0]; f s.[1]; ...; f s.[length s - 1]; ().
iteri is like iter, but the function is also given the corresponding character index.
Searching
index_from s i c is the index of the first occurrence of c in s after position i.
index_from_opt s i c is the index of the first occurrence of c in s after position i (if any).
rindex_from s i c is the index of the last occurrence of c in s before position i+1.
rindex_from_opt s i c is the index of the last occurrence of c in s before position i+1 (if any).
index s c is String.index_from s 0 c.
index_opt s c is String.index_from_opt s 0 c.
rindex s c is String.rindex_from s (length s - 1) c.
rindex_opt s c is String.rindex_from_opt s (length s - 1) c.
Strings and Sequences
to_seq s is a sequence made of the string's characters in increasing order.
to_seqi s is like to_seq but also tuples the corresponding index.
UTF decoding and validations
UTF-8
val get_utf_8_uchar : t -> int -> Uchar.utf_decodeget_utf_8_uchar b i decodes an UTF-8 character at index i in b.
val is_valid_utf_8 : t -> boolis_valid_utf_8 b is true if and only if b contains valid UTF-8 data.
UTF-16BE
val get_utf_16be_uchar : t -> int -> Uchar.utf_decodeget_utf_16be_uchar b i decodes an UTF-16BE character at index i in b.
val is_valid_utf_16be : t -> boolis_valid_utf_16be b is true if and only if b contains valid UTF-16BE data.
UTF-16LE
val get_utf_16le_uchar : t -> int -> Uchar.utf_decodeget_utf_16le_uchar b i decodes an UTF-16LE character at index i in b.
val is_valid_utf_16le : t -> boolis_valid_utf_16le b is true if and only if b contains valid UTF-16LE data.
Binary decoding of integers
The functions in this section binary decode integers from strings.
All following functions raise Invalid_argument if the characters needed at index i to decode the integer are not available.
Little-endian (resp. big-endian) encoding means that least (resp. most) significant bytes are stored first. Big-endian is also known as network byte order. Native-endian encoding is either little-endian or big-endian depending on Sys.big_endian.
32-bit and 64-bit integers are represented by the int32 and int64 types, which can be interpreted either as signed or unsigned numbers.
8-bit and 16-bit integers are represented by the int type, which has more bits than the binary encoding. These extra bits are sign-extended (or zero-extended) for functions which decode 8-bit or 16-bit integers and represented them with int values.
get_uint8 b i is b's unsigned 8-bit integer starting at character index i.
get_int8 b i is b's signed 8-bit integer starting at character index i.
get_uint16_ne b i is b's native-endian unsigned 16-bit integer starting at character index i.
get_uint16_be b i is b's big-endian unsigned 16-bit integer starting at character index i.
get_uint16_le b i is b's little-endian unsigned 16-bit integer starting at character index i.
get_int16_ne b i is b's native-endian signed 16-bit integer starting at character index i.
get_int16_be b i is b's big-endian signed 16-bit integer starting at character index i.
get_int16_le b i is b's little-endian signed 16-bit integer starting at character index i.
get_int32_ne b i is b's native-endian 32-bit integer starting at character index i.
val hash : t -> intAn unseeded hash function for strings, with the same output value as Hashtbl.hash. This function allows this module to be passed as argument to the functor Hashtbl.Make.
val seeded_hash : int -> t -> intA seeded hash function for strings, with the same output value as Hashtbl.seeded_hash. This function allows this module to be passed as argument to the functor Hashtbl.MakeSeeded.
get_int32_be b i is b's big-endian 32-bit integer starting at character index i.
get_int32_le b i is b's little-endian 32-bit integer starting at character index i.
get_int64_ne b i is b's native-endian 64-bit integer starting at character index i.
get_int64_be b i is b's big-endian 64-bit integer starting at character index i.
Strings
Predicates
starts_with ~prefix s is true iff sub.[i] = s.[i] for all indices i of prefix.
Note. Available in 4.12.
eds_with ~suffix s is true iff sub.[i] = s.[m - i] for all indices i of sufix and with m = String.length s - 1.
Note. Available in 4.12.
includes ~affix s is true iff there exists an index j such that for all indices i of affix, sub.[i] = s.[j+ 1].
for_all p s is true iff for all indices i of s, p s.[i] = true.
exists p s is true iff there exists an index i of s with p s.[i] = true.
Finding substrings
find_sub ~start ~sub s is the start index (if any) of the first occurence of sub in s at or after start.
Extracting substrings
subrange ~first ~last s are the consecutive bytes of s whose indices exist in the range [first;last].
first defaults to 0 and last to String.length s - 1.
Note that both first and last can be any integer. If first > last the interval is empty and the empty string is returned.
Breaking
Breaking with magnitudes
take_left n s are the first n bytes of s. This is s if n >= length s and "" if n <= 0.
take_right n s are the last n bytes of s. This is s if n >= length s and "" if n <= 0.
drop_left n s is s without the first n bytes of s. This is "" if n >= length s and s if n <= 0.
drop_right n s is s without the last n bytes of s. This is "" if n >= length s and s if n <= 0.
break_right n v is (drop_left n v, take_right n v).
Breaking with predicates
keep_left sat s are the first consecutive sat statisfying bytes of s.
keep_right sat s are the last consecutive sat satisfying bytes of s.
lose_left sat s is s without the first consecutive sat satisfying bytes of s.
lose_right sat s is s without the last consecutive sat satisfying bytes of s.
span_left sat s is (keep_left sat s, lose_left sat s).
span_right sat s is (lose_right sat s, keep_right sat s).
Breaking with separators
cut ~sep s is either the pair Some (l,r) of the two (possibly empty) substrings of s that are delimited by the first match of the separator character sep or None if sep can't be matched in s. Matching starts from the left of s.
The invariant l ^ sep ^ r = s holds.
cut_right ~sep s is like cut_left but matching starts on the right of s.
cuts_left sep s is the list of all substrings of s that are delimited by matches of the non empty separator string sep. Empty substrings are omitted in the list if drop_empty is true (defaults to false).
Matching separators in s starts from the left of s (rev is false, default) or the end (rev is true). Once one is found, the separator is skipped and matching starts again, that is separator matches can't overlap. If there is no separator match in s, the list [s] is returned.
The following invariants hold:
concat ~sep (cuts ~drop_empty:false ~sep s) = scuts ~drop_empty:false ~sep s <> []
cuts_right sep s is like cuts_left but matching starts on the right of s.
Formatting
val pp : string Fmt.tpp ppf s prints s's bytes on ppf.
val pp_dump : string Fmt.tpp_dump ppf s prints s as a syntactically valid OCaml string on ppf.
Uniqueness
distinct ss is ss without duplicates, the list order is preserved.
unique ~exist n is n if exists n is false or r = strf "%s~%d" n d with d the smallest integer such that exists r if false. If no d in [1;1e9] satisfies the condition Invalid_argument is raised, limit defaults to 1e9.
Suggesting
edit_distance s0 s1 is the number of single character edits (insertion, deletion, substitution) that are needed to change s0 into s1.
suggest ~dist candidates s are the elements of candidates whose edit distance is the smallest to s and at most at a distance of dist of s (defaults to 2). If multiple results are returned the order of candidates is preserved.
(Un)escaping bytes
The following functions can only (un)escape a single byte. See also these functions to convert a string to printable US-ASCII characters.
byte_escaper char_len set_char is a byte escaper such that:
char_len cis the length of the unescaped bytecin the escaped form. If1is returned thencis assumed to be unchanged usebyte_replacerif that does not holdset_char b i csets an unescaped bytecto its escaped form at indexiinband returns the next writable index.set_charis called regardless ifcneeds to be escaped or not in the latter case you must writec(usebyte_replacerif that is not the case). No bounds check need to be performed onior the returned value.
For any b, c and i the invariant i + char_len c = set_char b i c must hold.
Here's a small example that escapes '"' by prefixing them by backslashes. double quotes from strings:
let escape_dquotes s =
let char_len = function '"' -> 2 | _ -> 1 in
let set_char b i = function
| '"' -> Bytes.set b i '\\'; Bytes.set b (i+1) '"'; i + 2
| c -> Bytes.set b i c; i + 1
in
String.byte_escaper char_len set_char sbyte_replacer char_len set_char is like byte_escaper but a byte can be substituted by another one by set_char.
val byte_unescaper :
(string -> int -> int) ->
(bytes -> int -> string -> int -> int) ->
string ->
(string, int) resultbyte_unescaper char_len_at set_char is a byte unescaper such that:
char_len_at s iis the length of an escaped byte at indexiofs. If1is returned then the byte is assumed to be unchanged by the unescape, usebyte_unreplaceif that does not hold.set_char b k s isets at indexkinbthe unescaped byte read at indexiinsand returns the next readable index ins.set_charis called regardless of wheter the byte atimust be unescaped or not in the latter case you must write s.ionly (usebyte_unreplacerif that is not the case). No bounds check need to be performed onk,ior the returned value.
For any b, s, k and i the invariant i + char_len_at s i = set_char b k s i must hold.
Both char_len_at and set_char may raise Illegal_escape i if the given index i has an illegal or truncated escape. The unescaper turns this exception into Error i if that happens.
val byte_unreplacer :
(string -> int -> int) ->
(bytes -> int -> string -> int -> int) ->
string ->
(string, int) resultbyte_unreplacer char_len_at set_char is like byte_unscaper except set_char can set a different byte whenever char_len_at returns 1.
US-ASCII strings
module Ascii : sig ... endUS-ASCII string support.
Version strings
The type for version strings. Major, minor, patch and additional info.
val to_version : string -> version optionto_version parses version strings of the form:
"[v|V]major.minor[.patchlevel][(+|~)additional-info]"into (major, minor, patch, (+|~)additional_info) tuples. If no patchlevel is found 0 is used.
val of_version : version -> stringof_version v is "major.minor.patchlevel[(+|~)additional-info]"
Sets and maps
module Set : sig ... endString sets.
module Map : sig ... endString maps.
Variable substitution
val subst_pct_vars :
?buf:Buffer.t ->
(string -> string option) ->
string ->
stringsubst_pct_vars ~buf vars s substitutes in s sub-strings of the form %%VAR%% by the value of vars "VAR" (if any).