/
hashtable.pyx
415 lines (331 loc) · 11.4 KB
/
hashtable.pyx
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
402
403
404
405
406
407
408
409
410
411
412
413
414
"""
Modified from Pandas: https://github.com/pydata/pandas/blob/master/pandas/src/hashtable.pyx
"""
from khash cimport *
from numpy cimport *
import numpy as np
cimport numpy as np
cdef inline bint _checknan(object val):
return not np.PyArray_Check(val) and val != val
# def list_to_object_array(list obj):
# """
# Convert list to object ndarray. Seriously can't believe I had to write this
# function
# """
# cdef:
# Py_ssize_t i, n
# ndarray[object] arr
# n = len(obj)
# arr = np.empty(n, dtype=object)
# for i from 0 <= i < n:
# arr[i] = obj[i]
# return arr
cdef class Int64HashTable:
"""A hashtable taking 64bit integer as key and 64bit float as
value.
"""
cdef:
kh_int64_t *table
def __init__(self, size_hint=1):
if size_hint is not None:
kh_resize_int64(self.table, size_hint)
def __cinit__(self):
self.table = kh_init_int64()
def __dealloc__(self):
kh_destroy_int64(self.table)
cpdef bint has_key(self, int64_t key):
"""Check if a given key is valid in hashtable.
"""
cdef khiter_t k
k = kh_get_int64(self.table, key)
return k != self.table.n_buckets
cpdef get_item(self, int64_t key):
"""Given a key, return a value.
"""
cdef khiter_t k
k = kh_get_int64(self.table, key)
if k != self.table.n_buckets:
return self.table.vals[k]
else:
raise KeyError(key)
cpdef set_item(self, int64_t key, float64_t val):
"""Put a key-value pair to hashtable.
"""
cdef:
khiter_t k
int ret = 0
k = kh_put_int64(self.table, key, &ret)
self.table.keys[k] = key
if kh_exist_int64(self.table, k):
self.table.vals[k] = val
else:
raise KeyError(key)
def map(self, ndarray[int64_t] keys, ndarray[float64_t] values):
"""Take an array of keys in int64, and an array of values in
float64 (of the same length), create key-value pairs in
hashtable.
"""
cdef:
Py_ssize_t i, n = len(values)
int ret = 0
int64_t key
khiter_t k
for i in range(n):
key = keys[i]
k = kh_put_int64(self.table, key, &ret)
self.table.vals[k] = <float64_t> values[i]
def map_locations(self, ndarray[int64_t] values):
"""Take a list of keys, set the value of each key according to
the index in input array.
"""
cdef:
Py_ssize_t n = len(values)
float64_t i
int ret = 0
int64_t key
khiter_t k
for i in range(n):
key = values[i]
k = kh_put_int64(self.table, key, &ret)
self.table.vals[k] = i
def lookup(self, ndarray[int64_t] values):
"""Take a list of keys, return their values.
"""
cdef:
Py_ssize_t i, n = len(values)
int ret = 0
int64_t key
khiter_t k
ndarray[float64_t] locs = np.empty(n, dtype='float64')
for i in range(n):
key = values[i]
k = kh_get_int64(self.table, key)
if k != self.table.n_buckets:
locs[i] = self.table.vals[k]
else:
locs[i] = -1
return locs
cdef class Float64HashTable:
"""A hashtable taking 64bit float as key and 64bit float as
value.
"""
cdef:
kh_float64_t *table
def __init__(self, size_hint=1):
if size_hint is not None:
kh_resize_float64(self.table, size_hint)
def __cinit__(self):
self.table = kh_init_float64()
def __dealloc__(self):
kh_destroy_float64(self.table)
cpdef bint has_key(self, float64_t key):
"""Check if a given key is valid in hashtable.
"""
cdef khiter_t k
k = kh_get_float64(self.table, key)
return k != self.table.n_buckets
cpdef get_item(self, float64_t key):
"""Given a key, return a value.
"""
cdef khiter_t k
k = kh_get_float64(self.table, key)
if k != self.table.n_buckets:
return self.table.vals[k]
else:
raise KeyError(key)
cpdef set_item(self, float64_t key, float64_t val):
"""Put a key-value pair to hashtable.
"""
cdef:
khiter_t k
int ret = 0
k = kh_put_float64(self.table, key, &ret)
self.table.keys[k] = key
if kh_exist_float64(self.table, k):
self.table.vals[k] = val
else:
raise KeyError(key)
def map(self, ndarray[float64_t] keys, ndarray[float64_t] values):
"""Take an array of keys in float64, and an array of values in
float64 (of the same length), create key-value pairs in
hashtable.
"""
cdef:
Py_ssize_t i, n = len(values)
int ret = 0
float64_t key
khiter_t k
for i in range(n):
key = keys[i]
k = kh_put_float64(self.table, key, &ret)
self.table.vals[k] = <float64_t> values[i]
def map_locations(self, ndarray[float64_t] values):
"""Take a list of keys, set the value of each key according to
the index in input array.
"""
cdef:
Py_ssize_t n = len(values)
float64_t i
int ret = 0
float64_t key
khiter_t k
for i in range(n):
key = values[i]
k = kh_put_float64(self.table, key, &ret)
self.table.vals[k] = i
def lookup(self, ndarray[float64_t] values):
"""Take a list of keys, return their values.
"""
cdef:
Py_ssize_t i, n = len(values)
int ret = 0
float64_t key
khiter_t k
ndarray[float64_t] locs = np.empty(n, dtype='float64')
for i in range(n):
key = values[i]
k = kh_get_float64(self.table, key)
if k != self.table.n_buckets:
locs[i] = self.table.vals[k]
else:
locs[i] = -1
return locs
ONAN = np.nan
# cdef class PyObjectHashTable:
# cdef:
# kh_pymap_t *table
# def __init__(self, size_hint=1):
# self.table = kh_init_pymap()
# kh_resize_pymap(self.table, size_hint)
# def __dealloc__(self):
# if self.table is not NULL:
# self.destroy()
# cpdef destroy(self):
# kh_destroy_pymap(self.table)
# self.table = NULL
# cpdef get_item(self, object val):
# cdef khiter_t k
# k = kh_get_pymap(self.table, <PyObject*>val)
# if k != self.table.n_buckets:
# return self.table.vals[k]
# else:
# raise KeyError(val)
# def get_iter_test(self, object key, Py_ssize_t iterations):
# cdef Py_ssize_t i, val
# for i in range(iterations):
# k = kh_get_pymap(self.table, <PyObject*>key)
# if k != self.table.n_buckets:
# val = self.table.vals[k]
# cpdef set_item(self, object key, Py_ssize_t val):
# cdef:
# khiter_t k
# int ret = 0
# char* buf
# k = kh_put_pymap(self.table, <PyObject*>key, &ret)
# # self.table.keys[k] = key
# if kh_exist_pymap(self.table, k):
# self.table.vals[k] = val
# else:
# raise KeyError(key)
# def map_locations(self, ndarray[object] values):
# cdef:
# Py_ssize_t i, n = len(values)
# int ret = 0
# object val
# khiter_t k
# for i in range(n):
# val = values[i]
# k = kh_put_pymap(self.table, <PyObject*>val, &ret)
# self.table.vals[k] = i
# def lookup(self, ndarray[object] values):
# cdef:
# Py_ssize_t i, n = len(values)
# int ret = 0
# object val
# khiter_t k
# ndarray[int32_t] locs = np.empty(n, dtype='i4')
# for i in range(n):
# val = values[i]
# k = kh_get_pymap(self.table, <PyObject*>val)
# if k != self.table.n_buckets:
# locs[i] = self.table.vals[k]
# else:
# locs[i] = -1
# return locs
# def lookup2(self, ndarray[object] values):
# cdef:
# Py_ssize_t i, n = len(values)
# int ret = 0
# object val
# khiter_t k
# long hval
# ndarray[int32_t] locs = np.empty(n, dtype='i4')
# # for i in range(n):
# # val = values[i]
# # hval = PyObject_Hash(val)
# # k = kh_get_pymap(self.table, <PyObject*>val)
# return locs
# def unique(self, ndarray[object] values):
# cdef:
# Py_ssize_t i, n = len(values)
# Py_ssize_t idx, count = 0
# int ret = 0
# object val
# khiter_t k
# list uniques = []
# bint seen_na = 0
# for i in range(n):
# val = values[i]
# if not _checknan(val):
# k = kh_get_pymap(self.table, <PyObject*>val)
# if k == self.table.n_buckets:
# k = kh_put_pymap(self.table, <PyObject*>val, &ret)
# uniques.append(val)
# elif not seen_na:
# seen_na = 1
# uniques.append(ONAN)
# return uniques
# cpdef get_labels(self, ndarray[object] values, list uniques,
# Py_ssize_t count_prior, int32_t na_sentinel):
# cdef:
# Py_ssize_t i, n = len(values)
# ndarray[int32_t] labels
# ndarray[int32_t] counts
# Py_ssize_t idx, count = count_prior
# int ret = 0
# object val
# khiter_t k
# labels = np.empty(n, dtype=np.int32)
# counts = np.empty(count_prior + n, dtype=np.int32)
# for i in range(n):
# val = values[i]
# if val != val or val is None:
# labels[i] = na_sentinel
# continue
# k = kh_get_pymap(self.table, <PyObject*>val)
# if k != self.table.n_buckets:
# idx = self.table.vals[k]
# labels[i] = idx
# counts[idx] = counts[idx] + 1
# else:
# k = kh_put_pymap(self.table, <PyObject*>val, &ret)
# self.table.vals[k] = count
# uniques.append(val)
# labels[i] = count
# counts[count] = 1
# count += 1
# return labels, counts[:count].copy()
# # def unique(self, ndarray[object] values, list uniques):
# # cdef:
# # Py_ssize_t i, n = len(values)
# # Py_ssize_t idx, count = 0
# # int ret
# # object val
# # khiter_t k
# # for i in range(n):
# # val = values[i]
# # k = kh_get_pymap(self.table, <PyObject*>val)
# # if k == self.table.n_buckets:
# # k = kh_put_pymap(self.table, <PyObject*>val, &ret)
# # uniques.append(val)
# # count += 1