-
Notifications
You must be signed in to change notification settings - Fork 18
/
Copy pathclosejoin.jl
401 lines (377 loc) · 15.8 KB
/
closejoin.jl
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
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
function _find_ranges_for_closeback!(ranges, x, y, _fl::F1, _fr::F2, ::Val{T1}, ::Val{T2}; threads = true) where {T1, T2, F1, F2}
@_threadsfor threads for i in 1:length(x)
curr_start = ranges[i].start
if length(ranges[i]) == 0
ranges[i] = 0:0
else
ranges[i] = 1:searchsortedlast_join(_fr, y, _fl(x[i])::T1, ranges[i].start, ranges[i].stop, Base.Order.Forward, Val(T2))
if ranges[i].stop < curr_start
ranges[i] = 0:curr_start
end
end
end
end
function _find_ranges_for_closefor!(ranges, x, y, _fl::F1, _fr::F2, ::Val{T1}, ::Val{T2}; threads = true) where {T1, T2, F1, F2}
@_threadsfor threads for i in 1:length(x)
cur_stop = ranges[i].stop
if length(ranges[i]) == 0
ranges[i] = 0:0
else
ranges[i] = 1:searchsortedfirst_join(_fr, y, _fl(x[i])::T1, ranges[i].start, ranges[i].stop, Base.Order.Forward, Val(T2))
if ranges[i].stop > cur_stop
ranges[i] = 0:cur_stop
end
end
end
end
function _find_ranges_for_closenearest!(ranges, x, y, _fl::F1, _fr::F2, ::Val{T1}, ::Val{T2}; threads = true) where {T1, T2, F1, F2}
@_threadsfor threads for i in 1:length(x)
cur_stop = ranges[i].stop
curr_start = ranges[i].start
if length(ranges[i]) == 0
ranges[i] = 0:0
else
#TODO we don't need to search whole range for the second search
fval = searchsortedfirst_join(_fr, y, _fl(x[i])::T1, ranges[i].start, ranges[i].stop, Base.Order.Forward, Val(T2))
lval = searchsortedlast_join(_fr, y, _fl(x[i])::T1, ranges[i].start, ranges[i].stop, Base.Order.Forward, Val(T2))
if fval > cur_stop
ranges[i] = 0:lval
elseif lval < curr_start
ranges[i] = 0:fval
else
ranges[i] = min(fval, lval):max(fval, lval)
end
end
end
end
_IST_(x,y)=true
function _close_notol_nn!(_res, ranges, x, rnn, lnn, bordervalue; threads = true)
@_threadsfor threads for i in 1:length(ranges)
if ranges[i] == 0:0
_res[i] = missing
else
r1 = rnn[ranges[i].stop]
if ranges[i].start == 0
if ismissing(bordervalue)
_res[i] = missing
else
_res[i] = x[ranges[i].stop]
end
else
r2 = rnn[ranges[i].start]
if isless(abs(r2-lnn[i]), abs(r1-lnn[i]))
_res[i] = x[ranges[i].start]
else
_res[i] = x[ranges[i].stop]
end
end
end
end
end
# instead of finding the nearest, set res = op(x[left], x[right]), in border it sets res = op(missing, x[border])
function _close_notol_nn!(_res, ranges, x, rnn, lnn, bordervalue, op::F; threads = true) where F
@_threadsfor threads for i in 1:length(ranges)
if ranges[i] == 0:0
_res[i] = missing
else
if ranges[i].start == 0
_res[i] = op(missing, x[ranges[i].stop])
else
_res[i] = op(x[ranges[i].start],x[ranges[i].stop])
end
end
end
end
function _close_notol_noborder!(_res, ranges, x, direction; threads = true)
@_threadsfor threads for i in 1:length(ranges)
if ranges[i] == 0:0
_res[i] = missing
else
if ranges[i].start == 0
_res[i] = missing
else
if direction == :backward
_res[i] = x[ranges[i].start]
else
_res[i] = x[ranges[i].stop]
end
end
end
end
end
function _close_notol_border!(_res, ranges, x, bordervalue; threads = true)
@_threadsfor threads for i in 1:length(ranges)
if ranges[i] == 0:0
_res[i] = missing
else
_res[i] = x[ranges[i].stop]
if !bordervalue && ranges[i].start == 0
_res[i] = missing
end
end
end
end
function _close_tol_nn!(_res, ranges, x, rnn, lnn, tol, aem::F, bordervalue; threads = true) where F
@_threadsfor threads for i in 1:length(ranges)
if ranges[i] == 0:0
_res[i] = missing
else
r1 = rnn[ranges[i].stop]
if ranges[i].start == 0
if ismissing(bordervalue)
_res[i] = missing
else
if isless(abs(r1-lnn[i]), tol) && aem(r1, lnn[i])
_res[i] = x[ranges[i].stop]
else
_res[i] = missing
end
end
else
r2 = rnn[ranges[i].start]
if isless(abs(r2-lnn[i]), abs(r1-lnn[i]))
if isless(abs(r2-lnn[i]), tol) && aem(r2, lnn[i])
_res[i] = x[ranges[i].start]
else
_res[i] = missing
end
else
if isless(abs(r1-lnn[i]), tol) && aem(r1, lnn[i])
_res[i] = x[ranges[i].stop]
else
_res[i] = missing
end
end
end
end
end
end
# instead of finding the nearest, set res = op(x[left], x[right]), in border it sets res = op(missing, x[border]), op(missing, missing) must be defined
function _close_tol_nn!(_res, ranges, x, rnn, lnn, tol, aem::F1, bordervalue, op::F2; threads = true) where {F1, F2}
@_threadsfor threads for i in 1:length(ranges)
if ranges[i] == 0:0
_res[i] = missing
else
r1 = rnn[ranges[i].stop]
if ranges[i].start == 0
if isless(abs(r1-lnn[i]), tol) && aem(r1, lnn[i])
_res[i] = op(missing, x[ranges[i].stop])
else
_res[i] = op(missing, missing)
end
else
r2 = rnn[ranges[i].start]
if isless(abs(r2-lnn[i]), tol) && aem(r2, lnn[i])
if isless(abs(r1-lnn[i]), tol) && aem(r1, lnn[i])
_res[i] = op(x[ranges[i].start], x[ranges[i].stop])
else
_res[i] = op(x[ranges[i].start], missing)
end
else
if isless(abs(r1-lnn[i]), tol) && aem(r1, lnn[i])
_res[i] = op(missing, x[ranges[i].stop])
else
_res[i] = op(missing, missing)
end
end
end
end
end
end
function _close_tol_noborder!(_res, ranges, x, rnn, lnn, tol, aem::F, direction; threads = true) where F
@_threadsfor threads for i in 1:length(ranges)
if ranges[i] == 0:0
_res[i] = missing
else
if ranges[i].start == 0
_res[i] = missing
else
if direction == :backward
r1 = rnn[ranges[i].start]
if isless(abs(r1-lnn[i]), tol) && aem(r1, lnn[i])
_res[i] = x[ranges[i].start]
else
_res[i] = missing
end
else
r1 = rnn[ranges[i].stop]
if isless(abs(r1-lnn[i]), tol) && aem(r1, lnn[i])
_res[i] = x[ranges[i].stop]
else
_res[i] = missing
end
end
end
end
end
end
function _close_tol_border!(_res, ranges, x, rnn, lnn, tol, aem::F, bordervalue; threads = true) where F
@_threadsfor threads for i in 1:length(ranges)
if ranges[i] == 0:0
_res[i] = missing
else
r1 = rnn[ranges[i].stop]
if isless(abs(r1-lnn[i]), tol) && aem(r1, lnn[i])
_res[i] = x[ranges[i].stop]
else
_res[i] = missing
end
if !bordervalue && ranges[i].start == 0
_res[i] = missing
end
end
end
end
function _fill_right_cols_table_close!(_res, x, ranges, total, borderval, fill_val, direction; op = nothing, nn = false, rnn = nothing, lnn = nothing, tol = nothing, aem = _IST_, threads = true)
if borderval == :nearest
bordervalue = true
elseif borderval == :none
bordervalue = missing
elseif borderval == :missing
bordervalue = false
end
if tol === nothing
if nn
if op === nothing
_close_notol_nn!(_res, ranges, x, rnn, lnn, bordervalue; threads = threads)
else
_close_notol_nn!(_res, ranges, x, rnn, lnn, bordervalue, op; threads = threads)
end
else
if ismissing(bordervalue)
_close_notol_noborder!(_res, ranges, x, direction; threads = threads)
else
_close_notol_border!(_res, ranges, x, bordervalue; threads = threads)
end
end
else
if nn
if op === nothing
_close_tol_nn!(_res, ranges, x, rnn, lnn, tol, aem, bordervalue; threads = threads)
else
_close_tol_nn!(_res, ranges, x, rnn, lnn, tol, aem, bordervalue, op; threads = threads)
end
else
if ismissing(bordervalue)
_close_tol_noborder!(_res, ranges, x, rnn, lnn, tol, aem, direction; threads = threads)
else
_close_tol_border!(_res, ranges, x, rnn, lnn, tol, aem, bordervalue; threads = threads)
end
end
end
end
function _change_refpool_find_range_for_close!(ranges, dsl, dsr, r_perms, oncols_left, oncols_right, direction, lmf, rmf, j; nsfpaj=nsfpaj, threads = true)
nsfpaj_in = nsfpaj[1]
var_l = _columns(dsl)[oncols_left[j]]
var_r = _columns(dsr)[oncols_right[j]]
l_idx = oncols_left[j]
r_idx = oncols_right[j]
if lmf
_fl = getformat(dsl, l_idx)
else
_fl = identity
end
if rmf
_fr = getformat(dsr, r_idx)
else
_fr = identity
end
T1 = Core.Compiler.return_type(_fl, Tuple{eltype(var_l)})
if DataAPI.refpool(var_r) !== nothing && nsfpaj_in
throw(ErrorException("we shouldn't end up here"))
else
T2 = Core.Compiler.return_type(_fr, Tuple{eltype(var_r)})
if direction == :backward
_find_ranges_for_closeback!(ranges, var_l, view(var_r, r_perms), _fl, _fr, Val(T1), Val(T2); threads = threads)
elseif direction == :forward
_find_ranges_for_closefor!(ranges, var_l, view(var_r, r_perms), _fl, _fr, Val(T1), Val(T2); threads = threads)
elseif direction == :nearest
_find_ranges_for_closenearest!(ranges, var_l, view(var_r, r_perms), _fl, _fr, Val(T1), Val(T2); threads = threads)
end
end
end
# border = :nearest | :missing | :none
function _join_closejoin(dsl, dsr::AbstractDataset, ::Val{T}; onleft, onright, makeunique = false, border = :nearest, mapformats = [true, true], stable = false, alg = HeapSort, accelerate = false, direction = :backward, inplace = false, tol = nothing, allow_exact_match = true, op = nothing, method = :sort, threads = true, obs_id = [false, false], obs_id_name = :obs_id) where T
isempty(dsl) && return copy(dsl)
if !allow_exact_match
#aem is the function to check allow_exact_match
aem = !isequal
# missing is greater than anything
if tol == nothing
tol = missing
end
else
aem = _IST_
end
oncols_left = onleft
oncols_right = onright
right_cols = setdiff(1:length(index(dsr)), oncols_right)
if !makeunique && !isempty(intersect(_names(dsl), _names(dsr)[right_cols]))
throw(ArgumentError("duplicate column names, pass `makeunique = true` to make them unique using a suffix automatically." ))
end
nsfpaj = [true]
# if the column for close join is a PA we cannot use the fast path
if DataAPI.refpool(_columns(dsr)[oncols_right[end]]) !== nothing
nsfpaj = [false]
end
if length(oncols_left) > 1 && method == :hash
ranges, a, idx, minval, reps, sz, right_cols_2= _find_ranges_for_join_using_hash(dsl, dsr, onleft[1:end-1], onright[1:end-1], mapformats, true, Val(T), threads = threads)
filter!(!=(0), reps)
pushfirst!(reps, 1)
our_cumsum!(reps)
pop!(reps)
grng = GIVENRANGE(idx, reps, Int[], length(reps))
starts, idx, last_valid_range = _sort_for_join_after_hash(dsr, oncols_right[end], stable, alg, mapformats, nsfpaj, grng, threads = threads)
else
ranges = Vector{UnitRange{T}}(undef, nrow(dsl))
idx, uniquemode = _find_permute_and_fill_range_for_join!(ranges, dsr, dsl, oncols_right, oncols_left, stable, alg, mapformats, accelerate && length(oncols_right) > 1; nsfpaj = nsfpaj, threads = threads)
for j in 1:(length(oncols_left) - 1)
_change_refpool_find_range_for_join!(ranges, dsl, dsr, idx, oncols_left, oncols_right, mapformats[1], mapformats[2], j; nsfpaj = nsfpaj, threads = threads)
end
end
# if border = :none , we should use :nearest direction
_change_refpool_find_range_for_close!(ranges, dsl, dsr, idx, oncols_left, oncols_right, border == :none ? :nearest : direction, mapformats[1], mapformats[2], length(oncols_left); nsfpaj = nsfpaj, threads = threads)
total_length = nrow(dsl)
if inplace
newds = dsl
else
res = []
for j in 1:length(index(dsl))
push!(res, _columns(dsl)[j])
end
if dsl isa SubDataset
newds = Dataset(res, copy(index(dsl)))
else
newds = Dataset(res, Index(copy(index(dsl).lookup), copy(index(dsl).names), copy(index(dsl).format)))
end
end
for j in 1:length(right_cols)
_res = allocatecol(_columns(dsr)[right_cols[j]], total_length)
if DataAPI.refpool(_res) !== nothing
fill_val = DataAPI.invrefpool(_res)[missing]
_fill_right_cols_table_close!(_res.refs, view(DataAPI.refarray(_columns(dsr)[right_cols[j]]), idx), ranges, total_length, border, fill_val, direction; nn = direction == :nearest, rnn = view(_columns(dsr)[oncols_right[end]], idx), lnn = _columns(dsl)[oncols_left[end]], tol = tol, aem = aem, op = op, threads = threads)
else
_fill_right_cols_table_close!(_res, view(_columns(dsr)[right_cols[j]], idx), ranges, total_length, border, missing, direction; nn = direction == :nearest, rnn = view(_columns(dsr)[oncols_right[end]], idx), lnn = _columns(dsl)[oncols_left[end]], tol = tol, aem = aem, op = op, threads = threads)
end
push!(_columns(newds), _res)
new_var_name = make_unique([_names(dsl); _names(dsr)[right_cols[j]]], makeunique = makeunique)[end]
push!(index(newds), new_var_name)
setformat!(newds, index(newds)[new_var_name], getformat(dsr, _names(dsr)[right_cols[j]]))
end
if obs_id[1]
obs_id_name1 = Symbol(obs_id_name, "_left")
obs_id_left = allocatecol(nrow(dsl) < typemax(Int32) ? Int32 : Int64, total_length)
obs_id_left .= 1:nrow(dsl)
insertcols!(newds, ncol(newds)+1, obs_id_name1 => obs_id_left, unsupported_copy_cols = false, makeunique = makeunique)
end
if obs_id[2]
obs_id_name2 = Symbol(obs_id_name, "_right")
obs_id_right = allocatecol(T, total_length)
_fill_right_cols_table_close!(obs_id_right, idx, ranges, total_length, border, missing, direction; nn = direction == :nearest, rnn = view(_columns(dsr)[oncols_right[end]], idx), lnn = _columns(dsl)[oncols_left[end]], tol = tol, aem = aem, op = op, threads = threads)
insertcols!(newds, ncol(newds)+1, obs_id_name2 => obs_id_right, unsupported_copy_cols = false, makeunique = makeunique)
end
if inplace
_modified(_attributes(newds))
end
newds
end