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
|
// sol2
// The MIT License (MIT)
// Copyright (c) 2013-2022 Rapptz, ThePhD and contributors
// Permission is hereby granted, free of charge, to any person obtaining a copy of
// this software and associated documentation files (the "Software"), to deal in
// the Software without restriction, including without limitation the rights to
// use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
// the Software, and to permit persons to whom the Software is furnished to do so,
// subject to the following conditions:
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
// FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
// COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
// IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
// CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
#ifndef SOL_STACK_ITERATOR_HPP
#define SOL_STACK_ITERATOR_HPP
#include <sol/stack.hpp>
#include <limits>
#include <iterator>
namespace sol {
template <typename proxy_t, bool is_const>
struct stack_iterator {
typedef meta::conditional_t<is_const, const proxy_t, proxy_t> reference;
typedef meta::conditional_t<is_const, const proxy_t*, proxy_t*> pointer;
typedef proxy_t value_type;
typedef std::ptrdiff_t difference_type;
typedef std::random_access_iterator_tag iterator_category;
lua_State* L;
int index;
int stacktop;
proxy_t sp;
stack_iterator() : L(nullptr), index((std::numeric_limits<int>::max)()), stacktop((std::numeric_limits<int>::max)()), sp() {
}
stack_iterator(const stack_iterator<proxy_t, true>& r) : L(r.L), index(r.index), stacktop(r.stacktop), sp(r.sp) {
}
stack_iterator(lua_State* luastate, int idx, int topidx) : L(luastate), index(idx), stacktop(topidx), sp(luastate, idx) {
}
reference operator*() {
return proxy_t(L, index);
}
reference operator*() const {
return proxy_t(L, index);
}
pointer operator->() {
sp = proxy_t(L, index);
return &sp;
}
pointer operator->() const {
const_cast<proxy_t&>(sp) = proxy_t(L, index);
return &sp;
}
stack_iterator& operator++() {
++index;
return *this;
}
stack_iterator operator++(int) {
auto r = *this;
this->operator++();
return r;
}
stack_iterator& operator--() {
--index;
return *this;
}
stack_iterator operator--(int) {
auto r = *this;
this->operator--();
return r;
}
stack_iterator& operator+=(difference_type idx) {
index += static_cast<int>(idx);
return *this;
}
stack_iterator& operator-=(difference_type idx) {
index -= static_cast<int>(idx);
return *this;
}
difference_type operator-(const stack_iterator& r) const {
return index - r.index;
}
stack_iterator operator+(difference_type idx) const {
stack_iterator r = *this;
r += idx;
return r;
}
reference operator[](difference_type idx) const {
return proxy_t(L, index + static_cast<int>(idx));
}
bool operator==(const stack_iterator& r) const {
if (stacktop == (std::numeric_limits<int>::max)()) {
return r.index == r.stacktop;
}
else if (r.stacktop == (std::numeric_limits<int>::max)()) {
return index == stacktop;
}
return index == r.index;
}
bool operator!=(const stack_iterator& r) const {
return !(this->operator==(r));
}
bool operator<(const stack_iterator& r) const {
return index < r.index;
}
bool operator>(const stack_iterator& r) const {
return index > r.index;
}
bool operator<=(const stack_iterator& r) const {
return index <= r.index;
}
bool operator>=(const stack_iterator& r) const {
return index >= r.index;
}
};
template <typename proxy_t, bool is_const>
inline stack_iterator<proxy_t, is_const> operator+(
typename stack_iterator<proxy_t, is_const>::difference_type n, const stack_iterator<proxy_t, is_const>& r) {
return r + n;
}
} // namespace sol
#endif // SOL_STACK_ITERATOR_HPP
|
