Caml1999I037(4Stdlib__StringLabels!t;@@@A&stringQ@@@z@@@@0stringLabels.mliK  K  @@@@@@A@$make@#intA@@@{@$charB@@@| @@@}@@~@@@N 4 4N 4 T@@0A@@$init@@@@!f@'@@@#@@@@@A@@@@@@@@?T  @T '@@QB@@%emptyN@@@@L[M[@@^C@@&length@]@@@O@@@@@.%string_lengthAA @@@daBBeaBt@@vD@@#get@u@@@@i@@@e@@@@@@@0%string_safe_getBA@@@@dd@@E@@(of_bytes@%bytesC@@@@@@@@@jj@@F@@(to_bytes@@@@@@@@@@qq6@@G@@$blit#src@@@'src_pos@@@#dst:@@@'dst_pos@@@#len@@@$unitF@@@@@@@@@@@@@@xy@@H@@&concat#sep@@@@$listK@@@@@@@@@@@@@@@@I@@#cat@@@@@@@@@@@@@@@@@@.J@@%equal@5@@@@@@@$boolE@@@@@@@@67@@HK@@'compare@@@@@@@@=@@@@@@@@M33N3N@@_L@@+starts_with&prefix`@@@@f@@@4@@@@@@@@hiI@@zM@@)ends_with&suffix{@@@@@@@O@@@@@@@@@@N@@-contains_from@@@@@@@@@@@@n@@@@@@@@@@vvv@@O@@.rcontains_from@@@@@@@@@@@@@@@@@@@@@@ZZZ@@P@@(contains@@@@@@@@@@@@@@@@TTTy@@Q@@#sub@@@@#pos@@@#len@@@@@@@@@@@@@@@R@@-split_on_char#sep@@@@@@@ @@@@@@@@@@@7@@/S@@#map!f@@@@@@@@@@<@@@@@@@@@@@@>}}?}@@PT@@$mapi !f@A@@@@?@@@C@@@@@@@@c@@@g@@@@@@@@e//f/e@@wU@@)fold_left !f@#acc@@f@@@ @@@@$init@@@@@@@@@@@@@V@@*fold_right !f@@@@@#acc@@@@@@@@@$init@@@@@@@@@W@@'for_all !f@@@@@@@@@@@@@@@@@@@@@    @@X@@&exists !f@@@@@@@@@ @@@@ @@@ @@ @@ @!!!!F@@Y@@$trim@@@@@@@@@@!!!!@@Z@@'escaped@@@@@@@@@@"{"{"{"@@%[@@/uppercase_ascii@$@@@(@@@@@@&$$'$$@@8\@@/lowercase_ascii@7@@@;@@@@@@9 %a%a: %a%@@K]@@0capitalize_ascii@J@@@N@@@@@@L&&M&&=@@^^@@2uncapitalize_ascii@]@@@a@@@@@@_&&`&&@@q_@@$iter!f@Z@@@ @@@!@@"@~@@@#@@@$@@%@@&@!''!''@@`@@%iteri!f@@@@'@@@@(@@@)@@*@@+@@@@,@@@-@@.@@/@%(^(^%(^(@@a@@*index_from@@@@0@@@@1@@@@2@@@3@@4@@5@@6@-),),-),)Y@@b@@.index_from_opt@@@@7@@@@8@@@@9&optionL@@@:@@@;@@<@@=@@>@5*K*K5*K*@@c@@+rindex_from@@@@?@@@@@@@@@A@@@B@@C@@D@@E@ <+K+K <+K+y@@d@@/rindex_from_opt@@@@F@@@@G@@@@HE@@@I@@@J@@K@@L@@M@/C,r,r0C,r,@@Ae@@%index@@@@@N@,@@@O8@@@P@@Q@@R@HJ-x-xIJ-x-@@Zf@@)index_opt@Y@@@S@E@@@T|U@@@U@@@V@@W@@X@fM--gM--@@xg@@&rindex@w@@@Y@c@@@Zo@@@[@@\@@]@R.J.JR.J.l@@h@@*rindex_opt@@@@^@|@@@_@@@`@@@a@@b@@c@U..U..@@i@@&to_seq@@@@d&Stdlib#Seq!t@@@e@@@f@@g@\/^/^\/^/z@@j@@'to_seqi@@@@h#Seq!t@@@@j@@@@i@@k@@@l@@m@b//b/0 @@k@@&of_seq @>#Seq!t@@@n@@@o@@@p@@q@g0l0lg0l0@@ l@@/get_utf_8_uchar!@@@@r@@@@sa%Uchar*utf_decode@@@t@@u@@v@r1212r121d@@%m@@.is_valid_utf_8"@@@@w@@@x@@y@%v11&v11@@7n@@2get_utf_16be_uchar#@ @@@z@)@@@{%Uchar*utf_decode@@@|@@}@@~@@|2K2KA|2K2@@Ro@@1is_valid_utf_16be$@$@@@@@@@@@R22S22@@dp@@2get_utf_16le_uchar%@6@@@@V@@@%Uchar*utf_decode@@@@@@@@m3v3vn3v3@@q@@1is_valid_utf_16le&@Q@@@K@@@@@@4444%@@r@@-edit_distance'%limit@@@@@@@p@@@@u@@@@@@@@@@@@@4444@@s@@*spellcheck((max_dist$@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@8b8b88@@t@@)get_uint8)@@@@@@@@@@@@@@@@????;@@ u@@(get_int8*@ @@@@@@@@@@@@@@@????@@#v@@-get_uint16_ne+@"@@@@@@@@@@@@@@@*@9@9+@9@a@@@@@@@@@@@@@R5HHS5HH@@dC@@,get_int64_le8@c@@@@W@@@4@@@@@@@@k<I"I"l<I"IK@@}D@@*unsafe_get9@|@@@@p@@@l@@@@@@@2%string_unsafe_getBA%@@@@GJJGJJQ@@E@@+unsafe_blit:#src@@@'src_pos@@@#dst@@@'dst_pos@@@#len@@@@@@@@@@@@@@@@0caml_blit_stringE@_@@@@@@@HJRJRJJJ@'noallocJJJJJJ@@JJJ @@F@@@t\4Stdlib__StringLabels0osKoaw-Stdlib__Uchar056uf4[_+Stdlib__Seq0nwzG&amg.Stdlib__Either0Vy`u~c à&Stdlib0Lku]8_٠8CamlinternalFormatBasics0%FU(Q/Tu@@@Caml1999T037_ C4Stdlib__StringLabels*ocaml.text&_none_@@A  Strings. A string [s] of length [n] is an indexable and immutable sequence of [n] bytes. For historical reasons these bytes are referred to as characters. The semantics of string functions is defined in terms of indices and positions. These are depicted and described as follows. {v positions 0 1 2 3 4 n-1 n +---+---+---+---+ +-----+ indices | 0 | 1 | 2 | 3 | ... | n-1 | +---+---+---+---+ +-----+ v} {ul {- An {e index} [i] of [s] is an integer in the range \[[0];[n-1]\]. It represents the [i]th byte (character) of [s] which can be accessed using the constant time string indexing operator [s.[i]].} {- A {e position} [i] of [s] is an integer in the range \[[0];[n]\]. It represents either the point at the beginning of the string, or the point between two indices, or the point at the end of the string. The [i]th byte index is between position [i] and [i+1].}} Two integers [start] and [len] are said to define a {e valid substring} of [s] if [len >= 0] and [start], [start+len] are positions of [s]. {b Unicode text.} Strings being arbitrary sequences of bytes, they can hold any kind of textual encoding. However the recommended encoding for storing Unicode text in OCaml strings is UTF-8. This is the encoding used by Unicode escapes in string literals. For example the string ["\u{1F42B}"] is the UTF-8 encoding of the Unicode character U+1F42B. {b Past mutability.} Before OCaml 4.02, strings used to be modifiable in place like {!Bytes.t} mutable sequences of bytes. OCaml 4 had various compiler flags and configuration options to support the transition period from mutable to immutable strings. Those options are no longer available, and strings are now always immutable. The labeled version of this module can be used as described in the {!StdLabels} module. 0stringLabels.mliX%%G  @@@@@@3@@@@@@#intA;@@@A@@@@@:@A@$charB;@@A@@@@@>@A@&stringQ;@@ A@@@@@B@@@%bytesC;@@ A@@@@@F@@@%floatD;@@A@@@@@J@@@$boolE;@@%falsec@@T@$trued@@Z@@@A@@@@@[@A@$unitF;@@"()e@@e@@@A@@@@@f@A@ #exnG;@@@A@@@@@j@@@#effH;@@O@A@A@@@@@@s@@@,continuationI;@@Q@@P@B@A@nY@@@@@@@@@%arrayJ;@@R@A@A@@@@@@@@@ $listK;@@S@A"[]f@@@"::g@@@T@@@ @@A@Y@@@@@@@@&optionL;@@V@A$Noneh@@@$Somei@@@@@A@Y@@@@@@@@)nativeintM;@@A@@@@@@@@%int32N;@@A@@@@@@@@%int64O;@@A@@@@@@@@&lazy_tP;@@X@AJA@Y@@@@@@@@5extension_constructorR;@@A@@@@@@@@*floatarrayS;@@A@@@@@@@@&iarrayT;@@Y@A[A@Y@@@@@@@@*atomic_locU;@@Z@AdA@@@@@@@@@.Assert_failure`#@@@@@J@@@@@@@@[@@A=ocaml.warn_on_literal_pattern @ @0Division_by_zero]#@@@A  @+End_of_file\#$@@@A@'FailureY#,@'@@A!$$@0Invalid_argumentX#5@0@@A*$-#-@-Match_failureV#>@@=@9@;@@a@@A;5>4>@)Not_foundZ#O@@@AC=F<F@-Out_of_memoryW#W@@@AKENDN@.Stack_overflow^#_@@@ASMVLV@.Sys_blocked_io_#g@@@A[U^T^@)Sys_error[#o@j@@Ad^g]g@:Undefined_recursive_modulea#x@@w@s@u@@h@@Auoxnx@:Continuation_already_takenb#@@@A}wv@&Stdlib@Ax5 {1:strings Strings} I  I  @@@@@@A+!tAK  K  @@;@@@Ag@@@@@@@K  K  @)ocaml.doc7 The type for strings. L  L  2@@@@@@@@@@@@@Aг&stringK  @@ 3@+;@@@A3@@@@@@@@'$@@@A &@@(%Ґ$#@##@@@#@#@@ʰ32@$makeN 4 8N 4 <@б@г#intN 4 ?N 4 B@@ @@@3@[U@A@@б@г$charN 4 FN 4 J@@ @@@@@гɠ&stringN 4 NN 4 T@@ @@@@@@@@!@@@'@@$* @@@ N 4 4@q [make n c] is a string of length [n] with each index holding the character [c]. @raise Invalid_argument if [n < 0] or [n > ]{!Sys.max_string_length}. O U UR  @@@@@@@3A@@@.@@@@@@C$init1T 2T @б@г#int<T =T  @@ @@@3>==>>>>>@\q8@A@@б!fб@г$#intQT RT @@ @@@@@г,$char^T _T @@ @@@"@@@@@%@@г8&stringnT !oT '@@ @@@2@@0@@5wT  @@@<@@9? @@@}T  @ᐠ [init n ~f] is a string of length [n] with index [i] holding the character [f i] (called in increasing index order). @raise Invalid_argument if [n < 0] or [n > ]{!Sys.max_string_length}. @since 4.02 U((Y@@@@@@@B@@@@@@@@@X%empty[[ @гt&string[[@@ @@@3@o6@A@@@[ @ $ The empty string. @since 4.13 \_>@@@@@@@@C@@@(Ր@@@@@@!&lengthaBKaBQ@б@г&stringaBTaBZ@@ @@@3@:M8@A@@гŠ#intaB^aBa@@ @@@@@@@@@@.%string_lengthAA @@@aBBaBt@g ? [length s] is the length (number of bytes/characters) of [s]. buubu@@@@@@@)D@@@x%@@@@@@8#get(d)d@б@г&string3d4d@@ @@@354455555@Qf?@A@@б@г#intDdEd@@ @@@@@г$charQdRd@@ @@@@@@@@!@@@'@@$* @@0%string_safe_getBAb@@@@dded@ɐ [get s i] is the character at index [i] in [s]. This is the same as writing [s.[i]]. @raise Invalid_argument if [i] not an index of [s]. reshS@@@@@@@E@@@@@@@@@J(of_bytesjj@б@г[%bytesjj@@ @@@3@cx?@A@@гn&stringjj@@ @@@@@@@@@@@j @ c Return a new string that contains the same bytes as the given byte sequence. @since 4.13 ko@@@@@@@F@@@#А@@@@@@1(to_bytesqq$@б@г&stringq'q-@@ @@@3@J_8@A@@г%bytesq1q6@@ @@@@@@@@@@@q @\ c Return a new byte sequence that contains the same bytes as the given string. @since 4.13 r77v@@@@@@@G@@@l@@@@@@1$blitxx@б#srcг&string)y*y@@ @@@3+**+++++@La:@A@@б'src_posг#int<y=y@@ @@@@@б#dstг%bytesMyNy@@ @@@$@@б'dst_posг1#int^y_y@@ @@@5@@б#lenгB#intoypy@@ @@@F@@г)$unit|y}y@@ @@@S@@@@Vy @@3(@@Zy @@H=@@^y@@]R@@by@@ti@@fy@@@x@ 9 Same as {!Bytes.blit_string} which should be preferred. zz5@@@@@@@H@@,@ @@@@@@Ɛ k {1:concat Concatenating} {b Note.} The {!Stdlib.( ^ )} binary operator concatenates two strings. |77@@@@@@3@1@A&concat@б#sepг&string@@ @@@@@б@гg$list@г&string@@ @@@5@@@@@@: @@гѠ&string@@ @@@G@@@@@J@@?4@@M @@@@z [concat ~sep ss] concatenates the list of strings [ss], inserting the separator string [sep] between each. @raise Invalid_argument if the result is longer than {!Sys.max_string_length} bytes. #$@@@@@@@@б@г{!t 3A 3B@@ @@@3  @to8@A@@б@г!t3F3G@@ @@@@@г#int*3K+3N@@ @@@@@@@@!@@@'@@$* @@@833@ [compare s0 s1] sorts [s0] and [s1] in lexicographical order. [compare] behaves like {!Stdlib.compare} on strings but may be more efficient. EOOF@@@@@@@^L@@@Y@@@@@@C+starts_with\]@б&prefixг3&stringi1j7@@ @@@3kjjkkkkk@^s:@A@@б@гD&stringz;{A@@ @@@@@гE$boolEI@@ @@@@@@@@!@@2'@@$ @@@@ c [starts_with ][~prefix s] is [true] if and only if [s] starts with [prefix]. @since 4.13 JJ@@@@@@@M@@@ @@@@@@D)ends_with @б&suffixг&string@@ @@@3@_v:@A@@б@г&string @@ @@@@@г$bool@@ @@@@@@@@!@@2'@@$ @@@@X [ [ends_with ][~suffix s] is [true] if and only if [s] ends with [suffix]. @since 4.13 bt@@@@@@@N@@@h@@@@@@D-contains_from!vzv@б@г&string#v$v@@ @@@3%$$%%%%%@]t8@A@@б@г#int4v5v@@ @@@@@б@г$charCvDv@@ @@@ @@г$boolPvQv@@ @@@-@@@@@0@@@%@@3( @@@9@@6<@@@avv@Ő [contains_from s start c] is [true] if and only if [c] appears in [s] after position [start]. @raise Invalid_argument if [start] is not a valid position in [s]. noX@@@@@@@O@@!@@@@@@@U.rcontains_from"Z^Zl@б@гZ&stringZoZu@@ @@@3@n8@A@@б@гt#intZyZ|@@ @@@@@б@г~$charZZ@@ @@@ @@г{$boolZZ@@ @@@-@@@@@0@@@%@@3( @@@9@@6<@@@ZZ@2 [rcontains_from s stop c] is [true] if and only if [c] appears in [s] before position [stop+1]. @raise Invalid_argument if [stop < 0] or [stop+1] is not a valid position in [s]. ;R@@@@@@@P@@!@B@@@@@@U(contains#TXT`@б@гǠ&stringTcTi@@ @@@3@n8@A@@б@гܠ$charTmTq@@ @@@@@г٠$boolTuTy@@ @@@@@@@@!@@@'@@$* @@@)TT@ 4 [contains s c] is {!String.contains_from}[ s 0 c]. 6zz7z@@@@@@@OQ@@@J@@@@@@CXW # {1:extract Extracting substrings} TU@@@@@@3SRRSSSSS@Uj1@A#sub$`a@б@г5&stringkl@@ @@@@@б#posгO#int|}@@ @@@+@@б#lenг`#int@@ @@@<@@гd&string @@ @@@I@@@@L @@3(@@P @@@=@@T@@@@@ [sub s ~pos ~len] is a string of length [len], containing the substring of [s] that starts at position [pos] and has length [len]. @raise Invalid_argument if [pos] and [len] do not designate a valid substring of [s]. @@@@@@@R@@#@!ΐ@@@@@@s-split_on_char%@б#sepг$char@@ @@@3@:@A@@б@г&string"(@@ @@@@@гx$list37@гР&string , 2@@ @@@ (@@@@@@ - @@@"@@ 0%@@A6@@ 3 @@@ @~  [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: {ul {- The list is not empty.} {- Concatenating its elements using [sep] as 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 [sep] character.}} @since 4.05  '88 (CU@@@@@@@ @S@@.@ ;@@@@@@S I H? {1:transforming Transforming}  EWW FW{@@@@@@3 D C C D D D D D@e|1@A#map& Q} R}@б!fб@г .$char `} a}@@ @@@@@г ;$char m} n}@@ @@@+@@@@@.@@б@г I&string } }@@ @@@=@@г V&string } }@@ @@@J@@@@@M@@B$@@P } @@@ }}@ | [map f s] is the string resulting from applying [f] to all the characters of [s] in increasing order. @since 4.00   -@@@@@@@ T@@@ @@@@@@p$mapi' /3 /7@б!fб@г #int /= /@@@ @@@3        @<@A@@б@г $char /D /H@@ @@@@@г $char /L /P@@ @@@@@@@@!@@@'@@$* @@б@г ˠ&string /U /[@@ @@@3@@г ؠ&string /_ /e@@ @@@@@@@@@C@@V$@@F /: @@@ //@ g [mapi ~f s] is like {!map} but the index of the character is also passed to [f]. @since 4.02  *ff +@@@@@@@ CU@@@ >@@@@@@f)fold_left( A B@б!fб@А#acc@'B@3 N M M N N N N N@8@A T U@@б@г -$char _ `@@ @@@@@А#acc i j@@@ !@@ @@@$@@!@@б$initА#acc,' y z @@б@г N&string   @@ @@@"8@@А#accA<  @@@ F@@#A@@"I@@$D @@T+@@%H  @@@ @  [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]. @since 4.13   @@@@@@@ V@@@  @@@@@@h*fold_right)  @б!fб@г $char  @@ @@@(3        @<@A@@б@А#acc@1B@)   @@А#acc   @@@@@* @@@@@+!@@б@г Ġ&string  @@ @@@,*@@б$initА#acc*2  @@А#acc08  @@55@@-= @@@@@.A@@T+@@/D  @@@ @ [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]. @since 4.13  * + q @@@@@@@ CW@@@  >@@@@@@d'for_all* A   B  @б!fб@г $char P   Q  @@ @@@23 R Q Q R R R R R@<@A@@г $bool _   `  @@ @@@3@@@@@4@@б@г ;&string q   r  @@ @@@5!@@г <$bool ~     @@ @@@6.@@@@@71@@D$@@84    @@@   @ 񐠠 Z [for_all p s] checks if all characters in [s] satisfy the predicate [p]. @since 4.13     !!@@@@@@@ X@@@  @@@@@@T&exists+ !! !!!@б!fб@г $char !!' !!+@@ @@@93        @q<@A@@г $bool !!/ !!3@@ @@@:@@@@@;@@б@г &string !!8 !!>@@ @@@<!@@г $bool !!B !!F@@ @@@=.@@@@@>1@@D$@@?4 !!$ @@@ !!@ a g [exists p s] checks if at least one character of [s] satisfies the predicate [p]. @since 4.13  !G!G !!@@@@@@@ #Y@@@ q @@@@@@T$trim, !!! "!!@б@г &string ,!! -!!@@ @@@@3 . - - . . . . .@m8@A@@г &string ;!! <!!@@ @@@A@@@@@B@@@ F!! @ [trim s] is [s] without leading and trailing whitespace. Whitespace characters are: [' '], ['\x0C'] (form feed), ['\n'], ['\r'], and ['\t']. @since 4.00  S!! T"g"y@@@@@@@ lZ@@@  g@@@@@@1'escaped- j"{" k"{"@б@г ?&string u"{" v"{"@@ @@@C3 w v v w w w w w@J_8@A@@г N&string "{" "{"@@ @@@D@@@@@E@@@ "{"{ @ 󐠠  [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). @raise Invalid_argument if the result is longer than {!Sys.max_string_length} bytes.  "" $$@@@@@@@ [@@@  @@@@@@1/uppercase_ascii. $$ $$@б@г &string $$ $$@@ @@@F3        @J_8@A@@г &string $$ $$@@ @@@G@@@@@H@@@ $$ @ < [uppercase_ascii s] is [s] with all lowercase letters translated to uppercase, using the US-ASCII character set. @since 4.05  $$  %M%_@@@@@@@ \@@@ L @@@@@@1/lowercase_ascii/  %a%e  %a%t@б@г Ѡ&string  %a%w  %a%}@@ @@@I3        @J_8@A@@г ࠐ&string  %a%  %a%@@ @@@J@@@@@K@@@ ! %a%a @ [lowercase_ascii s] is [s] with all uppercase letters translated to lowercase, using the US-ASCII character set. @since 4.05  .%% /&&@@@@@@@ G]@@@  B@@@@@@10capitalize_ascii0 E&& F&&*@б@г &string P&&- Q&&3@@ @@@L3 R Q Q R R R R R@J_8@A@@г )&string _&&7 `&&=@@ @@@M@@@@@N@@@ j&& @ ΐ  [capitalize_ascii s] is [s] with the first character set to uppercase, using the US-ASCII character set. @since 4.05  w&>&> x&&@@@@@@@ ^@@@  @@@@@@12uncapitalize_ascii1 && &&@б@г c&string && &&@@ @@@O3        @J_8@A@@г r&string && &&@@ @@@P@@@@@Q@@@ && @  [uncapitalize_ascii s] is [s] with the first character set to lowercase, using the US-ASCII character set. @since 4.05  && 'b't@@@@@@@ _@@@ ' Ԑ@@@@@@1  ᐠ; {1:traversing Traversing}  'v'v 'v'@@@@@@3        @CX1@A$iter2 !'' !''@б!fб@г Ǡ$char !'' !''@@ @@@R@@г $unit!''!''@@ @@@S+@@@@@T.@@б@г ⠐&string!''!''@@ @@@U=@@г Ҡ$unit%!''&!''@@ @@@VJ@@@@@WM@@B$@@XP1!'' @@@4!''@ [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]; ()]. A"''B#((\@@@@@@@Z`@@@ U@@@@@@p%iteri3X%(^(bY%(^(g@б!fб@г:#intg%(^(mh%(^(p@@ @@@Y3ihhiiiii@<@A@@б@гF$charx%(^(ty%(^(x@@ @@@Z@@г2$unit%(^(|%(^(@@ @@@[@@@@@\!@@@'@@]$* @@б@гd&string%(^(%(^(@@ @@@^3@@гT$unit%(^(%(^(@@ @@@_@@@@@@`C@@V$@@aF%(^(j @@@%(^(^@  q [iteri] is like {!iter}, but the function is also given the corresponding character index. @since 4.00 &(()() @@@@@@@a@@@ *א@@@@@@f䐠9 {1:searching Searching} +) ) +) )*@@@@@@3@x1@A*index_from4-),)0-),):@б@г &string-),)=-),)C@@ @@@b@@б@гڠ#int-),)G-),)J@@ @@@c)@@б@г䠐$char-),)N-),)R@@ @@@d8@@г#int#-),)V$-),)Y@@ @@@eE@@@@@fH@@@%@@gK( @@@7@@hN:@@@4-),),@ [index_from s i c] is the index of the first occurrence of [c] in [s] after position [i]. @raise Not_found if [c] does not occur in [s] after position [i]. @raise Invalid_argument if [i] is not a valid position in [s]. A.)Z)ZB2**H@@@@@@@Zb@@!@ U@@@@@@m.index_from_opt5X5*K*OY5*K*]@б@г-&stringc5*K*`d5*K*f@@ @@@i3eddeeeee@8@A@@б@гG#intt5*K*ju5*K*m@@ @@@j@@б@гQ$char5*K*q5*K*u@@ @@@k @@г&option5*K*}5*K*@гm#int5*K*y5*K*|@@ @@@l7@@@@@@n< @@@"@@o?%@@@4@@pB7@@@H@@qEK@@@5*K*K @ [index_from_opt s i c] is the index of the first occurrence of [c] in [s] after position [i] (if any). @raise Invalid_argument if [i] is not a valid position in [s]. @since 4.05 6**:+7+I@@@@@@@c@@0@$ѐ@@@@@@d+rindex_from6<+K+O<+K+Z@б@г&string<+K+]<+K+c@@ @@@r3@}8@A@@б@гà#int<+K+g<+K+j@@ @@@s@@б@г͠$char<+K+n<+K+r@@ @@@t @@гߠ#int <+K+v <+K+y@@ @@@u-@@@@@v0@@@%@@w3( @@@9@@x6<@@@<+K+K@ [rindex_from s i c] is the index of the last occurrence of [c] in [s] before position [i+1]. @raise Not_found if [c] does not occur in [s] before position [i+1]. @raise Invalid_argument if [i+1] is not a valid position in [s]. *=+z+z+A,),p@@@@@@@Cd@@!@>@@@@@@U/rindex_from_opt7AC,r,vBC,r,@б@г&stringLC,r,MC,r,@@ @@@y3NMMNNNNN@n8@A@@б@г0#int]C,r,^C,r,@@ @@@z@@б@г:$charlC,r,mC,r,@@ @@@{ @@гؠ&optionyC,r,zC,r,@гV#intC,r,C,r,@@ @@@|7@@@@@@~< @@@"@@?%@@@4@@B7@@@H@@EK@@@C,r,r @ [rindex_from_opt s i c] is the index of the last occurrence of [c] in [s] before position [i+1] (if any). @raise Invalid_argument if [i+1] is not a valid position in [s]. @since 4.05 D,,H-d-v@@@@@@@e@@0@ @@@@@@d%index8J-x-|J-x-@б@г&stringJ-x-J-x-@@ @@@3@}8@A@@б@г$charJ-x-J-x-@@ @@@@@г#intJ-x-J-x-@@ @@@@@@@@!@@@'@@$* @@@J-x-x@X . [index s c] is {!String.index_from}[ s 0 c]. K--K--@@@@@@@f@@@h@@@@@@C)index_opt9M--M--@б@г&string#M--$M--@@ @@@3%$$%%%%%@\q8@A@@б@г$char4M--5M--@@ @@@@@г&optionAM--BM--@г#intKM--LM--@@ @@@(@@@@@@- @@@"@@0%@@@6@@39@@@^M--@ G [index_opt s c] is {!String.index_from_opt}[ s 0 c]. @since 4.05 kN--lP.6.H@@@@@@@g@@-@@@@@@@R&rindex:R.J.NR.J.T@б@гW&stringR.J.WR.J.]@@ @@@3@k8@A@@б@гl$charR.J.aR.J.e@@ @@@@@г~#intR.J.iR.J.l@@ @@@@@@@@!@@@'@@$* @@@R.J.J@ = [rindex s c] is {!String.rindex_from}[ s (length s - 1) c]. S.m.mS.m.@@@@@@@h@@@-ڐ@@@@@@C*rindex_opt;U..U..@б@г&stringU..U..@@ @@@3@\q8@A@@б@гǠ$charU..U..@@ @@@@@гe&optionU..U..@г㠐#intU..U..@@ @@@(@@@@@@- @@@"@@0%@@@6@@39@@@#U..@ V [rindex_opt s c] is {!String.rindex_from_opt}[ s (length s - 1) c]. @since 4.05 0V..1X/(/:@@@@@@@Ii@@-@D@@@@@@RRQ; {1 Strings and Sequences} NZ/</<OZ/</\@@@@@@3MLLMMMMM@dy1@A&to_seq{Z\/^/b[\/^/h@б@гԠ!te\/^/kf\/^/l@@ @@@@@г#Seq!tv\/^/uw\/^/x@ z\/^/y{\/^/z@@гS$char\/^/p\/^/t@@ @@@ :@@@ @@@ ? @@@+@@ B.@@@\/^/^@ d [to_seq s] is a sequence made of the string's characters in increasing order. @since 4.07 ]/{/{`//@@@@@@@j@@+@ @@@@@@a'to_seqi|b//b//@б@г3!tb//b//@@ @@@ 3@zu8@A@@г\#Seq!tb/0b/0 @ b/0 b/0 @@В@г#intb//b//@@ @@@ &@@@гǠ$charb/0b/0@@ @@@ 5@@@@@ @@ < @@@: @@@ A b//0@@@H@@ EK3@@@b//6@u Y [to_seqi s] is like {!to_seq} but also tuples the corresponding index. @since 4.07 c0 0 e0X0j@@@@@@@7k@@F@2@@@@@@d&of_seq}5g0l0p6g0l0v@б@г#Seq!tDg0l0~Eg0l0@ Hg0l0Ig0l0@@г!$charSg0l0yTg0l0}@@ @@@ 3UTTUUUUU@K@A@@@" @@@  @@г֠!tgg0l0hg0l0@@ @@@ @@@@@ @@@rg0l0l @֐ L [of_seq s] is a string made of the sequence's characters. @since 4.07 h00j00@@@@@@@l@@@@@@@@@6 7 {1:utf UTF decoding and validations} @since 4.14 l00n11@@@@@@3@Hp1@A1 {2:utf_8 UTF-8} p11p110@@@@@@/get_utf_8_ucharr1216r121E@б@г4!tr121Hr121I@@ @@@ +@@б@г#intr121Mr121P@@ @@@ :@@гj%Uchar*utf_decoder121Tr121Y@ r121Zr121d@@@@@@ rP @@@@@ sS @@@.@@ tV1 @@@r1212@\ K [get_utf_8_uchar b i] decodes an UTF-8 character at index [i] in [b]. s1e1et11@@@@@@@m@@@l@@@@@@u.is_valid_utf_8v11v11@б@г!t'v11(v11@@ @@@ u3)(()))))@x8@A@@г$bool6v117v11@@ @@@ v@@@@@ w@@@Av11 @ P [is_valid_utf_8 b] is [true] if and only if [b] contains valid UTF-8 data. Nw11Ox22+@@@@@@@gn@@@b@@@@@@1po7 {2:utf_16be UTF-16BE} lz2-2-mz2-2I@@@@@@3kjjkkkkk@CX1@A2get_utf_16be_ucharx|2K2Oy|2K2a@б@г!t|2K2d|2K2e@@ @@@ x@@б@гe#int|2K2i|2K2l@@ @@@ y)@@г(%Uchar*utf_decode|2K2p|2K2u@ |2K2v|2K2@@@@@@ z? @@@@@ {B @@@.@@ |E1 @@@|2K2K@ Q [get_utf_16be_uchar b i] decodes an UTF-16BE character at index [i] in [b]. }22~22@@@@@@@o@@@*א@@@@@@d1is_valid_utf_16be2222@б@гT!t2222@@ @@@ }3@}x8@A@@г$bool2222@@ @@@ ~@@@@@ @@@22 @c V [is_valid_utf_16be b] is [true] if and only if [b] contains valid UTF-16BE data.  22 3A3V@@@@@@@%p@@@s @@@@@@1.-7 {2:utf_16le UTF-16LE} *3X3X+3X3t@@@@@@3)(()))))@CX1@A2get_utf_16le_uchar63v3z73v3@б@г!tA3v3B3v3@@ @@@ @@б@г##intP3v3Q3v3@@ @@@ )@@г%Uchar*utf_decodea3v3b3v3@ e3v3f3v3@@@@@@ ? @@@@@ B @@@.@@ E1 @@@t3v3v@ؐ Q [get_utf_16le_uchar b i] decodes an UTF-16LE character at index [i] in [b]. 3334@@@@@@@q@@@@@@@@@d1is_valid_utf_16le4444@б@г!t4444@@ @@@ 3@}x8@A@@гp$bool44!44%@@ @@@ @@@@@ @@@44 @! V [is_valid_utf_16le b] is [true] if and only if [b] contains valid UTF-16LE data. 4&4&4l4@@@@@@@r@@@1ސ@@@@@@1될 ! {1:spellchecking Spellchecking} 4444@@@@@@3@CX1@A-edit_distance4444@б%limitгԠ#int4444@@ @@@ @@б@г!t4444@@ @@@ +@@б@г!t44 44@@ @@@ :@@г#int,44-44@@ @@@ G@@@@@ J@@@%@@ M( @@B;@@@  @@ U@44@@ @C44@  [edit_distance s0 s1] is the number of single character edits (understood as insertion, deletion, substitution, transposition) that are needed to change [s0] into [s1]. If [limit] is provided the function returns with [limit] as soon as it was determined that [s0] and [s1] have distance of at least [limit]. This is faster if you have a fixed limit, for example for spellchecking. The function assumes the strings are UTF-8 encoded and uses {!Uchar.t} for the notion of character. Decoding errors are replaced by {!Uchar.rep}. Normalizing the strings to {{:https://unicode.org/glossary/#normalization_form_c}NFC} gives better results. {b Note.} This implements the simpler Optimal String Alignement (OSA) distance, not the Damerau-Levenshtein distance. With this function ["ca"] and ["abc"] have a distance of 3 not 2. @since 5.4 P44Q8^8`@@@@@@@is@@'@d@@@@@@u*spellcheckg8b8fh8b8p@б(max_distб@г@&stringv8s8w8s8@@ @@@ 3xwwxxxxx@<@A@@гX#int8s88s8@@ @@@ @@@@@ @@б@б@б@гe&string8s88s8@@ @@@ %@@гU$unit8s88s8@@ @@@ 2@@@@@ 5@@гe$unit8s88s8@@ @@@ B@@@@@ E8s8 @@б@г&string8s88s8@@ @@@ U@@гT$list8888@г&string8888@@ @@@ l@@@@@@ q @@@"@@ t%@@@4@@ w8s8@@n@@@  @@ 8s8u#@@ @8b8b&@b  [spellcheck iter_dict s] are the strings enumerated by the iterator [iter_dict] whose {{!edit_distance}edit distance} to [s] is the smallest and at most [max_dist s]. If multiple corrections are returned their order is as found in [iter_dict]. The default [max_dist s] is: {ul {- [0] if [s] has 0 to 2 Unicode characters.} {- [1] if [s] has 3 to 4 Unicode characters.} {- [2] otherwise.}} If your dictionary is a list [l], a suitable [iter_dict] is given by [(fun yield -> List.iter yield l)]. All strings are assumed to be UTF-8 encoded, decoding errors are replaced by {!Uchar.rep} characters. @since 5.4  88 ;T;e@@@@@@@$t@@6@r@@@@@@-, ! {1 Binary decoding of integers} );g;g*;g;@@@@@@3(''(((((@1@A@?  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_uint8F??G??$@б@г&stringQ??'R??-@@ @@@ +@@б@г3#int`??1a??4@@ @@@ :@@г@#intm??8n??;@@ @@@ G@@@@@ J@@@%@@ M( @@@{??@ߐ g [get_uint8 b i] is [b]'s unsigned 8-bit integer starting at character index [i]. @since 4.13 ?<?<??@@@@@@@u@@@@@@@@@l(get_int8????@б@гt&string????@@ @@@ 3@o8@A@@б@г#int????@@ @@@ @@г#int????@@ @@@ @@@@@ !@@@'@@ $* @@@??@: d [get_int8 b i] is [b]'s signed 8-bit integer starting at character index [i]. @since 4.13 ??@5@7@@@@@@@v@@@J@@@@@@C-get_uint16_ne@9@=@9@J@б@гϠ&string@9@M@9@S@@ @@@ 3@\q8@A@@б@г預#int@9@W@9@Z@@ @@@ @@г#int#@9@^$@9@a@@ @@@ @@@@@ !@@@'@@ $* @@@1@9@9@ z [get_uint16_ne b i] is [b]'s native-endian unsigned 16-bit integer starting at character index [i]. @since 4.13 >@b@b?@@@@@@@@@Ww@@@R@@@@@@C-get_uint16_beU@@V@@@б@г*&string`@@a@@@@ @@@ 3baabbbbb@\q8@A@@б@гD#intq@Ar@A@@ @@@ @@гQ#int~@A@A @@ @@@ @@@@@ !@@@'@@ $* @@@@@@𐠠 w [get_uint16_be b i] is [b]'s big-endian unsigned 16-bit integer starting at character index [i]. @since 4.13 A A AA@@@@@@@x@@@@@@@@@C-get_uint16_leAAAA@б@г&stringAAAA@@ @@@ 3@\q8@A@@б@г#intAAAA@@ @@@ @@г#intAAAA@@ @@@ @@@@@ !@@@'@@ $* @@@AA@K z [get_uint16_le b i] is [b]'s little-endian unsigned 16-bit integer starting at character index [i]. @since 4.13 AAB0B2@@@@@@@ y@@@[@@@@@@C,get_int16_ne B4B8 B4BD@б@гࠐ&stringB4BGB4BM@@ @@@ 3@\q8@A@@б@г#int'B4BQ(B4BT@@ @@@ @@г#int4B4BX5B4B[@@ @@@ @@@@@ !@@@'@@ $* @@@BB4B4@ w [get_int16_ne b i] is [b]'s native-endian signed 16-bit integer starting at character index [i]. @since 4.13 OB\B\PBB@@@@@@@hz@@@c@@@@@@C,get_int16_befBBgBB@б@г;&stringqBBrBB@@ @@@ 3srrsssss@\q8@A@@б@гU#intBBBB@@ @@@ @@гb#intBBBC@@ @@@ @@@@@ !@@@'@@ $* @@@BB@ t [get_int16_be b i] is [b]'s big-endian signed 16-bit integer starting at character index [i]. @since 4.13 CCCyC{@@@@@@@{@@@@@@@@@C,get_int16_leC}CC}C@б@г&stringC}CC}C@@ @@@ 3@\q8@A@@б@г#intC}CC}C@@ @@@ @@г#intC}CC}C@@ @@@ @@@@@ !@@@'@@ $* @@@C}C}@\ w [get_int16_le b i] is [b]'s little-endian signed 16-bit integer starting at character index [i]. @since 4.13 CC DD!@@@@@@@|@@@l@@@@@@C,get_int32_ne D#D' D#D3@б@г&string' D#D6( D#D<@@ @@@ 3)(()))))@\q8@A@@б@г #int8 D#D@9 D#DC@@ @@@ @@г%int32E D#DGF D#DL@@ @@@ @@@@@ !@@@'@@ $* @@@S D#D#@ p [get_int32_ne b i] is [b]'s native-endian 32-bit integer starting at character index [i]. @since 4.13 ` DMDMaDD@@@@@@@y}@@@t@@@@@@C$hashwDDxDD@б@г!tDDDD@@ @@@ 3@\q8@A@@гd#intDDDD@@ @@@ @@@@@ @@@DD @ An 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}. @since 5.0 DDEE@@@@@@@~@@@@@@@@@1+seeded_hashEEEE@б@г#intEEEE@@ @@@ 3@J_8@A@@б@гK!tEEEE@@ @@@ @@г#intEEEE@@ @@@ @@@@@ !@@@'@@ $* @@@EE@[ A 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}. @since 5.0 EEFF@@@@@@@@@@k@@@@@@C,get_int32_be FF FF@б@г&string& FF' FF@@ @@@ 3(''(((((@\q8@A@@б@г #int7 FF8 FF@@ @@@ @@г%int32D FFE FF@@ @@@ @@@@@ !@@@'@@ $* @@@R FF@ m [get_int32_be b i] is [b]'s big-endian 32-bit integer starting at character index [i]. @since 4.13 _!FF`%G>G@@@@@@@@x@@@@s@@@@@@C,get_int32_lev'GBGFw'GBGR@б@гK&string'GBGU'GBG[@@ @@@ 3@\q8@A@@б@гe#int'GBG_'GBGb@@ @@@ @@г㠐%int32'GBGf'GBGk@@ @@@ @@@@@ !@@@'@@ $* @@@'GBGB@ p [get_int32_le b i] is [b]'s little-endian 32-bit integer starting at character index [i]. @since 4.13 (GlGl,GG@@@@@@@A@@@!ΐ@@@@@@C,get_int64_ne.GG.GG@б@г&string.GG.GG@@ @@@ 3@\q8@A@@б@г#int.GH.GH@@ @@@ @@г:%int64.GH.GH @@ @@@ @@@@@ !@@@'@@ $* @@@.GG@l p [get_int64_ne b i] is [b]'s native-endian 64-bit integer starting at character index [i]. @since 4.13 /H H 3HH@@@@@@@.B@@@|)@@@@@@C,get_int64_be,5HH-5HH@б@г&string75HH85HH@@ @@@ 398899999@\q8@A@@б@г#intH5HHI5HH@@ @@@ @@г%int64U5HHV5HH@@ @@@ @@@@@ !@@@'@@ $* @@@c5HH@ǐ m [get_int64_be b i] is [b]'s big-endian 64-bit integer starting at character index [i]. @since 4.13 p6HHq:II @@@@@@@C@@@@@@@@@C,get_int64_le<I"I&<I"I2@б@г\&string<I"I5<I"I;@@ @@@ 3@\q8@A@@б@гv#int<I"I?<I"IB@@ @@@ @@г%int64<I"IF<I"IK@@ @@@ @@@@@ !@@@'@@ $* @@@<I"I"@" p [get_int64_le b i] is [b]'s little-endian 64-bit integer starting at character index [i]. @since 4.13 =ILILAII@@@@@@@D@@@2ߐ@@@@@@C쐠"/*CIICII@@@@@@3@Uj1@A*unsafe_getGJJGJJ"@б@гʠ&stringGJJ%GJJ+@@ @@@ @@б@г⠐#intGJJ/GJJ2@@ @@@ )@@гꠐ$charGJJ6GJJ:@@ @@@ 6@@@@@ 9@@@%@@ <( @@2%string_unsafe_getBA-@@@@/GJJ0GJJQ@@HE@@@@I+unsafe_blit<HJRJ[=HJRJf@б#srcг&stringIIJiJoJIJiJu@@ @@@ 3KJJKKKKK@d_(@A@@б'src_posг/#int\IJiJ]IJiJ@@ @@@ @@б#dstг3%bytesmIJiJnIJiJ@@ @@@ $@@б'dst_posгQ#int~IJiJIJiJ@@ @@@ 5@@б#lenгb#intIJiJIJiJ@@ @@@ F@@гI$unitJJJJJJ@@ @@@ S@@@@ VIJiJ @@3(@@ ZIJiJ @@H=@@ ^IJiJ@@]R@@ bIJiJy@@ti@@ fIJiJk@@0caml_blit_stringE@@@@@@@@HJRJRJJJ@'noallocJJJJJJ@@JJJ @@F@@@  @ @@HBA@@^@>)@ @@[4@@O@@z@G@@[@;@@t)@ @N@.@d@D@f@F@z@Z @@~@^7@@@b@/@c@0@m@M@  @ h /@  @  n@ N @  @ v @  @ y 9@  @  @ _ 8@ @~@K@A@@m@M@@b@B @@W@7@@^@>@@S@3@@n7@)@@3^]]^^^^^@+@A@ H************************************************************************gAWWhAWc@ H mBddnBd@ H OCaml sCtC@ H yDzDJ@ H Xavier Leroy, projet Cristal, INRIA Rocquencourt EKKEK@ H FF@ H Copyright 1996 Institut National de Recherche en Informatique et GG1@ H en Automatique. H22H2~@ H II@ H All rights reserved. This file is distributed under the terms of JJ@ H the GNU Lesser General Public License version 2.1, with the KKe@ H special exception on linking described in the file LICENSE. LffLf@ H MM@ H************************************************************************NNL@ NOTE: If this file is stringLabels.mli, run tools/sync_stdlib_docs after editing it to generate string.mli. If this file is string.mli, do not edit it directly -- edit stringLabels.mli instead. PNNV #@ * Strings. A string [s] of length [n] is an indexable and immutable sequence of [n] bytes. For historical reasons these bytes are referred to as characters. The semantics of string functions is defined in terms of indices and positions. These are depicted and described as follows. {v positions 0 1 2 3 4 n-1 n +---+---+---+---+ +-----+ indices | 0 | 1 | 2 | 3 | ... | n-1 | +---+---+---+---+ +-----+ v} {ul {- An {e index} [i] of [s] is an integer in the range \[[0];[n-1]\]. It represents the [i]th byte (character) of [s] which can be accessed using the constant time string indexing operator [s.[i]].} {- A {e position} [i] of [s] is an integer in the range \[[0];[n]\]. It represents either the point at the beginning of the string, or the point between two indices, or the point at the end of the string. The [i]th byte index is between position [i] and [i+1].}} Two integers [start] and [len] are said to define a {e valid substring} of [s] if [len >= 0] and [start], [start+len] are positions of [s]. {b Unicode text.} Strings being arbitrary sequences of bytes, they can hold any kind of textual encoding. However the recommended encoding for storing Unicode text in OCaml strings is UTF-8. This is the encoding used by Unicode escapes in string literals. For example the string ["\u{1F42B}"] is the UTF-8 encoding of the Unicode character U+1F42B. {b Past mutability.} Before OCaml 4.02, strings used to be modifiable in place like {!Bytes.t} mutable sequences of bytes. OCaml 4 had various compiler flags and configuration options to support the transition period from mutable to immutable strings. Those options are no longer available, and strings are now always immutable. The labeled version of this module can be used as described in the {!StdLabels} module. 6* {1:strings Strings} >8* The type for strings.  * [make n c] is a string of length [n] with each index holding the character [c]. @raise Invalid_argument if [n < 0] or [n > ]{!Sys.max_string_length}.  * [init n ~f] is a string of length [n] with index [i] holding the character [f i] (called in increasing index order). @raise Invalid_argument if [n < 0] or [n > ]{!Sys.max_string_length}. @since 4.02 C %* The empty string. @since 4.13  @* [length s] is the length (number of bytes/characters) of [s]. à * [get s i] is the character at index [i] in [s]. This is the same as writing [s.[i]]. @raise Invalid_argument if [i] not an index of [s]. d d* Return a new string that contains the same bytes as the given byte sequence. @since 4.13  d* Return a new byte sequence that contains the same bytes as the given string. @since 4.13 נ :* Same as {!Bytes.blit_string} which should be preferred. : l* {1:concat Concatenating} {b Note.} The {!Stdlib.( ^ )} binary operator concatenates two strings.  * [concat ~sep ss] concatenates the list of strings [ss], inserting the separator string [sep] between each. @raise Invalid_argument if the result is longer than {!Sys.max_string_length} bytes.   * [cat s1 s2] concatenates s1 and s2 ([s1 ^ s2]). @raise Invalid_argument if the result is longer than {!Sys.max_string_length} bytes. @since 4.13 j ,* {1:predicates Predicates and comparisons} O e* [equal s0 s1] is [true] if and only if [s0] and [s1] are character-wise equal. @since 4.05  * [compare s0 s1] sorts [s0] and [s1] in lexicographical order. [compare] behaves like {!Stdlib.compare} on strings but may be more efficient.  ( comment thwarts tools/sync_stdlib_docs /@ d* [starts_with ][~prefix s] is [true] if and only if [s] starts with [prefix]. @since 4.13 W ( comment thwarts tools/sync_stdlib_docs @ \* [ends_with ][~suffix s] is [true] if and only if [s] ends with [suffix]. @since 4.13  * [contains_from s start c] is [true] if and only if [c] appears in [s] after position [start]. @raise Invalid_argument if [start] is not a valid position in [s].  * [rcontains_from s stop c] is [true] if and only if [c] appears in [s] before position [stop+1]. @raise Invalid_argument if [stop < 0] or [stop+1] is not a valid position in [s]. . 5* [contains s c] is {!String.contains_from}[ s 0 c]. ֠ $* {1:extract 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]. @raise Invalid_argument if [pos] and [len] do not designate a valid substring of [s]. X * [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: {ul {- The list is not empty.} {- Concatenating its elements using [sep] as 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 [sep] character.}} @since 4.05  * {1:transforming Transforming} Ӡ }* [map f s] is the string resulting from applying [f] to all the characters of [s] in increasing order. @since 4.00 s h* [mapi ~f s] is like {!map} but the index of the character is also passed to [f]. @since 4.02  * [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]. @since 4.13 w * [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]. @since 4.13  [* [for_all p s] checks if all characters in [s] satisfy the predicate [p]. @since 4.13  h* [exists p s] checks if at least one character of [s] satisfies the predicate [p]. @since 4.13  * [trim s] is [s] without leading and trailing whitespace. Whitespace characters are: [' '], ['\x0C'] (form feed), ['\n'], ['\r'], and ['\t']. @since 4.00 ڠ  * [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). @raise Invalid_argument if the result is longer than {!Sys.max_string_length} bytes.  * [uppercase_ascii s] is [s] with all lowercase letters translated to uppercase, using the US-ASCII character set. @since 4.05 N * [lowercase_ascii s] is [s] with all uppercase letters translated to lowercase, using the US-ASCII character set. @since 4.05  * [capitalize_ascii s] is [s] with the first character set to uppercase, using the US-ASCII character set. @since 4.05   * [uncapitalize_ascii s] is [s] with the first character set to lowercase, using the US-ASCII character set. @since 4.05 |<* {1:traversing Traversing} a * [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]; ()].  r* [iteri] is like {!iter}, but the function is also given the corresponding character index. @since 4.00 :* {1:searching Searching} g * [index_from s i c] is the index of the first occurrence of [c] in [s] after position [i]. @raise Not_found if [c] does not occur in [s] after position [i]. @raise Invalid_argument if [i] is not a valid position in [s].  * [index_from_opt s i c] is the index of the first occurrence of [c] in [s] after position [i] (if any). @raise Invalid_argument if [i] is not a valid position in [s]. @since 4.05  * [rindex_from s i c] is the index of the last occurrence of [c] in [s] before position [i+1]. @raise Not_found if [c] does not occur in [s] before position [i+1]. @raise Invalid_argument if [i+1] is not a valid position in [s]. ' * [rindex_from_opt s i c] is the index of the last occurrence of [c] in [s] before position [i+1] (if any). @raise Invalid_argument if [i+1] is not a valid position in [s]. @since 4.05  /* [index s c] is {!String.index_from}[ s 0 c]. V H* [index_opt s c] is {!String.index_from_opt}[ s 0 c]. @since 4.05   >* [rindex s c] is {!String.rindex_from}[ s (length s - 1) c].  W* [rindex_opt s c] is {!String.rindex_from_opt}[ s (length s - 1) c]. @since 4.05  0<* {1 Strings and Sequences}   e* [to_seq s] is a sequence made of the string's characters in increasing order. @since 4.07  Ġ Z* [to_seqi s] is like {!to_seq} but also tuples the corresponding index. @since 4.07  K M* [of_seq s] is a string made of the sequence's characters. @since 4.07  8* {1:utf UTF decoding and validations} @since 4.14  Ҡ2* {2:utf_8 UTF-8}    L* [get_utf_8_uchar b i] decodes an UTF-8 character at index [i] in [b].  p Q* [is_valid_utf_8 b] is [true] if and only if [b] contains valid UTF-8 data.  *8* {2:utf_16be UTF-16BE}   R* [get_utf_16be_uchar b i] decodes an UTF-16BE character at index [i] in [b].  W* [is_valid_utf_16be b] is [true] if and only if [b] contains valid UTF-16BE data.  u8* {2:utf_16le UTF-16LE}  Z R* [get_utf_16le_uchar b i] decodes an UTF-16LE character at index [i] in [b].   W* [is_valid_utf_16le b] is [true] if and only if [b] contains valid UTF-16LE data.  "* {1:spellchecking Spellchecking}  * [edit_distance s0 s1] is the number of single character edits (understood as insertion, deletion, substitution, transposition) that are needed to change [s0] into [s1]. If [limit] is provided the function returns with [limit] as soon as it was determined that [s0] and [s1] have distance of at least [limit]. This is faster if you have a fixed limit, for example for spellchecking. The function assumes the strings are UTF-8 encoded and uses {!Uchar.t} for the notion of character. Decoding errors are replaced by {!Uchar.rep}. Normalizing the strings to {{:https://unicode.org/glossary/#normalization_form_c}NFC} gives better results. {b Note.} This implements the simpler Optimal String Alignement (OSA) distance, not the Damerau-Levenshtein distance. With this function ["ca"] and ["abc"] have a distance of 3 not 2. @since 5.4  @ * [spellcheck iter_dict s] are the strings enumerated by the iterator [iter_dict] whose {{!edit_distance}edit distance} to [s] is the smallest and at most [max_dist s]. If multiple corrections are returned their order is as found in [iter_dict]. The default [max_dist s] is: {ul {- [0] if [s] has 0 to 2 Unicode characters.} {- [1] if [s] has 3 to 4 Unicode characters.} {- [2] otherwise.}} If your dictionary is a list [l], a suitable [iter_dict] is given by [(fun yield -> List.iter yield l)]. All strings are assumed to be UTF-8 encoded, decoding errors are replaced by {!Uchar.rep} characters. @since 5.4  "* {1 Binary decoding of integers} m * 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. ] h* [get_uint8 b i] is [b]'s unsigned 8-bit integer starting at character index [i]. @since 4.13  e* [get_int8 b i] is [b]'s signed 8-bit integer starting at character index [i]. @since 4.13  {* [get_uint16_ne b i] is [b]'s native-endian unsigned 16-bit integer starting at character index [i]. @since 4.13 d x* [get_uint16_be b i] is [b]'s big-endian unsigned 16-bit integer starting at character index [i]. @since 4.13  {* [get_uint16_le b i] is [b]'s little-endian unsigned 16-bit integer starting at character index [i]. @since 4.13  x* [get_int16_ne b i] is [b]'s native-endian signed 16-bit integer starting at character index [i]. @since 4.13 \ u* [get_int16_be b i] is [b]'s big-endian signed 16-bit integer starting at character index [i]. @since 4.13  x* [get_int16_le b i] is [b]'s little-endian signed 16-bit integer starting at character index [i]. @since 4.13  q* [get_int32_ne b i] is [b]'s native-endian 32-bit integer starting at character index [i]. @since 4.13 T * An 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}. @since 5.0  * A 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}. @since 5.0  n* [get_int32_be b i] is [b]'s big-endian 32-bit integer starting at character index [i]. @since 4.13 ^ q* [get_int32_le b i] is [b]'s little-endian 32-bit integer starting at character index [i]. @since 4.13  q* [get_int64_ne b i] is [b]'s native-endian 64-bit integer starting at character index [i]. @since 4.13  n* [get_int64_be b i] is [b]'s big-endian 64-bit integer starting at character index [i]. @since 4.13 V q* [get_int64_le b i] is [b]'s little-endian 64-bit integer starting at character index [i]. @since 4.13 #*/*㠠 = The following is for system use only. Do not call directly. EIIEIJ @@G)../ocamlc0-strict-sequence(-absname"-w5+a-4-9-41-42-44-45-48"-g+-warn-error"+A*-bin-annot)-nostdlib*-principal#-pp #gawk -f ./expand_module_aliases.awk"-o8stdlib__StringLabels.cmi"-c0stringLabels.mli D/builds/workspace/precheck/flambda/false/label/ocaml-linux-32/stdlib @@037㦀kEW焏3@@@8CamlinternalFormatBasics0%FU(Q/Tu&Stdlib0Lku]8_٠.Stdlib__Either0Vy`u~c à+Stdlib__Seq0nwzG&amg 0osKoaw-Stdlib__Uchar056uf4[_@0osKoawAGR=@@w@@L@@@Ȑ@ Q @t ϐ 3@b@bհ~@@@I@@@@@@ & Ұ:@@T 4 @`@t@>x@  @@  3@@@@@@ ̐ @ ̐ @'@Q@@@(j#o@@ZI@ٰŐ @)uP@ _ °E@N@@ U °EI@@@@@@ՐB@ ]@KٰYʰ@ҰH@+w@@  O@$_@y@ Cp@@P@@