blob: f92548872c3955e8697f767a4595925f510d54ec (
plain)
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
|
type 'a vyconf_tree = {
name: string;
data: 'a;
children: 'a vyconf_tree list
}
type 'a t = 'a vyconf_tree
exception Empty_path
exception Duplicate_child
exception Nonexistent_path
let make name data = { name = name; data = data; children = [] }
let make_full name data children = { name = name; data = data; children = children }
let name_of_node node = node.name
let data_of_node node = node.data
let children_of_node node = node.children
let insert_immediate node name data =
let new_node = make name data in
let children' = node.children @ [new_node] in
{ node with children = children' }
let delete_immediate node name =
let children' = Vylist.remove (fun x -> x.name = name) node.children in
{ node with children = children' }
let adopt node child =
{ node with children = (node.children @ [child]) }
let replace node child =
let children = node.children in
let name = child.name in
let children' = Vylist.replace (fun x -> x.name = name) child children in
{ node with children = children' }
let find node name =
Vylist.find (fun x -> x.name = name) node.children
let find_or_fail node name =
let child = find node name in
match child with
| None -> raise Nonexistent_path
| Some child' -> child'
let list_children node =
List.map (fun x -> x.name) node.children
let rec insert default_data node path data =
match path with
| [] -> raise Empty_path
| [name] ->
begin
(* Check for duplicate item *)
let last_child = find node name in
match last_child with
| None -> insert_immediate node name data
| (Some _) -> raise Duplicate_child
end
| name :: names ->
let next_child = find node name in
match next_child with
| Some next_child' ->
let new_node = insert default_data next_child' names data in
replace node new_node
| None ->
let next_child' = make name default_data in
let new_node = insert default_data next_child' names data in
adopt node new_node
let rec delete node path =
match path with
| [] -> raise Empty_path
| [name] -> delete_immediate node name
| name :: names ->
let next_child = find_or_fail node name in
let new_node = delete next_child names in
replace node new_node
let rec get node path =
match path with
| [] -> raise Empty_path
| [name] -> find_or_fail node name
| name :: names -> get (find_or_fail node name) names
|
