Hi y'all,
I signed up for this mailing list a few days ago with interest in
participating in
the Phalanx Project. I'm a part of SanDiego.pm and sent an e-mail yesterday to
see if anyone else in San Diego wants to also help out. Anyway, I'm using
the ContactTheAuthor template (from the kwiki) to
Lacking committer privileges, I'd like to discuss patches first. I'll
only start coding anything after I received at least one +1 from a
committer. After that I would submit a patch and wait for it to be
applied or rejected. That way I hope to avoid warnocked patches.
t/pmc/env.t is failing on
On Dec 16, 2005, at 4:58, Joshua Isom wrote:
I just finished three more shoot outs. Two are rather simple, a
floating point version of ack,
Great, thanks. A comment wrt takfp:
ubstitution. Anyway, the floating point takfp is slow, 364 seconds
for me, which makes it really really slow. Th
On Dec 16, 2005, at 6:15, Joshua Isom wrote:
I noticed a slight glitch with the regex-dna benchmark.
There is still a glitch in the PIR:
* use regex substitution to remove FASTA sequence descriptions and all
linefeed characters
Thanks,
leo
John Macdonald:
> [trans]
> If a shorter rule is allowed to match first, then the longer
> rule can be removed from the match set, at least for constant
> string matches.
It is not about the length of the rules, but about the length of the
matches.
If both \s+ and \h+ match the same length, shou
peter baylies wrote:
This one is really trivial, but I'm not complaining.
Thanks, applied as well as mandelbrot.pir (I've stripped C code - it's
refed anyway)
r10552
leo
Joshua Isom wrote:
I've fixed a few of the japhs, 3-7. I didn't leave japh7.pasm
obfuscated any more than a japh should be.
Thanks, applied - r10553
leo
Joshua Isom wrote:
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.
ci'ed takfp and sumcol - r10554
Thanks,
leo
On 15/12/05 23:35, Larry Wall wrote:
On Thu, Dec 15, 2005 at 06:50:19PM +0100, Brad Bowman wrote:
: The "first in order" rule is more flexible, the user can sort their
: arrays to produce the longest input rule, or use another order if that is
: preferred.
What possible use is a user-ordered rul
# New Ticket Created by jerry gay
# Please include the string: [perl #37956]
# in the subject line of all future correspondence about this issue.
# https://rt.perl.org/rt3/Ticket/Display.html?id=37956 >
it seems a grep for 'cvs' returns a number of references in the parrot
source. we haven't
# New Ticket Created by Will Coleda
# Please include the string: [perl #37957]
# in the subject line of all future correspondence about this issue.
# https://rt.perl.org/rt3/Ticket/Display.html?id=37957 >
Tcl 8.5 (at least) has a new {expand} keyword, adding another rule to
tcl parsing.
ht
What is correct:
new P0, .PerlString
set P0, "1E5"
set I0, P0# 1 or 100_000
new P0, .String
set P0, "1E5"
set I0, P0# 1 or 100_000
leo, who would say 100_000 and 1 respectively.
Leopold Toetsch wrote:
Joshua Isom wrote:
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.
ci'ed takfp and sumcol - r10554
sumcol is +twice the speed now (r10555).
On Fri, Dec 16, 2005 at 12:11:45AM -0800, David Romano ([EMAIL PROTECTED])
wrote:
> progress: how
> do I get a perl.org subversion account? Is that after the module
> author accepts the proposal?
I can set you up with the svn.perl.org access. You need an account on
perl.org, and then you'll tel
I would say 10 in both.
Leopold Toetsch wrote:
What is correct:
new P0, .PerlString
set P0, "1E5"
set I0, P0# 1 or 100_000
new P0, .String
set P0, "1E5"
set I0, P0# 1 or 100_000
leo, who would say 100_000 and 1 respectively.
--
Alberto Simões
Leopold Toetsch wrote:
>What is correct:
>
> new P0, .PerlString
> set P0, "1E5"
> set I0, P0# 1 or 100_000
100_000, please. But also note that for .PerlString, we ought to
also have (from S02):
"0x" # 65535
"0b100010001000" # 2184
"0o4210"
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Matt Diephouse wrote:
| 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
|
I agree with Leo and think this should be just 1, so that we
can say that .String doesn't do any special conversions (or
try to explain which conversions it does do).
Yeah, I think you are right.
--
Alberto Simões - Departamento de Informática - Universidade do Minho
Campus de G
Agreed.
On Dec 16, 2005, at 10:44 AM, Patrick R. Michaud wrote:
Leopold Toetsch wrote:
What is correct:
new P0, .PerlString
set P0, "1E5"
set I0, P0# 1 or 100_000
100_000, please. But also note that for .PerlString, we ought to
also have (from S02):
"0x"
On Fri, Dec 16, 2005 at 01:29:11PM +0100, Ruud H.G. van Tol wrote:
: John Macdonald:
:
: > [trans]
: > If a shorter rule is allowed to match first, then the longer
: > rule can be removed from the match set, at least for constant
: > string matches.
:
: It is not about the length of the rules, bu
On Fri, Dec 16, 2005 at 09:14:52AM -0800, Larry Wall wrote:
: It would be a useful exercise to write tr/// in terms of s///.
: It occurs to me that it'd be awfully useful to have a kind of hash
: that returns any unmatched key unchanged.
Actually, in this case it's handled by the fact that the nul
--- Rob Kinyon <[EMAIL PROTECTED]> wrote:
> As for the syntactic sugar, I'm not quite sure what should be
> done here. And, with macros, it's not clear that there needs
> to be an authoritative answer. Personally, I'd simply overload
> + for union, - for difference, * for cross-product, / for
> d
Larry Wall:
> Ruud H.G. van Tol:
>> John Macdonald:
>>> [trans]
>>> If a shorter rule is allowed to match first, then the longer
>>> rule can be removed from the match set, at least for constant
>>> string matches.
>>
>> It is not about the length of the rules, but about the length of the
>> match
This is only about transliteration (tr///), not rules in general.
So you are only matching a fixing set of strings at a certain position.
If one string is the prefix of another, the longer is preferred.
If there are two identical match strings, the replacement corresponding
to the first is used.
On Tue, Dec 13, 2005 at 12:42:47PM +0200, Gaal Yahas wrote:
: S11 stipulates:
:
: * modules can decorate exports with tagsets
:
: * module users are the ones who control which imports are allowed,
: and what scoping to give each import. The default is always lexical.
:
: There are a few pieces
On Dec 16, 2005, at 15:54, Audrey Tang (autrijus) wrote:
On a somewhat related note, I'd very much like the ability for two
LexInfo names to point to the same underlying register, as it would
make
certain Perl6isms easier ($!foo vs $foo, for example).
Leo explained on #parrot a while ago tha
On 12/16/05, Ovid <[EMAIL PROTECTED]> wrote:
> --- Rob Kinyon <[EMAIL PROTECTED]> wrote:
>
> > As for the syntactic sugar, I'm not quite sure what should be
> > done here. And, with macros, it's not clear that there needs
> > to be an authoritative answer. Personally, I'd simply overload
> > + for
I agree with just about everything you wrote. I only have two minor
quibbles and they may merely be restatements of what you meant.
--- Rob Kinyon <[EMAIL PROTECTED]> wrote:
> Overriding the operators in a generic way so that you have
> to have an exact type match before you compare values also,
On 12/16/05, Ovid <[EMAIL PROTECTED]> wrote:
> Minor nit: we're discussing to the relational algebra and not the
> relational Calculus (unless the topic changed and I wasn't paying
> attention. I wouldn't be surprised :)
Algebra, in general, is a specific form of calculus. So, we're
speaking of
Something else I've been thinking about, as a tangent to the
relational data models discussion, concerns Perl's concept of
"undef", which I see as being fully equivalent to the relational
model's concept of "null".
The root question of the matter is, what does "undef" mean to you?
To me, it m
# New Ticket Created by Joshua Isom
# Please include the string: [perl #37965]
# in the subject line of all future correspondence about this issue.
# https://rt.perl.org/rt3/Ticket/Display.html?id=37965 >
Is PGE's ^^ broken? From the results I'm getting, ^^ is being treated
like ^, so only
On Fri, Dec 16, 2005 at 04:08:27PM -0800, Joshua Isom wrote:
> # New Ticket Created by Joshua Isom
> # Please include the string: [perl #37965]
> # in the subject line of all future correspondence about this issue.
> # https://rt.perl.org/rt3/Ticket/Display.html?id=37965 >
>
>
> Is PGE's ^^ b
I just retried it and it seems to be my mistake, not escaping the
backslashes...
On Dec 16, 2005, at 10:00 PM, Patrick R. Michaud via RT wrote:
On Fri, Dec 16, 2005 at 04:08:27PM -0800, Joshua Isom wrote:
# New Ticket Created by Joshua Isom
# Please include the string: [perl #37965]
# in th
Hi,
Overloading undef would be cool. This way Joe Coder can make it act
however he'd like when it's not used in the various contexts or
operations -- string, math, smart ... Basically a pragma (or
something) would define the behavior of all undefs declared within the
given scope. Since each undef
Please scratch that first parahgraph because it's incoherrent and I'm crazy:
Overloading undef would be cool. This way Joe Coder can make it act
however he'd like when it's not used in the various contexts or
operations -- string, math, smart ... Basically we would subclass (something) to
to defi
I do tend to use the latest revision, rarely more than a day old. I've
made up a quick script to make parrot, mainly because I have gmp and
gdbm installed by fink. I have --optimized enabled now. I'm primarily
using and 800Mhz PPC, 512k cache. I rarely get any difference in
speeds between -
On 12/16/05, Darren Duncan <[EMAIL PROTECTED]> wrote:
> Something else I've been thinking about, as a tangent to the
> relational data models discussion, concerns Perl's concept of
> "undef", which I see as being fully equivalent to the relational
> model's concept of "null".
The relational model
On Fri, Dec 16, 2005 at 10:56:21PM -0600, Joshua Isom wrote:
> Anyway, I've got it working uses all the regexes. I stuck to the p6
> rules, and kept the hash to print out the regex they want to see. It's
> been running now for an hour now and it hasn't even reached the main
> matching yet for
On Friday 16 December 2005 18:15, Darren Duncan wrote:
> Therefore, I propose that the default behaviour of Perl 6 be changed
> or maintained such that:
>
> 0. An undefined value should never magically change into a defined
> value, at least by default.
This is fairly well at odds with the princi
At 11:57 PM -0500 12/16/05, Rob Kinyon wrote:
How many different undefs are there?
That depends on what exactly you are asking.
1. An undef is what you have when a container contains no explicit
value (or junction/etc thereof).
A variable whose value is undefined is still a typed container;
At 10:07 PM -0800 12/16/05, chromatic wrote:
On Friday 16 December 2005 18:15, Darren Duncan wrote:
> 0. An undefined value should never magically change into a defined
value, at least by default.
This is fairly well at odds with the principle that users shouldn't have to
bear the burden of
On Dec 17, 2005, at 1:08, Joshua Isom (via RT) wrote:
The pattern I'm using is "^^\\N*$$|\\n". This is with
r10555.
Above is better written as:
'^^\N*$$|\n'
It takes the backslashes as is, doesn't need an extra string_unescape
call and is more readable (some whitespace
42 matches
Mail list logo
