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
|
open Util
module Make =
functor (X : Set.OrderedType) ->
functor (Y : Map.OrderedType) ->
functor (Z : Map.OrderedType) ->
struct
module Y_tries = struct
type t = (Y.t * int) option
let compare x y =
match x,y with
None,None -> 0
| Some (l,n),Some (l',n') ->
let m = Y.compare l l' in
if Int.equal m 0 then
n-n'
else m
| Some(l,n),None -> 1
| None, Some(l,n) -> -1
end
module XZOrd = struct
type t = X.t * Z.t
let compare (x1,x2) (y1,y2) =
let m = (X.compare x1 y1) in
if Int.equal m 0 then (Z.compare x2 y2) else
m
end
module XZ = Set.Make(XZOrd)
module X_tries =
struct
type t = XZ.t
let nil = XZ.empty
let is_nil = XZ.is_empty
let add = XZ.union
let sub = XZ.diff
end
module Trie = Trie.Make(Y_tries)(X_tries)
type decompose_fun = X.t -> (Y.t * X.t list) option
type 'res lookup_res = Label of 'res | Nothing | Everything
type 'tree lookup_fun = 'tree -> (Y.t * 'tree list) lookup_res
type t = Trie.t
let create () = Trie.empty
(* [path_of dna pat] returns the list of nodes of the pattern [pat] read in
prefix ordering, [dna] is the function returning the main node of a pattern *)
let path_of dna =
let rec path_of_deferred = function
| [] -> []
| h::tl -> pathrec tl h
and pathrec deferred t =
match dna t with
| None ->
None :: (path_of_deferred deferred)
| Some (lbl,[]) ->
(Some (lbl,0))::(path_of_deferred deferred)
| Some (lbl,(h::def_subl as v)) ->
(Some (lbl,List.length v))::(pathrec (def_subl@deferred) h)
in
pathrec []
let tm_of tm lbl =
try [Trie.next tm lbl, true] with Not_found -> []
let rec skip_arg n tm =
if Int.equal n 0 then [tm, true]
else
let labels = Trie.labels tm in
let map lbl = match lbl with
| None -> skip_arg (pred n) (Trie.next tm lbl)
| Some (_, m) ->
skip_arg (pred n + m) (Trie.next tm lbl)
in
List.flatten (List.map map labels)
let lookup tm dna t =
let rec lookrec t tm =
match dna t with
| Nothing -> tm_of tm None
| Label(lbl,v) ->
tm_of tm None@
(List.fold_left
(fun l c ->
List.flatten(List.map (fun (tm, b) ->
if b then lookrec c tm
else [tm,b]) l))
(tm_of tm (Some(lbl,List.length v))) v)
| Everything -> skip_arg 1 tm
in
List.flatten (List.map (fun (tm,b) -> XZ.elements (Trie.get tm)) (lookrec t tm))
let add tm dna (pat,inf) =
let p = path_of dna pat in Trie.add p (XZ.singleton (pat, inf)) tm
let rmv tm dna (pat,inf) =
let p = path_of dna pat in Trie.remove p (XZ.singleton (pat, inf)) tm
let app f tm = Trie.iter (fun _ p -> XZ.iter f p) tm
end
|
