Josh Wilmes wrote:
For the meantime, I have added the Parrot_exit and Parrot_on_exit functions
to CVS.
Thanks for providing this. I did slightly modify your patch to really
get rid of the leaks:
- test_main calls Parrot_exit now
- copied prototype to embed.h
leo
If no one hollers, I'll remove the IntQueue class.
- only used in some tests AFAIK
- functionality may be written in terms of intlist push/pop
- has a weird syntax for queue/dequeue
- is broken WRT memory management and clone
leo
Allison Randal <[EMAIL PROTECTED]> writes:
> Ask was fast:
>
>> Subscribe by sending mail to [EMAIL PROTECTED]
>> NNTP access and archives at nntp.perl.org will be available a few
>> hours after the first posting to the list.
>
> Let the games begin...
Those of us with subs to perl6-all will get
For the meantime, I have added the Parrot_exit and Parrot_on_exit functions
to CVS.
This will fix the leak on all platforms, for now. If you want to fix
internal_exception so this isn't necessary, that's fine- we can rip this
out later.
--Josh
At 22:21 on 11/06/2002 +0100, Leopold Toetsch <
Ask was fast:
> Subscribe by sending mail to [EMAIL PROTECTED]
> NNTP access and archives at nntp.perl.org will be available a few
> hours after the first posting to the list.
Let the games begin...
Allison
On Nov 07, Dan Sugalski wrote:
> Lacking a decent C++ compiler isn't necessarily a strike against
> VMS--to be a strike against, there'd actually have to *be* a decent
> C++ compiler...
Doesn't VMS have a /bin/false?
- Kurt
On Thu, Nov 07, 2002 at 01:36:07PM -0600, Me wrote:
: > is *1* _all_ that topic is about ?
:
: Sorta. To quote an excellent summary:
:
: "Topic is $_".
A "real" topicalizer also sets a topicalizer scope that can be broken out of.
: > also
: >
: > @a := ( $a, $b)
:
: Er, I don't think
On Thu, Nov 07, 2002 at 04:16:50PM -0500, Dan Sugalski wrote:
: At 8:29 PM +0100 11/7/02, Leopold Toetsch wrote:
: >Michael Lazzaro wrote:
: >
: >>
: >>On Thursday, November 7, 2002, at 06:36 AM, Austin Hastings wrote:
: >>
: >>>For 'bit', the key value is (eenie, meenie, ...) '1'.
: >
: >
: >> Fr
On 2002-11-07 at 15:28:14, Luke Palmer wrote:
> > From: "Mark J. Reed" <[EMAIL PROTECTED]>
> > Will something like that not be possible in Perl6?
>
> I'm afraid that statement is false for all values of "something" :)
Good point. Erratum: for
> Mailing-List: contact [EMAIL PROTECTED]; run by ezmlm
> Date: Thu, 7 Nov 2002 17:19:28 -0500
> From: "Mark J. Reed" <[EMAIL PROTECTED]>
> Content-Disposition: inline
> X-Julian-Day: 2452586.42675
> X-SMTPD: qpsmtpd/0.12, http://develooper.com/code/qpsmtpd/
>
> [Recipients list trimmed back to ju
[Recipients list trimmed back to just the list - it was getting ridiculous.
So everyone will get only get one copy and it may take a tad longer to
get there . . .]
On 2002-11-07 at 17:07:46, Dan Sugalski wrote:
> Attributes are class-specific for a variable (okay, class instance
> specific, if
[responding to several of the most recent posts]
Let's table discussion of the details for a few days until we get the
perl6-documentation list set up. Then we can dig into planning out the
scope and goals of the project, and what roles various people might
take.
Allison
At 3:56 PM -0600 11/7/02, Garrett Goebel wrote:
Dan Sugalski wrote:
At 8:29 PM +0100 11/7/02, Leopold Toetsch wrote:
>Michael Lazzaro wrote:
>>On Thursday, November 7, 2002, at 06:36 AM, Austin Hastings wrote:
>>
>>>For 'bit', the key value is (eenie, meenie, ...) '1'.
>
>> From A2 we ha
On Thu, Nov 07, 2002 at 03:56:04PM -0600, Garrett Goebel wrote:
> Dan Sugalski wrote:
> > At 8:29 PM +0100 11/7/02, Leopold Toetsch wrote:
> > >Michael Lazzaro wrote:
> > >>On Thursday, November 7, 2002, at 06:36 AM, Austin Hastings wrote:
> > >>
> > >>>For 'bit', the key value is (eenie, meenie,
Dan Sugalski wrote:
> At 8:29 PM +0100 11/7/02, Leopold Toetsch wrote:
> >Michael Lazzaro wrote:
> >>On Thursday, November 7, 2002, at 06:36 AM, Austin Hastings wrote:
> >>
> >>>For 'bit', the key value is (eenie, meenie, ...) '1'.
> >
> >> From A2 we have:
> >>
> >>"Run-time properties really ar
Damian:
> ["it" will be passed to about 5% of subs,
> regardless of whether the context is your
> 10 line scripts or my large modules]
If the syntax for passing "it" to a sub
remains as verbose as it currently is,
you are probably right that "it" won't
be used to achieve brevity! I think it's
a
At 8:29 PM +0100 11/7/02, Leopold Toetsch wrote:
Michael Lazzaro wrote:
On Thursday, November 7, 2002, at 06:36 AM, Austin Hastings wrote:
For 'bit', the key value is (eenie, meenie, ...) '1'.
From A2 we have:
"Run-time properties really are associated with the object in
question, whi
Luke Palmer wrote:
Mailing-List: contact [EMAIL PROTECTED]; run by ezmlm
From: Luke Palmer <[EMAIL PROTECTED]>
Cc: [EMAIL PROTECTED]
Date: Thu, 7 Nov 2002 13:49:14 -0700 (MST)
X-SMTPD: qpsmtpd/0.12, http://develooper.com/code/qpsmtpd/
Date: Thu, 07 Nov 2002 20:48:50 +1100
From: Damian Conway <
At 1:27 PM -0800 11/6/02, Brad Hughes wrote:
Flaviu Turean wrote:
[...]
5. if you want to wait for the computing platforms before programming in
p6, then there is quite a wait ahead. how about platforms which will never
catch up? VMS, anyone?
Not to start an OS war thread or anything, but why d
> Mailing-List: contact [EMAIL PROTECTED]; run by ezmlm
> From: Luke Palmer <[EMAIL PROTECTED]>
> Cc: [EMAIL PROTECTED]
> Date: Thu, 7 Nov 2002 13:49:14 -0700 (MST)
> X-SMTPD: qpsmtpd/0.12, http://develooper.com/code/qpsmtpd/
>
> > Date: Thu, 07 Nov 2002 20:48:50 +1100
> > From: Damian Conway <[E
> Date: Thu, 07 Nov 2002 20:48:50 +1100
> From: Damian Conway <[EMAIL PROTECTED]>
>
> we could make it lazy thus:
>
> sub a_pure_func(Num $n) is lazy returns Num {
> return $n ** $n
> }
>
> which would cause any invocation of C to cache
> its arguments (probably in a closure
Me writes:
> In the hope this saves Allison time, and/or
> clarifies things for me, I'll attempt some
> answers.
>
Thanks .
> > In your article at perl.com you describes
> > various ways and situations when perl
> > creates a topic and this is described as
> > perl making the following
Peter Gibbs wrote:
An extended version of my previous example follows, as it points
out some more inconsistent behaviour.
Here is a simple example, which shows inconsistent WRT strings:
set S0, "not"
set S1, S0
set S0, "ok"
print S1
print "\n"
new P0, .PerlString
s
Michael Lazzaro wrote:
On Thursday, November 7, 2002, at 06:36 AM, Austin Hastings wrote:
For 'bit', the key value is (eenie, meenie, ...) '1'.
From A2 we have:
"Run-time properties really are associated with the object in question,
which implies some amount of overhead. For that reaso
In the hope this saves Allison time, and/or
clarifies things for me, I'll attempt some
answers.
> In your article at perl.com you describes
> various ways and situations when perl
> creates a topic and this is described as
> perl making the following binding on my behalf:
>
> $_ := $some_var ;
On Thu, 7 Nov 2002 at 10:38 -0800, Michael Lazzaro <[EMAIL PROTECTED]:
> I dunno anymore, maybe we need to rethink what place there is for
> public domain docs at all. Perhaps we just have a man page that says
> "buy the damn books, you cheapskate" and be done with it.
I trust you were joking, r
On Thursday, November 7, 2002, at 03:44 AM, Angel Faus wrote:
1) We find a team of volunteers who are willing to "own" the
task of converting each Apocalypse into a complete design. If
nobody wants to write the Perl 6 user manual, then we might as well
I would prefer to work from perl5 docum
On Thursday, November 7, 2002, at 06:36 AM, Austin Hastings wrote:
For 'bit', the key value is (eenie, meenie, ...) '1'.
Any '1' value will trigger a search for undef bit values. Presuming
that bit values will not frequently be undef, the search should be
cheap and the storage requirements will
--- Michael Lazzaro <[EMAIL PROTECTED]> wrote:
> Primitive types were originally intended for runtime speed, thus an
> "int" or a "bit" is as small as possible, and not a lot of weird
> runtime
> checking has to take place that would slow it down. It can't even be
> undef, because that would tak
I just want to be sure I understand correctly :
In your article at perl.com you describes various ways and situations
when perl creates a topic and this is described as perl making the
following binding on my behalf:
$_ := $some_var ; *1*
and probably marking $_ with some additional properti
Leopold Toetsch wrote:
> Appended is a test program that shows timings (i386 w rdtsc) and
> the limit, where malloc changes strategy to use mmap and returns
> zeroed memory.
I don't know if it helps, but there are the results on my machine,
using Windows XP Pro and Cygwin 1.3.10 and GCC 2.95.3:
#
>1) We find a team of volunteers who are willing to "own" the
> task of converting each Apocalypse into a complete design. If
> nobody wants to write the Perl 6 user manual, then we might as well
> give up and go home now. So far we only need to find four, though,
> so it Might Just Work.
I w
Flaviu Turean wrote:
[...]
5. if you want to wait for the computing platforms before programming in
p6, then there is quite a wait ahead. how about platforms which will never
catch up? VMS, anyone?
Not to start an OS war thread or anything, but why do people still have
this mistaken impression o
Michael Lazzaro wrote:
If anyone knows the answer to these two questions, I'd appreciate it.
Only Larry "knows". But I'm prepared to take an educated guess.
1) What do these do?
my int $n = 5; # OK
Yes.
my int $n = 5.005; # trunc or err?
Truncate to 5 with optio
Leopold Toetsch wrote:
> Appended is a test program
Arg, damned Mozilla, shows attachment and doesn't include it
/* test program for malloc */
/* run program with
* cc -o chkm -Wall chkm.c -O3 && ./chkm
* cc -o chkm -Wall chkm.c malloc.c -O3 && ./chkm
*
* the timing macro needs adjustment f
Piers Cawley mused:
The idea being that, when you do
a_pure_func($val1|$val2|$val3)
instead of Perl going away and doing the calculation right away, you
get back a 'special' superposition
Remember to s/superposition/junction/g. For this week, at least ;-)
> which stores an 'invocation
Brent Dax wrote:
Leopold Toetsch:
# The questions are (and this is IMHO the same problem with PMCs):
# - set vs assign
# - what should this program do
This idea may be totally on crack, but why do we even have S and P
registers as pointers? What if the S registers were basically just
STRING[32]
Peter Gibbs wrote:
Leopold Toetsch wrote:
Fine. But how do we know, which version we could take. Please read again
Peter's example. It depends on the semantics of Sx register usage all
over the program IMHO.
In an attempt to clarify the positions here, let us start with a shorter
example:
Piers Cawley pointed out:
%a_students = grep {.key ~~ :i/^a/}, %grades.kv;
I think you could probably get away without the .kv there since, in a
list context you're going to get a list of pairs anyway.
In fact, the code is invalid as it stands. The following variations
work as desired:
%a_s
ralph wrote:
My estimate (based on the -- not inconsiderable --
code base of my own modules) is closer to 5%.
Your estimate of what others will do when
knocking out 10 line scripts in a hurry,
or what's in your current p5 modules?
Both.
Can currying include the given topic?
sub bar is
Michael Lazzaro wrote:
[...some good points...]
> and has resulted in us revisiting decisions *repeatedly*
Simon Cozens wrote:
[...some good ideas...]
> [1] You can tell I've been rereading MMM...
Maybe there's some benefit to be had from revisiting old material? :-)
I can't think of any non-tr
Dan Sugalski wrote:
At 8:58 PM +0100 11/6/02, Leopold Toetsch wrote:
If we want this, then lets have Parrot_{re,}allocate{,zeroed}.
The allocate_string variants are ok with unzeroed mem already.
Which was my thought here. Things that care can ask for zeroed memory,
which they may get anyw
Leopold Toetsch:
# The questions are (and this is IMHO the same problem with PMCs):
# - set vs assign
# - what should this program do
This idea may be totally on crack, but why do we even have S and P
registers as pointers? What if the S registers were basically just
STRING[32] and the Ps were PM
43 matches
Mail list logo
