Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?

Re: File::Find considered hard?

by MADuran (Beadle)
on Mar 15, 2004 at 17:07 UTC ( #336757=note: print w/ replies, xml ) Need Help??

in reply to File::Find considered hard?

I believe the issue is really one of appearences. map and File::Find accept a code block, a function and/or a reference to a function. From my ignorant perspective they are anonymous functions and from the imparative way of looking of things this is not how you do it. These anonymous functions do not look like objects so it can not be right from an object oriented view.

I realize this is actually some of the LISP concepts showing through and I think of it as a lambda function in LISP which makes it easier to work with. But most working programmers have little exposier to LISP and I think that some exposier would help. This is a crude explantaion but this is how I see it.

Who needs a spiffy sig

Comment on Re: File::Find considered hard?
Select or Download Code
Replies are listed 'Best First'.
Re: Re: File::Find considered hard?
by eserte (Deacon) on Mar 16, 2004 at 17:38 UTC
    I think you should really start to learn how to use anonymous functions, function references, closures et al. Once you get familiar with them, you can't live without them.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (3)
As of 2016-02-09 04:19 GMT
Find Nodes?
    Voting Booth?

    How many photographs, souvenirs, artworks, trophies or other decorative objects are displayed in your home?

    Results (301 votes), past polls