Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask

Re: Memory issue with large array comparison

by pemungkah (Priest)
on May 24, 2012 at 21:17 UTC ( #972324=note: print w/ replies, xml ) Need Help??

in reply to Memory issue with large array comparison

When you say "doesn't match any of" I think of a hash rather than arrays; otherwise you're spending lots of runtime searching, when a hash would just hand it to you, O(1).

How about building a hash out of the pathnames, with the keys being the last part of the name, and the value being the path? That way, to get the ones that aren't in the safelist, you'd just look over the safelist and delete those keys. Anything left is not safe.

Would that work? It would certainly be faster.

Comment on Re: Memory issue with large array comparison

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (16)
As of 2015-07-30 15:27 GMT
Find Nodes?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...

    Results (272 votes), past polls