package catala
Low-level language for tax code specification
Install
Dune Dependency
Authors
Maintainers
Sources
0.3.0.tar.gz
md5=4a2c5495f30d8fc2e3bf977df6e602f9
sha512=8dcc404b6068b9dbd76982ade60d8fba1950fdd0a8a626db17429120483367dce1f51997e96d7b8ee5308f305c3bcbb897ef85336f25e9ef3681f4cb9237f56a
doc/src/catala.runtime/runtime.ml.html
Source file runtime.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 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255
(* This file is part of the Catala compiler, a specification language for tax and social benefits computation rules. Copyright (C) 2020 Inria, contributor: Denis Merigoux <denis.merigoux@inria.fr> Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. *) type money = Z.t type integer = Z.t type decimal = Q.t type date = CalendarLib.Date.t type duration = CalendarLib.Date.Period.t exception EmptyError exception NoValueProvided exception AssertionFailed exception ConflictError exception UncomparableDurations exception ImpossibleDate let money_of_cents_string (cents : string) : money = Z.of_string cents let money_of_units_int (units : int) : money = Z.(of_int units * of_int 100) let money_of_cents_integer (cents : integer) : money = cents let money_to_float (m : money) : float = Z.to_float m /. 100. let money_to_string (m : money) : string = Format.asprintf "%.2f" Q.(to_float (of_bigint m / of_int 100)) let money_to_cents m = m let decimal_of_string (d : string) : decimal = Q.of_string d let decimal_to_float (d : decimal) : float = Q.to_float d let decimal_of_float (d : float) : decimal = Q.of_float d let decimal_of_integer (d : integer) : decimal = Q.of_bigint d let decimal_to_string ~(max_prec_digits : int) (i : decimal) : string = let sign = Q.sign i in let n = Z.abs (Q.num i) in let d = Z.abs (Q.den i) in let int_part = Z.ediv n d in let n = ref (Z.erem n d) in let digits = ref [] in let leading_zeroes (digits : Z.t list) : int = match List.fold_right (fun digit num_leading_zeroes -> match num_leading_zeroes with | `End _ -> num_leading_zeroes | `Begin i -> if Z.(digit = zero) then `Begin (i + 1) else `End i) digits (`Begin 0) with | `End i -> i | `Begin i -> i in while !n <> Z.zero && List.length !digits - leading_zeroes !digits < max_prec_digits do n := Z.mul !n (Z.of_int 10); digits := Z.ediv !n d :: !digits; n := Z.erem !n d done; Format.asprintf "%s%a.%a%s" (if sign < 0 then "-" else "") Z.pp_print int_part (Format.pp_print_list ~pp_sep:(fun _fmt () -> ()) (fun fmt digit -> Format.fprintf fmt "%a" Z.pp_print digit)) (List.rev !digits) (if List.length !digits - leading_zeroes !digits = max_prec_digits then "…" else "") let integer_of_string (i : string) : integer = Z.of_string i let integer_to_string (i : integer) : string = Z.to_string i let integer_to_int (i : integer) : int = Z.to_int i let integer_of_int (i : int) : integer = Z.of_int i let integer_exponentiation (i : integer) (e : int) : integer = Z.pow i e let integer_log2 = Z.log2 let year_of_date (d : date) : integer = Z.of_int (CalendarLib.Date.year d) let month_number_of_date (d : date) : integer = Z.of_int (CalendarLib.Date.int_of_month (CalendarLib.Date.month d)) let day_of_month_of_date (d : date) : integer = Z.of_int (CalendarLib.Date.day_of_month d) let date_of_numbers (year : int) (month : int) (day : int) : date = try CalendarLib.Date.make year month day with _ -> raise ImpossibleDate let date_to_string (d : date) : string = CalendarLib.Printer.Date.to_string d let duration_of_numbers (year : int) (month : int) (day : int) : duration = CalendarLib.Date.Period.make year month day let duration_to_string (d : duration) : string = let x, y, z = CalendarLib.Date.Period.ymd d in let to_print = List.filter (fun (a, _) -> a <> 0) [ (x, "years"); (y, "months"); (z, "days") ] in match to_print with | [] -> "empty duration" | _ -> Format.asprintf "%a" (Format.pp_print_list ~pp_sep:(fun fmt () -> Format.fprintf fmt ",@ ") (fun fmt (d, l) -> Format.fprintf fmt "%d %s" d l)) to_print let duration_to_days_months_years (d : duration) : int * int * int = CalendarLib.Date.Period.ymd d let handle_default : 'a. (unit -> 'a) array -> (unit -> bool) -> (unit -> 'a) -> 'a = fun exceptions just cons -> let except = Array.fold_left (fun acc except -> let new_val = try Some (except ()) with EmptyError -> None in match (acc, new_val) with | None, _ -> new_val | Some _, None -> acc | Some _, Some _ -> raise ConflictError) None exceptions in match except with Some x -> x | None -> if just () then cons () else raise EmptyError let no_input : unit -> 'a = fun _ -> raise EmptyError let ( *$ ) (i1 : money) (i2 : decimal) : money = let rat_result = Q.mul (Q.of_bigint i1) i2 in let res, remainder = Z.div_rem (Q.num rat_result) (Q.den rat_result) in (* we perform nearest rounding when multiplying an amount of money by a decimal !*) if Z.(of_int 2 * remainder >= Q.den rat_result) then Z.add res (Z.of_int 1) else res let ( /$ ) (i1 : money) (i2 : money) : decimal = if i2 <> Z.zero then Q.div (Q.of_bigint i1) (Q.of_bigint i2) else raise Division_by_zero let ( +$ ) (i1 : money) (i2 : money) : money = Z.add i1 i2 let ( -$ ) (i1 : money) (i2 : money) : money = Z.sub i1 i2 let ( ~-$ ) (i1 : money) : money = Z.sub Z.zero i1 let ( +! ) (i1 : integer) (i2 : integer) : integer = Z.add i1 i2 let ( -! ) (i1 : integer) (i2 : integer) : integer = Z.sub i1 i2 let ( ~-! ) (i1 : integer) : integer = Z.sub Z.zero i1 let ( *! ) (i1 : integer) (i2 : integer) : integer = Z.mul i1 i2 let ( /! ) (i1 : integer) (i2 : integer) : integer = if i2 <> Z.zero then Z.div i1 i2 else raise Division_by_zero let ( +& ) (i1 : decimal) (i2 : decimal) : decimal = Q.add i1 i2 let ( -& ) (i1 : decimal) (i2 : decimal) : decimal = Q.sub i1 i2 let ( ~-& ) (i1 : decimal) : decimal = Q.sub Q.zero i1 let ( *& ) (i1 : decimal) (i2 : decimal) : decimal = Q.mul i1 i2 let ( /& ) (i1 : decimal) (i2 : decimal) : decimal = if i2 <> Q.zero then Q.div i1 i2 else raise Division_by_zero let ( +@ ) (d1 : date) (d2 : duration) : date = CalendarLib.Date.add d1 d2 let ( -@ ) (d1 : date) (d2 : date) : duration = CalendarLib.Date.sub d1 d2 let ( +^ ) (d1 : duration) (d2 : duration) : duration = CalendarLib.Date.Period.add d1 d2 let ( -^ ) (d1 : duration) (d2 : duration) : duration = CalendarLib.Date.Period.sub d1 d2 let ( <=$ ) (m1 : money) (m2 : money) : bool = Z.compare m1 m2 <= 0 let ( >=$ ) (m1 : money) (m2 : money) : bool = Z.compare m1 m2 >= 0 let ( <$ ) (m1 : money) (m2 : money) : bool = Z.compare m1 m2 < 0 let ( >$ ) (m1 : money) (m2 : money) : bool = Z.compare m1 m2 > 0 let ( =$ ) (m1 : money) (m2 : money) : bool = Z.compare m1 m2 = 0 let ( >=! ) (i1 : integer) (i2 : integer) : bool = Z.compare i1 i2 >= 0 let ( <=! ) (i1 : integer) (i2 : integer) : bool = Z.compare i1 i2 <= 0 let ( >! ) (i1 : integer) (i2 : integer) : bool = Z.compare i1 i2 > 0 let ( <! ) (i1 : integer) (i2 : integer) : bool = Z.compare i1 i2 < 0 let ( =! ) (i1 : integer) (i2 : integer) : bool = Z.compare i1 i2 = 0 let ( >=& ) (i1 : decimal) (i2 : decimal) : bool = Q.compare i1 i2 >= 0 let ( <=& ) (i1 : decimal) (i2 : decimal) : bool = Q.compare i1 i2 <= 0 let ( >& ) (i1 : decimal) (i2 : decimal) : bool = Q.compare i1 i2 > 0 let ( <& ) (i1 : decimal) (i2 : decimal) : bool = Q.compare i1 i2 < 0 let ( =& ) (i1 : decimal) (i2 : decimal) : bool = Q.compare i1 i2 = 0 let ( >=@ ) (d1 : date) (d2 : date) : bool = CalendarLib.Date.compare d1 d2 >= 0 let ( <=@ ) (d1 : date) (d2 : date) : bool = CalendarLib.Date.compare d1 d2 <= 0 let ( >@ ) (d1 : date) (d2 : date) : bool = CalendarLib.Date.compare d1 d2 > 0 let ( <@ ) (d1 : date) (d2 : date) : bool = CalendarLib.Date.compare d1 d2 < 0 let ( =@ ) (d1 : date) (d2 : date) : bool = CalendarLib.Date.compare d1 d2 = 0 let compare_periods (p1 : CalendarLib.Date.Period.t) (p2 : CalendarLib.Date.Period.t) : int = try let p1_days = CalendarLib.Date.Period.nb_days p1 in let p2_days = CalendarLib.Date.Period.nb_days p2 in compare p1_days p2_days with CalendarLib.Date.Period.Not_computable -> raise UncomparableDurations let ( >=^ ) (d1 : duration) (d2 : duration) : bool = compare_periods d1 d2 >= 0 let ( <=^ ) (d1 : duration) (d2 : duration) : bool = compare_periods d1 d2 <= 0 let ( >^ ) (d1 : duration) (d2 : duration) : bool = compare_periods d1 d2 > 0 let ( <^ ) (d1 : duration) (d2 : duration) : bool = compare_periods d1 d2 < 0 let ( =^ ) (d1 : duration) (d2 : duration) : bool = compare_periods d1 d2 = 0 let ( ~-^ ) (d1 : duration) : duration = CalendarLib.Date.Period.opp d1 let array_filter (f : 'a -> bool) (a : 'a array) : 'a array = Array.of_list (List.filter f (Array.to_list a)) let array_length (a : 'a array) : integer = Z.of_int (Array.length a)
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>