Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine

Re: Stupid mistakes I repeatedly make

by itub (Priest)
on Mar 27, 2005 at 15:33 UTC ( #442629=note: print w/replies, xml ) Need Help??

in reply to Stupid mistakes I repeatedly make

I've made most of those errors at least once, but the most common for me is the last one (my( $n, $m, $o ) = shift;). By now I've tried to standardized on my ($n) = @_ even for one parameter, but when I change code that has shifts I often forget.

It would be interesting to set up a poll titled "The stupid mistake that I make most often" with some of the errors discussed in this thread.

Replies are listed 'Best First'.
Re^2: Stupid mistakes I repeatedly make
by geekgrrl (Pilgrim) on Mar 29, 2005 at 22:42 UTC

    I used to do the my ($n, $m, $o) = shift so often that I vigorously enforce always using @_ now in my code. Because without fail the one time I use shift, I end up adding a variable later.

    Plus I get really annoyed with all the extra typing I have to do to convert it from one format to the other. I suppose I should create an emacs macro to do that for me...Its good to know that laziness does indeed support good habits. ;-)

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://442629]
[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 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.