@@ -68,21 +68,21 @@ def asof_join_backward_{{on_dtype}}_by_{{by_dtype}}(
68
68
69
69
# find last position in right whose value is less than left's
70
70
if allow_exact_matches:
71
- while right_pos < right_size and\
72
- right_values[right_pos] <= left_values[left_pos]:
71
+ while ( right_pos < right_size and
72
+ right_values[right_pos] <= left_values[left_pos]) :
73
73
hash_table.set_item(right_by_values[right_pos], right_pos)
74
74
right_pos += 1
75
75
else:
76
- while right_pos < right_size and\
77
- right_values[right_pos] < left_values[left_pos]:
76
+ while ( right_pos < right_size and
77
+ right_values[right_pos] < left_values[left_pos]) :
78
78
hash_table.set_item(right_by_values[right_pos], right_pos)
79
79
right_pos += 1
80
80
right_pos -= 1
81
81
82
82
# save positions as the desired index
83
83
by_value = left_by_values[left_pos]
84
- found_right_pos = hash_table.get_item(by_value)\
85
- if by_value in hash_table else -1
84
+ found_right_pos = ( hash_table.get_item(by_value)
85
+ if by_value in hash_table else -1)
86
86
left_indexer[left_pos] = left_pos
87
87
right_indexer[left_pos] = found_right_pos
88
88
@@ -133,21 +133,21 @@ def asof_join_forward_{{on_dtype}}_by_{{by_dtype}}(
133
133
134
134
# find first position in right whose value is greater than left's
135
135
if allow_exact_matches:
136
- while right_pos >= 0 and\
137
- right_values[right_pos] >= left_values[left_pos]:
136
+ while ( right_pos >= 0 and
137
+ right_values[right_pos] >= left_values[left_pos]) :
138
138
hash_table.set_item(right_by_values[right_pos], right_pos)
139
139
right_pos -= 1
140
140
else:
141
- while right_pos >= 0 and\
142
- right_values[right_pos] > left_values[left_pos]:
141
+ while ( right_pos >= 0 and
142
+ right_values[right_pos] > left_values[left_pos]) :
143
143
hash_table.set_item(right_by_values[right_pos], right_pos)
144
144
right_pos -= 1
145
145
right_pos += 1
146
146
147
147
# save positions as the desired index
148
148
by_value = left_by_values[left_pos]
149
- found_right_pos = hash_table.get_item(by_value)\
150
- if by_value in hash_table else -1
149
+ found_right_pos = ( hash_table.get_item(by_value)
150
+ if by_value in hash_table else -1)
151
151
left_indexer[left_pos] = left_pos
152
152
right_indexer[left_pos] = found_right_pos
153
153
@@ -259,12 +259,12 @@ def asof_join_backward_{{on_dtype}}(
259
259
260
260
# find last position in right whose value is less than left's
261
261
if allow_exact_matches:
262
- while right_pos < right_size and\
263
- right_values[right_pos] <= left_values[left_pos]:
262
+ while ( right_pos < right_size and
263
+ right_values[right_pos] <= left_values[left_pos]) :
264
264
right_pos += 1
265
265
else:
266
- while right_pos < right_size and\
267
- right_values[right_pos] < left_values[left_pos]:
266
+ while ( right_pos < right_size and
267
+ right_values[right_pos] < left_values[left_pos]) :
268
268
right_pos += 1
269
269
right_pos -= 1
270
270
@@ -313,19 +313,19 @@ def asof_join_forward_{{on_dtype}}(
313
313
314
314
# find first position in right whose value is greater than left's
315
315
if allow_exact_matches:
316
- while right_pos >= 0 and\
317
- right_values[right_pos] >= left_values[left_pos]:
316
+ while ( right_pos >= 0 and
317
+ right_values[right_pos] >= left_values[left_pos]) :
318
318
right_pos -= 1
319
319
else:
320
- while right_pos >= 0 and\
321
- right_values[right_pos] > left_values[left_pos]:
320
+ while ( right_pos >= 0 and
321
+ right_values[right_pos] > left_values[left_pos]) :
322
322
right_pos -= 1
323
323
right_pos += 1
324
324
325
325
# save positions as the desired index
326
326
left_indexer[left_pos] = left_pos
327
- right_indexer[left_pos] = right_pos\
328
- if right_pos != right_size else -1
327
+ right_indexer[left_pos] = ( right_pos
328
+ if right_pos != right_size else -1)
329
329
330
330
# if needed, verify that tolerance is met
331
331
if has_tolerance and right_pos != right_size:
0 commit comments