FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
xtensor-python/include/xtensor-python/pybuffer_adaptor.hpp at master · stonebig/xtensor-python · GitHub
stonebig
xtensor-python
Repository navigation
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
xtensor-python
/
include
/
xtensor-python
/
pybuffer_adaptor.hpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
475 lines (373 loc) · 12.5 KB
Breadcrumbs
xtensor-python
/
include
/
xtensor-python
/
pybuffer_adaptor.hpp
Copy path
File metadata and controls
475 lines (373 loc) · 12.5 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
/*
**************************************************************************
* Copyright (c) 2016, Johan Mabille and Sylvain Corlay *
* *
* Distributed under the terms of the BSD 3-Clause License. *
* *
* The full license is in the file LICENSE, distributed with this software. *
***************************************************************************
*/
#
ifndef
PYBUFFER_ADAPTOR_HPP
#
define
PYBUFFER_ADAPTOR_HPP
#
include
<
cstddef
>
#
include
<
iterator
>
#
include
<
algorithm
>
namespace
xt
{
template
<
class
T
>
class
pybuffer_adaptor
{
public:
using
value_type = T;
using
reference = T&;
using
const_reference =
const
T&;
using
pointer = T*;
using
const_pointer =
const
T*;
using
size_type = std::
size_t
;
using
difference_type = std::
ptrdiff_t
;
using
iterator = pointer;
using
const_iterator = const_pointer;
using
reverse_iterator = std::reverse_iterator<iterator>;
using
const_reverse_iterator = std::reverse_iterator<const_iterator>;
pybuffer_adaptor
() =
default
;
pybuffer_adaptor
(pointer data, size_type size);
bool
empty
()
const
noexcept
;
size_type
size
()
const
noexcept
;
reference
operator
[](size_type i);
const_reference
operator
[](size_type i)
const
;
reference
front
();
const_reference
front
()
const
;
reference
back
();
const_reference
back
()
const
;
iterator
begin
();
iterator
end
();
const_iterator
begin
()
const
;
const_iterator
end
()
const
;
const_iterator
cbegin
()
const
;
const_iterator
cend
()
const
;
reverse_iterator
rbegin
();
reverse_iterator
rend
();
const_reverse_iterator
rbegin
()
const
;
const_reverse_iterator
rend
()
const
;
const_reverse_iterator
crbegin
()
const
;
const_reverse_iterator
crend
()
const
;
pointer
data
();
const_pointer
data
()
const
;
private:
pointer p_data;
size_type m_size;
};
template
<
class
T
>
bool
operator
==(
const
pybuffer_adaptor<T>& x,
const
pybuffer_adaptor<T>& y);
template
<
class
T
>
bool
operator
<(
const
pybuffer_adaptor<T>& x,
const
pybuffer_adaptor<T>& y);
template
<
class
T
>
bool
operator
!=(
const
pybuffer_adaptor<T>& x,
const
pybuffer_adaptor<T>& y);
template
<
class
T
>
bool
operator
>(
const
pybuffer_adaptor<T>& x,
const
pybuffer_adaptor<T>& y);
template
<
class
T
>
bool
operator
<=(
const
pybuffer_adaptor<T>& x,
const
pybuffer_adaptor<T>& y);
template
<
class
T
>
bool
operator
>=(
const
pybuffer_adaptor<T>& x,
const
pybuffer_adaptor<T>& y);
template
<std::
size_t
N>
class
pystrides_iterator
;
template
<std::
size_t
N>
class
pystrides_adaptor
{
public:
using
value_type = std::
size_t
;
using
const_reference = value_type;
using
const_pointer =
const
value_type*;
using
size_type = std::
size_t
;
using
difference_type = std::
ptrdiff_t
;
using
const_iterator = pystrides_iterator<N>;
pystrides_adaptor
() =
default
;
pystrides_adaptor
(const_pointer data, size_type size);
bool
empty
()
const
noexcept
;
size_type
size
()
const
noexcept
;
const_reference
operator
[](size_type i)
const
;
const_reference
front
()
const
;
const_reference
back
()
const
;
const_iterator
begin
()
const
;
const_iterator
end
()
const
;
const_iterator
cbegin
()
const
;
const_iterator
cend
()
const
;
private:
const_pointer p_data;
size_type m_size;
};
/*
**********************************
* pybuffer_adaptor implementation *
**********************************
*/
template
<
class
T
>
inline
pybuffer_adaptor<T>::pybuffer_adaptor(pointer data, size_type size)
: p_data(data), m_size(size)
{
}
template
<
class
T
>
inline
bool
pybuffer_adaptor<T>::empty()
const
noexcept
{
return
m_size ==
0
;
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::size()
const
noexcept
-> size_type
{
return
m_size;
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::
operator
[](size_type i) -> reference
{
return
p_data[i];
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::
operator
[](size_type i)
const
-> const_reference
{
return
p_data[i];
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::front() -> reference
{
return
p_data[
0
];
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::front()
const
-> const_reference
{
return
p_data[
0
];
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::back() -> reference
{
return
p_data[m_size -
1
];
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::back()
const
-> const_reference
{
return
p_data[m_size -
1
];
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::begin() -> iterator
{
return
p_data;
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::end() -> iterator
{
return
p_data + m_size;
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::begin()
const
-> const_iterator
{
return
const_iterator
(p_data);
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::end()
const
-> const_iterator
{
return
const_iterator
(p_data + m_size);
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::cbegin()
const
-> const_iterator
{
return
begin
();
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::cend()
const
-> const_iterator
{
return
end
();
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::rbegin() -> reverse_iterator
{
return
reverse_iterator
(
end
());
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::rend() -> reverse_iterator
{
return
reverse_iterator
(
begin
());
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::rbegin()
const
-> const_reverse_iterator
{
return
const_reverse_iterator
(
end
());
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::rend()
const
-> const_reverse_iterator
{
return
const_reverse_iterator
(
begin
());
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::crbegin()
const
-> const_reverse_iterator
{
return
rbegin
();
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::crend()
const
-> const_reverse_iterator
{
return
rend
();
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::data() -> pointer
{
return
p_data;
}
template
<
class
T
>
inline
auto
pybuffer_adaptor<T>::data()
const
-> const_pointer
{
return
p_data;
}
template
<
class
T
>
inline
bool
operator
==(
const
pybuffer_adaptor<T>& x,
const
pybuffer_adaptor<T>& y)
{
return
(x.
size
() == y.
size
() &&
std::equal
(x.
begin
(), x.
end
(), y.
begin
()));
}
template
<
class
T
>
inline
bool
operator
<(
const
pybuffer_adaptor<T>& x,
const
pybuffer_adaptor<T>& y)
{
return
std::lexicographical_compare
(x.
begin
(), x.
end
(), y.
begin
(), y.
end
());
}
template
<
class
T
>
inline
bool
operator
!=(
const
pybuffer_adaptor<T>& x,
const
pybuffer_adaptor<T>& y)
{
return
!(x == y);
}
template
<
class
T
>
inline
bool
operator
>(
const
pybuffer_adaptor<T>& x,
const
pybuffer_adaptor<T>& y)
{
return
y < x;
}
template
<
class
T
>
inline
bool
operator
<=(
const
pybuffer_adaptor<T>& x,
const
pybuffer_adaptor<T>& y)
{
return
!(y < x);
}
template
<
class
T
>
inline
bool
operator
>=(
const
pybuffer_adaptor<T>& x,
const
pybuffer_adaptor<T>& y)
{
return
!(x < y);
}
/*
************************************
* pystrides_iterator implementation *
************************************
*/
template
<std::
size_t
N>
class
pystrides_iterator
{
public:
using
self_type = pystrides_iterator<N>;
using
value_type =
typename
pystrides_adaptor<N>::value_type;
using
pointer =
typename
pystrides_adaptor<N>::const_pointer;
using
reference =
typename
pystrides_adaptor<N>::const_reference;
using
difference_type =
typename
pystrides_adaptor<N>::difference_type;
using
iterator_category = std::random_access_iterator_tag;
inline
pystrides_iterator
(pointer current)
: p_current(current)
{
}
inline
reference
operator
*()
const
{
return
*p_current / N; }
inline
pointer
operator
->()
const
{
return
p_current; }
inline
reference
operator
[](difference_type n) {
return
*(p_current + n) / N; }
inline
self_type&
operator
++() { ++p_current;
return
*
this
; }
inline
self_type&
operator
--() { --p_current;
return
*
this
; }
inline
self_type
operator
++(
int
) { self_type
tmp
(*
this
); ++p_current;
return
tmp; }
inline
self_type
operator
--(
int
) { self_type
tmp
(*
this
); --p_current;
return
tmp; }
inline
self_type&
operator
+=(difference_type n) { p_current += n;
return
*
this
; }
inline
self_type&
operator
-=(difference_type n) { p_current -= n;
return
*
this
; }
inline
self_type
operator
+(difference_type n)
const
{
return
self_type
(p_current + n); }
inline
self_type
operator
-(difference_type n)
const
{
return
self_type
(p_current - n); }
inline
self_type
operator
-(
const
self_type& rhs)
const
{
self_type
tmp
(*
this
);
tmp -= (p_current - rhs.
p_current
);
return
tmp;
}
pointer
get_pointer
()
const
{
return
p_current; }
private:
pointer p_current;
};
template
<std::
size_t
N>
inline
bool
operator
==(
const
pystrides_iterator<N>& lhs,
const
pystrides_iterator<N>& rhs)
{
return
lhs.
get_pointer
() == rhs.
get_pointer
();
}
template
<std::
size_t
N>
inline
bool
operator
!=(
const
pystrides_iterator<N>& lhs,
const
pystrides_iterator<N>& rhs)
{
return
!(lhs == rhs);
}
template
<std::
size_t
N>
inline
bool
operator
<(
const
pystrides_iterator<N>& lhs,
const
pystrides_iterator<N>& rhs)
{
return
lhs.
get_pointer
() < rhs.
get_pointer
();
}
template
<std::
size_t
N>
inline
bool
operator
<=(
const
pystrides_iterator<N>& lhs,
const
pystrides_iterator<N>& rhs)
{
return
(lhs < rhs) || (lhs == rhs);
}
template
<std::
size_t
N>
inline
bool
operator
>(
const
pystrides_iterator<N>& lhs,
const
pystrides_iterator<N>& rhs)
{
return
!(lhs <= rhs);
}
template
<std::
size_t
N>
inline
bool
operator
>=(
const
pystrides_iterator<N>& lhs,
const
pystrides_iterator<N>& rhs)
{
return
!(lhs < rhs);
}
/*
***********************************
* pystrides_adaptor implementation *
***********************************
*/
template
<std::
size_t
N>
inline
pystrides_adaptor<N>::pystrides_adaptor(const_pointer data, size_type size)
: p_data(data), m_size(size)
{
}
template
<std::
size_t
N>
inline
bool
pystrides_adaptor<N>::empty()
const
noexcept
{
return
m_size ==
0
;
}
template
<std::
size_t
N>
inline
auto
pystrides_adaptor<N>::size()
const
noexcept
-> size_type
{
return
m_size;
}
template
<std::
size_t
N>
inline
auto
pystrides_adaptor<N>::
operator
[](size_type i)
const
-> const_reference
{
return
p_data[i] / N;
}
template
<std::
size_t
N>
inline
auto
pystrides_adaptor<N>::front()
const
-> const_reference
{
return
p_data[
0
] / N;
}
template
<std::
size_t
N>
inline
auto
pystrides_adaptor<N>::back()
const
-> const_reference
{
return
p_data[m_size -
1
] / N;
}
template
<std::
size_t
N>
inline
auto
pystrides_adaptor<N>::begin()
const
-> const_iterator
{
return
const_iterator
(p_data);
}
template
<std::
size_t
N>
inline
auto
pystrides_adaptor<N>::end()
const
-> const_iterator
{
return
const_iterator
(p_data + m_size);
}
template
<std::
size_t
N>
inline
auto
pystrides_adaptor<N>::cbegin()
const
-> const_iterator
{
return
begin
();
}
template
<std::
size_t
N>
inline
auto
pystrides_adaptor<N>::cend()
const
-> const_iterator
{
return
end
();
}
}
#
endif
Back
|
FazBrowse Home
|
New Git URL