Debian Codegraph @

ocaml-lib/num_impl_num/rational_impl.ml

raw
1 module QI = struct
2 type t = Num.num
3
4 let of_int = Num.num_of_int
5 let of_ints x y = Num.div_num (of_int x) (of_int y)
6 let of_big_int = Num.num_of_big_int
7
8 let add = Num.add_num
9 let sub = Num.sub_num
10 let mul = Num.mult_num
11 let div = Num.div_num
12 let neg = Num.minus_num
13 let abs = Num.abs_num
14
15 let equal = Num.eq_num
16 let lt = Num.lt_num
17 let gt = Num.gt_num
18 let leq = Num.le_num
19 let geq = Num.ge_num
20 let min = Num.min_num
21 let max = Num.max_num
22 let floor x = Num.big_int_of_num (Num.floor_num x)
23 let ceiling x = Num.big_int_of_num (Num.ceiling_num x)
24 let num = function
25 | Num.Int i -> Big_int.big_int_of_int i
26 | Num.Big_int i -> i
27 | Num.Ratio r -> Ratio.numerator_ratio r
28 let den = function
29 | Num.Int i -> Big_int.unit_big_int
30 | Num.Big_int i -> Big_int.unit_big_int
31 | Num.Ratio r -> Ratio.denominator_ratio r
32 end