> I just tried to build parrot with g++ on darwin/intel to see if I could
> replicate the initial failure
> reported in the ticket, but am unable to. (g++ is detected as gcc, and then
> we pass it an option
> that makes it explode.)
What Configure options do you used? I usually do:
--cc=g++ --c
On Fri, Dec 12, 2008 at 11:49:37PM -0500, Uri Guttman wrote:
: so you have not discovered something new in perl or perl6 regarding
: sorting. it has been covered and in depth but never properly integrated
: into the p6 docs.
It will be more useful if you comment relative to the existing design fou
On Mon, Dec 15, 2008 at 04:43:51PM -0700, David Green wrote:
> I can't really think of a great example where you'd want to numify a
> pair, but I would expect printing one to produce something like "a =>
> 23" (especially since that's what a one-element hash would print,
> right?).
Nope, wou
On Mon, Dec 15, 2008 at 10:26 PM, Larry Wall wrote:
> On Mon, Dec 15, 2008 at 04:43:51PM -0700, David Green wrote:
>> I can't really think of a great example where you'd want to numify a
>> pair, but I would expect printing one to produce something like "a =>
>> 23" (especially since that's what a
On Sat Aug 16 07:29:43 2008, je...@perl.org wrote:
> - Need resumable exceptions (Parrot)
Fixed in r33942 .
HaloO,
Moritz Lenz wrote:
The counter example is if you want to print a pair:
.say for %hash.pairs.sort: { .value };
In that case it would be nice to have the key appear in the stringification.
I see no problem as long as say gets a pair as argument. Then it can
print the key and value separ
On Tue, 16 Dec 2008, jason switzer wrote:
You can already easily mix it in using 'does':
$fstab = open('/etc/fstab', :r);
$fstab does WhitespaceTrim;
I don't think it's really necessary to include that into open(),
though it might be useful syntactic sugar.
I haven't spent the time to unders
# New Ticket Created by Stephane Payrard
# Please include the string: [perl #61394]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt3/Ticket/Display.html?id=61394 >
my $s = " "; say $s.chars # now returns 1
Note : the bug was reported on macinte
On Wed Sep 24 17:24:16 2008, pmichaud wrote:
> On Wed, Sep 24, 2008 at 04:53:54PM -0700, chromatic wrote:
> > On Tuesday 23 September 2008 09:35:05 Moritz Lenz wrote:
> >
> > > %hash.pairs.sort needs infix: to work properly with Pair as
input.
> > >
> > > It should be easy to add a multi that does
On Sun Dec 14 11:47:58 2008, moritz wrote:
> S29 says:
>
> : If all criteria are exhausted when comparing two elements, sort should
> : return them in the same relative order they had in @values.
>
> or in terms of computer science, the sort should be stable.
>
> Rakudo r33895 doesn't do this, a
On 2008-Dec-6, at 7:37 am, Aristotle Pagaltzis wrote:
Funnily enough, I think you’re onto something here that you didn’t
even notice: [...]
if we had a NOTFIRST (which would run before ENTER just as FIRST
does, but on *every* iteration *except* the first), then we could
trivially attain the
Added in r33963, thanks!
Pm
I'll pick up borland and play with it, although I won't get to it
until the next cycle. I've got a really old version of Turbo C++ 4.52
left over from school, and free versions of Turbo C++ Explorer are
available for download. I don't promise any miracles, but at least I
will be able to prove that
HaloO,
Daniel Ruoso wrote:
That being said, we should note that this example looks simple because
we have almost no lazyness implied (since there's an assignment in the
first line), every list access requires the evaluation of the flatenning
of the list.
my @@a = ((),(1,2,3),());
Mustn't th
Hi!
Yes I use Ubuntu.
libicu36-dev 3.6-2etch1
Parrot 33940 maked on my box, but make test fail:
Test Summary Report
---
t/pmc/fixedfloatarray.t (Wstat: 11 Tests: 0 Failed: 0)
Parse errors: Bad plan. You planned 24 tests but ran 0.
t/pmc/multisub.t
TSa wrote:
> I see no problem as long as say gets a pair as argument. Then it can
> print the key and value separated with a tab. More problematic are
> string concatenations of the form
>
> say "the pair is: " ~ (foo => $bar);
>
> which need to be written so that say sees the pair
>
> say "the
Hi,
One of the hardest features in Perl 6 is the slice context. It is
undoubtfully usefull, since it provides semantics to acces each
iteration of a map, for instance.
But there's one thing in the spec that makes not only slices, but the
lists themselves considerably harder to implement, and that
Andrew Whitworth wrote:
> I'll pick up borland and play with it, although I won't get to it
> until the next cycle. I've got a really old version of Turbo C++ 4.52
> left over from school, and free versions of Turbo C++ Explorer are
> available for download. I don't promise any miracles, but at lea
Moritz Lenz wrote:
> Off the top of my head, see S06 for the gory details:
>
> my $pair = a => 'b';
>
> named(a => 'b');
> named(:a);
> named(|$pair);
>
> positional((a => 'b'));
> positional((:a));
> positional($pair);
As you say: the gory details, emphasis on gory. But if that's the way
of thin
On Tue, Dec 16, 2008 at 1:20 PM, Ron Blaschke wrote:
> Some time ago, because of this ticket, I tried with Borland C++ 5.5.1
> and 5.82, and failed miserably. But that may just be my bad bcc-foo.
> Unless someone's keen for this platform and has access to a fairly new
> ("within two years") versi
Unless this task would make you exceedingly happy, I wouldn't bother.
IMO, there are much higher priority things requiring tuits than trying
to add a fourth compiler for windows, especially before the 1.0
release.
Regards.
On Tue, Dec 16, 2008 at 1:24 PM, Andrew Whitworth wrote:
> On Tue, Dec 1
On Sun, 14 Dec 2008, Marc Chantreux wrote:
On Sat, Dec 13, 2008 at 01:34:44PM +1100, Timothy S. Nelson wrote:
On Sat, 13 Dec 2008, howard chen wrote:
What I think is more likely to happen in reality is that people will
make various Perl6 "distros", ie. the Perl6 core + whatever modules
Em Ter, 2008-12-16 às 18:47 +0100, TSa escreveu:
> > # the following will require a flatenning to get the actual index
> > say @a[3];
> Could we not shift the problem into a more complicated form
> of the size of the array? Here it has size 0+3+0 but each of the
> summands could be lazy and hen
On Mon, Dec 08, 2008 at 02:32:14PM -0600, Patrick R. Michaud wrote:
: A very interesting question came up on #perl today, so I'm
: forwarding it to p6l for discussion/decision.
:
: Given the following code:
:
: sub foo() { return 1; }
: sub bar() { warn "oops"; }
:
: {
:
Author: kjs
Date: Tue Dec 16 12:09:02 2008
New Revision: 33979
Modified:
trunk/docs/pdds/pdd19_pir.pod
Log:
[pdd19] change some {{ }} notes in more formal notes, indicating the current
behaviour, and what it will be like. More cleanups of pdd19 will come after
more deprecated stuff is remove
I think I'm fine with making them separate. Recursive lazy flattening
seems too evil; slice and list contexts should not try to do the work of
captures. Thanks.
Larry
On Mon, Dec 15, 2008 at 03:06:44PM -0700, Stephen Weeks wrote:
: do {
: die 'some text';
: say 'after the exception';
: CATCH {
: say 'caught the exception';
: ...; # what goes here?
: }
: }
:
: My proposal is to call .resume() on the exception object.
It could jus
Author: allison
Date: Tue Dec 16 14:03:21 2008
New Revision: 33985
Modified:
trunk/docs/pdds/pdd22_io.pod
Log:
[pdd] Remove section on Deprecated Opcodes from I/O PDD, now that all of them
have been removed.
Modified: trunk/docs/pdds/pdd22_io.pod
=
On Tuesday 16 December 2008 15:40:32 Allison Randal via RT wrote:
> The simple solution is to add opcodes for 'setstdin', 'setstdout', and
> 'setstderr' that change the interpreter's stored FileHandle PMCs to a
> PMC passed in as an argument. This will not effect any C code that
> directly calls t
Author: chromatic
Date: Tue Dec 16 16:05:40 2008
New Revision: 33998
Modified:
trunk/docs/pdds/draft/pdd14_numbers.pod
Log:
[PDD] Updated link to IBM's decimal arithmetic library (thanks to Geraud for
finding its new location).
Modified: trunk/docs/pdds/draft/pdd14_numbers.pod
===
TSa wrote:
> HaloO,
>
> Daniel Ruoso wrote:
>> That being said, we should note that this example looks simple because
>> we have almost no lazyness implied (since there's an assignment in the
>> first line), every list access requires the evaluation of the flatenning
>> of the list.
>>
>> my @@
# New Ticket Created by Jeff Horwitz
# Please include the string: [perl #61412]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt3/Ticket/Display.html?id=61412 >
In r33954 this succeeds in Rakudo:
> my %hash; %hash = 'bar'; say %hash;
bar
but this
Jon Lang wrote:
> That's a good point. Is there an easy way to distinguish between
> passing a pair into a positional parameter vs. passing a value into a
> named parameter?
Off the top of my head, see S06 for the gory details:
my $pair = a => 'b';
named(a => 'b');
named(:a);
named(|$pair);
On Tue, Dec 16, 2008 at 12:20 PM, Ron Blaschke wrote:
> Andrew Whitworth wrote:
>> I'll pick up borland and play with it, although I won't get to it
>> until the next cycle. I've got a really old version of Turbo C++ 4.52
>> left over from school, and free versions of Turbo C++ Explorer are
>> ava
# New Ticket Created by "Eric Hodges"
# Please include the string: [perl #61420]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt3/Ticket/Display.html?id=61420 >
Index: src/classes/Int.pir
===
On Tue, 16 Dec 2008, David Green wrote:
On 2008-Dec-6, at 7:37 am, Aristotle Pagaltzis wrote:
Funnily enough, I think you?re onto something here that you didn?t even
notice: [...]
if we had a NOTFIRST (which would run before ENTER just as FIRST does, but
on *every* iteration *except* the first
How do you compute '*'? That is, how do you know how many more
iterations you have to go before you're done?
Should you really be handling this sort of thing through an "iteration
count" mechanism? How do you keep track of which iteration you're on?
Is it another detail that needs to be handled
On Tue, 16 Dec 2008, Jon Lang wrote:
How do you compute '*'? That is, how do you know how many more
iterations you have to go before you're done?
In some cases, it won't have to be computed, in some cases it won't be
computeable (which should be an error). I'd say it'd be fair enough to sa
On Tue, Dec 16, 2008 at 7:04 AM, jason switzer wrote:
> I hadn't seen a Nameable role mentioned yet, so I wasn't able to understand
> any such concept.
The list was not meant to be exhaustive. There are a lot more roles
that have something to do with IO but were missing: Asynchronous IO,
Datagram
On Tue, Dec 16, 2008 at 10:02:23AM -0800, Jeff Horwitz wrote:
> # New Ticket Created by Jeff Horwitz
> # Please include the string: [perl #61412]
> # in the subject line of all future correspondence about this issue.
> # http://rt.perl.org/rt3/Ticket/Display.html?id=61412 >
>
>
> In r33954 th
Hi all. I've been working on some stuff that's vaguely, tangentially
CPAN-related.
My basic assumption is that there's going to be some kind of packaging
system written around 6PAN.
One thing I've been working on recently is a (Perl 5) object that
models package metadata. In theory, it
On Mon, Dec 15, 2008 at 11:18:54PM -0500, Mark J. Reed wrote:
> On Mon, Dec 15, 2008 at 5:41 PM, Moritz Lenz wrote:
> > I know at least of infix:(Num $a, Num $b) (which does the same as
> > Perl 5's <=>) and infix:(Pair $a, Pair $b) (which does $a.key cmp
> > $a.key || $a.value cmp $b.value), so n
Applied in r34011, thanks!
Pm
On 2008 Dec 16, at 23:00, Timothy S. Nelson wrote:
One thing I've been working on recently is a (Perl 5) object that
models package metadata. In theory, it should be able to model the
metadata from a .rpm, a .deb, a CPAN package, or whatever. Then you
read the data using a "metadata input
On Tue, 16 Dec 2008, Brandon S. Allbery KF8NH wrote:
On 2008 Dec 16, at 23:00, Timothy S. Nelson wrote:
One thing I've been working on recently is a (Perl 5) object that
models package metadata. In theory, it should be able to model the
metadata from a .rpm, a .deb, a CPAN package, or whatev
On 2008-Dec-16, at 6:21 pm, Timothy S. Nelson wrote:
Or, instead of having a new block, just add the iterator indicator
to the NEXT block, and get rid of ENTER and LEAVE. That way, you'd
have this sequence:
- FIRST {}
- NEXT 0 {} # Replaces ENTER
- NEXT 1..* {} # Does NOTF
# New Ticket Created by Jochen Plumeyer
# Please include the string: [perl #61410]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt3/Ticket/Display.html?id=61410 >
Hi again,
just to give the positive feedback: No build issues anymore since parrot
47 matches
Mail list logo
