1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
module Set = Set.Make (String)
module Map = Map.Make (String)
let split delim ?(dup = true) ?(limit = max_int) path =
let l = String.length path in
let rec do_slashes acc limit i =
if i >= l then List.rev acc
else if path.[i] = delim then
if dup then do_slashes acc limit (i + 1) else do_split acc limit (i + 1)
else do_split acc limit i
and do_split acc limit i =
if limit <= 0 then
if i = l then List.rev acc
else List.rev (String.sub path i (l - i) :: acc)
else do_component acc (pred limit) i i
and do_component acc limit i j =
if j >= l then
if i = j then List.rev acc
else List.rev (String.sub path i (j - i) :: acc)
else if path.[j] = delim then
do_slashes (String.sub path i (j - i) :: acc) limit j
else do_component acc limit i (j + 1)
in
if limit > 0 then do_slashes [] limit 0 else [path]
let split_path path = split '/' path
let has_prefix ~prefix s =
let x = String.length prefix in
let n = String.length s in
n >= x && String.sub s 0 x = prefix
let remove_prefix ~prefix s =
let x = String.length prefix in
let n = String.length s in
if n >= x && String.sub s 0 x = prefix then Some (String.sub s x (n - x))
else None
let common_prefix s1 s2 =
let last = min (String.length s1) (String.length s2) in
let rec loop i =
if last <= i then last else if s1.[i] = s2.[i] then loop (i + 1) else i
in
loop 0
let mem_char s c = String.index_opt s c <> None
let fold_left f init s =
let acc = ref init in
String.iter (fun c -> acc := f !acc c) s ;
!acc
let pp_bytes_hex fmt bytes = Hex.(of_bytes bytes |> pp fmt)