-
-
Save AlexDaniel/7102bb2e70835f28851b992a41ea121f to your computer and use it in GitHub Desktop.
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
use lib ‘data/all-modules/github/jdv/p6-data-selector/’; | |
use Data::Selector; | |
use Test; | |
my $data_tree = { | |
foo_1 => 'a', | |
foo_2 => [ 'foo_2_1', [ 'foo_2_2', ], { foo_2_3 => 'b', }, ], | |
foo_3 => { | |
foo_3_1 => 'c', | |
foo_3_2 => [ 'foo_3_2_1', ], | |
foo_3_3 => { foo_3_3_1 => 'd', }, | |
}, | |
'+foo_4' => 'leading_plus', | |
'-foo_4' => 'leading_hyphen', | |
}; | |
my @cases = ( | |
[ '*', $data_tree, 0.001, ], | |
[ '-*', {}, 0.001, ], | |
[ | |
'[foo_3,foo_1]', | |
(<foo_3 foo_1>.map: { ($_, $data_tree{$_}).Slip }).hash, | |
0.001, | |
], | |
[ | |
'foo_1,-foo_1', | |
(<foo_2 foo_3 +foo_4 -foo_4>.map: { ($_, $data_tree{$_}).Slip }).hash, | |
0.001, | |
], | |
[ '-foo_1,foo_1', { foo_1 => 'a', }, 0.001, ], | |
[ | |
'foo_2.[+-1,0],foo_3.foo_3_1', | |
{ | |
foo_2 => [ 'foo_2_1', { foo_2_3 => 'b', }, ], | |
foo_3 => { foo_3_1 => 'c', }, | |
}, | |
0.001, | |
], | |
[ '(foo_*){1}', {}, 0.001, ], | |
[ 'foo_2.asdf', { foo_2 => [], }, 0.001, ], | |
[ 'foo_3.1', { foo_3 => {}, }, 0.001, ], | |
[ '-foo_3,*', $data_tree, 0.001, ], | |
[ | |
'*,-foo_3', | |
(<foo_1 foo_2 +foo_4 -foo_4>.map: { ($_, $data_tree{$_}).Slip }).hash, | |
0.001, | |
], | |
[ 'foo_3,-*', {}, 0.001, ], | |
[ '-*,foo_3', (<foo_3>.map: { ($_, $data_tree{$_}).Slip }).hash, 0.001, | |
], | |
[ | |
'-foo*,foo*', | |
(<foo_1 foo_2 foo_3>.map: { ($_, $data_tree{$_}).Slip }).hash, | |
], | |
[ | |
'foo*,-foo*', | |
(<+foo_4 -foo_4>.map: { ($_, $data_tree{$_}).Slip }).hash, | |
0.001, | |
], | |
[ | |
'foo_2.[1..2]', { foo_2 => [ [ 'foo_2_2', ], { foo_2_3 => 'b', }, ], }, | |
0.001, | |
], | |
[ | |
'foo_2.[0..-1]', | |
{ foo_2 => [ 'foo_2_1', [ 'foo_2_2', ], { foo_2_3 => 'b', }, ], }, | |
0.001, | |
], | |
[ | |
'foo_2.[0..-1].-foo_2_3', | |
{ foo_2 => [ 'foo_2_1', [ 'foo_2_2', ], {}, ], }, 0.001, | |
], | |
[ | |
'foo_2.[0..-1].-0', | |
{ foo_2 => [ 'foo_2_1', [], { foo_2_3 => 'b', }, ], }, 0.001, | |
], | |
[ | |
'foo_2*.0,foo_2.1', { foo_2 => [ 'foo_2_1', [ 'foo_2_2', ], ], }, 0.001, | |
], | |
[ 'foo_2.0..0', { foo_2 => [ 'foo_2_1', ], }, 0.001, ], | |
[ 'foo_2.+0..0', { foo_2 => [ 'foo_2_1', ], }, 0.001, ], | |
[ | |
'foo_2.-0..0', { foo_2 => [ [ 'foo_2_2', ], { foo_2_3 => 'b', }, ], }, | |
0.001, | |
], | |
[ 'foo_2.-1..-1', { foo_2 => [ 'foo_2_1', ], }, 0.001, ], | |
[ 'foo_2.+-1..-1', { foo_2 => [ { foo_2_3 => 'b', }, ], }, 0.001, ], | |
[ 'foo_2.--1..-1', { foo_2 => [ 'foo_2_1', [ 'foo_2_2', ], ], }, 0.001, ], | |
[ '++foo_4', { '+foo_4' => 'leading_plus', }, 0.001, ], | |
[ | |
'--foo_4', | |
do { | |
my $data_tree_temp = EVAL $data_tree.perl; | |
$data_tree_temp{'-foo_4'}:delete; | |
$data_tree_temp; | |
}, | |
0.001, | |
], | |
[ '+-foo_4', { '-foo_4' => 'leading_hyphen', }, 0.001, ], | |
[ | |
'-+foo_4', | |
do { | |
my $data_tree_temp = EVAL $data_tree.perl; | |
$data_tree_temp{'+foo_4'}:delete; | |
$data_tree_temp; | |
}, | |
0.001, | |
], | |
# include 0, 1, 2, & 3 | |
[ 'foo_2.0', { foo_2 => [ 'foo_2_1', ], }, 0.001, ], | |
[ 'foo_2.+0', { foo_2 => [ 'foo_2_1', ], }, 0.001, ], | |
[ 'foo_2.1', { foo_2 => [ [ 'foo_2_2', ], ], }, 0.001, ], | |
[ 'foo_2.+1', { foo_2 => [ [ 'foo_2_2', ], ], }, 0.001, ], | |
[ 'foo_2.2', { foo_2 => [ { foo_2_3 => 'b', }, ], }, 0.001, ], | |
[ 'foo_2.+2', { foo_2 => [ { foo_2_3 => 'b', }, ], }, 0.001, ], | |
[ 'foo_2.3', { foo_2 => [], }, 0.001, ], | |
[ 'foo_2.+3', { foo_2 => [], }, 0.001, ], | |
# exclude 0, 1, 2 & 3 | |
[ | |
'foo_2.-0', { foo_2 => [ [ 'foo_2_2', ], { foo_2_3 => 'b', }, ], }, | |
0.001, | |
], | |
[ 'foo_2.-1', { foo_2 => [ 'foo_2_1', { foo_2_3 => 'b', }, ], }, 0.001, ], | |
[ 'foo_2.-2', { foo_2 => [ 'foo_2_1', [ 'foo_2_2', ], ], }, 0.001, ], | |
[ | |
'foo_2.-3', | |
{ foo_2 => [ 'foo_2_1', [ 'foo_2_2', ], { foo_2_3 => 'b', }, ], }, | |
0.001, | |
], | |
# include -0, -1, -2, -3, & -4 | |
[ 'foo_2.+-0', { foo_2 => [ 'foo_2_1', ], }, 0.001, ], | |
[ 'foo_2.+-1', { foo_2 => [ { foo_2_3 => 'b', }, ], }, 0.001, ], | |
[ 'foo_2.+-2', { foo_2 => [ [ 'foo_2_2', ], ], }, 0.001, ], | |
[ 'foo_2.+-3', { foo_2 => [ 'foo_2_1', ], }, 0.001, ], | |
[ 'foo_2.+-4', { foo_2 => [], }, 0.001, ], | |
# exclude -0, -1, -2, -3, & -4 | |
[ | |
'foo_2.--0', { foo_2 => [ [ 'foo_2_2', ], { foo_2_3 => 'b', }, ], }, | |
0.001, | |
], | |
[ 'foo_2.--1', { foo_2 => [ 'foo_2_1', [ 'foo_2_2', ], ], }, 0.001, ], | |
[ 'foo_2.--2', { foo_2 => [ 'foo_2_1', { foo_2_3 => 'b', }, ], }, 0.001, ], | |
[ | |
'foo_2.--3', { foo_2 => [ [ 'foo_2_2', ], { foo_2_3 => 'b', }, ], }, | |
0.001, | |
], | |
[ | |
'foo_2.--4', | |
{ foo_2 => [ 'foo_2_1', [ 'foo_2_2', ], { foo_2_3 => 'b', }, ], }, | |
0.001, | |
], | |
# included and excluded negative array subscripts involved in | |
# selector tree merging | |
[ 'foo_2.-*,foo_2.+-1.bar', { foo_2 => [ {}, ], }, 0.001, ], | |
[ | |
'foo_2.*,foo_2.--1', { foo_2 => [ 'foo_2_1', [ 'foo_2_2', ], ], }, | |
0.001, | |
], | |
[ | |
'*foo_4', { '+foo_4' => 'leading_plus', '-foo_4' => 'leading_hyphen', }, | |
0.001, | |
], | |
[ '+non-existent', {}, 0.001, ], | |
[ '+non-existent,-foo*', {}, 0.001, ], | |
[ '-non-existent', $data_tree, 0.001, ], | |
[ {}, $data_tree, 0.001, 'empty selector tree', ], | |
); | |
for @cases { | |
my ( $selector, $data_tree_expected, $elasped_expected, ) = @($_); | |
my $desc = $_[3] || $selector; | |
my $data_tree_local = EVAL $data_tree.perl; | |
my $selector_tree = | |
$selector ~~ Hash | |
?? $selector | |
!! Data::Selector.parse_string( selector_string => $selector, ); | |
Data::Selector.apply_tree( | |
selector_tree => $selector_tree, | |
data_tree => $data_tree_local, | |
); | |
is-deeply( $data_tree_local, $data_tree_expected, "$desc applied" ); | |
} | |
done-testing; | |
my $x = now - BEGIN now; | |
say $x; | |
exit 42 if $x < 3 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment