-
-
Notifications
You must be signed in to change notification settings - Fork 373
/
Iterable.pm
152 lines (131 loc) Β· 5.34 KB
/
Iterable.pm
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
# Iterable is done by anything that we should be able to get an iterator
# from. Things that are Iterable will flatten in flattening contexts, so a
# default implementation of .flat is provided by this role. As itemization is
# what defeats flattening, this role also provides a default .item method.
# Additionally, as .lazy and .eager are about iterator behavior, they are
# provided by this role. Overriding those is not likely to be needed, and
# discouraged to maintain predictable semantics. Finally, both .hyper() and
# .race() are implemented here, and return a HyperSeq wrapping the iterator.
my class HyperSeq { ... }
my class X::Invalid::Value { ... }
my role Iterable {
method iterator() { ... }
method item() {
nqp::p6bindattrinvres(nqp::create(Scalar), Scalar, '$!value', self)
}
method flat(Iterable:D:) {
my $laze := self.is-lazy;
Seq.new(class :: does Iterator {
has Iterator $!source;
has Iterator $!nested;
method new(\source) {
nqp::p6bindattrinvres(nqp::create(self),self,'$!source',source)
}
my constant NO_RESULT_YET = nqp::create(Mu);
method pull-one() is raw {
my $result := NO_RESULT_YET;
my $got;
nqp::while(
nqp::eqaddr($result, NO_RESULT_YET),
nqp::if(
$!nested,
nqp::if(
nqp::eqaddr(($got := $!nested.pull-one),IterationEnd),
($!nested := Iterator),
($result := $got)
),
nqp::if(
nqp::istype(($got := $!source.pull-one),Iterable)
&& nqp::not_i(nqp::iscont($got)),
($!nested := $got.flat.iterator),
($result := $got)
)
)
);
$result
}
method push-all($target --> IterationEnd) {
my $iter := $!nested || $!source;
nqp::until(
nqp::eqaddr((my $got := $iter.pull-one), IterationEnd)
&& nqp::eqaddr($iter, $!source),
nqp::if(
nqp::eqaddr($got, IterationEnd),
nqp::stmts(
($!nested := Iterator),
($iter := $!source),
),
nqp::if(
nqp::istype($got,Iterable)
&& nqp::not_i(nqp::iscont($got)),
($iter := $got.flat.iterator),
$target.push($got),
),
)
);
}
}.new(self.iterator)).lazy-if($laze)
}
method lazy-if($flag) { $flag ?? self.lazy !! self }
method lazy() {
# Return a Seq with an iterator wrapping this Iterable, claiming to
# be lazy, and implicitly preventing working ahead (by hiding any
# push-at-least-n of the source iterator).
Seq.new(class :: does Iterator {
has $!iterable;
has $!iterator;
method new(\iterable) {
nqp::p6bindattrinvres(
nqp::create(self),self,'$!iterable',iterable
)
}
method pull-one() is raw {
$!iterator := $!iterable.iterator unless $!iterator.DEFINITE;
$!iterator.pull-one
}
method push-exactly($target, int $n) {
$!iterator := $!iterable.iterator unless $!iterator.DEFINITE;
$!iterator.push-exactly($target, $n);
}
method is-lazy() { True }
}.new(self))
}
method !valid-hyper-race($method,$batch,$degree --> Nil) {
$batch <= 0
?? X::Invalid::Value.new(
:$method,:name<batch>,:value($batch)).throw
!! $degree <= 0
?? X::Invalid::Value.new(
:$method,:name<degree>,:value($degree)).throw
!! Nil
}
method hyper(Int(Cool) :$batch = 64, Int(Cool) :$degree = 4) {
self!valid-hyper-race('hyper',$batch,$degree);
self!go-hyper(HyperConfiguration.new(:!race, :$batch, :$degree))
}
method race(Int(Cool) :$batch = 64, Int(Cool) :$degree = 4) {
self!valid-hyper-race('race',$batch,$degree);
self!go-hyper(HyperConfiguration.new(:race, :$batch, :$degree))
}
method !go-hyper($configuration) {
HyperSeq.new(class :: does HyperIterator {
has $!source;
has $!configuration;
method new(\iter, $configuration) {
my \hyper-iter = nqp::create(self);
nqp::bindattr(hyper-iter, self, '$!source', iter);
nqp::bindattr(hyper-iter, self, '$!configuration', $configuration);
hyper-iter
}
method fill-buffer(HyperWorkBuffer:D $work, int $items) {
$!source.push-exactly($work.input, $items)
}
method process-buffer(HyperWorkBuffer:D $work --> Nil) { }
method configuration() { $!configuration }
}.new(self.iterator, $configuration));
}
}
#?if jvm
nqp::p6setitertype(Iterable);
#?endif
# vim: ft=perl6 expandtab sw=4