-
Notifications
You must be signed in to change notification settings - Fork 12
/
Copy path_dartsclone.pyx
168 lines (146 loc) · 5.88 KB
/
_dartsclone.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
from libc.stdlib cimport malloc, free
cdef class DoubleArray:
def __cinit__(self):
self.wrapped = new CppDoubleArray()
def __dealloc__(self):
del self.wrapped
def __getstate__(self):
return self.array()
def __setstate__(self, array):
self.set_array(array)
def array(self):
cdef size_t total_size = self.wrapped.total_size()
cdef char[:] data = <char[:total_size]>self.wrapped.array()
return bytes(data)
def set_array(self, const unsigned char[::1] array, size_t size=0):
self.wrapped.set_array(<const void*> &array[0], size)
def clear(self):
self.wrapped.clear()
def unit_size(self):
return self.wrapped.unit_size()
def size(self):
return self.wrapped.size()
def total_size(self):
return self.wrapped.total_size()
def nonzero_size(self):
return self.wrapped.nonzero_size()
def build(self, keys,
lengths = None,
values = None):
cdef size_t num_keys = len(keys)
cdef const char** _keys = <const char**> malloc(num_keys * sizeof(char*))
cdef size_t *_lengths = NULL
cdef int *_values = NULL
for i, key in enumerate(keys):
_keys[i] = key
if lengths is not None:
_lengths = <size_t *> malloc(num_keys * sizeof(size_t))
for i, length in enumerate(lengths):
_lengths[i] = length
if values is not None:
_values = <int *> malloc(num_keys * sizeof(int))
for i, value in enumerate(values):
_values[i] = value
try:
self.wrapped.build(num_keys, _keys, <const size_t*> _lengths, <const int*> _values, NULL)
finally:
free(_keys)
if lengths is not None:
free(_lengths)
if values is not None:
free(_values)
def open(self, file_name,
mode = 'rb',
size_t offset = 0,
size_t size = 0):
file_name = file_name.encode('utf-8')
cdef const char *_file_name = file_name
mode = mode.encode('utf-8')
cdef const char *_mode = mode
with nogil:
self.wrapped.open(_file_name, _mode, offset, size)
def save(self, file_name,
mode = 'wb',
size_t offset = 0):
file_name = file_name.encode('utf-8')
cdef const char *_file_name = file_name
mode = mode.encode('utf-8')
cdef const char *_mode = mode
with nogil:
self.wrapped.save(_file_name, _mode, offset)
def exact_match_search(self, key,
size_t length = 0,
size_t node_pos = 0,
pair_type=True):
cdef const char *_key = key
if pair_type:
return self.__exact_match_search_pair_type(_key, length, node_pos)
else:
return self.__exact_match_search(_key, length, node_pos)
def common_prefix_search(self, key,
size_t max_num_results = 0,
size_t length = 0,
size_t node_pos = 0,
pair_type=True):
cdef const char *_key = key
if max_num_results == 0:
max_num_results = len(key)
if pair_type:
return self.__common_prefix_search_pair_type(_key, max_num_results, length, node_pos)
else:
return self.__common_prefix_search(_key, max_num_results, length, node_pos)
def traverse(self, key,
size_t node_pos,
size_t key_pos,
size_t length = 0):
cdef const char *_key = key
cdef int result
with nogil:
result = self.wrapped.traverse(_key, node_pos, key_pos, length)
return result
def __exact_match_search(self, const char *key,
size_t length = 0,
size_t node_pos = 0):
cdef int result
with nogil:
self.wrapped.exact_match_search(key, result, length, node_pos)
return result
def __exact_match_search_pair_type(self, const char *key,
size_t length = 0,
size_t node_pos = 0):
cdef result_pair_type result
with nogil:
self.wrapped.exact_match_search(key, result, length, node_pos)
return result.value, result.length
def __common_prefix_search(self, const char *key,
size_t max_num_results,
size_t length,
size_t node_pos):
cdef int *results = <int *> malloc(max_num_results * sizeof(int))
cdef int result_len
try:
with nogil:
result_len = self.wrapped.common_prefix_search(key, results, max_num_results, length, node_pos)
values = list()
for i in range(result_len):
values.append(results[i])
finally:
free(results)
return values
def __common_prefix_search_pair_type(self, const char *key,
size_t max_num_results,
size_t length,
size_t node_pos):
cdef result_pair_type *results = <result_pair_type *> malloc(max_num_results * sizeof(result_pair_type))
cdef result_pair_type result
cdef int result_len
try:
with nogil:
result_len = self.wrapped.common_prefix_search(key, results, max_num_results, length, node_pos)
values = list()
for i in range(result_len):
result = results[i]
values.append((result.value, result.length))
finally:
free(results)
return values