Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re^2: Personal library with CPAN

by monkfan (Curate)
on Apr 28, 2008 at 00:32 UTC ( #683219=note: print w/replies, xml ) Need Help??

in reply to Re: Personal library with CPAN
in thread Personal library with CPAN

Dear Zaxo,
How can I make your setting above workable in Mac OSX? Have you ever try it? I can't seem to find proper "" in / This is all I have.
./System/Library/Perl/5.8.8/darwin-thread-multi-2level/ ./System/Library/Perl/5.8.8/darwin-thread-multi-2level/Encode/Config.p +m ./System/Library/Perl/5.8.8/ExtUtils/MakeMaker/ ./System/Library/Perl/5.8.8/Net/ ./System/Library/Perl/Extras/5.8.8/darwin-thread-multi-2level/ModPerl/ ./System/Library/Perl/Extras/5.8.8/Module/Build/


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://683219]
[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)
[LanX]: oh I meant fixed amount
[LanX]: every path must have l left and r right edges and l and r are fixed and l+r is the height
[LanX]: simple recursive function which goes left and right till l or r are exhausted

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

    Results (239 votes). Check out past polls.