-
-
Notifications
You must be signed in to change notification settings - Fork 373
/
Parcel.pm
241 lines (215 loc) Β· 7.81 KB
/
Parcel.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
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
my class Parcel does Positional { # declared in BOOTSTRAP
# class Parcel is Cool {
# has Mu $!storage; # VM's array of Parcel's elements
# has Str $!WHICH;
multi method new(|) {
my Mu $args := nqp::p6argvmarray();
nqp::shift($args);
nqp::p6parcel($args, Nil)
}
multi method Bool(Parcel:D:) { nqp::p6bool($!storage) }
multi method Numeric(Parcel:D:) { nqp::elems($!storage) }
multi method Str(Parcel:D:) { self.list.Str }
multi method ACCEPTS(Parcel:D: $topic) {
my $sseq = self.list;
my $tseq = $topic.list;
my int $spos = 0;
my int $tpos = 0;
while $spos < +$sseq {
# if the next element is Whatever
if nqp::istype($sseq[$spos],Whatever) {
# skip over all of the Whatevers
$spos = $spos + 1
while $spos <= +$sseq && nqp::istype($sseq[$spos],Whatever);
# if nothing left, we're done
return True if !($spos < +$sseq);
# find a target matching our new target
$tpos = $tpos + 1
while ($tpos < +$tseq) && $tseq[$tpos] !== $sseq[$spos];
# return false if we ran out
return False if !($tpos < +$tseq);
}
elsif $tpos >= +$tseq || $tseq[$tpos] !=== $sseq[$spos] {
return False;
}
# skip matching elements
$spos = $spos + 1;
$tpos = $tpos + 1;
}
# If nothing left to match, we're successful.
$tpos >= +$tseq;
}
multi method WHICH(Parcel:D:) {
$!WHICH //= self.^name
~ '|'
~ (^self.elems).map( {'(' ~ self[$_].VAR.WHICH ~ ')'} ).join;
}
method Parcel() { self }
method Capture() {
my $cap := nqp::create(Capture);
my Mu $list := nqp::list();
my Mu $hash := nqp::hash();
my int $c = nqp::elems($!storage);
my int $i = 0;
while $i < $c {
my $v := nqp::atpos($!storage, $i);
nqp::istype($v, Pair) ??
nqp::bindkey($hash, nqp::unbox_s($v.key), $v.value) !!
nqp::push($list, $v);
$i = $i + 1;
}
nqp::bindattr($cap, Capture, '$!list', $list);
nqp::bindattr($cap, Capture, '$!hash', $hash);
$cap
}
method elems() { nqp::elems($!storage) }
method item() { my $ = self }
method flat() { nqp::p6list(nqp::clone($!storage), List, Bool::True) }
method list() { nqp::p6list(nqp::clone($!storage), List, Mu) }
method lol() { nqp::p6list(nqp::clone($!storage), LoL, Mu) }
method reverse() {
my Mu $reverse := nqp::list();
my Mu $original := nqp::clone($!storage);
nqp::push($reverse, nqp::pop($original)) while $original;
my $parcel := nqp::create(self.WHAT);
nqp::bindattr($parcel, Parcel, '$!storage', $reverse);
$parcel;
}
method rotate (Int $n is copy = 1) {
my $elems := nqp::p6box_i(nqp::elems($!storage));
return self if !$elems;
$n %= $elems;
return self if $n == 0;
my Mu $storage := nqp::clone($!storage);
if $n > 0 {
nqp::push($storage, nqp::shift($storage)) while $n--;
}
elsif $n < 0 {
nqp::unshift($storage, nqp::pop($storage)) while $n++;
}
my $parcel := nqp::create(self.WHAT);
nqp::bindattr($parcel, Parcel, '$!storage', $storage);
$parcel;
}
multi method exists_pos(Parcel:D: int \pos) {
nqp::p6bool(
nqp::islt_i(pos,nqp::elems($!storage)) && nqp::isge_i(pos,0)
);
}
multi method exists_pos(Parcel:D: Int:D \pos) {
pos < nqp::elems($!storage) && pos >= 0;
}
multi method at_pos(Parcel:D: int \pos) is rw {
fail X::OutOfRange.new(:what<Index>,:got(pos),:range<0..Inf>)
if nqp::islt_i(pos,0);
nqp::isge_i(pos,nqp::elems($!storage))
?? Nil
!! nqp::atpos($!storage,pos);
}
multi method at_pos(Parcel:D: Int:D \pos) is rw {
my int $pos = nqp::unbox_i(pos);
fail X::OutOfRange.new(:what<Index>,:got(pos),:range<0..Inf>)
if nqp::islt_i($pos,0);
nqp::isge_i($pos,nqp::elems($!storage))
?? Nil
!! nqp::atpos($!storage,$pos);
}
multi method assign_pos(Parcel:D: int \pos, Mu \assignee) is rw {
X::OutOfRange.new(
:what<Index>,
:got(pos),
:range("0..{nqp::elems($!storage)-1}")
).throw
if nqp::isge_i(pos,nqp::elems($!storage)) || nqp::islt_i(pos,0);
nqp::atpos($!storage,pos) = assignee;
}
multi method assign_pos(Parcel:D: Int:D \pos, Mu \assignee) is rw {
my int $pos = nqp::unbox_i(pos);
X::OutOfRange.new(
:what<Index>,
:got(pos),
:range("0..{nqp::elems($!storage)-1}")
).throw
if nqp::isge_i($pos,nqp::elems($!storage)) || nqp::islt_i($pos,0);
nqp::atpos($!storage,$pos) = assignee;
}
multi method gist(Parcel:D:) {
my Mu $gist := nqp::list();
my Mu $iter := nqp::iterator($!storage);
nqp::push($gist, nqp::unbox_s(nqp::shift($iter).gist)) while $iter;
nqp::p6box_s(nqp::join(' ', $gist))
}
multi method perl(Parcel:D \SELF:) {
my Mu $rpa := nqp::clone($!storage);
my $perl = nqp::iscont(SELF) ?? '$(' !! '(';
if $rpa {
$perl = $perl ~ nqp::shift($rpa).perl;
if $rpa {
$perl = $perl ~ ', ' ~ nqp::shift($rpa).perl while $rpa;
}
else {
$perl = $perl ~ ',';
}
$perl ~ ')'
}
# because $() is *NOT* a Parcel but short for "$( $/.made // Str($/) )"
elsif nqp::iscont(SELF) {
$perl ~ ' )'
}
else {
$perl ~ ')'
}
}
method STORE(|) {
# get the list of rvalues to store and lhs containers
my Mu $args := nqp::p6argvmarray();
nqp::shift($args);
my $rhs := nqp::p6list($args, List, Bool::True);
# first pass -- scan lhs containers and pick out
# scalar versus list assignment. This also reifies
# the rhs values
my Mu $lhs := nqp::clone($!storage);
my Mu $tv := nqp::list();
while ($lhs) {
my Mu \x := nqp::shift($lhs);
if nqp::iscont(x) {
# container: scalar assignment
nqp::push($tv, x);
nqp::push($tv, $rhs.gimme(1) ?? nqp::decont($rhs.shift) !! Nil);
}
elsif nqp::istype(x, Whatever) {
# Whatever: skip assigning value
$rhs.shift;
}
elsif nqp::istype(x, Parcel) {
# Parcel: splice into current lhs
nqp::splice($lhs, nqp::getattr(x, Parcel, '$!storage'), 0, 0)
}
else {
# store entire rhs
nqp::push($tv, x);
nqp::push($tv, $rhs);
$rhs := ().list;
}
}
# second pass, perform the assignments
while ($tv) { my \x := nqp::shift($tv); x = nqp::shift($tv); }
self
}
multi method DUMP(Parcel:D: :$indent-step = 4, :%ctx?) {
return DUMP(self, :$indent-step) unless %ctx;
my Mu $attrs := nqp::list();
nqp::push($attrs, '$!storage');
nqp::push($attrs, $!storage );
self.DUMP-OBJECT-ATTRS($attrs, :$indent-step, :%ctx);
}
method FLATTENABLE_LIST() { $!storage }
method FLATTENABLE_HASH() { nqp::hash() }
method fmt($format = '%s', $separator = ' ') {
self.list.fmt($format, $separator);
}
}
my sub infix:<,>(|) is pure {
nqp::p6parcel(nqp::p6argvmarray(), nqp::null());
}
# vim: ft=perl6 expandtab sw=4