/
FileUtilSize.ml
150 lines (137 loc) · 4.44 KB
/
FileUtilSize.ml
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
(******************************************************************************)
(* ocaml-fileutils: files and filenames common operations *)
(* *)
(* Copyright (C) 2003-2014, Sylvain Le Gall *)
(* *)
(* This library is free software; you can redistribute it and/or modify it *)
(* under the terms of the GNU Lesser General Public License as published by *)
(* the Free Software Foundation; either version 2.1 of the License, or (at *)
(* your option) any later version, with the OCaml static compilation *)
(* exception. *)
(* *)
(* This library is distributed in the hope that it will be useful, but *)
(* WITHOUT ANY WARRANTY; without even the implied warranty of *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the file *)
(* COPYING for more details. *)
(* *)
(* You should have received a copy of the GNU Lesser General Public License *)
(* along with this library; if not, write to the Free Software Foundation, *)
(* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA *)
(******************************************************************************)
open FileUtilTypes
let byte_of_size sz =
let rec mul_1024 n i =
if n > 0 then
mul_1024
(n - 1)
(Int64.mul 1024L i)
else
i
in
match sz with
| B i -> i
| KB i -> mul_1024 1 i
| MB i -> mul_1024 2 i
| GB i -> mul_1024 3 i
| TB i -> mul_1024 4 i
let size_add sz1 sz2 =
B (Int64.add (byte_of_size sz1) (byte_of_size sz2))
let size_compare ?(fuzzy=false) sz1 sz2 =
let by1 =
byte_of_size sz1
in
let by2 =
byte_of_size sz2
in
if fuzzy then begin
let rec fuzzy_comp n1 n2 =
if n1 = n2 then
0
else begin
let up_unit_n1 =
Int64.div n1 1024L
in
let up_unit_n2 =
Int64.div n2 1024L
in
if up_unit_n1 <> 0L && up_unit_n2 <> 0L then
fuzzy_comp up_unit_n1 up_unit_n2
else
Int64.compare n1 n2
end
in
fuzzy_comp by1 by2
end else
Int64.compare by1 by2
let string_of_size ?(fuzzy=false) sz =
let szstr i unt (cur_i, cur_unt, tl) =
let tl =
(cur_i, cur_unt) :: tl
in
i, unt, tl
in
let rec decomp_continue fup i unt acc =
if i = 0L then
szstr i unt acc
else begin
(* Continue with upper unit *)
let r =
Int64.rem i 1024L
in
let q =
Int64.div i 1024L
in
decomp_start (szstr r unt acc) (fup q)
end
and decomp_start acc sz =
(* Decompose size for current unit and try
* to use upper unit
*)
match sz with
| TB i ->
szstr i "TB" acc
| GB i ->
decomp_continue (fun n -> TB n) i "GB" acc
| MB i ->
decomp_continue (fun n -> GB n) i "MB" acc
| KB i ->
decomp_continue (fun n -> MB n) i "KB" acc
| B i ->
decomp_continue (fun n -> KB n) i "B" acc
in
(* Only accumulate significant unit in tail *)
let only_significant_unit (cur_i, cur_unt, lst) =
let significant_lst =
List.filter
(fun (i, _) -> i <> 0L)
((cur_i, cur_unt) :: lst)
in
match significant_lst with
| [] -> cur_i, cur_unt, []
| (cur_i, cur_unt) :: tl -> (cur_i, cur_unt, tl)
in
let main_i, main_unt, rem_lst =
only_significant_unit (decomp_start (0L, "B", []) sz)
in
if fuzzy then begin
let _, rem =
List.fold_left
(fun (div, acc) (i, _unt) ->
let acc =
acc +. ((Int64.to_float i) /. div)
in
div *. 1024.0,
acc)
(1024.0, 0.0)
rem_lst
in
Printf.sprintf "%.2f %s"
((Int64.to_float main_i) +. rem)
main_unt
end else begin
String.concat
" "
(List.map
(fun (i, unt) -> Printf.sprintf "%Ld %s" i unt)
((main_i, main_unt) :: rem_lst))
end