Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic

Re: Socket Programming

by NetWallah (Canon)
on Jan 07, 2004 at 05:59 UTC ( #319377=note: print w/replies, xml ) Need Help??

in reply to Socket Programming

I'd strongly recommend Net::EasyTCP for socket programming - this is an area with many stumbling blocks, and that module gets you functional FAST.

I Could not resist adding this to the response .. (Author unknown , and apologies to the good Doctor)

If a packet hits a pocket on a socket on a port,
And the bus is interrupted as a very last resort,
And the address of the memory makes your floppy disk abort,
Then the socket packet pocket has an error to report.

If your cursor finds a menu item followed by a dash,
And the double-clicking icons put your window in the trash,
And your data is corrupted 'cause the index doesn't hash,
Then your situation's hopeless, and your system's gonna crash!

If the label on your cable on the gable at your house,
Says the network is connected to the button on your mouse,
But your packets want to tunnel to another protocol,
That's repeatedly rejected by the printer down the hall.

And your screen is all distorted by the side effects of gauss,
So your icons in the window are as wavy as a souse,
Then you may as well reboot and go out with a bang,
'Cause as sure as I'm a poet, the sucker's gonna hang!

When the copy of your floppy's getting sloppy on the disk,
And the microcode instructions cause unnecessary RISC,
Then you have to flash your memory and you'll want to RAM your ROM,
Quickly turn off your computer and be sure to tell your mom!

"When you are faced with a dilemma, might as well make dilemmanade. "

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://319377]
[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)
[LanX]: oh I meant fixed amount

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.