@@ -68,21 +68,21 @@ def asof_join_backward_{{on_dtype}}_by_{{by_dtype}}(
6868
6969 # find last position in right whose value is less than left's
7070 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]) :
7373 hash_table.set_item(right_by_values[right_pos], right_pos)
7474 right_pos += 1
7575 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]) :
7878 hash_table.set_item(right_by_values[right_pos], right_pos)
7979 right_pos += 1
8080 right_pos -= 1
8181
8282 # save positions as the desired index
8383 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)
8686 left_indexer[left_pos] = left_pos
8787 right_indexer[left_pos] = found_right_pos
8888
@@ -133,21 +133,21 @@ def asof_join_forward_{{on_dtype}}_by_{{by_dtype}}(
133133
134134 # find first position in right whose value is greater than left's
135135 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]) :
138138 hash_table.set_item(right_by_values[right_pos], right_pos)
139139 right_pos -= 1
140140 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]) :
143143 hash_table.set_item(right_by_values[right_pos], right_pos)
144144 right_pos -= 1
145145 right_pos += 1
146146
147147 # save positions as the desired index
148148 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)
151151 left_indexer[left_pos] = left_pos
152152 right_indexer[left_pos] = found_right_pos
153153
@@ -259,12 +259,12 @@ def asof_join_backward_{{on_dtype}}(
259259
260260 # find last position in right whose value is less than left's
261261 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]) :
264264 right_pos += 1
265265 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]) :
268268 right_pos += 1
269269 right_pos -= 1
270270
@@ -313,19 +313,19 @@ def asof_join_forward_{{on_dtype}}(
313313
314314 # find first position in right whose value is greater than left's
315315 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]) :
318318 right_pos -= 1
319319 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]) :
322322 right_pos -= 1
323323 right_pos += 1
324324
325325 # save positions as the desired index
326326 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)
329329
330330 # if needed, verify that tolerance is met
331331 if has_tolerance and right_pos != right_size:
0 commit comments