forked from pikatchu/jsonpat
-
Notifications
You must be signed in to change notification settings - Fork 0
/
jsonpatAst.ml
167 lines (142 loc) · 4.41 KB
/
jsonpatAst.ml
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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
(*
Copyright (c) 2010, Mylife.com
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the
distribution.
3. Neither the name of Mylife.com nor the names of
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*)
open JsonpatUtil
(* Operators *)
type bop =
| Plus | Minus | Mult | Div (* Arithmetics *)
| Eq | Diff | Lt | Gt | Lte | Gte (* Comparisons *)
| Seq | As | Bar | Dot | Cons
| Apply | Def | And | Or
type type_ =
| Tint | Tbool | Tfloat
| Tstring | Tobject | Tarray | Tany
type 'a prim =
| Group
| Flatten
| Fold of 'a
| Filter of 'a
| Drop of 'a
| Head of 'a
type flow = value JsonpatFlow.t
and value =
| Null
| Pfailed
| Bool of bool
| Float of float
| Int of Big_int.big_int
| String of string
| Prim of value prim
| Closure of (value -> value)
| Flow of flow
| Array of value list
| Tuple of value list
| Variant of string * value
| Object of value SMap.t
and expr =
| Any
| Enull
| Ebool of bool
| Efloat of float
| Eint of Big_int.big_int
| Estring of string
| Eprim of expr prim
| Eflow of value JsonpatFlow.t
| Type of type_
| Id of string
| When of expr * expr
| Arrow of expr * expr
| Semi of expr * expr
| Binop of bop * expr * expr
| Earray of expr list
| Etuple of expr list
| Evariant of string * expr
| Eobject of field list
and field =
| Fname of string
| Field of bool * string * expr
type t = value
let get_type = function
| Bool _ -> Tbool
| Float _ -> Tfloat
| Int _ -> Tint
| String _ -> Tstring
| Array _ -> Tarray
| Object _ -> Tobject
| _ -> Tany
let rec add_left x = function
| Binop (Seq, z, t) -> Binop (Seq, add_left x z, t)
| Semi (eq, y) -> Semi (eq, add_left x y)
| y -> Binop (Seq, x, y)
let rec compare_list f l1 l2 =
match l1, l2 with
| [], [] -> 0
| [], _ -> -1
| _, [] -> 1
| x1 :: rl1, x2 :: rl2 ->
let c = f x1 x2 in
if c = 0
then compare_list f rl1 rl2
else c
let rec compare v1 v2 =
match v1, v2 with
| Array x, Array y -> compare_list compare x y
| Object x, Object y -> compare_list compare_fields (elements x) (elements y)
| Int n1, Int n2 -> Big_int.compare_big_int n1 n2
| Int _, _ -> -1
| _, Int _ -> 1
| x, y -> Pervasives.compare x y
and compare_fields (s1, v1) (s2, v2) =
let c = String.compare s1 s2 in
if c = 0
then compare v1 v2
else c
let env = ref SMap.empty
let register name f = env := SMap.add name (Closure f) !env
let list_of_record o acc =
SMap.fold (fun x y acc -> Array [String x ; y] :: acc) o acc
let rec all_values acc = function
| Null
| Pfailed -> acc
| Bool _
| Float _
| Int _
| String _ as x -> x :: acc
| Prim _
| Closure _
| Flow _ -> acc
| Array l
| Tuple l -> List.fold_left all_values acc l
| Variant (_,v) -> all_values acc v
| Object v -> SMap.fold (fun _ x acc -> all_values acc x) v acc
let () = register "lor"
(function Object x -> Array (list_of_record x []) | x -> x)
let () = register "values" (fun x -> Array (all_values [] x))
let () = register "map"
(function
| Array [Closure f; Array l] -> Array (List.map f l)
| _ -> Null)