All~
On 11/6/05, Joshua Juran <[EMAIL PROTECTED]> wrote:
> On Nov 5, 2005, at 4:27 PM, Joshua Hoblitt via RT wrote:
>
> >> [EMAIL PROTECTED] - Tue Nov 01 04:52:22 2005]:
> >>
> >> This patch fixes two classes of issue.
> >>
> >> * Don't assign -1 to an unsigned variable; use ~0U instead as it
>
Patrick~
On 11/8/05, Patrick R. Michaud <[EMAIL PROTECTED]> wrote:
> On Tue, Nov 08, 2005 at 12:57:18PM +, [EMAIL PROTECTED] wrote:
> > "Patrick R. Michaud" <[EMAIL PROTECTED]> wrote:
> > :And we also get \d:0123 as a cheap way of saying \d0123.
> >
> > I think the ':' changes the meaning of t
Larry~
On 11/8/05, Larry Wall <[EMAIL PROTECTED]> wrote:
> On Tue, Nov 08, 2005 at 10:55:05AM -0500, Matt Fowles wrote:
> : Patrick~
> :
> : On 11/8/05, Patrick R. Michaud <[EMAIL PROTECTED]> wrote:
> : > On Tue, Nov 08, 2005 at 12:57:18PM +, [EMAIL PROTEC
Will~
On 11/9/05, Will Coleda <[EMAIL PROTECTED]> wrote:
> - Updated the "Where we are" section.
>From this section: "check out This week on Perl 6 by Matt Fowles,"
that should also say "and Piers Cawley".
Thanks for keeping the website pretty, it is our public face.
Matt
Perl 6 Summary for 2005-11-14 through 2005-11-21
All~
Welcome to another Perl 6 Summary. The attentive among you may notice
that this one is on time. I am not sure how that happened, but we will
try and keep it up. On a complete side note, I think there should be a
Perl guild o
Luke~
On 11/23/05, Luke Palmer <[EMAIL PROTECTED]> wrote:
> On 11/23/05, Rob Kinyon <[EMAIL PROTECTED]> wrote:
> > On 11/22/05, Larry Wall <[EMAIL PROTECTED]> wrote:
> > >
> > > for ^5 { say } # 0, 1, 2, 3, 4
> >
> > I read this and I'm trying to figure out why P6 needs a unary operator
> > f
Larry~
On 11/23/05, Larry Wall <[EMAIL PROTECTED]> wrote:
> On Wed, Nov 23, 2005 at 11:55:35AM -0500, Matt Fowles wrote:
> : I think using C< ..5 > to mean (0, 1, 2, 3, 4) would be a more
> : sensible option. Makes sense to me at least.
>
> That does
Chip~
On 11/29/05, Chip Salzenberg <[EMAIL PROTECTED]> wrote:
> Consider:
>
>P0 = P1
>P0 = S1
>P0 = I1
>P0 = N1
>
> o/~ One of these things is not like the others
> One of these things just doesn't belong o/~
>
> And if I have to read:
>
>P0 = new .Integer
>P0 = 1
>
Piers~
On 11/30/05, The Perl 6 Summarizer <[EMAIL PROTECTED]> wrote:
>
> So, I hopped into a taxi (and I use the word hopped advisedly) and
> repaired straightway to King's Cross and thence home to Gateshead, where
> my discomfort was somewhat ameliorated by the distraction of preparin
Leo~
On 12/4/05, Leopold Toetsch <[EMAIL PROTECTED]> wrote:
>
> On Dec 4, 2005, at 5:57, Matt Diephouse wrote:
>
> > Roger Browne <[EMAIL PROTECTED]> wrote:
> >> Leopold Toetsch wrote:
> >>
> add_sub($S0, $P0)
> >>>
> add_namespace($S0, $P0)
> >>>
> add_var($S0, $P0)
> >
Perl 6 Summary for 2005-12-05 through 2005-12-12
All~
Welcome to another Perl 6 summary. This week, like last, Parrot has
produced the highest volume of emails. Fine by me, Parrot tends to be
easiest to summarize. This summary is brought to you by Snow (the latest
soft toy in t
All~
Fear not this weeks summary will come out... just a bit late. I have
it half written, but my bed is calling oh so sweetly.
Night all,
Matt
--
"Computer Science is merely the post-Turing Decline of Formal Systems Theory."
-Stan Kelly-Bootle, The Devil's DP Dictionary
Perl 6 Summary for 2006-01-02 though 2006-01-09
All~
Welcome to another Perl 6 Summary. On a complete tangent, if you are
playing World of Warcraft and see a troll hunter named Krynna, she
rocks. She royally saved me. Be nice to her.
Perl 6 Compiler
PIL Containers and Roles
Bob~
On 1/15/06, Leopold Toetsch <[EMAIL PROTECTED]> wrote:
>
> On Jan 14, 2006, at 21:28, Bob Rogers wrote:
>
> >I had thought this field was being used, but it turns out to be
> > irrelevant. I offer this patch so that no one else is fooled (and
> > because I had to test it anyway to prove
Larry~
On 1/18/06, Larry Wall <[EMAIL PROTECTED]> wrote:
>
> But I have a strong gut-feeling that over the long term it's going to
> be important to be able to view a given object as either a partially
> instantiated class or a partially undefined object, and for that we have
> to break down the f
Klaas-Jan~
On 1/20/06, Klaas-Jan Stol <[EMAIL PROTECTED]> wrote:
> Hi,
>
> I tried to index aggregates using several types of keys (that is,
> several types of values), and it seems only string and integer values
> can be used as keys. A quick look at the source in
> compilers/imcc/symreg.c confir
All~
It turns out that Mondays are now my paperwork day at work. As you
can probably guess, paperwork leaves me in a somewhat foul mood. As
such, I am moving the summarizing schedule from Mondays, back to
Tuesdays. This has the happy coincidence of coinciding with World of
Warcraft's patch sche
ML::Parser::Syck
Bernhard Schmalhofer posted a brief look at what has already been done
with adding support of libsyck and left the door open to anyone who
wished to pick up the torch. Warnock applies.
<http://xrl.us/jpxi>
Parrot Link Issues
Klaas-Jan Stol had problems l
Larry~
On 2/6/06, Larry Wall <[EMAIL PROTECTED]> wrote:
> This is mostly motivated by linguistics rather than computer science,
> insofar as types/classes/roles in natural language are normally
> represented by generic objects rather than "meta" objects. When I
> ask in English:
>
> Can a dog
Larry~
On 2/7/06, Larry Wall <[EMAIL PROTECTED]> wrote:
>
> Indeed, and the modeling point of view is that $pipe is *also* just
> a representation of the Pipe. Neither Pipe nor $pipe is the thing
> itself. Most computer programs are about Something Else, so computer
> languages should be optimiz
Stevan~
I am going to assume that you intended to reply to perl 6 language,
and thus will include your post in its entirety in my response.
On 2/7/06, Stevan Little <[EMAIL PROTECTED]> wrote:
> On 2/7/06, Matt Fowles <[EMAIL PROTECTED]> wrote:
> > Larry~
> >
> &
<http://xrl.us/jwuc>
Macros
Herbert Snorrason wants more specifics on macros in Perl 6. Larry gave
him some.
<http://xrl.us/jwud>
Synopsis Typos
Yiyi Hu and Andrew Savige found a few typos in a few synopses. Larry
graciously fixed them.
<http://
Stevan~
On 2/7/06, Stevan Little <[EMAIL PROTECTED]> wrote:
>
> Well, to be totally honest, I think only Larry truely understands
> their usage, but to the best of my understanding they are intented to
> serve a number of roles;
I agree with you about that, which is part of what bothers me.
>
>
Stevan~
On 2/7/06, Stevan Little <[EMAIL PROTECTED]> wrote:
>
> > After all Foo is just a specific instance of the class Class.
>
> Shhh... class objects don't exist ... I was never here,... I will I
> count to three and when I snap my fingers you will awaken and will
> have forgotten all about cl
All~
On 2/17/06, jesse <[EMAIL PROTECTED]> wrote:
>
>
>
> On Fri, Feb 17, 2006 at 08:38:26AM -0800, Robert Spier wrote:
> > > snapshots or releases. And, since a checkout takes about an hour (last
> > > time I checked) I tend to be too lazy to fetch one just to make a patch.
> >
> > Only if you'r
Andy~
On 2/17/06, Andy Dougherty <[EMAIL PROTECTED]> wrote:
> On Fri, 17 Feb 2006, Matt Fowles wrote:
>
> > All~
> >
> > On 2/17/06, jesse <[EMAIL PROTECTED]> wrote:
> > >
> > >
> > >
> > > On Fri, Feb 17, 2006 at 08:38:26AM
Leo~
On 2/20/06, Leopold Toetsch <[EMAIL PROTECTED]> wrote:
> *) the resizable variant is heavily borked WRT allocation size
> fixes welcome
>
> *) I don't think that *BooleanArray should support:
>
>set P0[0], 3.2
>set P0[1], "foo"
>set P0[2], P1
>
> nor
>
>set N0, P[0]
>.
All~
I just noticed something claiming that C<$a. foo()> is actually
C<$a.foo()> (a method call on C<$a>) and that C<$a .foo()> is actually
C<$a $_.foo()> (likely a syntax error).
When did this change? Why did this change?
Also, I liked it better when C<$a .foo()> was a method call on C<$a>.
T
Larry~
On 4/6/06, Larry Wall <[EMAIL PROTECTED]> wrote:
> On Thu, Apr 06, 2006 at 01:58:55PM -0400, Matt Fowles wrote:
> : All~
> :
> : I just noticed something claiming that C<$a. foo()> is actually
> : C<$a.foo()> (a method call on C<$a>) and that C
All~
It has become abundantly clear to me that I will not find the time to
resume summarizing the perl lists. I doubt this surprises many of you
given how long it has been since the last summary. Paradoxically, I
have found myself wishing that there were summaries as there seems to
have been a l
Jonathan~
On 10/7/06, Jonathan Lang <[EMAIL PROTECTED]> wrote:
TSa wrote:
> Dispatch depends on a partial ordering of roles.
Could someone please give me an example to illustrate what is meant by
"partial ordering" here?
Sets demonstrate partial ordering. Let < denote the subset relation shi
All~
> >It does on reading. I forget the eloquent explanation about the how or
> >why, but all references bar the leftmost are vivified. (Even inside
> >defined). In effect, all bar the last reference are in lvalue context -
> >only the rightmost is rvalue.
>
> The explanation is the part that wo
All~
> The differences between the two versions are:
> 1) Use of the interpreter cycle-counter instead of stack walking.
> 2) Linked lists of buffer headers sorted by bufstart
> 3) COW-supporting code in GC (for all buffer objects)
> 4) Implementation of COW for string_copy and string_substr
>
>
All~
> > Does ICU handle Unix, Windows, VMS and Palm OS? If not, we can't use
> > it. (I figure if it handles those four, it's up to anything. :^) )
>
> Well, we don't handle PalmOS right now anyway, so that's a moot point.
> It handles the other three, and as I pointed out in my last post
> de
All~
I disagree.
I don't like Java that much (for many reasons), but I have nothing but
respect for the massive amount of documentation that is easily accessible as
a direct result of JavaDoc. I personnaly feel that it greatly helped java
achieve the success it has. If all of parrot's module w
All~
On 5/11/05, Luke Palmer <[EMAIL PROTECTED]> wrote:
> On 5/11/05, Autrijus Tang <[EMAIL PROTECTED]> wrote:
> > In a somewhat related topic:
> >
> > pugs> (1,(2,3),4)[2]
> > 4
> >
> > Because the invocant to .[] assumes a Singular context.
>
> Right, but the *inside* of the invocant is
All~
I feel like people have lost track of one of the initial arguments for
having C< .method == $?SELF.method >. Currently, all of
$.foo
@.foo
%.foo
and their ilk operate on the current invocant, $?SELF. This leads
naturally toward &.foo also refering to $?SELF. But as we all know
the & is o
All~
What does the reduce metaoperator do with an empty list?
my @a;
[+] @a; # 0? exception?
[*] @a; # 1? exception?
[<] @a; # false?
[||] @a; # false?
[&&] @a; # true?
Also if it magically supplies some correct like the above, how does it
know what that value is?
Thanks,
Matt
--
"Computer Sci
Perl 6 Summary for 2005-05-03 through 2005-05-17
All~
Welcome ot another fortnight's summary. Wouldn't it just figure that I
can't think of anything sufficiently non-sequiterish to amuse myself.
Perhaps I need a running gag like Leon Brocard or chromatic's
cummingseque capitali
Mark~
On 5/20/05, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
>
> > Mark A. Biggar wrote:
> > > Well the identity of % is +inf (also right side only).
> >
> > I read $n % any( $n..Inf ) == $n. The point is there's no
> > unique right identity and thus (Num,%) disqualifies for a
> > Monoid. BTW,
Perl 6 Summary for 2005-05-24 through 2005-05-31
All~
Welcome to another Perl 6 summary, brought to you by Aliya's new
friends, Masha Nannifer and Philippe, and my own secret running joke.
Without further ado, I bring you Perl 6 Compiler.
Perl 6 Compiler
method chaining
All~
On 6/3/05, Curtis Rawls <[EMAIL PROTECTED]> wrote:
> On 6/3/05, Leopold Toetsch <[EMAIL PROTECTED]> wrote:
> > Dheeraj Kumar Arora wrote:
> > >I m interseted in one of LLVM project
> > > "Implement well-known optimizations in PIR compiler (SSA ->
> > > register
> > > allocat
All~
On 6/3/05, Bill Coffman <[EMAIL PROTECTED]> wrote:
>
> There are several threads in the parrot mailing list that discuss the
> continuations problem. I hoped to be able to address parrot register
> allocator again, at some point, but it could be a while before I get to
> that. In the mean tim
Ingo~
On 6/7/05, Ingo Blechschmidt <[EMAIL PROTECTED]> wrote:
> Hi,
>
> sub foo (Code $code) {
> my $return_to_caller = -> $ret { return $ret };
>
> $code($return_to_caller);
> return 23;
> }
>
> sub bar (Code $return) { $return(42) }
>
> say foo &bar; # 42 or 23?
>
> I th
All~
On 6/7/05, Luke Palmer <[EMAIL PROTECTED]> wrote:
> On 6/7/05, Matt Fowles <[EMAIL PROTECTED]> wrote:
> > On 6/7/05, Ingo Blechschmidt <[EMAIL PROTECTED]> wrote:
> > > Hi,
> > >
> > > sub foo (Code $code) {
> > > my $re
Chip~
On 6/12/05, Chip Salzenberg <[EMAIL PROTECTED]> wrote:
> I'd like like to note for other readers and the p6i archives that
> Piers has failed to grasp the problem, so the solution seems pointless
> to him. I'm sorry that's the case, but I've already explained enough.
This response worries
All~
Although all tests pass, a core file is created during the test run.
Here is a little snippet from GDB. I am running a fairly stock Debian
Testing x86 (slightly out of date).
(gdb) list
1006INTVAL
1007PIO_putps(theINTERP, PMC *pmc, STRING *s)
1008{
1009ParrotIOLayer *l
ister Allocation Bug
Leo opened a ticket for a problem with improper control flow tracking.
Bill Coffman wondered whether the new register design had been
implemented yet.
<http://xrl.us/gke9>
Pass by Value PMCs
Klaas-Jan Stol mused that the new calling conventions
Jens~
On 6/29/05, Jens Rieks <[EMAIL PROTECTED]> wrote:
> > #13 0x0808588e in main (argc=1, argv=0xb8ac) at imcc/main.c:637
> Can you please run
> print ((char**)0xb8ac)[1]
> to find out which file causes the coredump??
Sure!
> gdb ./parrot core
Core was generated by `./parrot --gc-debu
Patrick~
On 6/29/05, Patrick R. Michaud <[EMAIL PROTECTED]> wrote:
> On Tue, Jun 28, 2005 at 08:11:24PM -0400, Matt Fowles wrote:
> >Parrot Loses with Fedora Core 4
> > Patrick reported that Fedora Core 4 and Parrot don't get along well. Leo
> > s
Leo~
On 6/29/05, Leopold Toetsch <[EMAIL PROTECTED]> wrote:
> Matt Fowles wrote:
>
> > Core was generated by `./parrot --gc-debug
> > /home/mfowles/perl6/parrot/t/pmc/io_1.pir'.
>
> Ah. ok. That's a TODO tests that is supposed to fail. It is testing i
Leo~
On 6/30/05, Leopold Toetsch <[EMAIL PROTECTED]> wrote:
> Nice summary with examples:
>
> ftp://ftp.inf.puc-rio.br/pub/docs/techreports/04_15_moura.pdf
>
> and we still have to define semantics of parrot couroutines, e.g. WRT
> argument passing. See also Dan's blogs about couroutines,
I pre
All~
On 7/1/05, Luke Palmer <[EMAIL PROTECTED]> wrote:
> > Attempting to come up with a simplistic math grammar that has one possible
> > operand (A) and one possible operator (*) - so that things like A, A*A, and
> > A*A*A*A*A are all parsed. This simplistic example (thanks to spinclad on
> > #pe
Will~
On 7/6/05, Will Coleda <[EMAIL PROTECTED]> wrote:
>
> It would be nice if the summarizers also summarized the various
> Planet RSS feeds of journal entries, if those entries were
> sufficiently relevant.
I would be willing to do that, but I can't speak for Piers...
Matt
--
"Computer Scie
Larry~
On 7/11/05, Larry Wall <[EMAIL PROTECTED]> wrote:
> On Mon, Jul 11, 2005 at 11:14:18AM +0200, Michele Dondi wrote:
> : Hmmm... I am one of those who likes ./ more, instead. I mean, I _really_
> : like it! Thus, how about making '/' less meaningless, i.e. more
> : meaningful, in more general
Perl 6 Summary for 2005-07-05 through 2005-07-12
All~
Welcome to another summary from the frog house. A house so green it can
be seen from outerspace (according to google earth).
Perl 6 Compiler
Building Pugs Workaround
Sam Vilain posted a useful work around to the error "err
David~
On 25 Jul 2005 04:02:44 -, David Formosa (aka ? the Platypus)
<[EMAIL PROTECTED]> wrote:
>
> I'm going to hijack this thread to discuss something else.
Speaking for summarizers everywhere. A! Damn you!
Matt
--
"Computer Science is merely the post-Turing Decline of Formal System
ilures Nonfatal
Bernhard Schmalhofer suggested that " make languages " should not give
up after the first failure, but should instead build the remaining
languages.
<http://xrl.us/gv7k>
Dynclasses on Windows
Nick Glencross and Jonathan Worthington dis
Will~
Doesn't make have something called "PHONY" to handle that exact case?
Matt
On 7/27/05, Will Coleda <[EMAIL PROTECTED]> wrote:
> This is because there's a directory called "tcl". Since the directly
> already exists, there'd be nothing to make.
>
> Picking a dummy target like this is a way
Larry~
On 7/27/05, Larry Wall <[EMAIL PROTECTED]> wrote:
> On Wed, Jul 27, 2005 at 08:01:25PM +0800, Autrijus Tang wrote:
> : On Fri, Jul 22, 2005 at 03:40:34PM -0700, Larry Wall wrote:
> : > I dunno. I'm inclined to say that it should default to Item|Pair, and
> : > let people say Any explicitly
Autrijus~
On 8/6/05, Autrijus Tang <[EMAIL PROTECTED]> wrote:
> (Cc'ing p6l, but this feels like a p6c thread...)
>
> Greetings. As I'm moving forward with the new PIL runcore,
> I'm now trying to document my understanding as visual diagrams.
>
> The first one is about the compilation cycle:
>
Leo~
On 8/10/05, Leopold Toetsch <[EMAIL PROTECTED]> wrote:
> [ /me warnock fighting - and update below for method calls ]
>
> Original Message
> Subject: call opcodes cleanup
> Date: Thu, 21 Jul 2005 09:52:07 +0200
> From: Leopold Toetsch <[EMAIL PROTECTED]>
> To: Perl 6 Intern
Perl 6 Summary for 2005-08-02 through 2005-08-10
All~
Welcome to another summary, brought to you by chinese food. The
attentive among you will notice that this summary is a day late, because
I did not feel like doing it yesterday. If only I could do that at
work...
Perl 6 Co
Tim~
On 8/15/05, Tim Bunce <[EMAIL PROTECTED]> wrote:
> Anyone given any thought to Parrot <-> Java integration?
>
> Possible?
Definitely.
> Practical?
You would likely lose some speed, but that is really all.
> How much would would be involved?
Not a whole lot more than making a java compil
Perl 6 Summary for 2005-08-15 through 2005-08-22
All~
Welcome to another monday summary, which hopefully provides some
evidence that mondays can get better. It always feels like writing
summaries is an uphill battle, perhaps I should switch to writing about
Perl 6 Language firs
All~
I have a simple question. Who comprises @Larry? I am fairly sure
that I know a few people in it, but I am highly doubtful that I know
all of them.
Thanks,
Matt
--
"Computer Science is merely the post-Turing Decline of Formal Systems Theory."
-Stan Kelly-Bootle, The Devil's DP Dictionary
Nick~
Dan's plan was to do a topographic sort of the object tree to avoid
this problem for non-loops and to break loops randomly. I believe he
was even tempted to call rand in there just to make sure people didn't
come to depend on a behavior...
I think it might be wise for us to make all the de
Nick~
On 9/15/05, Nicholas Clark <[EMAIL PROTECTED]> wrote:
> On Thu, Sep 15, 2005 at 01:13:17PM -0400, Matt Fowles wrote:
> > Nick~
> >
> > Dan's plan was to do a topographic sort of the object tree to avoid
> > this problem for non-loops and to break loop
Jonathan~
On 9/19/05, Jonathan Worthington <[EMAIL PROTECTED]> wrote:
> "Nicholas Dronen" <[EMAIL PROTECTED]> wrote:
> > On Sun, Sep 18, 2005 at 11:48:08PM +0100, Jonathan Worthington wrote:
> > [ snip ]
> >
> >> I guess if I could offer any advice, it'd be don't be afraid of asking
> >> questions
Perl 6 Summary for 2005-09-12 through 2005-09-19
All~
Welcome to another Perl 6 Summary, this time brought to you with a
shorter pause (::grumble:: $WORK ::grumble::) and assisted by cookies.
Perl 6 Compilers
Circular Preludes for Fun and Confusion
Yuval Kogman posted a reall
Yuval~
On 9/20/05, Yuval Kogman <[EMAIL PROTECTED]> wrote:
> Today on #perl6 I complained about the fact that this is always
> inelegant:
>
> if ($condition) { pre }
>
> unconditional midsection;
>
> if ($condition) { post }
>
> I asked for some ideas and together with
Ingo~
On 9/21/05, Ingo Blechschmidt <[EMAIL PROTECTED]> wrote:
>
> foo(1,2,3); # &infix:<,> *not* called
> foo (1,2,3); # same as
> foo( (1,2,3) ); # &infix:<,> called
Do you mean this to read?
foo(1,2,3); # &infix:<,> *not* called
foo .(1,2,3);# &infix:<,>
Yuval~
On 9/22/05, Yuval Kogman <[EMAIL PROTECTED]> wrote:
> On Thu, Sep 22, 2005 at 08:20:42 +1000, Damian Conway wrote:
> > Ingo Blechschmidt asked:
> >
> > >my $pair = (a => 42);
> > >say ~$pair; # "a\t42"? "a\t42\n"? "a 42"?
> >
> > Not yet specified but I believe it should be "42" (i
Jonathan~
On 9/22/05, Jonathan Worthington <[EMAIL PROTECTED]> wrote:
> "Roger Browne" <[EMAIL PROTECTED]> wrote:
> > If you do tweak the signature for the packfile format, I suggest you
> > take a leaf out of the PNG specification and ensure that the signature
> > will robustly detect common erro
Austin~
On 9/29/05, Austin Hastings <[EMAIL PROTECTED]> wrote:
> Plus it's hard to talk about backwards. If you say
>
> for @l -> ?$prev, $curr, ?$next {...}
>
> what happens when you have two items in the list? I think we're best off
> using signature rules: optional stuff comes last.
I disagre
Austin~
On 9/29/05, Austin Hastings <[EMAIL PROTECTED]> wrote:
> Matt Fowles wrote:
>
> >Austin~
> >
> >On 9/29/05, Austin Hastings <[EMAIL PROTECTED]> wrote:
> >
> >
> >>Plus it's hard to talk about backwards. If you say
> >&g
Joshua~
On 10/3/05, Joshua Hoblitt via RT <[EMAIL PROTECTED]> wrote:
> > [EMAIL PROTECTED] - Sun Aug 22 17:19:34 2004]:
> >
> > All~
> >
> > This patch is an early step in getting a scons based build system for
> > parrot. Currently, it leaves the make system in place, the goal being
> > to add a
Perl 6 Summary for 2005-09-26 through 2005-10-02
All~
Welcome to another summary, this time a day late because I was in Philly
for Serenity. If you haven't seen Serenity yet you should stop reading
this summary and go see it. The summary will be here when you get back.
I promis
Joshua~
On 10/9/05, Joshua Hoblitt via RT <[EMAIL PROTECTED]> wrote:
> > [EMAIL PROTECTED] - Mon Oct 03 12:49:55 2005]:
> >
> > I brought it up on the list first, and Dan was OK with it because
> > scons can output a series of commands (like a bat file or batch
> > script) to build from scratch (n
Patrick~
On 10/9/05, Patrick R. Michaud <[EMAIL PROTECTED]> wrote:
> On Sun, Oct 09, 2005 at 09:55:44AM -1000, Joshua Hoblitt wrote:
> > > > What is the status of this bug? Should this be a PGE todo item?
> > >
> > > My opinion is that it's "not a bug" -- the normal behavior for
> > > most progra
Patrick~
On 10/10/05, Patrick R. Michaud <[EMAIL PROTECTED]> wrote:
> On Mon, Oct 10, 2005 at 09:11:02AM -0400, Matt Fowles wrote:
> > Patrick~
> >
> > The theoretical implementation of this is quite simple. Keep a
> > counter. everytime a token is consum
Patrick~
On 10/10/05, Patrick R. Michaud <[EMAIL PROTECTED]> wrote:
> On Mon, Oct 10, 2005 at 10:45:54AM -0400, Matt Fowles wrote:
> > Perhaps a better approach would be to perform a bit
> > of static analysis on the grammar and look for left recursions at
> > creatio
All~
On 10/13/05, Brent 'Dax' Royal-Gordon <[EMAIL PROTECTED]> wrote:
> Luke Palmer <[EMAIL PROTECTED]> wrote:
> > Okay, I seriously have to see an example of a submethod in use.
>
> Likewise. As far as I've seen, submethods are a kludge wedged in for
> cases where you're actually calling all the
=head1 Perl 6 Summary for 2005-10-10 through 2005-10-18
All~
Welcome to another Perl 6 Summary. Sadly, this week's summary is not
brought to you by cookies as I already finished them. Sadder still,
it is also brought to you a week late. On the plus side, Mike
Doughty's "Haughty Melodic" is qui
Nick~
On 10/26/05, Nick Glencross <[EMAIL PROTECTED]> wrote:
> Guy,
>
> As a follow-up to a discussion a few days ago about binding parrot to
> C++ functions, is making it possible to compile parrot with a C++
> compiler a 'Bad Thing'?
I like the idea, but I tend to like C++ more than reason woul
Larry~
On 10/26/05, Larry Wall <[EMAIL PROTECTED]> wrote:
> So we'd get:
>
> :@array[42] 42 => @array[1]
Do you mean C< :@array[42] 42 => @array[42] >?
> The last three forms are more arguable than the first three, especially
> since they probably aren't valid formal parameters. We kind of
Juerd~
On 10/27/05, Juerd <[EMAIL PROTECTED]> wrote:
> Yiyi Hu skribis 2005-10-28 3:17 (+0800):
> > class A {
> > has $.b;
> > method show { "$.b".say };
> > };
> > A( b => 5 ).show;`
>
> This is how some other language construct objects, but not how Perl does
> it. In other words: you should not
All~
> >>The clone functions could be redone like:
> >> Parrot_do_dod_run(); // get free headers if possible
> >> Parrot_block_DOD/GC();
> >> do_clone
> >> Parrot_unblock_DOD/GC
> >>This would also be faster, because there are no DOD runs during clone
> >>(which wouldn't yield more free header
All~
Regarding MM dispatch, I implemented a version of this for a class of mine
once. The version I have is in C++, and heavily uses templating to provide
compile time type checks where appropriate. Despite these differences,
however, I think that the system of caching methods and the system of
All~
It occurs to me that no one has mentioned ML. ML would be a pretty good
language to compile to parrot, and has reasonably strong usage in academic
circle...
Matt
> -Original Message-
> From: K Stol [mailto:[EMAIL PROTECTED]]
> Sent: Tuesday, January 21, 2003 3:18 AM
> To: [EMAIL PR
All~
I just checked out a fresh copy of the everything and got
Failed Test Stat Wstat Total Fail Failed List of Failed
---
t/op/hacks.t 1 256 91 11.11% 7
t/src/basic.t255 65280 22 100.0
Leopold Toetsch wrote:
First thanks, seconds I modified and applied it - but third, its
disabled and doesn't work and forth - it needs a lot of tests to really
get activated.
I did add some comments, and an example, why it will not work.
I think its better, to have the midifed patch applied and lea
Piers Cawley wrote:
The Continu(ation)ing Saga
Jonathan Sillito posted a longish meditation on Parrot's new
continuation passing calling conventions. He wondered if, now we have
continuation passing, we really needed the various register stacks that
were used in the old stack base
Dan Sugalski wrote:
The issue is metadata. How do you declare a class' inheritance
hierarchy, its interfaces, its attributes, and its type? (At the very
least, there's probably more) I can see the following .
1) A class subclasses a single parent.
2) A class subclasses a single parent and adds
All~
I have been following the whole GC/timely destruction thing for a while
and have a few questions/observations.
Most of the ref counting systems provide for very simple ref counting
containers and, essentially, provide timely destruction for the simple
case where a variable is not placed i
Benjamin Goldberg wrote:
For more complex cases timely destruction will not be assured.
Which is not-so-good. We'd like timely destruction *always*
However, given that your suggestion can be implemented purely through
compile time behaviors, there's no reason we can't use what you've
suggested fo
All~
I have been playing with imcc's optimization and have a question about
it. With -O2 we get the following results for various inputs:
(results 1, invariant removed from loop)
.sub _main
set I0, 5
loop:
set I1, 2
add I0, I1
lt I0, 20, l
All~
Jonathan Sillito wrote:
The patch looks pretty good to me. Here is a proposal for an alternative
inheritance hierarchy. Invocable, the root of the hierarchy, is basically a
sub that is not a closure (i.e. *no* context at all, just an address).
pmclass Invocable { # I called this sublite befor
Leopold Toetsch wrote:
( /me again mumbling why we have 6 different stack implementations with
a lot of duplicate code. One general stack with different sized data
items would do it too - with some overhead ;-)
Were this C++ I would say that we could write a single general purpose
stack and use te
Gordon Henriksen wrote:
The most fundamental feature throwing an exception is that it transfers
program execution from the call site. Allowing the caller to resume
execution at that site is a very dangerous form of action at a distance.
I think you'd be better off a giving the caller an explicit wa
1 - 100 of 242 matches
Mail list logo
