On 7/18/05, Sam Vilain <[EMAIL PROTECTED]> wrote:
> Is this needed, when you can just;
>
>atomic {
> unsafeIO { $dbh.begin_work };
>
> unsafeIO { $dbh.do(...) };
>
> unsafeIO { $dbh.commit };
>} CATCH {
> $dbh.rollback;
>};
Shouldn't that `CATCH` block be wit
# New Ticket Created by Curtis Rawls
# Please include the string: [perl #36584]
# in the subject line of all future correspondence about this issue.
# https://rt.perl.org/rt3/Ticket/Display.html?id=36584 >
This patch:
-Adds an "immediate dominator" attribute to the CFG.
-Adds an algorithm to
# New Ticket Created by Curtis Rawls
# Please include the string: [perl #36585]
# in the subject line of all future correspondence about this issue.
# https://rt.perl.org/rt3/Ticket/Display.html?id=36585 >
This patch pulls the graph coloring portion of imc_reg_alloc() out and
puts it in its o
- Original Message -
From: "Stevan Little" <[EMAIL PROTECTED]>
Subject: Re: Perl 6 Modules
| Gav,
|
| Welcome aboard. You might also want to hop onto the #perl6 channel over
| at irc.freenode.net it is where many of use spend way too much time,
| and a great place for asking questions l
Curtis Rawls (via RT) wrote:
This patch:
-Adds an "immediate dominator" attribute to the CFG.
Thanks, applied - r8647
leo
Curtis Rawls (via RT) wrote:
This patch pulls the graph coloring portion of imc_reg_alloc() out and
puts it in its own function, graph_coloring_reg_alloc(). This will
allow alternate register allocators to be implemented.
Thanks, applied - r8648
leo
This currently works in Pugs:
for [1..10].pairs -> Pair $x { say $x.value }
But this does not:
for [1..10].pairs -> $x { say $x.value }
Because the ruling that pairs must not be bound to parameters that are
not explicitly declared to handle them. Is this a desirable behaviour?
Thanks,
I've begun using perl's Test modules to do some unit testing on our code
and regression testing on some of our web applications.
Specificially, I'm using Test::More and prove.
However, I have some questions that aren't really addressed by the
documentation I've found thus far. These are basic q
Autrijus Tang <[EMAIL PROTECTED]> wrote:
On Fri, Jul 15, 2005 at 02:16:48PM -0500, [EMAIL PROTECTED] wrote:
> package MyModule;
> > use v6;
> sub doubler( Num $x ) {
>return 2 * $x;
> }
> > sub value_v( Code +$func = &MyModule::doubler ) is export {
>return $func( 5 );
> }
> > This wor
Nattfodd wrote:
Leopold Toetsch wrote:
I believe that if we want variable-sized body, we need at least one next
(or pmc_size) pointer in the header.
Not necessarily. We can have:
- some type bits in the gmc_header for fixed-sized and commonly used
objects, so that GMC knows the size
- alt
On Mon, Jul 18, 2005 at 09:42:06AM -0400, Brett Sanger ([EMAIL PROTECTED])
wrote:
> Currently I have a directory tree, and my testing consists of running
> prove on one .t file, a directory, or recursively over all. I don't
> seem to have a means of controlling the order of tests without using th
On Mon, Jul 18, 2005 at 09:00:50AM -0500, [EMAIL PROTECTED] wrote:
> I made the test. The problem only occurs when the sub is called from
> another package, in my case that was a driving script.
>
> I'm not sure how to accept the invitation (or what that even means).
Oh. It means you should
Bob Rogers wrote:
From: Leopold Toetsch <[EMAIL PROTECTED]>
Date: Sun, 17 Jul 2005 12:08:34 +0200
> What happens when a store creates a cycle? And how would this be
> detected?
To keep the invariant we can't move the container nor the contained
object, *if* both are aggregat
(insert off-topic grumblings about that "Munging Reply-To Considered
Harmful" and how I can't reply in one way to most lists anymore)
On Mon, Jul 18, 2005 at 09:44:25AM -0500, Andy Lester wrote:
> > shell. (i.e. "prove" will run the tests in whatever order it pleases.
> > "prove *" will run them
Brett Sanger wrote:
I have some related tests. For example, to test the account management
of our LDAP administration tools on the website, I have a test to create
an account, test various edit options, then delete the account. (This
is testing the create and delete as well, so I don't want to
On Mon, Jul 18, 2005 at 08:42:24PM +0800, Autrijus Tang wrote:
: This currently works in Pugs:
:
: for [1..10].pairs -> Pair $x { say $x.value }
:
: But this does not:
:
: for [1..10].pairs -> $x { say $x.value }
:
: Because the ruling that pairs must not be bound to parameters that are
Ok, I will un-warnock myself here :)
As of r5674 in the Pugs tree, the Perl6::MetaModel now supports all the
A12 dispatch orders.
:canonical # canonical dispatch order
:ascendant # most-derived first, like destruction order
:descendant # least-derived first, like con
Larry,
On Jul 18, 2005, at 3:21 PM, Larry Wall wrote:
On Mon, Jul 18, 2005 at 02:54:40PM -0400, Stevan Little wrote:
: Ok, I will un-warnock myself here :)
Sorry, I've been occupied by various time-consuming family obligations.
My own fault, I asked on the weekend. People *should* spend time
On Mon, Jul 18, 2005 at 02:54:40PM -0400, Stevan Little wrote:
: Ok, I will un-warnock myself here :)
Sorry, I've been occupied by various time-consuming family obligations.
: And after some discussion on #perl6 I decided to make 'C3' the
: algorithm of choice for the :ascendant ordering, and al
Autrijus Tang <[EMAIL PROTECTED]> wrote:
On Mon, Jul 18, 2005 at 09:00:50AM -0500, [EMAIL PROTECTED] wrote:
> I made the test. The problem only occurs when the sub is called from
> another package, in my case that was a driving script.
> > I'm not sure how to accept the invitation (or what tha
At 7:39 PM +0800 7/18/05, Gav wrote:
What would be the changes required to write this a Perl 6 file, my guess is
:-
#!/usr/bin/pugs
use v6;
but I don't know about the rest of it.
I'd like to get this sorted first and then write a test perl6 module and use
that in my test perl 6 script. The
Simon Marlow (via RT) kirjoitti:
# New Ticket Created by "Simon Marlow"
# Please include the string: [perl #36548]
# in the subject line of all future correspondence about this issue.
# https://rt.perl.org/rt3/Ticket/Display.html?id=36548 >
Hi,
I've been trying in vain over the last day or
On Mon, Jul 18, 2005 at 09:42:06AM -0400, Brett Sanger wrote:
> Currently I have a directory tree, and my testing consists of running
> prove on one .t file, a directory, or recursively over all. I don't
> seem to have a means of controlling the order of tests without using the
> shell. (i.e. "pr
Just a quick addition to my previous message: I now got
1) --no error, just a failed test--
2) --no error, just a failed test--
3) pugs: internal error: scavenge_stack: weird activation record found
on stack: 49900
4) pugs: internal error: EVACUATED object entered!
5) pugs: internal error: scav
Autrijus Tang <[EMAIL PROTECTED]> wrote:
> This currently works in Pugs:
>
> for [1..10].pairs -> Pair $x { say $x.value }
>
> But this does not:
>
> for [1..10].pairs -> $x { say $x.value }
>
> Because the ruling that pairs must not be bound to parameters that are
> not explicitly declared
On Mon, Jul 18, 2005 at 03:34:36PM +1200, Sam Vilain wrote:
: Say I make an "accessor" method for an attribute that doesn't really
: 'exist'.
:
: For instance, a good example of this is the "month_0" vs "month"
: properties on a date object; I want to make both look equivalent as
: real properties
Leopold Toetsch wrote:
>
>gen n | gen j
>[ A ] -> [ B ] -|-> [ C ]
> ^ |
> +--+
>
> A circular data structure doesn't really change the picture, except,
> when again scanning up to generation j, and we find object C b
Larry Wall wrote:
> > Users of the class includes people subclassing the class, so to them
> > they need to be able to use $.month_0 and $.month, even though there
> > is no "has $.month_0" declared in the Class implementation, only
> > "has $.month".
We thought about defining the attribute varia
From: Nattfodd <[EMAIL PROTECTED]>
Date: Tue, 19 Jul 2005 04:03:49 +0200
Leopold Toetsch wrote:
>
>gen n | gen j
>[ A ] -> [ B ] -|-> [ C ]
> ^ |
> +--+
>
> A circular data structure doe
From: Leopold Toetsch <[EMAIL PROTECTED]>
Date: Mon, 18 Jul 2005 17:08:53 +0200
Circular or not isn't really the problem. With generational GC you'll
always have the chance of tenured garbage . . .
Now due to some other pointer store the object C becomes dead. But as
long as w
On Mon, Jul 18, 2005 at 03:48:55PM -0700, Brent 'Dax' Royal-Gordon wrote:
> Autrijus Tang <[EMAIL PROTECTED]> wrote:
> > This currently works in Pugs:
> >
> > for [1..10].pairs -> Pair $x { say $x.value }
> >
> > But this does not:
> >
> > for [1..10].pairs -> $x { say $x.value }
> >
> > Be
31 matches
Mail list logo
