Re^2: finding neighbors of an element in arrays

thank you so much.it was great.but please give me some explanation about these lines of code.thank you again.

for my $idx (0 .. $#$domain) {
        my @near = grep {$_ >= 0 && $_ <= $#$domain} $idx - 1, $idx + 
+1;
        push @{$neighbours{$domain->[$idx]}}, map {$domain->[$_]} @nea
+r;
    }
}
[download]

Comment on Re^2: finding neighbors of an element in arrays Download Code

Replies are listed 'Best First'.
Re^3: finding neighbors of an element in arrays by GrandFather (Saint) on Jul 28, 2011 at 20:45 UTC
The loop iterates over all the element indexes in the current domain array. For each index it generates a list containing the index before and after the current index: `$idx - 1, $idx + 1`. The grep then filters the list to give a list containing just valid indexes (it removes -1 or scalar @$domain values if present). That leaves the neighbour indexes for the current index in @near. The map turns the neighbour indexes into a list of neighbour values. The push pushes the list into the array referenced by the hash entry for the value at the current index. Looking back over that description I'm glad to be using Perl rather than COBOL! True laziness is hard work	[reply] [d/l]

Replies are listed 'Best First'.

Re^3: finding neighbors of an element in arrays
by GrandFather (Saint) on Jul 28, 2011 at 20:45 UTC

The loop iterates over all the element indexes in the current domain array. For each index it generates a list containing the index before and after the current index: $idx - 1, $idx + 1. The grep then filters the list to give a list containing just valid indexes (it removes -1 or scalar @$domain values if present).

That leaves the neighbour indexes for the current index in @near. The map turns the neighbour indexes into a list of neighbour values. The push pushes the list into the array referenced by the hash entry for the value at the current index.

Looking back over that description I'm glad to be using Perl rather than COBOL!

True laziness is hard work

[reply]
[d/l]