On Sat Feb 28 15:56:13 2009, bacek wrote:
> From 116eec4b249f6917187741053006763f96d22496 Mon Sep 17 00:00:00 2001
> From: Vasily Chekalkin
> Date: Sun, 1 Mar 2009 09:08:30 +1100
> Subject: [PATCH] Fix handling verbosity in t/harness
>
> ---
> t/harness |2 +-
> 1 files changed, 1 insertions
I'm guessing this was an issue in the build system and has since been
fixed with the --gen-parrot option to Configure.pl . I'll close the
ticket for now; if the problem is not resolved, feel free to re-open a
ticket (and describe a bit more about your setup so we can try to
reproduce it).
Thanks
On Sat Jan 17 14:17:17 2009, masak wrote:
> rakudo: if 5 > my $a = 4 { say $a }
> rakudo 35707: OUTPUT«Unable to set lvalue on PAST::Val node [...]
> it works if I use parens, but what does that error mean?
> Hmm.
> masak: What's the next line down in the backtrace?
> called from Sub 'parrot;
On Thu Jan 22 02:48:08 2009, masak wrote:
> masak: can you submit the 'my Int $x = +"2"' bug please?
> * masak submits
> rakudo: my Int $x = +'2'
> rakudo 35875: OUTPUT«Type mismatch in assignment. [...]
> rakudo: say WHAT +"2";
> rakudo 35875: OUTPUT«Num»
> meh.
> That's why.
> it should
On Fri Jan 02 18:02:41 2009, andy_b...@wiwb.uscourts.gov wrote:
> class Prime {
> has @!primes is rw;
> has Int $!number is rw = 1;
>
> method next() {
> my $not_prime = 1;
>
> while($not_prime && $!number++) {
> $not_prime = @!primes.grep({$!number % $^a == 0});
> }
>
>
On Sat Dec 27 10:07:39 2008, mberends wrote:
> In Rakudo r34416, the exit() function gives:
> *** glibc detected *** /usr/local/bin/perl6: double free or
> corruption (!prev): 0x013ee070 ***
>
> In a script, other statements prior to exit() execute
> correctly. On the command line, perl6 -
On Sun Dec 07 13:31:27 2008, bacek wrote:
> Hello.
>
> Simple example
>
> ba...@icering:~/src/xquery$ cat m.pl
> token a { 'a' };
> token b { 'b' };
> rule Foo { | };
>
> 'b' ~~ / /;
> given $/ {
> when . { say "a"; };
> when . { say "b"; };
> };
Now fixed in 7bd5a95 (and tests added
Closing this ticket, as we'll put any FAQ on the new rakudo.org website
or one of the other Perl 6 websites.
Thanks!
Pm
On Mon Oct 27 11:21:57 2008, pmichaud wrote:
> On Sun, Oct 26, 2008 at 02:47:12PM -0700, Carl Mäsak wrote:
> > rakudo: if(3 < 5) { say "yes" } # that should fail
> >
> > Early experimentation indicates that this goes for unless, while,
> > until and given as well, and probably others I can't thin
On Mon Oct 27 11:21:57 2008, pmichaud wrote:
> On Sun, Oct 26, 2008 at 02:47:12PM -0700, Carl Mäsak wrote:
> > rakudo: if(3 < 5) { say "yes" } # that should fail
> >
> > Early experimentation indicates that this goes for unless, while,
> > until and given as well, and probably others I can't thin
On Wed Feb 25 18:21:49 2009, i...@nurey.com wrote:
> I am on OS X 10.5.6 using perl 5.8.9 from macports.
>
> I cloned rakudo's git repo and then compiled as follows:
>
> $ cd rakudo
> $ perl Configure.pl --gen-parrot
> $ parrot/parrot_config revision
> 37000
> $ gmake
> $ gmake spectest
> perl t/
On Thu Feb 26 04:37:42 2009, masak wrote:
> $ cat A.pm
> module A;
>
> sub foo is export {
> }
> $ perl6 -e 'use A; foo'
> Could not find non-existent sub foo
> [...]
>
> I may have misunderstood how to use the 'is export' feature, but the
> above doesn't work, and that surprises me. What should
On Sun Jun 22 13:04:51 2008, karavelov wrote:
> There is some parse error for this simpe case:
> ==code
> use v6;
>
> sub ok ($num){
> $num;
> }
>
> for 1..5000 {
> ok($_);
> }
This is now fixed in 1e22a68, as well as the other cases where
if/while/until/unless/for... were being incorrec
Jon Lang wrote:
Keys, OTOH, don't have any such requirement; so continuous keys may
very well be doable. If they _are_ doable, you have to ask questions
such as "how do I assign values to a continuous interval of keys?" To
truly be robust, we ought also answer this question in terms of
multidi
On Feb 28, 2009, at 11:07 AM, Patrick R. Michaud wrote:
On Sat, Feb 28, 2009 at 10:46:10AM -0600, Andy Lester wrote:
On Feb 28, 2009, at 10:29 AM, Patrick R. Michaud wrote:
So, for the time being Rakudo's official policy will be to
accept patch submissions via RT. I've now cleared the fork
Jon Lang wrote:
Darren Duncan wrote:
What I'm proposing here in the general case, is a generic collection type,
"Interval" say, that can represent a discontinuous interval of an ordered
type. A simple way of defining such a type is that it is a "Set of Pair of
Ordered", where each Pair defines
On Sat, Feb 28, 2009 at 10:46:10AM -0600, Andy Lester wrote:
>
> On Feb 28, 2009, at 10:29 AM, Patrick R. Michaud wrote:
>
>> So, for the time being Rakudo's official policy will be to
>> accept patch submissions via RT. I've now cleared the fork queue
>> on GitHub; any patches that were previousl
On Feb 28, 2009, at 10:29 AM, Patrick R. Michaud wrote:
So, for the time being Rakudo's official policy will be to
accept patch submissions via RT. I've now cleared the fork queue
on GitHub; any patches that were previously there need to be
resubmitted.
My understanding is that this is bad
A few people have asked about submitting patches via the
"fork queue" on GitHub; after working with the queue this
morning and largely being frustrated by it, I'm going to request
that patches continue to be submitted as patches through RT.
The biggest difficulty that I'm encounter with the fork q
Darren Duncan wrote:
> In reply to Jon Lang,
>
> What I'm proposing here in the general case, is a generic collection type,
> "Interval" say, that can represent a discontinuous interval of an ordered
> type. A simple way of defining such a type is that it is a "Set of Pair of
> Ordered", where eac
Darren Duncan wrote:
In reply to Jon Lang,
What I'm proposing here in the general case, is a generic collection
type, "Interval" say, that can represent a discontinuous interval of an
ordered type. A simple way of defining such a type is that it is a "Set
of Pair of Ordered", where each Pair
In reply to Jon Lang,
What I'm proposing here in the general case, is a generic collection type,
"Interval" say, that can represent a discontinuous interval of an ordered type.
A simple way of defining such a type is that it is a "Set of Pair of Ordered",
where each Pair defines a continuous
22 matches
Mail list logo
