mirror of
https://github.com/c-cube/sidekick.git
synced 2025-12-11 21:48:50 -05:00
1d5c1c187c
- basic types, including terms and nodes (internalized terms) - congruence closure - utils
39 lines
776 B
OCaml
39 lines
776 B
OCaml
|
|
(* This file is free software. See file "license" for more details. *)
|
|
|
|
type 'a t = 'a -> int
|
|
|
|
let bool b = if b then 1 else 2
|
|
|
|
let int i = i land max_int
|
|
|
|
let string (s:string) = Hashtbl.hash s
|
|
|
|
let combine f a b = Hashtbl.seeded_hash a (f b)
|
|
|
|
let combine2 a b = Hashtbl.seeded_hash a b
|
|
|
|
let combine3 a b c =
|
|
combine2 a b
|
|
|> combine2 c
|
|
|
|
let combine4 a b c d =
|
|
combine2 a b
|
|
|> combine2 c
|
|
|> combine2 d
|
|
|
|
let pair f g (x,y) = combine2 (f x) (g y)
|
|
|
|
let opt f = function
|
|
| None -> 42
|
|
| Some x -> combine2 43 (f x)
|
|
|
|
let list f l = List.fold_left (combine f) 0x42 l
|
|
let array f = Array.fold_left (combine f) 0x43
|
|
let iarray f = IArray.fold (combine f) 0x44
|
|
let seq f seq =
|
|
let h = ref 0x43 in
|
|
seq (fun x -> h := combine f !h x);
|
|
!h
|
|
|
|
let poly x = Hashtbl.hash x
|