#!/usr/bin/perl use strict; # https://perlmonks.org/?node_id=11162546 use warnings; use Data::Dump 'dd'; use Test::More; $SIG{__WARN__} = sub { die @_ }; # Is there a better way to get an inverse slice than to do something like: my @array = ('aa'..'zz'); my @slice_idx = (6,13,42,66,69); # Slice my @slice = @array[@slice_idx]; my $expected = [ "aa" .. "af", "ah" .. "am", "ao" .. "bp", "br" .. "cn", "cp", "cq", "cs" .. "zz", ]; dd { 'array' => \@array, 'slice_idx' => \@slice_idx, 'slice' => \@slice, 'expected' => $expected, }; { my $TEST = "not in idx hash"; my %slice_idx; @slice_idx{@slice_idx} = (); # NO MAP NEEDED my @invslice_idx = grep { ! exists $slice_idx{$_} } 0 .. $#array; # Inverse slice. my @invslice = @array[@invslice_idx]; is_deeply(\@invslice, $expected, $TEST ) or diag dd { 'idx' => \@invslice_idx, 'invslice' => \@invslice }; } { my $TEST = "not delete value"; my @newinvslice = @array; my $delete; @newinvslice[@slice_idx] = (\$delete) x @slice_idx; # UNIQUE REF VALUE @newinvslice = grep { ref $_ ne "SCALAR" or $_ ne \$delete } @newinvslice; is_deeply(\@newinvslice ,$expected, $TEST) or diag dd { 'newinvslice' => \@newinvslice }; } { my $TEST = "splice backwards"; my @new3invslice = @array; splice @new3invslice, $_, 1 for sort { $a < $b } @slice_idx; # ENSURE IDX SORTED is_deeply(\@new3invslice, $expected, $TEST) or diag dd { 'new3invslice' => \@new3invslice }; } done_testing; #### { array => ["aa" .. "zz"], expected => [ "aa" .. "af", "ah" .. "am", "ao" .. "bp", "br" .. "cn", "cp", "cq", "cs" .. "zz", ], slice => ["ag", "an", "bq", "co", "cr"], slice_idx => [6, 13, 42, 66, 69], } ok 1 - not in idx hash ok 2 - not delete value ok 3 - splice backwards 1..3