Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine

Re^4: Removing elemets from an array (optimization)

by LanX (Chancellor)
on Dec 30, 2012 at 17:15 UTC ( #1010943=note: print w/ replies, xml ) Need Help??

in reply to Re^3: Removing elemets from an array
in thread Removing elemets from an array

Every operation in Perl - like any abstraction - has an overhead which can't be compensated by its C-implementation.

So tending to use as few as possible perl-commands which do mass-operations means to reduce overhead and delaying the task to highly optimized C.

Loops (including maps) are just multiplying the amount of executed commands (just imagine the linearized alternative which is even faster as the loop...)

so my approach is the fastest because its basically reduced to only 3 perl commands¹

1. setting a hash

2. deleting a slice from that hash

3. reading the resulting hash

OTOH my approach has drawbacks, depending on the task, it's only suitable for real sets of strings.

Arrays can contain repeated data or other datatypes like refs.

EDIT: you might be interested in Using hashes for set operations...

Cheers Rolf

PS: of course there are still loops working under the hood, but they are already optimized in C.

Comment on Re^4: Removing elemets from an array (optimization)
Replies are listed 'Best First'.
Re^5: Removing elemets from an array (optimization)
by karlgoethebier (Parson) on Dec 31, 2012 at 18:00 UTC

    ThanX - and especially for the link

    HNY and best regards, Karl

    «The Crux of the Biscuit is the Apostrophe»

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1010943]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (6)
As of 2016-05-06 12:12 GMT
Find Nodes?
    Voting Booth?