Skip to content

Commit

Permalink
Browse files Browse the repository at this point in the history
move changes to SLICE.pm@04cc1d52c5 to makeSLICE.pl6
  • Loading branch information
@FROGGS
FROGGS committed Apr 28, 2015
1 parent 04cc1d5 commit 4fafbe8
Show file tree
Hide file tree
Showing 2 changed files with 27 additions and 27 deletions.
2 changes: 1 addition & 1 deletion src/core/SLICE.pm
View file
@@ -1,7 +1,7 @@
#===============================================================================
#
# This file has been generated by tools/build/makeSLICE.pl6
# on 2015-03-13T18:46:40Z.
# on 2015-04-28T08:26:53Z.
#
# Please do *NOT* make changes to this file, as they will be lost
# whenever this file is generated again.
Expand Down
52 changes: 26 additions & 26 deletions tools/build/makeSLICE.pl6
View file
Expand Up @@ -222,25 +222,25 @@ sub SLICE_MORE_@TYPE[]\SELF,$more,*%adv) is hidden-from-backtrace {
if DELETEKEY($d,'delete') { # :delete:*
if DELETEKEY($d,'SINK') { # :delete:SINK
SELF.@DELETE[]$_,:SINK) for $more;
SELF.@DELETE[]$_,:SINK) for $more.list;
Nil;
}
elsif nqp::elems($d) == 0 { # :delete
$more.list.map( { SELF.@DELETE[]$_) } ).eager.Parcel;
$more.list.flatmap( { SELF.@DELETE[]$_) } ).eager.Parcel;
}
elsif nqp::existskey($d,'exists') { # :delete:exists(0|1):*
my $exists := DELETEKEY($d,'exists');
my $wasthere; # no need to initialize every iteration of map
if nqp::elems($d) == 0 { # :delete:exists(0|1)
$more.list.map( {
$more.list.flatmap( {
SELF.@DELETE[]$_) if $wasthere = SELF.@EXISTS[]$_);
!( $wasthere ?^ $exists );
} ).eager.Parcel;
}
elsif nqp::existskey($d,'kv') { # :delete:exists(0|1):kv(0|1):*
my $kv := DELETEKEY($d,'kv');
if nqp::elems($d) == 0 { # :delete:exists(0|1):kv(0|1)
$more.list.map( {
$more.list.flatmap( {
SELF.@DELETE[]$_) if $wasthere = SELF.@EXISTS[]$_);
next unless !$kv || $wasthere;
($_, !( $wasthere ?^ $exists ));
Expand All @@ -253,7 +253,7 @@ sub SLICE_MORE_@TYPE[]\SELF,$more,*%adv) is hidden-from-backtrace {
elsif nqp::existskey($d,'p') { # :delete:exists(0|1):p(0|1):*
my $p := DELETEKEY($d,'p');
if nqp::elems($d) == 0 { # :delete:exists(0|1):p(0|1)
$more.list.map( {
$more.list.flatmap( {
SELF.@DELETE[]$_) if $wasthere = SELF.@EXISTS[]$_);
next unless !$p || $wasthere;
RWPAIR($_,!($wasthere ?^ $exists));
Expand All @@ -271,11 +271,11 @@ sub SLICE_MORE_@TYPE[]\SELF,$more,*%adv) is hidden-from-backtrace {
my $kv := DELETEKEY($d,'kv');
if nqp::elems($d) == 0 { # :delete:kv(0|1)
$kv
?? $more.list.map( {
?? $more.list.flatmap( {
next unless SELF.@EXISTS[]$_);
( $_, SELF.@DELETE[]$_) );
} ).flat.eager.Parcel
!! $more.list.map( {
!! $more.list.flatmap( {
( $_, SELF.@DELETE[]$_) )
} ).flat.eager.Parcel;
}
Expand All @@ -287,11 +287,11 @@ sub SLICE_MORE_@TYPE[]\SELF,$more,*%adv) is hidden-from-backtrace {
my $p := DELETEKEY($d,'p');
if nqp::elems($d) == 0 { # :delete:p(0|1)
$p
?? $more.list.map( {
?? $more.list.flatmap( {
next unless SELF.@EXISTS[]$_);
RWPAIR($_, SELF.@DELETE[]$_));
} ).eager.Parcel
!! $more.list.map( {
!! $more.list.flatmap( {
RWPAIR($_, SELF.@DELETE[]$_))
} ).eager.Parcel;
}
Expand All @@ -303,11 +303,11 @@ sub SLICE_MORE_@TYPE[]\SELF,$more,*%adv) is hidden-from-backtrace {
my $k := DELETEKEY($d,'k');
if nqp::elems($d) == 0 { # :delete:k(0|1)
$k
?? $more.list.map( {
?? $more.list.flatmap( {
next unless SELF.@EXISTS[]$_);
SEQ( SELF.@DELETE[]$_); $_ );
} ).eager.Parcel
!! $more.list.map( {
!! $more.list.flatmap( {
SELF.@DELETE[]$_); $_
} ).eager.Parcel;
}
Expand All @@ -319,11 +319,11 @@ sub SLICE_MORE_@TYPE[]\SELF,$more,*%adv) is hidden-from-backtrace {
my $v := DELETEKEY($d,'v');
if nqp::elems($d) == 0 { # :delete:v(0|1)
$v
?? $more.list.map( {
?? $more.list.flatmap( {
next unless SELF.@EXISTS[]$_);
SELF.@DELETE[]$_);
} ).eager.Parcel
!! $more.list.map( {
!! $more.list.flatmap( {
SELF.@DELETE[]$_)
} ).eager.Parcel;
}
Expand All @@ -338,17 +338,17 @@ sub SLICE_MORE_@TYPE[]\SELF,$more,*%adv) is hidden-from-backtrace {
elsif nqp::existskey($d,'exists') { # :!delete?:exists(0|1):*
my $exists := DELETEKEY($d,'exists');
if nqp::elems($d) == 0 { # :!delete?:exists(0|1)
$more.list.map({ !( SELF.@EXISTS[]$_) ?^ $exists ) }).eager.Parcel;
$more.list.flatmap({ !( SELF.@EXISTS[]$_) ?^ $exists ) }).eager.Parcel;
}
elsif nqp::existskey($d,'kv') { # :!delete?:exists(0|1):kv(0|1):*
my $kv := DELETEKEY($d,'kv');
if nqp::elems($d) == 0 { # :!delete?:exists(0|1):kv(0|1)
$kv
?? $more.list.map( {
?? $more.list.flatmap( {
next unless SELF.@EXISTS[]$_);
( $_, $exists );
} ).flat.eager.Parcel
!! $more.list.map( {
!! $more.list.flatmap( {
( $_, !( SELF.@EXISTS[]$_) ?^ $exists ) )
} ).flat.eager.Parcel;
}
Expand All @@ -360,11 +360,11 @@ sub SLICE_MORE_@TYPE[]\SELF,$more,*%adv) is hidden-from-backtrace {
my $p := DELETEKEY($d,'p');
if nqp::elems($d) == 0 { # :!delete?:exists(0|1):p(0|1)
$p
?? $more.list.map( {
?? $more.list.flatmap( {
next unless SELF.@EXISTS[]$_);
RWPAIR( $_, $exists );
} ).eager.Parcel
!! $more.list.map( {
!! $more.list.flatmap( {
RWPAIR( $_, !( SELF.@EXISTS[]$_) ?^ $exists ) )
} ).eager.Parcel;
}
Expand All @@ -380,11 +380,11 @@ sub SLICE_MORE_@TYPE[]\SELF,$more,*%adv) is hidden-from-backtrace {
my $kv := DELETEKEY($d,'kv');
if nqp::elems($d) == 0 { # :!delete?:kv(0|1)
$kv
?? $more.list.map( {
?? $more.list.flatmap( {
next unless SELF.@EXISTS[]$_);
$_, SELF.@AT[]$_);
} ).flat.eager.Parcel
!! $more.list.map( {
!! $more.list.flatmap( {
$_, SELF.@AT[]$_)
} ).flat.eager.Parcel;
}
Expand All @@ -396,11 +396,11 @@ sub SLICE_MORE_@TYPE[]\SELF,$more,*%adv) is hidden-from-backtrace {
my $p := DELETEKEY($d,'p');
if nqp::elems($d) == 0 { # :!delete?:p(0|1)
$p
?? $more.list.map( {
?? $more.list.flatmap( {
next unless SELF.@EXISTS[]$_);
RWPAIR($_, SELF.@AT[]$_));
} ).eager.Parcel
!! $more.list.map( {
!! $more.list.flatmap( {
RWPAIR( $_, SELF.@AT[]$_) )
} ).eager.Parcel;
}
Expand All @@ -412,7 +412,7 @@ sub SLICE_MORE_@TYPE[]\SELF,$more,*%adv) is hidden-from-backtrace {
my $k := DELETEKEY($d,'k');
if nqp::elems($d) == 0 { # :!delete?:k(0|1)
$k
?? $more.list.map( {
?? $more.list.flatmap( {
next unless SELF.@EXISTS[]$_);
$_;
} ).eager.Parcel
Expand All @@ -426,11 +426,11 @@ sub SLICE_MORE_@TYPE[]\SELF,$more,*%adv) is hidden-from-backtrace {
my $v := DELETEKEY($d,'v');
if nqp::elems($d) == 0 { # :!delete?:v(0|1)
$v
?? $more.list.map( {
?? $more.list.flatmap( {
next unless SELF.@EXISTS[]$_);
SELF.@AT[]$_);
} ).eager.Parcel
!! $more.list.map( {
!! $more.list.flatmap( {
SELF.@AT[]$_)
} ).eager.Parcel;
}
Expand All @@ -439,7 +439,7 @@ sub SLICE_MORE_@TYPE[]\SELF,$more,*%adv) is hidden-from-backtrace {
}
}
elsif nqp::elems($d) == 0 { # :!delete
$more.list.map( { SELF.@AT[]$_) } ).eager.Parcel;
$more.list.flatmap( { SELF.@AT[]$_) } ).eager.Parcel;
}
}
Expand Down

0 comments on commit 4fafbe8

Please sign in to comment.