Some suggestions, while I wait for Ubuntu to upgrade...

My comments in all CAPS.

Most importantly - regarding @newinvslice - Ikegami was right to point out that an undef value is not a sufficiently safe criteria (AKA the semi-predicate problem)

I have a solution using the ref of a scalar var which MUST be unique.

A bit clumsy, because Perl has no === operator, but I am open for more elegant suggestions. :)

#!/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 l +ike: 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 V +ALUE @newinvslice = grep { ref $_ ne "SCALAR" or $_ ne \$delete } @ne +winvslice; 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; # ENS +URE 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

Cheers Rolf
(addicted to the Perl Programming Language :)
see Wikisyntax for the Monastery

Updates

Bugfix s/and/or/


In reply to Re^2: Inverse slices by LanX
in thread Inverse slices by Anonymous Monk

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":



  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.