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 = first + len - 1 in 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 > last then empty else if first = 0 && last = max_idx then s else unsafe_string_sub s first ( last + 1 - first ) |
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 > last then empty else if first = 0 && last = max_idx then s else unsafe_string_sub s first ( last + 1 - 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 drop ( unsafe_get s i ) then right_pos ( i - 1 ) else ( i + 1 ) in let left = left_pos 0 in if left = len then empty else let right = right_pos max_idx in if left = 0 && right = len then s else unsafe_string_sub s left ( right - left ) |
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 = length s in let max_idx = len - 1 in let max_idx = let k = max - 1 in ( if k > max_idx then max_idx else k ) in let need_idx = min in let rec loop i = if i <= max_idx && sat ( unsafe_get s i ) then loop ( i + 1 ) else if i < need_idx || i = 0 then ( empty , s ) else if i = len then ( s , empty ) else unsafe_string_sub s 0 i , unsafe_string_sub s i ( len - i ) in loop 0 |
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 = length s in let max_idx = len - 1 in let min_idx = let k = len - max in ( if k < 0 then 0 else k ) in let need_idx = max_idx - min in let rec loop i = if i >= min_idx && sat ( unsafe_get s i ) then loop ( i - 1 ) else if i > need_idx || i = max_idx then ( s , empty ) else if i = - 1 then ( empty , s ) else let cut = i + 1 in unsafe_string_sub s 0 cut , unsafe_string_sub s cut ( len - cut ) in loop max_idx |
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 max_idx = len - 1 in let max_idx = let k = max - 1 in ( if k > max_idx then max_idx else k ) in let need_idx = min in let rec loop i = if i <= max_idx && sat ( unsafe_get s i ) then loop ( i + 1 ) else if i < need_idx || i = 0 then empty else if i = len then s else unsafe_string_sub s 0 i in loop 0 |
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 max_idx = len - 1 in let min_idx = let k = len - max in ( if k < 0 then 0 else k ) in let need_idx = max_idx - min in let rec loop i = if i >= min_idx && sat ( unsafe_get s i ) then loop ( i - 1 ) else if i > need_idx || i = max_idx then empty else if i = - 1 then s else let cut = i + 1 in unsafe_string_sub s cut ( len - cut ) in loop max_idx |
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_idx = len - 1 in let max_idx = let k = max - 1 in ( if k > max_idx then max_idx else k ) in let need_idx = min in let rec loop i = if i <= max_idx && sat ( unsafe_get s i ) then loop ( i + 1 ) else if i < need_idx || i = 0 then s else if i = len then empty else unsafe_string_sub s i ( len - i ) in loop 0 |
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_idx = len - 1 in let min_idx = let k = len - max in ( if k < 0 then 0 else k ) in let need_idx = max_idx - min in let rec loop i = if i >= min_idx && sat ( unsafe_get s i ) then loop ( i - 1 ) else if i > need_idx || i = max_idx then s else if i = - 1 then empty else let cut = i + 1 in unsafe_string_sub s 0 cut in loop max_idx |
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_string_sub s 0 i , unsafe_string_sub s r_start ( s_len - r_start ) ) else if unsafe_get s ( i + k ) = unsafe_get sep k then check_sep i ( k + 1 ) else scan ( i + 1 ) and scan i = if i > max_s_idx then None else if unsafe_get s i = unsafe_get sep 0 then check_sep i 1 else scan ( i + 1 ) in scan 0 |
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 s 0 i , unsafe_string_sub s r_start ( s_len - r_start ) ) else if unsafe_get s ( i + k ) = unsafe_get sep k then check_sep i ( k + 1 ) else rscan ( i - 1 ) and rscan i = if i < 0 then None else if unsafe_get s i = unsafe_get sep 0 then check_sep i 1 else rscan ( i - 1 ) in rscan ( max_s_idx - max_sep_idx ) |
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 in scan new_start new_start ( add_sub ~ no_empty s ~ start ~ stop : i acc ) else if unsafe_get s ( i + k ) = unsafe_get sep k then check_sep start i ( k + 1 ) acc else scan start ( i + 1 ) acc and scan start i acc = if i > max_s_idx then if start = 0 then ( if no_empty && s_len = 0 then [ ] else [ s ] ) else List . rev ( add_sub ~ no_empty s ~ start ~ stop : s_len acc ) else if unsafe_get s i = unsafe_get sep 0 then check_sep start i 1 acc else scan start ( i + 1 ) acc in scan 0 0 [ ] |
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 i ( i - sep_len ) ( add_sub ~ no_empty s ~ start ~ stop acc ) else if unsafe_get s ( i + k ) = unsafe_get sep k then check_sep stop i ( k + 1 ) acc else rscan stop ( i - 1 ) acc and rscan stop i acc = if i < 0 then if stop = s_len then ( if no_empty && s_len = 0 then [ ] else [ s ] ) else add_sub ~ no_empty s ~ start : 0 ~ stop : stop acc else if unsafe_get s i = unsafe_get sep 0 then check_sep stop i 1 acc else rscan stop ( i - 1 ) acc in rscan s_len ( max_s_idx - max_sep_idx ) [ ] |
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_empty s ~ start : 0 ~ stop : end_pos acc end else begin if not ( is_sep ( unsafe_get s i ) ) then loop ( i - 1 ) end_pos acc else loop ( i - 1 ) i ( add_sub ~ no_empty s ~ start ( : i + 1 ) ~ stop : end_pos acc ) end in loop ( max_pos - 1 ) max_pos [ ] |
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_get sub k = unsafe_get s ( i + k ) then loop i ( k + 1 ) else loop ( i + 1 ) 0 else if unsafe_get sub 0 = unsafe_get s i then loop i 1 else loop ( i + 1 ) 0 in match start with | None -> loop 0 0 | Some i when i < 0 -> loop 0 0 | Some i -> loop i 0 |
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 = unsafe_get s ( i + k ) then loop i ( k + 1 ) else loop ( i - 1 ) 0 else if unsafe_get sub 0 = unsafe_get s i then loop i 1 else loop ( i - 1 ) 0 in match start with | None -> loop max_idx_s 0 | Some i when i > max_idx_s -> loop max_idx_s 0 | Some i -> loop i 0 |
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 > max_idx then s else if ( sat ( unsafe_get s i ) ) then try_no_alloc ( i + 1 ) else if i = max_idx then unsafe_string_sub s 0 i else let b = Bytes . of_string s in with_buf b i ( i + 1 ) in try_no_alloc 0 |
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 b ( k + 1 ) ( 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 | None -> if i = max_idx then unsafe_string_sub s 0 i else let b = Bytes . of_string s in with_buf b i ( i + 1 ) | Some cm when cm <> c -> let b = Bytes . of_string s in bytes_unsafe_set b i cm ; with_buf b ( i + 1 ) ( i + 1 ) | Some _ -> try_no_alloc ( i + 1 ) in try_no_alloc 0 |
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 when cm <> c -> let b = Bytes . of_string s in bytes_unsafe_set b i cm ; with_buf b ( i + 1 ) | _ -> try_no_alloc ( i + 1 ) in try_no_alloc 0 |
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 | cm when cm <> c -> let b = Bytes . of_string s in bytes_unsafe_set b i cm ; with_buf b ( i + 1 ) | _ -> try_no_alloc ( i + 1 ) in try_no_alloc 0 |
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 = for k = i to max_idx do bytes_unsafe_set b k ( to_case ( unsafe_get s k ) ) done ; bytes_unsafe_to_string b in let rec try_no_alloc i = if i > max_idx then s else if is_not_case ( unsafe_get s i ) then caseify ( Bytes . of_string s ) i else try_no_alloc ( i + 1 ) in try_no_alloc 0 let uppercase s = caseify Astring_char . Ascii . is_lower Astring_char . Ascii . uppercase s let lowercase s = caseify Astring_char . Ascii . is_upper Astring_char . Ascii . lowercase s let caseify_first is_not_case to_case s = if length s = 0 then s else let c = unsafe_get s 0 in if not ( is_not_case c ) then s else let b = Bytes . of_string s in bytes_unsafe_set b 0 ( to_case c ) ; bytes_unsafe_to_string b let capitalize s = caseify_first Astring_char . Ascii . is_lower Astring_char . Ascii . uppercase s let uncapitalize s = caseify_first Astring_char . Ascii . is_upper Astring_char . Ascii . lowercase s let escape = Astring_escape . escape let unescape = Astring_escape . unescape let escape_string = Astring_escape . escape_string let unescape_string = Astring_escape . unescape_string end |
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 pp_elt elt is_first = if is_first then ( ) else Format . fprintf ppf " @ " ; Format . fprintf ppf " % a " dump_str elt ; false in Format . fprintf ppf " [ @< 1 { " ; > ignore ( fold pp_elt ss true ) ; Format . fprintf ppf " } ] " ; @ ( ) let err_empty ( ) = invalid_arg " empty set " let err_absent s ss = invalid_arg ( strf " % a not in set % a " dump_str s dump ss ) let get_min_elt ss = try min_elt ss with Not_found -> err_empty ( ) let min_elt ss = try Some ( min_elt ss ) with Not_found -> None let get_max_elt ss = try max_elt ss with Not_found -> err_empty ( ) let max_elt ss = try Some ( max_elt ss ) with Not_found -> None let get_any_elt ss = try choose ss with Not_found -> err_empty ( ) let choose ss = try Some ( choose ss ) with Not_found -> None let get s ss = try find s ss with Not_found -> err_absent s ss let find s ss = try Some ( find s ss ) with Not_found -> None let of_list = List . fold_left ( fun acc s -> add s acc ) empty let of_stdlib_set s = s let to_stdlib_set s = s end |
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_binding m ) with Not_found -> None let get_max_binding m = try max_binding m with Not_found -> err_empty ( ) let max_binding m = try Some ( max_binding m ) with Not_found -> None let get_any_binding m = try choose m with Not_found -> err_empty ( ) let choose m = try Some ( choose m ) with Not_found -> None let get k s = try find k s with Not_found -> err_absent k let find k m = try Some ( find k m ) with Not_found -> None let dom m = fold ( fun k _ acc -> Set . add k acc ) m Set . empty let of_list bs = List . fold_left ( fun m ( k , v ) -> add k v m ) empty bs let of_stdlib_map m = m let to_stdlib_map m = m let pp ? sep ( : pp_sep = Format . pp_print_cut ) pp_binding ppf ( m : ' a t ) = let pp_binding k v is_first = if is_first then ( ) else pp_sep ppf ( ) ; pp_binding ppf ( k , v ) ; false in ignore ( fold pp_binding m true ) let dump_str = dump let dump pp_v ppf m = let pp_binding k v is_first = if is_first then ( ) else Format . fprintf ppf " @ " ; Format . fprintf ppf " [ @< 1 ( [ >@% a ] , @@ [ @% a ] ) ] " @@ dump k pp_v v ; false in Format . fprintf ppf " [ @< 1 { " ; > ignore ( fold pp_binding m true ) ; Format . fprintf ppf " } ] " ; @ ( ) let dump_string_map ppf m = dump dump_str ppf m end |
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_idx -> ( s , s_len , s_len ) | first -> ( s , first , first ) in if len = 0 then empty first else let last = match len with | len when len = max_int -> max_idx | len -> let last = first + len - 1 in 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 > last then empty first else ( s , first , last + 1 ) |
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 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 > last then empty first else ( s , first , last + 1 ) |
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 rec loop i = if i > max_idx then ( s , start , i ) else if sat ( string_unsafe_get s i ) then loop ( i + 1 ) else ( s , start , i ) in loop stop |
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 , stop ) else if sat ( string_unsafe_get s i ) then loop ( i - 1 ) else ( s , i + 1 , stop ) in loop ( start - 1 ) |
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 = if i < min_idx then ( s , start , min_idx ) else if sat ( string_unsafe_get s i ) then loop ( i - 1 ) else ( s , start , i + 1 ) in loop ( stop - 1 ) |
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_idx then max_idx else i in let rec loop i = if i > max_idx then ( s , i , stop ) else if sat ( string_unsafe_get s i ) then loop ( i + 1 ) else ( s , i , stop ) in loop start |
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 , start , stop ) |
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_unsafe_blit_string s1 start1 b l0 l1 ; ( bytes_unsafe_to_string b , 0 , len ) |
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 = 0 then l else let max_sep_count = Sys . max_string_length / sep_len in if sep_count < 0 || sep_count > max_sep_count then - 1 else sep_count * sep_len + l in let cat_len = cat_len 0 sub_len ss in if cat_len < 0 then invalid_arg Astring_base . err_max_string_len else let b = Bytes . create cat_len in bytes_unsafe_blit_string s start b 0 sub_len ; let rec loop i = function | [ ] -> bytes_unsafe_to_string b | ( str , str_start , _ as str_sub ) :: ss -> let sep_pos = i in let str_pos = i + sep_len in let str_len = length str_sub in bytes_unsafe_blit_string sep sep_start b sep_pos sep_len ; bytes_unsafe_blit_string str str_start b str_pos str_len ; loop ( str_pos + str_len ) ss in ( loop sub_len ss , 0 , cat_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 + i ) <> sunsafe_get s ( sstart + i ) then false else loop ( i + 1 ) in loop 0 |
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 false else if k > max_zidx_a then true else if k > 0 then if sunsafe_get affix ( astart + k ) = sunsafe_get s ( sstart + i + k ) then loop i ( k + 1 ) else loop ( i + 1 ) 0 else if sunsafe_get affix astart = sunsafe_get s ( sstart + i ) then loop i 1 else loop ( i + 1 ) 0 in loop 0 0 |
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 i > max_zidx then true else if sunsafe_get affix ( max_idx_a - i ) <> sunsafe_get s ( max_idx_s - i ) then false else loop ( i + 1 ) in loop 0 |
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 else if sunsafe_get s0 ( start0 + i ) <> sunsafe_get s1 ( start1 + i ) then false else loop ( i + 1 ) in loop 0 |
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 > max_i then compare len0 len1 else let c0 = sunsafe_get s0 ( start0 + i ) in let c1 = sunsafe_get s1 ( start1 + i ) in let cmp = compare c0 c1 in if cmp <> 0 then cmp else loop ( i + 1 ) in loop 0 |
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 ) | first when first > max_idx -> ( s , stop , stop ) | first -> ( s , start + first , start + first ) in if len = 0 then empty first else let last = match len with | len when len = max_int -> max_idx | len -> let last = first + len - 1 in 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 > last then empty first else ( s , start + first , start + last + 1 ) |
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 + first , start + first ) 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 > last then empty first else ( s , start + first , start + last + 1 ) |
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 + 1 ) else i in let rec right_pos i = if i < start then start else if drop ( sunsafe_get s i ) then right_pos ( i - 1 ) else ( i + 1 ) in let left = left_pos start in if left = max_pos then ( s , ( start + stop ) / 2 , ( start + stop ) / 2 ) else let right = right_pos max_idx in if left = start && right = max_pos then sub else ( s , left , right ) |
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 = stop - 1 in let max_idx = let k = start + max - 1 in ( if k > max_idx || k < 0 then max_idx else k ) in let need_idx = start + min in let rec loop i = if i <= max_idx && sat ( sunsafe_get s i ) then loop ( i + 1 ) else if i < need_idx || i = 0 then ( ( s , start , start ) , sub ) else if i = stop then ( sub , ( s , stop , stop ) ) else ( s , start , i ) , ( s , i , stop ) in loop start |
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 = stop - 1 in let min_idx = let k = stop - max in if k < start then start else k in let need_idx = stop - min - 1 in let rec loop i = if i >= min_idx && sat ( sunsafe_get s i ) then loop ( i - 1 ) else if i > need_idx || i = max_idx then ( sub , ( s , stop , stop ) ) else if i = start - 1 then ( ( s , start , start ) , sub ) else ( s , start , i + 1 ) , ( s , i + 1 , stop ) in loop max_idx |
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 then Some ( ( s , start , i ) , ( s , i + sep_len , stop ) ) else if sunsafe_get s ( i + k ) = sunsafe_get sep ( sep_start + k ) then check_sep i ( k + 1 ) else scan ( i + 1 ) and scan i = if i > max_s_idx then None else if sunsafe_get s i = sunsafe_get sep sep_start then check_sep i 1 else scan ( i + 1 ) in scan start |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.