blob: e3f68d9985b1550e2abe8093c1691dda688f7f3b (
plain) (
blame)
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
|
(** Merkle tree module signature for content-addressed hash sets.
This is an opaque interface that can be backed by different implementations:
- A simple hash set (current placeholder)
- A proper radix/patricia merkle tree (e.g., plebeia when OCaml 5 support arrives)
The tree stores hashes as keys (like a set) and computes a root hash
from all contained elements. *)
module type S = sig
type t
(** The empty tree *)
val empty : t
(** Check if tree is empty *)
val is_empty : t -> bool
(** Insert a hash into the tree. Returns a new tree. *)
val insert : Conventions.Hash.t -> t -> t
(** Delete a hash from the tree. Returns a new tree. *)
val delete : Conventions.Hash.t -> t -> t
(** Check if a hash is in the tree *)
val member : Conventions.Hash.t -> t -> bool
(** Get all hashes in the tree *)
val keys : t -> Conventions.Hash.t list
(** Compute the root hash of the tree. None if empty. *)
val root_hash : t -> Conventions.Hash.t option
(** Number of elements in the tree *)
val size : t -> int
end
(** Simple hash set implementation.
This is a placeholder until a proper radix-merkle library
with OCaml 5 support becomes available. *)
module HashSet : S = struct
module StringSet = Set.Make(String)
type t = StringSet.t
let empty = StringSet.empty
let is_empty = StringSet.is_empty
let insert hash tree = StringSet.add hash tree
let delete hash tree = StringSet.remove hash tree
let member hash tree = StringSet.mem hash tree
let keys tree = StringSet.elements tree
let root_hash tree =
if StringSet.is_empty tree then
None
else
(* Compute root hash by hashing sorted concatenation of all hashes *)
let sorted_hashes = StringSet.elements tree in
let concatenated = String.concat "" sorted_hashes in
Some (Conventions.Hash.hash_text concatenated)
let size = StringSet.cardinal
end
(** Default implementation using HashSet *)
include HashSet
|
