FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
xtensor-python/include/xtensor-python/pystrides_adaptor.hpp at master · phaustin/xtensor-python · GitHub
phaustin
xtensor-python
Repository navigation
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
xtensor-python
/
include
/
xtensor-python
/
pystrides_adaptor.hpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
219 lines (169 loc) · 6.24 KB
Breadcrumbs
xtensor-python
/
include
/
xtensor-python
/
pystrides_adaptor.hpp
Copy path
File metadata and controls
219 lines (169 loc) · 6.24 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
/*
**************************************************************************
* 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
PYSTRIDES_ADAPTOR_HPP
#
define
PYSTRIDES_ADAPTOR_HPP
#
include
<
cstddef
>
#
include
<
iterator
>
namespace
xt
{
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;
};
/*
************************************
* 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