-
Notifications
You must be signed in to change notification settings - Fork 0
/
data_processing_dsl.clj
302 lines (284 loc) · 14.9 KB
/
data_processing_dsl.clj
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
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
;;;
;;; Copyright 2015 Ruediger Gad
;;;
;;; This software is released under the terms of the Eclipse Public License
;;; (EPL) 1.0. You can find a copy of the EPL at:
;;; http://opensource.org/licenses/eclipse-1.0.php
;;;
(ns
^{:author "Ruediger Gad",
:doc "DSL for processing data"}
dsbdp.data-processing-dsl
(:require [dsbdp.byte-array-conversion :refer :all]
[clojure.pprint :refer :all]))
(def ^:dynamic *incremental-indicator-suffix* "#inc")
(defn- create-proc-sub-fn
"Create a sub part of a processing function.
The data-processing-definition will be processed recursively.
This function is responsible for actually resolving the given data processing functions.
The input symbol will be placed as first argument on the innermost terms."
[data-processing-definition input]
(into
'()
(reverse
(reduce
(fn [v data-proc-def-element]
(cond
(symbol? data-proc-def-element)
(let [s data-proc-def-element]
(cond
(or (= s 'nth) (= s 'get) (= s 'identity))
(conj v (ns-resolve 'clojure.core s) 'input)
(ns-resolve 'clojure.core s)
(conj v (ns-resolve 'clojure.core s))
(ns-resolve 'dsbdp.byte-array-conversion s)
(conj v (ns-resolve 'dsbdp.byte-array-conversion s) 'input)
:default
(do
(println "Warning: Could not resolve symbol:" s)
(println "Assuming" s "is intended as \"self-reference\".")
(conj v s))))
(list? data-proc-def-element)
(conj v (into '() (reverse (create-proc-sub-fn data-proc-def-element input))))
:default (conj v data-proc-def-element)))
[] data-processing-definition))))
(defn cond-rule-expr?
[rule-expression]
(and
(vector? rule-expression)
(every? list? (butlast (take-nth 2 rule-expression)))
(every?
vector?
(butlast
(take-nth
2
(rest rule-expression))))))
(defn prefix-rule-name
[rule-name nesting-level]
(if
(> 1 nesting-level)
rule-name
(symbol (str "__" nesting-level "_" rule-name))))
(declare create-let-expression)
(declare create-proc-fn)
(defn- create-bindings-vector
[input rules out-format-fn output nesting-level]
(reduce
(fn [v rule]
(let [rule-name (first rule)
rule-expression (second rule)]
(cond
(and
(list? rule-expression)
(every? vector? rule-expression)) (do
; (println "Creating looped processing for nested sequence...")
(let [seq-params (rule 2)
nested-expr-tmp (create-let-expression
input
(vec rule-expression)
out-format-fn
output
(inc nesting-level))
nested-expr-ret-tmp (last nested-expr-tmp)
nested-expr-ret [nested-expr-ret-tmp (prefix-rule-name '__offset-increment (inc nesting-level))]
nested-expr (into '() (reverse (assoc (vec nested-expr-tmp) (- (count nested-expr-tmp) 1) nested-expr-ret)))
loop-expr `(loop [~'offset (~seq-params :initial-offset) ~'result ~(out-format-fn)]
(let [~'tmp-result ~nested-expr
~'new-offset (+ ~'offset (second ~'tmp-result))
~'new-result ~(out-format-fn 'result '(first tmp-result))]
; (println "Nested seq step:" ~'new-offset "--" (count ~'input))
(if (< ~'new-offset (count ~'input))
(recur ~'new-offset ~'new-result)
~'new-result)))]
(conj v
(prefix-rule-name rule-name nesting-level)
loop-expr)))
(list? rule-expression) (conj v
(prefix-rule-name rule-name nesting-level)
(create-proc-sub-fn rule-expression input))
(and
(vector? rule-expression)
(every? vector? rule-expression)) (let [nested-expr (create-let-expression
input
rule-expression
out-format-fn
output
(inc nesting-level))]
(conj v (prefix-rule-name rule-name nesting-level) nested-expr))
(cond-rule-expr? rule-expression) (let [cond-expr (reduce
(fn [vect v]
(cond
(or (list? v)
(keyword? v)) (conj vect v)
(vector? v) (conj vect
(create-let-expression
input
v
out-format-fn
output
(inc nesting-level)))
:default (do
(println "Unknown rule expression part:" v)
vect)))
['clojure.core/cond]
rule-expression)]
(conj v (prefix-rule-name rule-name nesting-level) (into '() (reverse cond-expr))))
:default (println "Binding: unknown element for rule:" (str rule)))))
[]
rules))
(defn- create-let-expression
[input rules out-format-fn output nesting-level]
`(let
~(create-bindings-vector input rules out-format-fn output nesting-level)
~(reverse (into '() (out-format-fn rules output nesting-level)))))
(defn- java-out-format-fn
([]
`(java.util.ArrayList.))
([result-list new-result-value]
`(doto ~result-list (.add ~new-result-value)))
([rules output nesting-level]
(reduce
(fn [v rule]
(cond
(sequential? (second rule)) (conj v
`(.put
~(name (first rule))
~(prefix-rule-name (first rule) nesting-level)))
(cond-rule-expr? (second rule)) (conj v
`(.put ~(name (first rule))
~(prefix-rule-name (first rule) nesting-level)))
:default (println "Java Map Body: unknown element for rule:" (str rule))))
(if (nil? output)
'[doto (java.util.HashMap.)]
'[doto ^java.util.Map output])
rules)))
(defn- clj-out-format-fn
([]
[])
([result-vec new-result-value]
`(conj ~result-vec ~new-result-value))
([rules output nesting-level]
(reduce
(fn [v rule]
(cond
(sequential? (second rule)) (conj v
`(assoc
~(name (first rule))
~(prefix-rule-name (first rule) nesting-level)))
(cond-rule-expr? (second rule)) (conj v
`(assoc ~(name (first rule))
~(prefix-rule-name (first rule) nesting-level)))
:default (do (println "Clj Map Body: unknown element for rule:" (str rule))
;(throw (RuntimeException. "Clj Map Body: unknown element for rule"))
)))
(if (nil? output)
'[-> {}]
'[-> output])
rules)))
(defn- csv-str-out-format-fn
[rules output nesting-level]
(reduce
(fn [v rule]
(let [tmp-v (if (some #{:string} rule)
(conj v `(.append "\"") `(.append ~(first rule)) `(.append "\""))
(conj v `(.append ~(first rule))))]
(if (not= rule (last rules))
(conj tmp-v `(.append ","))
tmp-v)))
(if (nil? output)
'[doto (java.lang.StringBuilder.)]
'[doto ^java.lang.StringBuilder output])
rules))
(defn- json-str-out-format-fn
[rules output nesting-level]
(reduce
(fn [v rule]
(let [tmp-k (conj v `(.append "\"")
`(.append ~(name (first rule)))
`(.append "\":"))
tmp-k2 (if (some #{:string} rule)
(conj tmp-k `(.append "\""))
tmp-k)
tmp-v (cond
(sequential? (second rule)) (conj
tmp-k2
`(.append ~(prefix-rule-name (first rule) nesting-level)))
(cond-rule-expr? (second rule)) (conj tmp-k2 `(.append ~(prefix-rule-name (first rule) nesting-level)))
:default (do
(println "JSON String Body: unknown element for rule:" (str rule))
tmp-k2))
tmp-v2 (if (some #{:string} rule)
(conj tmp-v `(.append "\""))
tmp-v)]
(if (not= rule (last rules))
(conj tmp-v2 `(.append ","))
(conj tmp-v2 `(.append "}")))))
(if (nil? output)
'[doto (java.lang.StringBuilder.) (.append "{")]
'[doto ^java.lang.StringBuilder output (.deleteCharAt (- (.length ^java.lang.StringBuilder output) 1)) (.append ",")])
rules))
(defn create-proc-fn
"Create a data processing function based on the given dsl-expression.
An example of a dsl-expression for processing a Clojure seq is given below:
{:output-type :clj-map
:rules [['myFloat '(nth 0)]
['myStr '(clojure.string/lower-case (nth 1)) :string]
['myRatio '(/ (nth 2) 100.0)]
['myStr2 '(str (nth 3) (nth 4)) :string]]}
The resulting function will for the input [1.23 \"FOO\" 42 \"bar\" \"baz\"] produce the output {\"myFloat\" 1.23, \"myStr\" \"foo\", \"myRatio\" 0.42, \"myStr2\" \"barbaz\"}."
[dsl-expression]
; (println "Got DSL expression:" dsl-expression)
(let [input-sym 'input
output-type (name (:output-type dsl-expression))
rules (:rules dsl-expression)
output-sym (if (.endsWith output-type *incremental-indicator-suffix*)
'output)
output-format-fn (condp (fn [^String v ^String s] (.startsWith s v)) output-type
"java" java-out-format-fn
"java-map" (do
(println "The format string 'java-map' is deprecated. Please use 'java' instead.")
java-out-format-fn)
"clj" clj-out-format-fn
"clj-map" (do
(println "The format string 'clj-map' is deprecated. Please use 'clj' instead.")
clj-out-format-fn)
"csv-str" csv-str-out-format-fn
"json-str" json-str-out-format-fn
(do
(println "Unknown output type:" output-type)
(println "Defaulting to :java-map as output type.")
java-out-format-fn))
; _ (println "Created data processing function vector from DSL:" fn-body-vec)
fn-body (create-let-expression input-sym rules output-format-fn output-sym 0)
; _ (println "Created data processing function body:" fn-body)
; _ (pprint fn-body)
; _ (println "")
data-processing-fn (if (not (nil? output-sym))
(eval `(fn [~input-sym ~output-sym] ~fn-body))
(eval `(fn [~input-sym] ~fn-body)))]
data-processing-fn))
(defn combine-proc-fns
"Based on the DSL expression dsl-expression, create a data processing function in which the processing rules starting at start-idx, inclusive, up to end-idx, non inclusive, are combined.
Please note that it is usually more appropriate to use combine-proc-fns-vec."
[dsl-expression start-idx end-idx]
(if (= 0 start-idx)
(create-proc-fn
{:output-type (:output-type dsl-expression)
:rules (subvec (:rules dsl-expression) start-idx end-idx)})
(create-proc-fn
{:output-type (keyword (str (name (:output-type dsl-expression)) *incremental-indicator-suffix*))
:rules (subvec (:rules dsl-expression) start-idx end-idx)})))
(defn combine-proc-fns-vec
"Based on the function mapping fn-mapping and the DSL expression dsl-expression, create a vector of data processing functions.
The mapping definition defines the number of processing rules to be included in each processing function.
For a vector of processing rules [a b c d e f], a mapping definition [1 2 3] will result in the following association of processing rules to processing functions f_x: [f_1(a), f_2(b, c), f_3(d e f)]."
[fn-mapping dsl-expression]
(reduce
(fn [v m]
(let [start-idx (reduce + (subvec fn-mapping 0 (count v)))]
(conj v (combine-proc-fns dsl-expression
start-idx
(+ start-idx m)))))
(let [f (combine-proc-fns dsl-expression 0 (first fn-mapping))]
[(fn [in _] (f in))])
(rest fn-mapping)))