-
-
Notifications
You must be signed in to change notification settings - Fork 372
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Split history src/core.c/hash_slice.pm6 to src/core.c/hash_multislice…
….pm6
- Loading branch information
Showing
1 changed file
with
240 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,240 @@ | ||
| # all sub postcircumfix {} candidates here please | ||
|
|
||
| proto sub postcircumfix:<{ }>(Mu $, $?, Mu $?, *%) is nodal {*} | ||
|
|
||
| # %h<key> | ||
| multi sub postcircumfix:<{ }>( \SELF, \key ) is raw { | ||
| SELF.AT-KEY(key); | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, \key, Mu \ASSIGN) is raw { | ||
| SELF.ASSIGN-KEY(key, ASSIGN); | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, \key, Mu :$BIND! is raw) is raw { | ||
| SELF.BIND-KEY(key, $BIND); | ||
| } | ||
| multi sub postcircumfix:<{ }>( \SELF, \key, Bool() :$delete! ) is raw { | ||
| nqp::if($delete,SELF.DELETE-KEY(key),SELF.AT-KEY(key)) | ||
| } | ||
| multi sub postcircumfix:<{ }>( \SELF, \key, Bool() :$delete!, *%other ) is raw { | ||
| SLICE_ONE_HASH( SELF, key, 'delete', $delete, %other ) | ||
| } | ||
| multi sub postcircumfix:<{ }>( \SELF, \key, Bool() :$exists! ) is raw { | ||
| nqp::if($exists,SELF.EXISTS-KEY(key),!SELF.EXISTS-KEY(key)) | ||
| } | ||
| multi sub postcircumfix:<{ }>( \SELF, \key, Bool() :$exists!, *%other ) is raw { | ||
| SLICE_ONE_HASH( SELF, key, 'exists', $exists, %other ) | ||
| } | ||
| multi sub postcircumfix:<{ }>( \SELF, \key, Bool() :$kv!, *%other ) is raw { | ||
| $kv && nqp::not_i(nqp::elems(nqp::getattr(%other,Map,'$!storage'))) | ||
| ?? (SELF.EXISTS-KEY(key) ?? (key,SELF.AT-KEY(key)) !! ()) | ||
| !! SLICE_ONE_HASH( SELF, key, 'kv', $kv, %other ); | ||
| } | ||
| multi sub postcircumfix:<{ }>( \SELF, \key, Bool() :$p!, *%other ) is raw { | ||
| $p && nqp::not_i(nqp::elems(nqp::getattr(%other,Map,'$!storage'))) | ||
| ?? (SELF.EXISTS-KEY(key) ?? Pair.new(key,SELF.AT-KEY(key)) !! ()) | ||
| !! SLICE_ONE_HASH( SELF, key, 'p', $p, %other ); | ||
| } | ||
| multi sub postcircumfix:<{ }>( \SELF, \key, Bool() :$k!, *%other ) is raw { | ||
| $k && nqp::not_i(nqp::elems(nqp::getattr(%other,Map,'$!storage'))) | ||
| ?? (SELF.EXISTS-KEY(key) ?? key !! ()) | ||
| !! SLICE_ONE_HASH( SELF, key, 'k', $k, %other ); | ||
| } | ||
| multi sub postcircumfix:<{ }>( \SELF, \key, Bool() :$v!, *%other ) is raw { | ||
| $v && nqp::not_i(nqp::elems(nqp::getattr(%other,Map,'$!storage'))) | ||
| ?? (SELF.EXISTS-KEY(key) ?? nqp::decont(SELF.AT-KEY(key)) !! ()) | ||
| !! SLICE_ONE_HASH( SELF, key, 'v', $v, %other ); | ||
| } | ||
|
|
||
| # %h<a b c> | ||
| multi sub postcircumfix:<{ }>( \SELF, Iterable \key ) is raw { | ||
| nqp::iscont(key) | ||
| ?? SELF.AT-KEY(key) | ||
| !! nqp::iscont(SELF) && nqp::not_i(nqp::isconcrete(SELF)) | ||
| ?? key.flatmap({ SELF{$_} }).eager.list | ||
| !! nqp::p6bindattrinvres(nqp::create(List),List,'$!reified', | ||
| nqp::stmts( | ||
| Rakudo::Iterator.AssociativeIterableKeys(SELF,key) | ||
| .push-all(my \buffer := nqp::create(IterationBuffer)), | ||
| buffer | ||
| ) | ||
| ) | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Iterable \key, Mu \ASSIGN) is raw { | ||
| nqp::iscont(key) | ||
| ?? SELF.ASSIGN-KEY(key, ASSIGN) | ||
| !! (nqp::p6bindattrinvres(nqp::create(List),List,'$!reified', | ||
| nqp::stmts( | ||
| Rakudo::Iterator.AssociativeIterableKeys(SELF //= {},key) | ||
| .push-all(my \buffer := nqp::create(IterationBuffer)), | ||
| buffer | ||
| ) | ||
| ) = ASSIGN) | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Iterable \key, :$BIND!) is raw { | ||
| X::Bind::Slice.new(type => SELF.WHAT).throw; | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF,Iterable \key, Bool() :$delete!,*%other) is raw { | ||
| nqp::iscont(key) | ||
| ?? SLICE_ONE_HASH( SELF, key, 'delete', $delete, %other ) | ||
| !! SLICE_MORE_HASH( SELF, key, 'delete', $delete, %other ) | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF,Iterable \key, Bool() :$exists!,*%other) is raw { | ||
| nqp::iscont(key) | ||
| ?? SLICE_ONE_HASH( SELF, key, 'exists', $exists, %other ) | ||
| !! SLICE_MORE_HASH( SELF, key, 'exists', $exists, %other ) | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Iterable \key, Bool() :$kv!, *%other) is raw { | ||
| nqp::iscont(key) | ||
| ?? SLICE_ONE_HASH( SELF, key, 'kv', $kv, %other ) | ||
| !! SLICE_MORE_HASH( SELF, key, 'kv', $kv, %other ) | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Iterable \key, Bool() :$p!, *%other) is raw { | ||
| nqp::iscont(key) | ||
| ?? SLICE_ONE_HASH( SELF, key, 'p', $p, %other ) | ||
| !! SLICE_MORE_HASH( SELF, key, 'p', $p, %other ) | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Iterable \key, Bool() :$k!, *%other) is raw { | ||
| nqp::iscont(key) | ||
| ?? SLICE_ONE_HASH( SELF, key, 'k', $k, %other ) | ||
| !! SLICE_MORE_HASH( SELF, key, 'k', $k, %other ) | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Iterable \key, Bool() :$v!, *%other) is raw { | ||
| nqp::iscont(key) | ||
| ?? SLICE_ONE_HASH( SELF, key, 'v', $v, %other ) | ||
| !! SLICE_MORE_HASH( SELF, key, 'v', $v, %other ) | ||
| } | ||
|
|
||
| # %h{*} | ||
| multi sub postcircumfix:<{ }>( \SELF, Whatever ) is raw { | ||
| SELF{SELF.keys.list}; | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Whatever, Mu \ASSIGN) is raw { | ||
| die "Cannot assign to *, as the order of keys is non-deterministic"; | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Whatever, :$BIND!) is raw { | ||
| X::Bind::Slice.new(type => SELF.WHAT).throw; | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Whatever, Bool() :$delete!, *%other) is raw { | ||
| SLICE_MORE_HASH( SELF, SELF.keys.list, 'delete', $delete, %other ); | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Whatever, Bool() :$exists!, *%other) is raw { | ||
| SLICE_MORE_HASH( SELF, SELF.keys.list, 'exists', $exists, %other ); | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Whatever, Bool() :$kv!, *%other) is raw { | ||
| SLICE_MORE_HASH( SELF, SELF.keys.list, 'kv', $kv, %other ); | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Whatever, Bool() :$p!, *%other) is raw { | ||
| SLICE_MORE_HASH( SELF, SELF.keys.list, 'p', $p, %other ); | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Whatever, Bool() :$k!, *%other) is raw { | ||
| SLICE_MORE_HASH( SELF, SELF.keys.list, 'k', $k, %other ); | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Whatever, Bool() :$p!, *%other) is raw { | ||
| SLICE_MORE_HASH( SELF, SELF.keys.list, 'p', $p, %other ); | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Whatever, Bool() :$v!, *%other) is raw { | ||
| nqp::elems(nqp::getattr(%other,Map,'$!storage')) | ||
| ?? SLICE_MORE_HASH( SELF, SELF.keys.list, 'v', $v, %other ) | ||
| !! SELF{SELF.keys.list}; | ||
| } | ||
|
|
||
| # %h{} | ||
| multi sub postcircumfix:<{ }>(\SELF, :$BIND!) is raw { | ||
| X::Bind::ZenSlice.new(type => SELF.WHAT).throw; | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Bool() :$delete!, *%other) is raw { | ||
| SLICE_MORE_HASH( SELF, SELF.keys.list, 'delete', $delete, %other ); | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Bool() :$exists!, *%other) is raw { | ||
| SLICE_MORE_HASH( SELF, SELF.keys.list, 'exists', $exists, %other ); | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Bool() :$kv!, *%other) is raw { | ||
| SLICE_MORE_HASH( SELF, SELF.keys.list, 'kv', $kv, %other ); | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Bool() :$p!, *%other) is raw { | ||
| SLICE_MORE_HASH( SELF, SELF.keys.list, 'p', $p, %other ); | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Bool() :$k!, *%other) is raw { | ||
| SLICE_MORE_HASH( SELF, SELF.keys.list, 'k', $k, %other ); | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Bool() :$p!, *%other) is raw { | ||
| SLICE_MORE_HASH( SELF, SELF.keys.list, 'p', $p, %other ); | ||
| } | ||
| multi sub postcircumfix:<{ }>(\SELF, Bool() :$v!, *%other) is raw { | ||
| nqp::elems(nqp::getattr(%other,Map,'$!storage')) | ||
| ?? SLICE_MORE_HASH( SELF, SELF.keys.list, 'v', $v, %other ) | ||
| !! SELF{SELF.keys.list}; | ||
| } | ||
| multi sub postcircumfix:<{ }>(Mu \SELF, *%other ) is raw { | ||
| nqp::elems(nqp::getattr(%other,Map,'$!storage')) | ||
| ?? SELF.ZEN-KEY(|%other) | ||
| !! nqp::decont(SELF) | ||
| } | ||
|
|
||
| proto sub postcircumfix:<{; }>($, $, *%) is nodal {*} | ||
|
|
||
| multi sub postcircumfix:<{; }>(\SELF, @indices) { | ||
| my \target = nqp::create(IterationBuffer); | ||
| my int $dims = @indices.elems; # reifies | ||
| my $indices := nqp::getattr(@indices,List,'$!reified'); | ||
|
|
||
| sub MD-HASH-SLICE-ONE-POSITION(\SELF, \idx, int $dim --> Nil) { | ||
| my int $next-dim = $dim + 1; | ||
| if nqp::istype(idx, Iterable) && nqp::not_i(nqp::iscont(idx)) { | ||
| MD-HASH-SLICE-ONE-POSITION(SELF, $_, $dim) | ||
| for idx; | ||
| } | ||
| elsif $next-dim < $dims { | ||
| if nqp::istype(idx,Whatever) { | ||
| MD-HASH-SLICE-ONE-POSITION(SELF.AT-KEY($_), | ||
| nqp::atpos($indices,$next-dim), $next-dim) | ||
| for SELF.keys; | ||
| } | ||
| else { | ||
| MD-HASH-SLICE-ONE-POSITION(SELF.AT-KEY(idx), | ||
| nqp::atpos($indices,$next-dim), $next-dim); | ||
| } | ||
| } | ||
| # $next-dim == $dims | ||
| elsif nqp::istype(idx,Whatever) { | ||
| nqp::push(target, SELF.AT-KEY($_)) for SELF.keys; | ||
| } | ||
| else { | ||
| nqp::push(target, SELF.AT-KEY(idx)); | ||
| } | ||
| } | ||
|
|
||
| MD-HASH-SLICE-ONE-POSITION(SELF, nqp::atpos($indices,0), 0); | ||
| target.List | ||
| } | ||
|
|
||
| multi sub postcircumfix:<{; }>(\SELF, @indices, :$exists!) { | ||
| sub recurse-at-key(\SELF, \indices) { | ||
| my \idx := indices[0]; | ||
| my \exists := SELF.EXISTS-KEY(idx); | ||
| nqp::if( | ||
| nqp::istype(idx, Iterable), | ||
| idx.map({ |recurse-at-key(SELF, ($_, |indices.skip.cache)) }).List, | ||
| nqp::if( | ||
| nqp::iseq_I(indices.elems, 1), | ||
| exists, | ||
| nqp::if( | ||
| exists, | ||
| recurse-at-key(SELF{idx}, indices.skip.cache), | ||
| nqp::stmts( | ||
| (my \times := indices.map({ .elems }).reduce(&[*])), | ||
| nqp::if( | ||
| nqp::iseq_I(times, 1), | ||
| False, | ||
| (False xx times).List | ||
| ) | ||
| ).head | ||
| ) | ||
| ) | ||
| ); | ||
| } | ||
|
|
||
| recurse-at-key(SELF, @indices) | ||
| } | ||
|
|
||
| # vim: expandtab shiftwidth=4 |