Beefy Boxes and Bandwidth Generously Provided by pair Networks
good chemistry is complicated,
and a little bit messy -LW

Re: Oh my God! Tie killed Perl!

by jmcnamara (Monsignor)
on Jan 15, 2002 at 15:24 UTC ( #138873=note: print w/replies, xml ) Need Help??

in reply to (tye)Re: Oh my God! Tie killed Perl!
in thread Oh my God! Tie killed Perl!

I wish Perl would at least have an option to, during clean up, decrement the ref count on all globals, destroying things in the normal manner, and after that, would then go sweep up anything that was left over.

I think that this has been fixed, to some extent, in 5.7.2. The following is from the Changes file.

[ 7991] By: jhi on 2000/12/05 15:52:34 Log: Subject: Re: [PATCH] The largest hoax of all times? From: Ilya Zakharevich <> Date: Tue, 5 Dec 2000 00:40:25 -0500 Message-ID: < +> ... Fix the unpredictable order of DESTROYs. ...
The fix was also discussed in the p5p digest.

Nevertheless, on 5.7.2 I still have problems with Perl objects that contain sub-objects which are destroyed too early. However, I am not sure if this is part of the same problem.


Replies are listed 'Best First'.
(tye)Re2: Oh my God! Tie killed Perl!
by tye (Sage) on Jan 15, 2002 at 19:33 UTC

    No, that patch fixes a completely different "problem" that never bothered me at all, something that I don't consider a "problem" much less a "bug".

    The patch causes unrelated objects to be destroyed in the reverse of the order in which they were created.

    The problem I'm talking about is that related objects (that is, objects where one object holds a reference to the other) can be destroyed in the wrong order if the objects manage to live until the "global destruction" phase of the Perl interpretter shutdown.

            - tye (but my friends call me "Tye")

Log In?

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