(migrated from perl-qa)
On Wednesday 01 August 2001 03:10 pm, David L. Nicol wrote:
Bryan C. Warnock wrote:
I didn't have a good solution for tables, mainly because I didn't like a
tab, comma, or pipe separated solution. (Which isn't intended as
commentary on Ziggy.)
Here's a
On Wednesday 01 August 2001 10:04 pm, David L. Nicol wrote:
I hope this isn't too stale to talk about.
This is perl6-language. Nothing, it seems, is too stale to talk about.
We're still brainstorming, even though the RFC period ended 10 months ago.
Please restrain from telling me that the
If I've got a set of matching properties, do I get to build hotels on my
hashes?
There are a number of properties built into Perl 6. Nearly all of these
properties don't make sense across the board - eg, a scalar won't have a
dimension, a hash won't prompt, etc.
So given the two different
As a necrohipposadist (beater of dead horses), I'll add...
Sterin, Ilya [EMAIL PROTECTED] writes:
Well guess not, since something like this...
{
my ($a, $b, $c);
$a = \$b;
$b = \$c;
$c = \$a;
}
would definitelly be hard, resource consuming to implement a circular
I was just wondering if there will be any solution for the circular
refernece memory leak (I guess you can call it a problem). Can't we keep
information on the number of circular references in the SV structure and
then decrement the references count by one + the circular reference count at
the
At 01:01 PM 8/1/2001 -0600, Sterin, Ilya wrote:
I was just wondering if there will be any solution for the circular
refernece memory leak (I guess you can call it a problem). Can't we keep
information on the number of circular references in the SV structure and
then decrement the references
At 01:01 PM 08-01-2001 -0600, Sterin, Ilya wrote:
I was just wondering if there will be any solution for the circular
refernece memory leak (I guess you can call it a problem). Can't we keep
information on the number of circular references in the SV structure and
then decrement the references
Did really think about that:)
But off the top of my head...
This is only a guess, but
my $a;
$a = \$a;
A match of two addresses. Though we are assigning on reference to a scalar,
we can match both addresses?
package CircRef;
sub new {
my $self = [];
bless $self, shift;
-Original Message-
From: David L. Nicol
To: Buddha Buck
Cc: Sterin, Ilya; '[EMAIL PROTECTED]'
Sent: 08/01/2001 1:12 PM
Subject: Re: Circular references
Buddha Buck wrote:
At 01:01 PM 08-01-2001 -0600, Sterin, Ilya wrote:
Can't we keep
information on the number of circular
Well guess not, since something like this...
{
my ($a, $b, $c);
$a = \$b;
$b = \$c;
$c = \$a;
}
would definitelly be hard, resource consuming to implement a circular
reference count.
Ilya
-Original Message-
From: Sterin, Ilya [mailto:[EMAIL PROTECTED]]
Sent: Wednesday,
hi,
I see nobody is talking here ... so !
Anyone to have idea how the Parser will work... I mean mostly at the
language-developer side (not the internals).
It will be written in Perl, right ?! some striped-version of Perl ?! i.e.
what will be allowed and will not ?
Will it support lookahead,
At 03:18 PM 8/1/2001 -0400, Buddha Buck wrote:
At 01:01 PM 08-01-2001 -0600, Sterin, Ilya wrote:
I was just wondering if there will be any solution for the circular
refernece memory leak (I guess you can call it a problem). Can't we keep
information on the number of circular references in the SV
12 matches
Mail list logo
