AllenGeng/ocamlgithub · Datasets at Hugging Face

text stringlengths 12 786k
let for_all sat s = Astring_base . for_all sat s ~ first : 0 ~ last ( : length s - 1 )
let exists sat s = Astring_base . exists sat s ~ first : 0 ~ last ( : length s - 1 )
let with_range ( ? first = 0 ) ( ? len = max_int ) s = if len < 0 then invalid_arg ( Astring_base . err_neg_len len ) else if len = 0 then empty else let s_len = length s in let max_idx = s_len - 1 in let last = match len with \| len when len = max_int -> max_idx \| len -> let last = fi...
let with_index_range ( ? first = 0 ) ? last s = let s_len = length s in let max_idx = s_len - 1 in let last = match last with \| None -> max_idx \| Some last -> if last > max_idx then max_idx else last in let first = if first < 0 then 0 else first in if first > max_idx \|\| last < 0 \|\| first > ...
let trim ( ? drop = Astring_char . Ascii . is_white ) s = let len = length s in if len = 0 then s else let max_idx = len - 1 in let rec left_pos i = if i > max_idx then len else if drop ( unsafe_get s i ) then left_pos ( i + 1 ) else i in let rec right_pos i = if i < 0 then 0 else if dr...
let fspan ( ? min = 0 ) ( ? max = max_int ) ( ? sat = fun _ -> true ) s = if min < 0 then invalid_arg ( Astring_base . err_neg_min min ) else if max < 0 then invalid_arg ( Astring_base . err_neg_max max ) else if min > max \|\| max = 0 then ( empty , s ) else let len = len...
let rspan ( ? min = 0 ) ( ? max = max_int ) ( ? sat = fun _ -> true ) s = if min < 0 then invalid_arg ( Astring_base . err_neg_min min ) else if max < 0 then invalid_arg ( Astring_base . err_neg_max max ) else if min > max \|\| max = 0 then ( s , empty ) else let len = len...
let span ( ? rev = false ) ? min ? max ? sat s = match rev with
let ftake ( ? min = 0 ) ( ? max = max_int ) ( ? sat = fun _ -> true ) s = if min < 0 then invalid_arg ( Astring_base . err_neg_min min ) else if max < 0 then invalid_arg ( Astring_base . err_neg_max max ) else if min > max \|\| max = 0 then empty else let len = length s in let m...
let rtake ( ? min = 0 ) ( ? max = max_int ) ( ? sat = fun _ -> true ) s = if min < 0 then invalid_arg ( Astring_base . err_neg_min min ) else if max < 0 then invalid_arg ( Astring_base . err_neg_max max ) else if min > max \|\| max = 0 then empty else let len = length s in let m...
let take ( ? rev = false ) ? min ? max ? sat s = match rev with
let fdrop ( ? min = 0 ) ( ? max = max_int ) ( ? sat = fun _ -> true ) s = if min < 0 then invalid_arg ( Astring_base . err_neg_min min ) else if max < 0 then invalid_arg ( Astring_base . err_neg_max max ) else if min > max \|\| max = 0 then s else let len = length s in let max_i...
let rdrop ( ? min = 0 ) ( ? max = max_int ) ( ? sat = fun _ -> true ) s = if min < 0 then invalid_arg ( Astring_base . err_neg_min min ) else if max < 0 then invalid_arg ( Astring_base . err_neg_max max ) else if min > max \|\| max = 0 then s else let len = length s in let max_i...
let drop ( ? rev = false ) ? min ? max ? sat s = match rev with
let fcut ~ sep s = let sep_len = length sep in if sep_len = 0 then invalid_arg Astring_base . err_empty_sep else let s_len = length s in let max_sep_idx = sep_len - 1 in let max_s_idx = s_len - sep_len in let rec check_sep i k = if k > max_sep_idx then let r_start = i + sep_len in Some ( unsafe_strin...
let rcut ~ sep s = let sep_len = length sep in if sep_len = 0 then invalid_arg Astring_base . err_empty_sep else let s_len = length s in let max_sep_idx = sep_len - 1 in let max_s_idx = s_len - 1 in let rec check_sep i k = if k > max_sep_idx then let r_start = i + sep_len in Some ( unsafe_string_sub...
let cut ( ? rev = false ) ~ sep s = if rev then rcut ~ sep s else fcut ~ sep s
let add_sub ~ no_empty s ~ start ~ stop acc = if start = stop then ( if no_empty then acc else empty :: acc ) else unsafe_string_sub s start ( stop - start ) :: acc
let fcuts ~ no_empty ~ sep s = let sep_len = length sep in if sep_len = 0 then invalid_arg Astring_base . err_empty_sep else let s_len = length s in let max_sep_idx = sep_len - 1 in let max_s_idx = s_len - sep_len in let rec check_sep start i k acc = if k > max_sep_idx then let new_start = i + sep_len...
let rcuts ~ no_empty ~ sep s = let sep_len = length sep in if sep_len = 0 then invalid_arg Astring_base . err_empty_sep else let s_len = length s in let max_sep_idx = sep_len - 1 in let max_s_idx = s_len - 1 in let rec check_sep stop i k acc = if k > max_sep_idx then let start = i + sep_len in rscan ...
let cuts ( ? rev = false ) ( ? empty = true ) ~ sep s = match rev with
let fields ( ? empty = true ) ( ? is_sep = Astring_char . Ascii . is_white ) s = let no_empty = not empty in let max_pos = length s in let rec loop i end_pos acc = if i < 0 then begin if end_pos = max_pos then ( if no_empty && max_pos = 0 then [ ] else [ s ] ) else add_sub ~ no_em...
let ffind ? start sat s = let max_idx = length s - 1 in let rec loop i = if i > max_idx then None else if sat ( unsafe_get s i ) then Some i else loop ( i + 1 ) in match start with \| None -> loop 0 \| Some i when i < 0 -> loop 0 \| Some i -> loop i
let rfind ? start sat s = let max_idx = length s - 1 in let rec loop i = if i < 0 then None else if sat ( unsafe_get s i ) then Some i else loop ( i - 1 ) in match start with \| None -> loop max_idx \| Some i when i > max_idx -> loop max_idx \| Some i -> loop i
let find ( ? rev = false ) ? start sat s = match rev with
let ffind_sub ? start ~ sub s = let len_sub = length sub in let len_s = length s in let max_idx_sub = len_sub - 1 in let max_idx_s = if len_sub <> 0 then len_s - len_sub else len_s - 1 in let rec loop i k = if i > max_idx_s then None else if k > max_idx_sub then Some i else if k > 0 then if unsafe_ge...
let rfind_sub ? start ~ sub s = let len_sub = length sub in let len_s = length s in let max_idx_sub = len_sub - 1 in let max_idx_s = if len_sub <> 0 then len_s - len_sub else len_s - 1 in let rec loop i k = if i < 0 then None else if k > max_idx_sub then Some i else if k > 0 then if unsafe_get sub k...
let find_sub ( ? rev = false ) ? start ~ sub s = match rev with
let filter sat s = let max_idx = length s - 1 in let rec with_buf b k i = if i > max_idx then Bytes . sub_string b 0 k else let c = unsafe_get s i in if sat c then ( bytes_unsafe_set b k c ; with_buf b ( k + 1 ) ( i + 1 ) ) else with_buf b k ( i + 1 ) in let rec try_no_alloc i = if i ...
let filter_map f s = let max_idx = length s - 1 in let rec with_buf b k i = if i > max_idx then ( if k > max_idx then bytes_unsafe_to_string b else Bytes . sub_string b 0 k ) else match f ( unsafe_get s i ) with \| None -> with_buf b k ( i + 1 ) \| Some c -> bytes_unsafe_set b k c ; with_buf...
let map f s = let max_idx = length s - 1 in let rec with_buf b i = if i > max_idx then bytes_unsafe_to_string b else ( bytes_unsafe_set b i ( f ( unsafe_get s i ) ) ; with_buf b ( i + 1 ) ) in let rec try_no_alloc i = if i > max_idx then s else let c = unsafe_get s i in match f c with \| cm...
let mapi f s = let max_idx = length s - 1 in let rec with_buf b i = if i > max_idx then bytes_unsafe_to_string b else ( bytes_unsafe_set b i ( f i ( unsafe_get s i ) ) ; with_buf b ( i + 1 ) ) in let rec try_no_alloc i = if i > max_idx then s else let c = unsafe_get s i in match f i c with ...
let fold_left f acc s = Astring_base . fold_left f acc s ~ first : 0 ~ last ( : length s - 1 )
let fold_right f s acc = Astring_base . fold_right f s acc ~ first : 0 ~ last ( : length s - 1 )
let iter f s = for i = 0 to length s - 1 do f ( unsafe_get s i ) done
let iteri f s = for i = 0 to length s - 1 do f i ( unsafe_get s i ) done
module Ascii = struct let is_valid s = let max_idx = length s - 1 in let rec loop i = if i > max_idx then true else if unsafe_get s i > Astring_char . Ascii . max_ascii then false else loop ( i + 1 ) in loop 0 let caseify is_not_case to_case s = let max_idx = length s - 1 in let caseify b i = fo...
let dump ppf s = Format . pp_print_char ppf ' " ' ; Format . pp_print_string ppf ( Ascii . escape_string s ) ; Format . pp_print_char ppf ' " ' ; ( )
module Set = struct include Set . Make ( String ) let pp ? sep ( : pp_sep = Format . pp_print_cut ) pp_elt ppf ss = let pp_elt elt is_first = if is_first then ( ) else pp_sep ppf ( ) ; pp_elt ppf elt ; false in ignore ( fold pp_elt ss true ) let dump_str = dump let dump ppf ss = let ...
module Map = struct include Map . Make ( String ) let err_empty ( ) = invalid_arg " empty map " let err_absent s = invalid_arg ( strf " % a is not bound in map " dump s ) let get_min_binding m = try min_binding m with Not_found -> err_empty ( ) let min_binding m = try Some ( min_bindi...
type ' a map = ' a Map . t
let uniquify ss = let add ( seen , ss as acc ) v = if Set . mem v seen then acc else ( Set . add v seen , v :: ss ) in List . rev ( snd ( List . fold_left add ( Set . empty , [ ] ) ss ) )
let err_base = " not on the same base string "
let err_empty_sub pos = strf " empty substring [ % d ; % d ] " pos pos
let err_pos_range start stop len = strf " invalid start :% d stop :% d for position range [ 0 ; % d ] " start stop len
let v ( ? start = 0 ) ? stop s = let s_len = string_length s in let stop = match stop with None -> s_len \| Some stop -> stop in if start < 0 \|\| stop > s_len \|\| stop < start then invalid_arg ( err_pos_range start stop s_len ) else ( s , start , stop )
let of_string_with_range ( ? first = 0 ) ( ? len = max_int ) s = if len < 0 then invalid_arg ( Astring_base . err_neg_len len ) else let s_len = string_length s in let max_idx = s_len - 1 in let empty = function \| first when first < 0 -> ( s , 0 , 0 ) \| first when first > max_...
let of_string_with_index_range ( ? first = 0 ) ? last s = let s_len = string_length s in let max_idx = s_len - 1 in let empty = function \| first when first < 0 -> ( s , 0 , 0 ) \| first when first > max_idx -> ( s , s_len , s_len ) \| first -> ( s , first , first ) in let ...
type t = string * int * int
let empty = ( Astring_base . empty , 0 , 0 )
let start_pos ( _ , start , _ ) = start
let stop_pos ( _ , _ , stop ) = stop
let base_string ( s , _ , _ ) = s
let length ( _ , start , stop ) = stop - start
let get ( s , start , _ ) i = string_safe_get s ( start + i )
let get_byte s i = char_to_byte ( get s i )
let unsafe_get ( s , start , _ ) i = string_unsafe_get s ( start + i )
let unsafe_get_byte s i = char_to_byte ( unsafe_get s i )
let head ( ? rev = false ) ( s , start , stop ) = if start = stop then None else Some ( string_unsafe_get s ( if rev then stop - 1 else start ) )
let get_head ( ? rev = false ) ( s , start , stop ) = if start = stop then invalid_arg ( err_empty_sub start ) else string_unsafe_get s ( if rev then stop - 1 else start )
let of_string s = v s
let to_string ( s , start , stop ) = if start = stop then Astring_base . empty else if start = 0 && stop = string_length s then s else unsafe_string_sub s start ( stop - start )
let rebase ( _ , start , stop as sub ) = ( to_string sub , 0 , stop - start )
let hash s = Hashtbl . hash s
let start ( s , start , _ ) = ( s , start , start )
let stop ( s , _ , stop ) = ( s , stop , stop )
let base ( s , _ , _ ) = ( s , 0 , string_length s )
let tail ( ? rev = false ) ( s , start , stop as sub ) = if start = stop then sub else if rev then ( s , start , stop - 1 ) else ( s , start + 1 , stop )
let fextend ? max ~ sat ( s , start , stop ) = let max_idx = string_length s - 1 in let max_idx = match max with \| None -> max_idx \| Some max when max < 0 -> invalid_arg ( Astring_base . err_neg_max max ) \| Some max -> let i = stop + max - 1 in if i > max_idx then max_idx else i in let...
let rextend ? max ~ sat ( s , start , stop ) = let min_idx = match max with \| None -> 0 \| Some max when max < 0 -> invalid_arg ( Astring_base . err_neg_max max ) \| Some max -> let i = start - max in if i < 0 then 0 else i in let rec loop i = if i < min_idx then ( s , min_idx , st...
let extend ( ? rev = false ) ? max ( ? sat = ( fun _ -> true ) ) sub = match rev with
let freduce ? max ~ sat ( s , start , stop as sub ) = if start = stop then sub else let min_idx = match max with \| None -> start \| Some max when max < 0 -> invalid_arg ( Astring_base . err_neg_max max ) \| Some max -> let i = stop - max in if i < start then start else i in let rec loop i =...
let rreduce ? max ~ sat ( s , start , stop as sub ) = if start = stop then sub else let max_idx = stop - 1 in let max_idx = match max with \| None -> max_idx \| Some max when max < 0 -> invalid_arg ( Astring_base . err_neg_max max ) \| Some max -> let i = start + max - 1 in if i > max_id...
let reduce ( ? rev = false ) ? max ( ? sat = ( fun _ -> true ) ) sub = match rev with
let extent ( s0 , start0 , stop0 ) ( s1 , start1 , stop1 ) = if s0 != s1 then invalid_arg err_base else let start = if start0 < start1 then start0 else start1 in let stop = if stop0 < stop1 then stop1 else stop0 in ( s0 , start , stop )
let overlap ( s0 , start0 , stop0 ) ( s1 , start1 , stop1 ) = if s0 != s1 then invalid_arg err_base else if not ( start0 <= stop1 && start1 <= stop0 ) then None else let start = if start0 < start1 then start1 else start0 in let stop = if stop0 < stop1 then stop0 else stop1 in Some ( s0 , ...
let append ( s0 , start0 , _ as sub0 ) ( s1 , start1 , _ as sub1 ) = let l0 = length sub0 in if l0 = 0 then rebase sub1 else let l1 = length sub1 in if l1 = 0 then rebase sub0 else let len = l0 + l1 in let b = Bytes . create len in bytes_unsafe_blit_string s0 start0 b 0 l0 ; bytes_unsaf...
let concat ? sep ( : sep , sep_start , _ as sep_sub = empty ) = function let sub_len = length sub in let sep_len = length sep_sub in let rec cat_len sep_count l ss = if l < 0 then l else match ss with \| s :: ss -> cat_len ( sep_count + 1 ) ( l + length s ) ss \| [ ] -> if sep_len =...
let is_empty ( _ , start , stop ) = stop - start = 0
let is_prefix ~ affix ( : affix , astart , _ as affix_sub ) ( s , sstart , _ as s_sub ) = let len_a = length affix_sub in let len_s = length s_sub in if len_a > len_s then false else let max_zidx = len_a - 1 in let rec loop i = if i > max_zidx then true else if sunsafe_get affix ( astart ...
let is_infix ~ affix ( : affix , astart , _ as affix_sub ) ( s , sstart , _ as s_sub ) = let len_a = length affix_sub in let len_s = length s_sub in if len_a > len_s then false else let max_zidx_a = len_a - 1 in let max_zidx_s = len_s - len_a in let rec loop i k = if i > max_zidx_s then f...
let is_suffix ~ affix ( : affix , _ , astop as affix_sub ) ( s , _ , sstop as s_sub ) = let len_a = length affix_sub in let len_s = length s_sub in if len_a > len_s then false else let max_zidx = len_a - 1 in let max_idx_a = astop - 1 in let max_idx_s = sstop - 1 in let rec loop i = if...
let for_all sat ( s , start , stop ) = Astring_base . for_all sat s ~ first : start ~ last ( : stop - 1 )
let exists sat ( s , start , stop ) = Astring_base . exists sat s ~ first : start ~ last ( : stop - 1 )
let same_base ( s0 , _ , _ ) ( s1 , _ , _ ) = s0 == s1
let equal_bytes ( s0 , start0 , stop0 ) ( s1 , start1 , stop1 ) = if s0 == s1 && start0 = start1 && stop0 = stop1 then true else let len0 = stop0 - start0 in let len1 = stop1 - start1 in if len0 <> len1 then false else let max_zidx = len0 - 1 in let rec loop i = if i > max_zidx then true...
let compare_bytes ( s0 , start0 , stop0 ) ( s1 , start1 , stop1 ) = if s0 == s1 && start0 = start1 && stop0 = stop1 then 0 else let len0 = stop0 - start0 in let len1 = stop1 - start1 in let min_len = if len0 < len1 then len0 else len1 in let max_i = min_len - 1 in let rec loop i = if i ...
let eq_pos : int -> int -> bool = fun p0 p1 -> p0 = p1
let equal ( s0 , start0 , stop0 ) ( s1 , start1 , stop1 ) = if s0 != s1 then invalid_arg err_base else eq_pos start0 start1 && eq_pos stop0 stop1
let compare_pos : int -> int -> int = compare
let compare ( s0 , start0 , stop0 ) ( s1 , start1 , stop1 ) = if s0 != s1 then invalid_arg err_base else let c = compare_pos start0 start1 in if c <> 0 then c else compare_pos stop0 stop1
let with_range ( ? first = 0 ) ( ? len = max_int ) ( s , start , stop ) = if len < 0 then invalid_arg ( Astring_base . err_neg_len len ) else let s_len = stop - start in let max_idx = s_len - 1 in let empty = function \| first when first < 0 -> ( s , start , start ) \| fir...
let with_index_range ( ? first = 0 ) ? last ( s , start , stop ) = let s_len = stop - start in let max_idx = s_len - 1 in let empty = function \| first when first < 0 -> ( s , start , start ) \| first when first > max_idx -> ( s , stop , stop ) \| first -> ( s , start +...
let trim ( ? drop = Astring_char . Ascii . is_white ) ( s , start , stop as sub ) = let len = stop - start in if len = 0 then sub else let max_pos = stop in let max_idx = stop - 1 in let rec left_pos i = if i > max_idx then max_pos else if drop ( sunsafe_get s i ) then left_pos ( i +...
let fspan ~ min ~ max ~ sat ( s , start , stop as sub ) = if min < 0 then invalid_arg ( Astring_base . err_neg_min min ) else if max < 0 then invalid_arg ( Astring_base . err_neg_max max ) else if min > max \|\| max = 0 then ( ( s , start , start ) , sub ) else let max_idx =...
let rspan ~ min ~ max ~ sat ( s , start , stop as sub ) = if min < 0 then invalid_arg ( Astring_base . err_neg_min min ) else if max < 0 then invalid_arg ( Astring_base . err_neg_max max ) else if min > max \|\| max = 0 then ( sub , ( s , stop , stop ) ) else let max_idx = s...
let span ( ? rev = false ) ( ? min = 0 ) ( ? max = max_int ) ( ? sat = fun _ -> true ) sub = match rev with \| true -> rspan ~ min ~ max ~ sat sub \| false -> fspan ~ min ~ max ~ sat sub
let take ( ? rev = false ) ? min ? max ? sat s = ( if rev then snd else fst ) @@ span ~ rev ? min ? max ? sat s
let drop ( ? rev = false ) ? min ? max ? sat s = ( if rev then fst else snd ) @@ span ~ rev ? min ? max ? sat s
let fcut ~ sep ( : sep , sep_start , sep_stop ) ( s , start , stop ) = let sep_len = sep_stop - sep_start in if sep_len = 0 then invalid_arg Astring_base . err_empty_sep else let max_sep_zidx = sep_len - 1 in let max_s_idx = stop - sep_len in let rec check_sep i k = if k > max_sep_zidx t...

let for_all sat s = Astring_base . for_all sat s ~ first : 0 ~ last ( : length s - 1 )

let exists sat s = Astring_base . exists sat s ~ first : 0 ~ last ( : length s - 1 )

let with_range ( ? first = 0 ) ( ? len = max_int ) s = if len < 0 then invalid_arg ( Astring_base . err_neg_len len ) else if len = 0 then empty else let s_len = length s in let max_idx = s_len - 1 in let last = match len with | len when len = max_int -> max_idx | len -> let last = fi...

let with_index_range ( ? first = 0 ) ? last s = let s_len = length s in let max_idx = s_len - 1 in let last = match last with | None -> max_idx | Some last -> if last > max_idx then max_idx else last in let first = if first < 0 then 0 else first in if first > max_idx || last < 0 || first > ...

let trim ( ? drop = Astring_char . Ascii . is_white ) s = let len = length s in if len = 0 then s else let max_idx = len - 1 in let rec left_pos i = if i > max_idx then len else if drop ( unsafe_get s i ) then left_pos ( i + 1 ) else i in let rec right_pos i = if i < 0 then 0 else if dr...

let fspan ( ? min = 0 ) ( ? max = max_int ) ( ? sat = fun _ -> true ) s = if min < 0 then invalid_arg ( Astring_base . err_neg_min min ) else if max < 0 then invalid_arg ( Astring_base . err_neg_max max ) else if min > max || max = 0 then ( empty , s ) else let len = len...

let rspan ( ? min = 0 ) ( ? max = max_int ) ( ? sat = fun _ -> true ) s = if min < 0 then invalid_arg ( Astring_base . err_neg_min min ) else if max < 0 then invalid_arg ( Astring_base . err_neg_max max ) else if min > max || max = 0 then ( s , empty ) else let len = len...

let span ( ? rev = false ) ? min ? max ? sat s = match rev with

let ftake ( ? min = 0 ) ( ? max = max_int ) ( ? sat = fun _ -> true ) s = if min < 0 then invalid_arg ( Astring_base . err_neg_min min ) else if max < 0 then invalid_arg ( Astring_base . err_neg_max max ) else if min > max || max = 0 then empty else let len = length s in let m...

let rtake ( ? min = 0 ) ( ? max = max_int ) ( ? sat = fun _ -> true ) s = if min < 0 then invalid_arg ( Astring_base . err_neg_min min ) else if max < 0 then invalid_arg ( Astring_base . err_neg_max max ) else if min > max || max = 0 then empty else let len = length s in let m...

let take ( ? rev = false ) ? min ? max ? sat s = match rev with

let fdrop ( ? min = 0 ) ( ? max = max_int ) ( ? sat = fun _ -> true ) s = if min < 0 then invalid_arg ( Astring_base . err_neg_min min ) else if max < 0 then invalid_arg ( Astring_base . err_neg_max max ) else if min > max || max = 0 then s else let len = length s in let max_i...

let rdrop ( ? min = 0 ) ( ? max = max_int ) ( ? sat = fun _ -> true ) s = if min < 0 then invalid_arg ( Astring_base . err_neg_min min ) else if max < 0 then invalid_arg ( Astring_base . err_neg_max max ) else if min > max || max = 0 then s else let len = length s in let max_i...

let drop ( ? rev = false ) ? min ? max ? sat s = match rev with

let fcut ~ sep s = let sep_len = length sep in if sep_len = 0 then invalid_arg Astring_base . err_empty_sep else let s_len = length s in let max_sep_idx = sep_len - 1 in let max_s_idx = s_len - sep_len in let rec check_sep i k = if k > max_sep_idx then let r_start = i + sep_len in Some ( unsafe_strin...

let rcut ~ sep s = let sep_len = length sep in if sep_len = 0 then invalid_arg Astring_base . err_empty_sep else let s_len = length s in let max_sep_idx = sep_len - 1 in let max_s_idx = s_len - 1 in let rec check_sep i k = if k > max_sep_idx then let r_start = i + sep_len in Some ( unsafe_string_sub...

let cut ( ? rev = false ) ~ sep s = if rev then rcut ~ sep s else fcut ~ sep s

let add_sub ~ no_empty s ~ start ~ stop acc = if start = stop then ( if no_empty then acc else empty :: acc ) else unsafe_string_sub s start ( stop - start ) :: acc

let fcuts ~ no_empty ~ sep s = let sep_len = length sep in if sep_len = 0 then invalid_arg Astring_base . err_empty_sep else let s_len = length s in let max_sep_idx = sep_len - 1 in let max_s_idx = s_len - sep_len in let rec check_sep start i k acc = if k > max_sep_idx then let new_start = i + sep_len...

let rcuts ~ no_empty ~ sep s = let sep_len = length sep in if sep_len = 0 then invalid_arg Astring_base . err_empty_sep else let s_len = length s in let max_sep_idx = sep_len - 1 in let max_s_idx = s_len - 1 in let rec check_sep stop i k acc = if k > max_sep_idx then let start = i + sep_len in rscan ...

let cuts ( ? rev = false ) ( ? empty = true ) ~ sep s = match rev with

let fields ( ? empty = true ) ( ? is_sep = Astring_char . Ascii . is_white ) s = let no_empty = not empty in let max_pos = length s in let rec loop i end_pos acc = if i < 0 then begin if end_pos = max_pos then ( if no_empty && max_pos = 0 then [ ] else [ s ] ) else add_sub ~ no_em...

let ffind ? start sat s = let max_idx = length s - 1 in let rec loop i = if i > max_idx then None else if sat ( unsafe_get s i ) then Some i else loop ( i + 1 ) in match start with | None -> loop 0 | Some i when i < 0 -> loop 0 | Some i -> loop i

let rfind ? start sat s = let max_idx = length s - 1 in let rec loop i = if i < 0 then None else if sat ( unsafe_get s i ) then Some i else loop ( i - 1 ) in match start with | None -> loop max_idx | Some i when i > max_idx -> loop max_idx | Some i -> loop i

let find ( ? rev = false ) ? start sat s = match rev with

let ffind_sub ? start ~ sub s = let len_sub = length sub in let len_s = length s in let max_idx_sub = len_sub - 1 in let max_idx_s = if len_sub <> 0 then len_s - len_sub else len_s - 1 in let rec loop i k = if i > max_idx_s then None else if k > max_idx_sub then Some i else if k > 0 then if unsafe_ge...

let rfind_sub ? start ~ sub s = let len_sub = length sub in let len_s = length s in let max_idx_sub = len_sub - 1 in let max_idx_s = if len_sub <> 0 then len_s - len_sub else len_s - 1 in let rec loop i k = if i < 0 then None else if k > max_idx_sub then Some i else if k > 0 then if unsafe_get sub k...

let find_sub ( ? rev = false ) ? start ~ sub s = match rev with

let filter sat s = let max_idx = length s - 1 in let rec with_buf b k i = if i > max_idx then Bytes . sub_string b 0 k else let c = unsafe_get s i in if sat c then ( bytes_unsafe_set b k c ; with_buf b ( k + 1 ) ( i + 1 ) ) else with_buf b k ( i + 1 ) in let rec try_no_alloc i = if i ...

let filter_map f s = let max_idx = length s - 1 in let rec with_buf b k i = if i > max_idx then ( if k > max_idx then bytes_unsafe_to_string b else Bytes . sub_string b 0 k ) else match f ( unsafe_get s i ) with | None -> with_buf b k ( i + 1 ) | Some c -> bytes_unsafe_set b k c ; with_buf...

let map f s = let max_idx = length s - 1 in let rec with_buf b i = if i > max_idx then bytes_unsafe_to_string b else ( bytes_unsafe_set b i ( f ( unsafe_get s i ) ) ; with_buf b ( i + 1 ) ) in let rec try_no_alloc i = if i > max_idx then s else let c = unsafe_get s i in match f c with | cm...

let mapi f s = let max_idx = length s - 1 in let rec with_buf b i = if i > max_idx then bytes_unsafe_to_string b else ( bytes_unsafe_set b i ( f i ( unsafe_get s i ) ) ; with_buf b ( i + 1 ) ) in let rec try_no_alloc i = if i > max_idx then s else let c = unsafe_get s i in match f i c with ...

let fold_left f acc s = Astring_base . fold_left f acc s ~ first : 0 ~ last ( : length s - 1 )

let fold_right f s acc = Astring_base . fold_right f s acc ~ first : 0 ~ last ( : length s - 1 )

let iter f s = for i = 0 to length s - 1 do f ( unsafe_get s i ) done

let iteri f s = for i = 0 to length s - 1 do f i ( unsafe_get s i ) done

module Ascii = struct let is_valid s = let max_idx = length s - 1 in let rec loop i = if i > max_idx then true else if unsafe_get s i > Astring_char . Ascii . max_ascii then false else loop ( i + 1 ) in loop 0 let caseify is_not_case to_case s = let max_idx = length s - 1 in let caseify b i = fo...

let dump ppf s = Format . pp_print_char ppf ' " ' ; Format . pp_print_string ppf ( Ascii . escape_string s ) ; Format . pp_print_char ppf ' " ' ; ( )

module Set = struct include Set . Make ( String ) let pp ? sep ( : pp_sep = Format . pp_print_cut ) pp_elt ppf ss = let pp_elt elt is_first = if is_first then ( ) else pp_sep ppf ( ) ; pp_elt ppf elt ; false in ignore ( fold pp_elt ss true ) let dump_str = dump let dump ppf ss = let ...

module Map = struct include Map . Make ( String ) let err_empty ( ) = invalid_arg " empty map " let err_absent s = invalid_arg ( strf " % a is not bound in map " dump s ) let get_min_binding m = try min_binding m with Not_found -> err_empty ( ) let min_binding m = try Some ( min_bindi...

type ' a map = ' a Map . t

let uniquify ss = let add ( seen , ss as acc ) v = if Set . mem v seen then acc else ( Set . add v seen , v :: ss ) in List . rev ( snd ( List . fold_left add ( Set . empty , [ ] ) ss ) )

let err_base = " not on the same base string "

let err_empty_sub pos = strf " empty substring [ % d ; % d ] " pos pos

let err_pos_range start stop len = strf " invalid start :% d stop :% d for position range [ 0 ; % d ] " start stop len

let v ( ? start = 0 ) ? stop s = let s_len = string_length s in let stop = match stop with None -> s_len | Some stop -> stop in if start < 0 || stop > s_len || stop < start then invalid_arg ( err_pos_range start stop s_len ) else ( s , start , stop )

let of_string_with_range ( ? first = 0 ) ( ? len = max_int ) s = if len < 0 then invalid_arg ( Astring_base . err_neg_len len ) else let s_len = string_length s in let max_idx = s_len - 1 in let empty = function | first when first < 0 -> ( s , 0 , 0 ) | first when first > max_...

let of_string_with_index_range ( ? first = 0 ) ? last s = let s_len = string_length s in let max_idx = s_len - 1 in let empty = function | first when first < 0 -> ( s , 0 , 0 ) | first when first > max_idx -> ( s , s_len , s_len ) | first -> ( s , first , first ) in let ...

type t = string * int * int

let empty = ( Astring_base . empty , 0 , 0 )

let start_pos ( _ , start , _ ) = start

let stop_pos ( _ , _ , stop ) = stop

let base_string ( s , _ , _ ) = s

let length ( _ , start , stop ) = stop - start

let get ( s , start , _ ) i = string_safe_get s ( start + i )

let get_byte s i = char_to_byte ( get s i )

let unsafe_get ( s , start , _ ) i = string_unsafe_get s ( start + i )

let unsafe_get_byte s i = char_to_byte ( unsafe_get s i )

let head ( ? rev = false ) ( s , start , stop ) = if start = stop then None else Some ( string_unsafe_get s ( if rev then stop - 1 else start ) )

let get_head ( ? rev = false ) ( s , start , stop ) = if start = stop then invalid_arg ( err_empty_sub start ) else string_unsafe_get s ( if rev then stop - 1 else start )

let of_string s = v s

let to_string ( s , start , stop ) = if start = stop then Astring_base . empty else if start = 0 && stop = string_length s then s else unsafe_string_sub s start ( stop - start )

let rebase ( _ , start , stop as sub ) = ( to_string sub , 0 , stop - start )

let hash s = Hashtbl . hash s

let start ( s , start , _ ) = ( s , start , start )

let stop ( s , _ , stop ) = ( s , stop , stop )

let base ( s , _ , _ ) = ( s , 0 , string_length s )

let tail ( ? rev = false ) ( s , start , stop as sub ) = if start = stop then sub else if rev then ( s , start , stop - 1 ) else ( s , start + 1 , stop )

let fextend ? max ~ sat ( s , start , stop ) = let max_idx = string_length s - 1 in let max_idx = match max with | None -> max_idx | Some max when max < 0 -> invalid_arg ( Astring_base . err_neg_max max ) | Some max -> let i = stop + max - 1 in if i > max_idx then max_idx else i in let...

let rextend ? max ~ sat ( s , start , stop ) = let min_idx = match max with | None -> 0 | Some max when max < 0 -> invalid_arg ( Astring_base . err_neg_max max ) | Some max -> let i = start - max in if i < 0 then 0 else i in let rec loop i = if i < min_idx then ( s , min_idx , st...

let extend ( ? rev = false ) ? max ( ? sat = ( fun _ -> true ) ) sub = match rev with

let freduce ? max ~ sat ( s , start , stop as sub ) = if start = stop then sub else let min_idx = match max with | None -> start | Some max when max < 0 -> invalid_arg ( Astring_base . err_neg_max max ) | Some max -> let i = stop - max in if i < start then start else i in let rec loop i =...

let rreduce ? max ~ sat ( s , start , stop as sub ) = if start = stop then sub else let max_idx = stop - 1 in let max_idx = match max with | None -> max_idx | Some max when max < 0 -> invalid_arg ( Astring_base . err_neg_max max ) | Some max -> let i = start + max - 1 in if i > max_id...

let reduce ( ? rev = false ) ? max ( ? sat = ( fun _ -> true ) ) sub = match rev with

let extent ( s0 , start0 , stop0 ) ( s1 , start1 , stop1 ) = if s0 != s1 then invalid_arg err_base else let start = if start0 < start1 then start0 else start1 in let stop = if stop0 < stop1 then stop1 else stop0 in ( s0 , start , stop )

let overlap ( s0 , start0 , stop0 ) ( s1 , start1 , stop1 ) = if s0 != s1 then invalid_arg err_base else if not ( start0 <= stop1 && start1 <= stop0 ) then None else let start = if start0 < start1 then start1 else start0 in let stop = if stop0 < stop1 then stop0 else stop1 in Some ( s0 , ...

let append ( s0 , start0 , _ as sub0 ) ( s1 , start1 , _ as sub1 ) = let l0 = length sub0 in if l0 = 0 then rebase sub1 else let l1 = length sub1 in if l1 = 0 then rebase sub0 else let len = l0 + l1 in let b = Bytes . create len in bytes_unsafe_blit_string s0 start0 b 0 l0 ; bytes_unsaf...

let concat ? sep ( : sep , sep_start , _ as sep_sub = empty ) = function let sub_len = length sub in let sep_len = length sep_sub in let rec cat_len sep_count l ss = if l < 0 then l else match ss with | s :: ss -> cat_len ( sep_count + 1 ) ( l + length s ) ss | [ ] -> if sep_len =...

let is_empty ( _ , start , stop ) = stop - start = 0

let is_prefix ~ affix ( : affix , astart , _ as affix_sub ) ( s , sstart , _ as s_sub ) = let len_a = length affix_sub in let len_s = length s_sub in if len_a > len_s then false else let max_zidx = len_a - 1 in let rec loop i = if i > max_zidx then true else if sunsafe_get affix ( astart ...

let is_infix ~ affix ( : affix , astart , _ as affix_sub ) ( s , sstart , _ as s_sub ) = let len_a = length affix_sub in let len_s = length s_sub in if len_a > len_s then false else let max_zidx_a = len_a - 1 in let max_zidx_s = len_s - len_a in let rec loop i k = if i > max_zidx_s then f...

let is_suffix ~ affix ( : affix , _ , astop as affix_sub ) ( s , _ , sstop as s_sub ) = let len_a = length affix_sub in let len_s = length s_sub in if len_a > len_s then false else let max_zidx = len_a - 1 in let max_idx_a = astop - 1 in let max_idx_s = sstop - 1 in let rec loop i = if...

let for_all sat ( s , start , stop ) = Astring_base . for_all sat s ~ first : start ~ last ( : stop - 1 )

let exists sat ( s , start , stop ) = Astring_base . exists sat s ~ first : start ~ last ( : stop - 1 )

let same_base ( s0 , _ , _ ) ( s1 , _ , _ ) = s0 == s1

let equal_bytes ( s0 , start0 , stop0 ) ( s1 , start1 , stop1 ) = if s0 == s1 && start0 = start1 && stop0 = stop1 then true else let len0 = stop0 - start0 in let len1 = stop1 - start1 in if len0 <> len1 then false else let max_zidx = len0 - 1 in let rec loop i = if i > max_zidx then true...

let compare_bytes ( s0 , start0 , stop0 ) ( s1 , start1 , stop1 ) = if s0 == s1 && start0 = start1 && stop0 = stop1 then 0 else let len0 = stop0 - start0 in let len1 = stop1 - start1 in let min_len = if len0 < len1 then len0 else len1 in let max_i = min_len - 1 in let rec loop i = if i ...

let eq_pos : int -> int -> bool = fun p0 p1 -> p0 = p1

let equal ( s0 , start0 , stop0 ) ( s1 , start1 , stop1 ) = if s0 != s1 then invalid_arg err_base else eq_pos start0 start1 && eq_pos stop0 stop1

let compare_pos : int -> int -> int = compare

let compare ( s0 , start0 , stop0 ) ( s1 , start1 , stop1 ) = if s0 != s1 then invalid_arg err_base else let c = compare_pos start0 start1 in if c <> 0 then c else compare_pos stop0 stop1

let with_range ( ? first = 0 ) ( ? len = max_int ) ( s , start , stop ) = if len < 0 then invalid_arg ( Astring_base . err_neg_len len ) else let s_len = stop - start in let max_idx = s_len - 1 in let empty = function | first when first < 0 -> ( s , start , start ) | fir...

let with_index_range ( ? first = 0 ) ? last ( s , start , stop ) = let s_len = stop - start in let max_idx = s_len - 1 in let empty = function | first when first < 0 -> ( s , start , start ) | first when first > max_idx -> ( s , stop , stop ) | first -> ( s , start +...

let trim ( ? drop = Astring_char . Ascii . is_white ) ( s , start , stop as sub ) = let len = stop - start in if len = 0 then sub else let max_pos = stop in let max_idx = stop - 1 in let rec left_pos i = if i > max_idx then max_pos else if drop ( sunsafe_get s i ) then left_pos ( i +...

let fspan ~ min ~ max ~ sat ( s , start , stop as sub ) = if min < 0 then invalid_arg ( Astring_base . err_neg_min min ) else if max < 0 then invalid_arg ( Astring_base . err_neg_max max ) else if min > max || max = 0 then ( ( s , start , start ) , sub ) else let max_idx =...

let rspan ~ min ~ max ~ sat ( s , start , stop as sub ) = if min < 0 then invalid_arg ( Astring_base . err_neg_min min ) else if max < 0 then invalid_arg ( Astring_base . err_neg_max max ) else if min > max || max = 0 then ( sub , ( s , stop , stop ) ) else let max_idx = s...

let span ( ? rev = false ) ( ? min = 0 ) ( ? max = max_int ) ( ? sat = fun _ -> true ) sub = match rev with | true -> rspan ~ min ~ max ~ sat sub | false -> fspan ~ min ~ max ~ sat sub

let take ( ? rev = false ) ? min ? max ? sat s = ( if rev then snd else fst ) @@ span ~ rev ? min ? max ? sat s

let drop ( ? rev = false ) ? min ? max ? sat s = ( if rev then fst else snd ) @@ span ~ rev ? min ? max ? sat s

let fcut ~ sep ( : sep , sep_start , sep_stop ) ( s , start , stop ) = let sep_len = sep_stop - sep_start in if sep_len = 0 then invalid_arg Astring_base . err_empty_sep else let max_sep_zidx = sep_len - 1 in let max_s_idx = stop - sep_len in let rec check_sep i k = if k > max_sep_zidx t...