mirror of
https://github.com/CatalaLang/catala.git
synced 2024-11-08 07:51:43 +03:00
403156b36e
This includes a few separate changes:
- pass visibility information of declarations (depending on wether the
declaration was in a ```catala-metadata block or not)
- add reasonable hash computation functions to discriminate the interfaces. In
particular:
* Uids have a `hash` function that depends on their string, but not on their
actual uid (which is not stable between runs of the compiler) ; the existing
`hash` function and its uses have been renamed to `id`.
* The `Hash` module provides the tools to properly combine hashes, etc. While
we rely on `Hashtbl.hash` for the atoms, we take care not to use it on any
recursive structure (it relies on a bounded traversal).
- insert the hashes in the artefacts, and properly check and report those (for
OCaml)
**Remains to do**:
- Record and check the hashes in the other backends
- Provide a way to get stable inline-test outputs in the presence of module
hashes
- Provide a way to write external modules that don't break at every Catala
update.
80 lines
2.4 KiB
OCaml
80 lines
2.4 KiB
OCaml
(* This file is part of the Catala compiler, a specification language for tax
|
|
and social benefits computation rules. Copyright (C) 2020 Inria,
|
|
contributors: Denis Merigoux <denis.merigoux@inria.fr>, Louis Gesbert
|
|
<louis.gesbert@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 ('a, 'm) ed = 'a * 'm
|
|
type 'a pos = ('a, Pos.t) ed
|
|
|
|
let add m e = e, m
|
|
let remove (x, _) = x
|
|
let get (_, m) = m
|
|
let set m (x, _) = x, m
|
|
let map f (x, m) = f x, m
|
|
let map_mark f (a, m) = a, f m
|
|
let copy (_, m) x = x, m
|
|
let fold f (x, _) = f x
|
|
let fold2 f (x, _) (y, _) = f x y
|
|
let compare cmp a b = fold2 cmp a b
|
|
let equal eq a b = fold2 eq a b
|
|
let hash f (x, _) = f x
|
|
|
|
class ['self] marked_map =
|
|
object (_self : 'self)
|
|
constraint
|
|
'self = < visit_marked :
|
|
'a. ('env -> 'a -> 'a) -> 'env -> ('a, 'm) ed -> ('a, 'm) ed
|
|
; .. >
|
|
|
|
method visit_marked
|
|
: 'a. ('env -> 'a -> 'a) -> 'env -> ('a, 'm) ed -> ('a, 'm) ed =
|
|
fun f env (x, m) -> f env x, m
|
|
end
|
|
|
|
class ['self] marked_iter =
|
|
object (_self : 'self)
|
|
constraint
|
|
'self = < visit_marked :
|
|
'a. ('env -> 'a -> unit) -> 'env -> ('a, 'm) ed -> unit
|
|
; .. >
|
|
|
|
method visit_marked
|
|
: 'a. ('env -> 'a -> unit) -> 'env -> ('a, 'm) ed -> unit =
|
|
fun f env (x, _) -> f env x
|
|
end
|
|
|
|
class ['self] pos_map =
|
|
object (_self : 'self)
|
|
constraint
|
|
'self = < visit_pos :
|
|
'a. ('env -> 'a -> 'a) -> 'env -> ('a, 'm) ed -> ('a, 'm) ed
|
|
; .. >
|
|
|
|
method visit_pos
|
|
: 'a. ('env -> 'a -> 'a) -> 'env -> ('a, 'm) ed -> ('a, 'm) ed =
|
|
fun f env (x, m) -> f env x, m
|
|
end
|
|
|
|
class ['self] pos_iter =
|
|
object (_self : 'self)
|
|
constraint
|
|
'self = < visit_pos :
|
|
'a. ('env -> 'a -> unit) -> 'env -> ('a, 'm) ed -> unit
|
|
; .. >
|
|
|
|
method visit_pos : 'a. ('env -> 'a -> unit) -> 'env -> ('a, 'm) ed -> unit =
|
|
fun f env (x, _) -> f env x
|
|
end
|