-
Notifications
You must be signed in to change notification settings - Fork 0
/
pyfuncs.hh
156 lines (129 loc) · 3.31 KB
/
pyfuncs.hh
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
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at https://mozilla.org/MPL/2.0/.
*
* Copyright (c) 2019, Arthus Leroy <[email protected]>
* On https://github.com/arthus-leroy/Pyfuncs
* All rights reserved. */
# pragma once
# include <vector>
# include <assert.h>
# include "misc.hh"
/** range
* Equivalent of python's range
* Called as :
* - for (const auto i : range(end)) with end any size_t
* - for (const auto i : range(begin, end)) with begin, end any size_t
*/
class range
{
class Iterator : std::iterator<std::input_iterator_tag, std::size_t, void, std::size_t*, std::size_t&>
{
public:
Iterator(std::size_t max)
: i_(0), max_(max)
{}
Iterator(std::size_t i, std::size_t max)
: i_(i), max_(max)
{}
bool operator!=(const Iterator& iter)
{
return i_ != iter.i_;
}
std::size_t operator*()
{
return i_;
}
Iterator& operator++()
{
i_++;
return *this;
}
private:
std::size_t i_;
const std::size_t max_;
};
public:
range(const std::size_t i, const std::size_t max)
: i_(i), max_(max)
{
assert(i <= max);
}
range(const std::size_t max)
: range(0, max)
{}
Iterator begin()
{
return Iterator(i_, max_);
}
Iterator end()
{
return Iterator(max_, max_);
}
private:
const std::size_t i_;
const std::size_t max_;
};
/** zip
* Equivalent of python's zip
* Called as :
* for (const auto& [a, b, ...] : zip(v0, v1, ...)) with v0, v1, ... any random access container
*/
template <typename ...Args>
class zip
{
using array_t = std::tuple<const Args&...>;
using tuple_t = std::tuple<typename Args::value_type...>;
template <std::size_t N>
class Iterator : std::iterator<std::input_iterator_tag, tuple_t, void, tuple_t*, tuple_t&>
{
template <std::size_t M>
auto get()
{
static_assert(M < N);
if constexpr(M == N - 1) // size - 1
return std::make_tuple(std::get<M>(arrays_)[i_]);
else
return std::tuple_cat(std::make_tuple(std::get<M>(arrays_)[i_]), get<M + 1>());
}
public:
Iterator(const array_t& arrays)
: arrays_(arrays), i_(0)
{}
Iterator(const array_t& arrays, const std::size_t i)
: arrays_(arrays), i_(i)
{}
bool operator!=(const Iterator& iter)
{
return i_ != iter.i_ || &arrays_ != &iter.arrays_;
}
tuple_t operator*()
{
return get<0>();
}
Iterator& operator++()
{
i_++;
return *this;
}
private:
const array_t& arrays_;
std::size_t i_;
};
public:
zip(const Args&... args)
: arrays_(args...)
, max_(min_size(args...))
{}
auto begin()
{
return Iterator<sizeof...(Args)>(arrays_, 0);
}
auto end()
{
return Iterator<sizeof...(Args)>(arrays_, max_);
}
private:
const array_t arrays_;
const std::size_t max_;
};