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
|
%global _empty_manifest_terminate_build 0
Name: python-BitVector
Version: 3.5.0
Release: 1
Summary: A memory-efficient packed representation for bit arrays in pure Python
License: Python Software Foundation License
URL: https://engineering.purdue.edu/kak/dist/BitVector-3.5.0.html
Source0: https://mirrors.nju.edu.cn/pypi/web/packages/46/1c/69678b05bcfbafa18d8166aa8ad89d0a57e9b348ac58a7586edc3424b33e/BitVector-3.5.0.tar.gz
BuildArch: noarch
%description
Consult the module API page at
https://engineering.purdue.edu/kak/dist/BitVector-3.5.0.html
for all information related to this module, including
information regarding the latest changes to the code. The
page at the URL shown above lists all of the module
functionality you can invoke in your own code.
With regard to the basic purpose of the module, it defines
the BitVector class as a memory-efficient packed
representation for bit arrays. The class comes with a large
number of methods for using the representation in diverse
applications such as computer security, computer vision,
etc.
**Version 3.5.0** makes the module compatible with Python 3.9 and
also reverts __add__ to its implementation in 3.4.8 to get around
a bug.
**Version 3.4.9** includes significantly faster implementations
for concatenating and extending bitvectors.
The class is provided with the following operators/methods:
- __add__
- __and__
- __contains__
- __eq__, __ne__, __lt__, __le__, __gt__, __ge__
- __getitem__
- __iadd__
- __int__
- __invert__
- __iter__
- __len__
- __lshift__
- __or__
- __rshift__
- __setitem__
- __str__
- __xor__
- close_file_object
- count_bits
- count_bits_sparse (faster for sparse bit vectors)
- deep_copy
- divide_into_two
- gcd (for greatest common divisor)
- gen_random_bits
- get_bitvector_in_ascii
- get_bitvector_in_hex
- gf_divide_by_modulus (for modular divisions in GF(2^n))
- gf_MI (for multiplicative inverse in GF(2^n))
- gf_multiply (for multiplications in GF(2))
- gf_multiply_modular (for multiplications in GF(2^n))
- hamming_distance
- int_val (for returning the integer value)
- is_power_of_2
- is_power_of_2_sparse (faster for sparse bit vectors)
- jaccard_distance
- jaccard_similarity
- length
- min_canonical
- multiplicative_inverse
- next_set_bit
- pad_from_left
- pad_from_right
- permute
- rank_of_bit_set_at_index
- read_bits_from_file
- reset
- reverse
- runs
- set_value
- shift_left (for non-circular left shift)
- shift_right (for non-circular right shift)
- test_for_primality
- unpermute
- write_to_file
- write_bits_to_stream_object
%package -n python3-BitVector
Summary: A memory-efficient packed representation for bit arrays in pure Python
Provides: python-BitVector
BuildRequires: python3-devel
BuildRequires: python3-setuptools
BuildRequires: python3-pip
%description -n python3-BitVector
Consult the module API page at
https://engineering.purdue.edu/kak/dist/BitVector-3.5.0.html
for all information related to this module, including
information regarding the latest changes to the code. The
page at the URL shown above lists all of the module
functionality you can invoke in your own code.
With regard to the basic purpose of the module, it defines
the BitVector class as a memory-efficient packed
representation for bit arrays. The class comes with a large
number of methods for using the representation in diverse
applications such as computer security, computer vision,
etc.
**Version 3.5.0** makes the module compatible with Python 3.9 and
also reverts __add__ to its implementation in 3.4.8 to get around
a bug.
**Version 3.4.9** includes significantly faster implementations
for concatenating and extending bitvectors.
The class is provided with the following operators/methods:
- __add__
- __and__
- __contains__
- __eq__, __ne__, __lt__, __le__, __gt__, __ge__
- __getitem__
- __iadd__
- __int__
- __invert__
- __iter__
- __len__
- __lshift__
- __or__
- __rshift__
- __setitem__
- __str__
- __xor__
- close_file_object
- count_bits
- count_bits_sparse (faster for sparse bit vectors)
- deep_copy
- divide_into_two
- gcd (for greatest common divisor)
- gen_random_bits
- get_bitvector_in_ascii
- get_bitvector_in_hex
- gf_divide_by_modulus (for modular divisions in GF(2^n))
- gf_MI (for multiplicative inverse in GF(2^n))
- gf_multiply (for multiplications in GF(2))
- gf_multiply_modular (for multiplications in GF(2^n))
- hamming_distance
- int_val (for returning the integer value)
- is_power_of_2
- is_power_of_2_sparse (faster for sparse bit vectors)
- jaccard_distance
- jaccard_similarity
- length
- min_canonical
- multiplicative_inverse
- next_set_bit
- pad_from_left
- pad_from_right
- permute
- rank_of_bit_set_at_index
- read_bits_from_file
- reset
- reverse
- runs
- set_value
- shift_left (for non-circular left shift)
- shift_right (for non-circular right shift)
- test_for_primality
- unpermute
- write_to_file
- write_bits_to_stream_object
%package help
Summary: Development documents and examples for BitVector
Provides: python3-BitVector-doc
%description help
Consult the module API page at
https://engineering.purdue.edu/kak/dist/BitVector-3.5.0.html
for all information related to this module, including
information regarding the latest changes to the code. The
page at the URL shown above lists all of the module
functionality you can invoke in your own code.
With regard to the basic purpose of the module, it defines
the BitVector class as a memory-efficient packed
representation for bit arrays. The class comes with a large
number of methods for using the representation in diverse
applications such as computer security, computer vision,
etc.
**Version 3.5.0** makes the module compatible with Python 3.9 and
also reverts __add__ to its implementation in 3.4.8 to get around
a bug.
**Version 3.4.9** includes significantly faster implementations
for concatenating and extending bitvectors.
The class is provided with the following operators/methods:
- __add__
- __and__
- __contains__
- __eq__, __ne__, __lt__, __le__, __gt__, __ge__
- __getitem__
- __iadd__
- __int__
- __invert__
- __iter__
- __len__
- __lshift__
- __or__
- __rshift__
- __setitem__
- __str__
- __xor__
- close_file_object
- count_bits
- count_bits_sparse (faster for sparse bit vectors)
- deep_copy
- divide_into_two
- gcd (for greatest common divisor)
- gen_random_bits
- get_bitvector_in_ascii
- get_bitvector_in_hex
- gf_divide_by_modulus (for modular divisions in GF(2^n))
- gf_MI (for multiplicative inverse in GF(2^n))
- gf_multiply (for multiplications in GF(2))
- gf_multiply_modular (for multiplications in GF(2^n))
- hamming_distance
- int_val (for returning the integer value)
- is_power_of_2
- is_power_of_2_sparse (faster for sparse bit vectors)
- jaccard_distance
- jaccard_similarity
- length
- min_canonical
- multiplicative_inverse
- next_set_bit
- pad_from_left
- pad_from_right
- permute
- rank_of_bit_set_at_index
- read_bits_from_file
- reset
- reverse
- runs
- set_value
- shift_left (for non-circular left shift)
- shift_right (for non-circular right shift)
- test_for_primality
- unpermute
- write_to_file
- write_bits_to_stream_object
%prep
%autosetup -n BitVector-3.5.0
%build
%py3_build
%install
%py3_install
install -d -m755 %{buildroot}/%{_pkgdocdir}
if [ -d doc ]; then cp -arf doc %{buildroot}/%{_pkgdocdir}; fi
if [ -d docs ]; then cp -arf docs %{buildroot}/%{_pkgdocdir}; fi
if [ -d example ]; then cp -arf example %{buildroot}/%{_pkgdocdir}; fi
if [ -d examples ]; then cp -arf examples %{buildroot}/%{_pkgdocdir}; fi
pushd %{buildroot}
if [ -d usr/lib ]; then
find usr/lib -type f -printf "/%h/%f\n" >> filelist.lst
fi
if [ -d usr/lib64 ]; then
find usr/lib64 -type f -printf "/%h/%f\n" >> filelist.lst
fi
if [ -d usr/bin ]; then
find usr/bin -type f -printf "/%h/%f\n" >> filelist.lst
fi
if [ -d usr/sbin ]; then
find usr/sbin -type f -printf "/%h/%f\n" >> filelist.lst
fi
touch doclist.lst
if [ -d usr/share/man ]; then
find usr/share/man -type f -printf "/%h/%f.gz\n" >> doclist.lst
fi
popd
mv %{buildroot}/filelist.lst .
mv %{buildroot}/doclist.lst .
%files -n python3-BitVector -f filelist.lst
%dir %{python3_sitelib}/*
%files help -f doclist.lst
%{_docdir}/*
%changelog
* Tue May 30 2023 Python_Bot <Python_Bot@openeuler.org> - 3.5.0-1
- Package Spec generated
|
