Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"

Re: How to close all open file descriptors after a fork?

by blazar (Canon)
on Jul 19, 2005 at 13:55 UTC ( #476094=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download

    Log In?

    What's my password?
    Create A New User
    Node Status?
    node history
    Node Type: note [id://476094]
    [oiskuu]: yergh, <code> tags... [$top_height .. $node_height]
    [Eily]: Discipulus by demonstrate I suppose you mean simulate with perl?
    [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

    How do I use this? | Other CB clients
    Other Users?
    Others rifling through the Monastery: (9)
    As of 2018-03-19 11:16 GMT
    Find Nodes?
      Voting Booth?
      When I think of a mole I think of:

      Results (239 votes). Check out past polls.