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

Re^3: Code style advice: where to put "use" statements?

by BrowserUk (Pope)
on Feb 27, 2008 at 10:49 UTC ( #670584=note: print w/replies, xml ) Need Help??

in reply to Re^2: Code style advice: where to put "use" statements?
in thread Code style advice: where to put "use" statements?

there are several very good reasons not to put "use" into a subroutine (or other block)

I was pretty convinced already, but your list settles the matter for me.

That said, for those not convinced that every abstraction is best served by being OOified, the notion of block-scoped imports is tantalising. Makes me wonder if a new pragma--say: uselocal Some::Module qw[ :stuff ]; wouldn't be possible.

Unlike require, the module would be loaded at compile time, but the import list would not be processed until runtime.

At runtime, the import list would be processed per use, but the callers package would be localised (and self initialised) first so that imports would disappear at close of block.

The problem is how to localise a hash entry within the scope of the caller?

BTW: I love your tagline. It's duality reminds of the old standby "this statement is false". Comtemplating it brings to mind the nightmares I had as a kid when I realised the implications of the infinity of space.

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://670584]
[Eily]: the demonstration itself is fairly easy. The number of paths on a node is the sum of the numbers of paths to the two nodes above (or one node above on the edges of the triangle)
[Eily]: since the value of a node is also the sum from the two nodes above, you just have to demonstrate that the equality is true at the top of the triangle
[Discipulus]: yes Eily, thanks oiskuu but i dont get it.. ;=( maybe I'll ask a SOPW
[LanX]: all combinations with same amount of left and right?
[Eily]: if you want to store in a structure with the coordinates as key, arrays might do, since the keys are going to be 0..n
[LanX]: (Pascale path)
[Eily]: paths like that
[Discipulus]: yes Eily++ (very keen) I want to integrate my project with a 17th experiments. I want to colorize in sequence all paths
[oiskuu]: Yeah, modifry the recursive func combinations() to return not the number, but the paths themselves.
[Eily]: Discipulus I'd do that by starting from the bottom node I think. That way it can inherit the paths from the two nodes above (and so on, recursively)

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (10)
As of 2018-03-19 11:18 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (239 votes). Check out past polls.