At 2:54 AM + 12/15/05, Luke Palmer wrote:
On 12/15/05, Darren Duncan <[EMAIL PROTECTED]> wrote:
I propose, perhaps redundantly, that Perl 6 include a complete set of
native
Okay, I'm with you here. Just please stop saying "native" and "core".
Everyone.
Yes, of course. What I meant w
As an addendum to what I said before ...
The general kind of thing I am proposing for Perl 6 to have is a
declarative syntax for more kinds of tasks, where you can simply
specify *what* you want to happen, and you don't have to tell Perl
how to perform that task.
An example of declaratives t
While working out some bugs in ParTcl I came across something roughly
equivalent to the following Perl code (I'm using Perl because I
believe more people know Perl than Tcl, at least on this list):
#!/usr/bin/perl
$var = "Foo";
*alias = *var;
$alias = undef;
$alias = "Baz";
print $va
# New Ticket Created by Joshua Isom
# Please include the string: [perl #37951]
# in the subject line of all future correspondence about this issue.
# https://rt.perl.org/rt3/Ticket/Display.html?id=37951 >
For all the files in docs/ops, the permissions are set to 600. If
parrot's installed b
On Dec 15, 2005, at 2:19, Darren Duncan wrote:
* a Tuple is an associative array having one or more Attributes,
and each Attribute has a name or ordinal position and it is typed
according to a Domain;
this is like a restricted Hash in a way, where each key has a
specific type
* a Relati
Matt Diephouse wrote:
$alias = undef
translates to
null $P1
$P2 = getinterp
$P2 = $P2["lexpad"; 1]
$P2['$alias'] = $P1
Given that you are using DynLexPad, you just do:
delete $P2['alias']
HTH
leo
Matt Diephouse wrote:
> So what am I supposed to do? It appears that using `null` to mark
> deleted/undefined variables won't work. But it's not clear to me that
> using a Null PMC is a good idea...
Here's one possibility: you can use one of the PObj_private PMC flags to
store the defined/undefin
On Dec 12, 2005, at 4:47 PM, Leopold Toetsch wrote:
Well, we dont't have a C-like static construct.
Today I remembered something I read about how pir handles pasm
registers, "PASM registers keep their register. During the usage of a
PASM register this register will be not get assigned
to."
Joshua Isom wrote:
On Dec 12, 2005, at 4:47 PM, Leopold Toetsch wrote:
Well, we dont't have a C-like static construct.
Today I remembered something I read about how pir handles pasm
registers, "PASM registers keep their register.
Yes, but not across function calls. I've a version here t
Leopold Toetsch <[EMAIL PROTECTED]> wrote:
> Matt Diephouse wrote:
>
> > $alias = undef
> >
> > translates to
> >
> > null $P1
> > $P2 = getinterp
> > $P2 = $P2["lexpad"; 1]
> > $P2['$alias'] = $P1
>
> Given that you are using DynLexPad, you just do:
>
>delete $P2['alias']
If only it
Hi,
S05 describes an array version of trans for transliteration:
( http://dev.perl.org/perl6/doc/design/syn/S05.html#Transliteration )
The array version can map one-or-more characters to one-or-more characters:
$str.=trans( [' ', '<','>','&'] =>
[' ',
Darren Duncan schreef:
> If you take ...
>
> +-+-+
> |a|x|
> |a|y|
> |a|z|
> |b|x|
> |c|y|
> +-+-+
>
> ... and divide it by ...
>
> +-+
> |x|
> |z|
> +-+
>
> ... the result is ...
>
> +-+
> |a|
> +-+
>
> I'm not sure if Divide has an equivalent in SQL.
A verbose way t
Darren Duncan wrote:
As an addendum to what I said before ...
...
I would want the set operations for tuples to be like that, but the
example code that Luke and I expressed already, with maps and greps etc,
seems to smack too much of telling Perl how to do the job.
I don't want to have to us
On Wednesday 14 December 2005 12:09, Alberto Simoes wrote:
> Basically, count tests, count tests ok, give rate. Useful if you want to
> run smoke and look to the output just at the end.
Thanks, applied with sprintf() tweaks as #10538.
Perhaps the maintainer of Test::TAP::Model should look at t
[snip entire conversation so far]
(Please bear with me - I'm going to go in random directions.)
Someone please correct me if I'm wrong, but it seems that there's only
a few things missing in P6:
1) An elegant way of creating a tuple-type (the "table", so to speak)
2) A way of providing co
I'm puzzled. I have a number of tests in a distribution. The test
reside in the /t subdirectory. When I run those test from a command
line, thusly:
prove t/*.t
All tests pass just fine. No errors of any kind are spit out. I'm
still working on the tests and they all currently use Test::Mo
On 12/15/05, Brad Bowman <[EMAIL PROTECTED]> wrote:
> Why does the longest input sequence win?
>Is it for some consistency that that I'm not seeing? Some exceedingly
> common use case? The rule seems unnecessarily restrictive.
Hmm. Good point. You see, the longest token wins because that's
Ruud H.G. van Tol schreef:
> [RD-interface]
See also these Haskell Hierarchical Libraries (base package)
http://www.haskell.org/ghc/docs/latest/html/libraries/base/Data-Set.html
http://www.haskell.org/ghc/docs/latest/html/libraries/base/Data-Map.html
--
Affijn, Ruud
"Gewoon is een tijger."
On Thu, Dec 15, 2005 at 06:50:19PM +0100, Brad Bowman wrote:
:
: Hi,
:
: S05 describes an array version of trans for transliteration:
: ( http://dev.perl.org/perl6/doc/design/syn/S05.html#Transliteration )
:
: The array version can map one-or-more characters to one-or-more
: characters:
:
The mandelbrot benchmark looked like it'd be an easy one to implement,
and lo and behold, it was! I haven't optimized this at all really, but
it seems to run fairly quickly anyhow.
-- Peter Baylies
=head1 NAME
examples/shootout/mandelbrot.pir - Print the Mandelbrot set
=head1 SYNOPSIS
% ./
This one is really trivial, but I'm not complaining.
=head1 NAME
examples/shootout/harmonic.pir - Partial sum of Harmonic series
=head1 SYNOPSIS
% ./parrot examples/shootout/harmonic.pir 1000
=head1 DESCRIPTION
Translated from C code by Greg Buchholz into PIR
by Peter Baylies <[EMAIL P
On Thu, Dec 15, 2005 at 09:56:09PM +, Luke Palmer wrote:
> On 12/15/05, Brad Bowman <[EMAIL PROTECTED]> wrote:
> > Why does the longest input sequence win?
> >Is it for some consistency that that I'm not seeing? Some exceedingly
> > common use case? The rule seems unnecessarily restrictive
I just finished three more shoot outs. Two are rather simple, a
floating point version of ack, and another that reads from stdin and
adds together the numbers on the lines. The third, is regex-dna. It
cheats a little, since as far as I know PGE doesn't have any regex
based substitutions even
I noticed a slight glitch with the regex-dna benchmark. The benchmark
spec says to account for case insensitivity. So I added the :i
modifier to the patterns and just stuck to the p6 rules. But using the
:i modifier makes it take over three times as long. Although for the
example and the fu
On Thu, Dec 15, 2005 at 11:15:20PM -0600, Joshua Isom wrote:
> I noticed a slight glitch with the regex-dna benchmark. The benchmark
> spec says to account for case insensitivity. So I added the :i
> modifier to the patterns and just stuck to the p6 rules. But using the
> :i modifier makes it
I've fixed a few of the japhs, 3-7. I didn't leave japh7.pasm
obfuscated any more than a japh should be.
japh3.pasm
Description: Binary data
japh4.pasm
Description: Binary data
japh5.pasm
Description: Binary data
japh6.pasm
Description: Binary data
japh7.pasm
Description: Binary
26 matches
Mail list logo
