On Wed, Jun 24, 2009 at 11:10:39AM -0700, Jon Lang wrote:
> On Wed, Jun 24, 2009 at 10:35 AM, John Macdonald wrote:
> > On Tue, Jun 23, 2009 at 07:51:45AM +1000, Damian Conway wrote:
> >> Perl 6's approach to xor is consistent with the linguistic sense of
> >> &#x
On Wed, Jun 24, 2009 at 01:35:25PM -0400, John Macdonald wrote:
> On Tue, Jun 23, 2009 at 07:51:45AM +1000, Damian Conway wrote:
> > Perl 6's approach to xor is consistent with the linguistic sense of
> > 'xor' ("You may have a soup (x)or a salad (x)or a cocktai
On Tue, Jun 23, 2009 at 07:51:45AM +1000, Damian Conway wrote:
> Perl 6's approach to xor is consistent with the linguistic sense of
> 'xor' ("You may have a soup (x)or a salad (x)or a cocktail"), [ ... ]
That choice tends to mean "exactly one", rather than "the first one
the waiter hears". (A go
On Mon, Jun 22, 2009 at 04:59:07PM +0900, hojung yoon wrote:
> from S03:
> http://perlcabal.org/syn/S03.html#Conditional_operator_precedence
>
> : It is a syntax error to use an operator in the middle part that binds
> looser in precedence, such as =.
>
> : my $x;
> : hmm() ?? $x = 1 !! $
On Fri, May 29, 2009 at 07:26:11PM +0200, Daniel Carrera wrote:
> Btw, if the majority wants to start uploading Ruby, Python and Lua
> modules to CPAN, we can rename CPAN so that the P stands for something
> else that doesn't mean anything. "Comprehensive Peacock Archive
> Network"? "Comprehe
On Fri, May 29, 2009 at 04:23:56PM +0200, Mark Overmeer wrote:
> What's in a name.
> Is it also
> CPAN is the Comprehensive Parrot Archive Network
> CPAN is the Comprehensive Pieton Archive Network
> CPAN is the Comprehensive Pony Archive Network
> CPAN is the Comprehensive PHPArchive
On Thu, May 28, 2009 at 08:10:41PM -0500, John M. Dlugosz wrote:
> John Macdonald john-at-perlwolf.com |Perl 6| wrote:
>> However, the assumption fails if "process" is supposed to mean that
>> everyone is capable of generating Unicode in the messages that they
>> a
On Thu, May 28, 2009 at 09:30:25AM -0700, Larry Wall wrote:
> On Thu, May 28, 2009 at 10:51:33AM -0400, John Macdonald wrote:
> : Yes. The full expression in raw APL for n! is:
> :
> : */n
> :
> : (where is the Greek letter iota - n is Perl's 1..$n).
>
> Only if
On Wed, May 27, 2009 at 05:42:58PM -0500, John M. Dlugosz wrote:
> Mark J. Reed markjreed-at-gmail.com |Perl 6| wrote:
>> On Wed, May 27, 2009 at 6:05 PM, John M. Dlugosz
>> <2nb81l...@sneakemail.com> wrote:
>>
>>> And APL calls it "|¨" (two little dots high up)
>>>
>>
>> Mr. MacDonald just
On Wed, May 27, 2009 at 02:21:40PM -0400, Mark J. Reed wrote:
> On Wed, May 27, 2009 at 1:59 PM, Daniel Carrera <
> daniel.carr...@theingots.org> wrote:
> > Wow... That's a foldl! In a functional language, that would be called a
> > fold.
>
> In Haskell it may be called fold (well, foldl and foldr
On Tue, May 26, 2009 at 04:38:21PM -0700, yary wrote:
> perl4-perl5.8 or so had a variable that let you change the starting
> index for arrays, so you could actually make the above work. But then
> everyone who'd re-arranged their brains to start counting at 0, and
> written code that has a startin
On Tue, Apr 14, 2009 at 05:17:08AM -0700, Will Coleda via RT wrote:
> On Tue Apr 14 01:44:39 2009, samm...@gmail.com wrote:
> > Hi,
> >
> > I think this line is wrong:
> > line 47: system(qw(svn checkout -r), $required , qw(
> > https://svn.parrot.org/parrot/trunk parrot));
> >
> > all qw shoul
On Wed, Apr 01, 2009 at 09:44:43AM -0400, Mark J. Reed wrote:
> The idea is that junctions should usually be invisible to the code,
> and autothreading handles them behind the scenes. [ ... ]
If I understand correctly, (which is by no means assured) a function
call with a junction as an argument
On Sat, Mar 28, 2009 at 10:39:01AM -0300, Daniel Ruoso wrote:
> That happens because $pa and $pb are a singular value, and that's how
> junctions work... The blackjack program is an example for sets, not
> junctions.
>
> Now, what are junctions good for? They're good for situation where it's
> col
On Tue, Mar 24, 2009 at 09:49:42AM -0700, Jon Lang wrote:
> 2009/3/24 Larry Wall :
> > http://www.wall.org/~larry/camelia.pdf
>
> Cute. I do like the hyper-operated smiley-face.
>
> What I'd really like to see, though, is a logo that speaks to Perl's
> linguistic roots. That, more than anything
On Tue, Mar 24, 2009 at 11:56:46AM -0400, Guy Hulbert wrote:
> On Tue, 2009-24-03 at 08:42 -0700, Paul Hodges wrote:
> > --- On Tue, 3/24/09, John Macdonald wrote:
> >
> > > The graphene logo inspires me to suggest that a carbon
> > > ring be used as the log
On Tue, Mar 24, 2009 at 09:17:15AM -0400, Mark J. Reed wrote:
> Are we seeking a logo for Perl 6 in general or Rakudo in particular?
> It seems like the latter should be derived from the former, perhaps
> with the Parrot logo mixed in.
The graphene logo inspires me to suggest that a carbon
ring be
On Thu, Dec 04, 2008 at 04:40:32PM +0100, Aristotle Pagaltzis wrote:
> * [EMAIL PROTECTED] <[EMAIL PROTECTED]> [2008-12-03 21:45]:
> > loop {
> > doSomething();
> > next if someCondition();
> > doSomethingElse();
> > }
>
> I specifically said that I was aware of this solution and that I
>
On Fri, Nov 14, 2008 at 01:50:59PM -0500, Brandon S. Allbery KF8NH wrote:
> WHat *is* the outermost scope in that case? When is code in that scope
> executed? I could see this as being a hack to allow a module to be used
> either directly as a main, or "use"d; the former ignoring top level scop
On Fri, Feb 15, 2008 at 03:12:20PM -0800, Larry Wall wrote:
> No, there's no problem with that. This is Perl 6, which is full of
> wonderfulness, not Perl 5, which was written by a person of minimal clue. :)
>
> That's part of what S02 means right at the top where it's talking
> about a one-pass
On Mon, Jun 11, 2007 at 01:43:40AM -, NeonGraal wrote:
> Surely if you defined !! to return "undef but true" and both operators
> to be left associative then it all works.
>
> 1==0 ?? "True" !! "False" -> (undef) !! "False" which seems right to
> me.
>
> 1==1 !! "False" ?? "True" -> (undef
On Fri, Jun 01, 2007 at 07:07:06AM -0400, Brandon S. Allbery KF8NH wrote:
>
> On Jun 1, 2007, at 5:44 , Thomas Wittek wrote:
>
> >Larry Wall:
> >>Nope. Hash is mostly about meaning, and very little about
> >>implementation.
> >>Please don't assume that I name things according to Standard Names
On Tue, May 15, 2007 at 02:02:06AM +0200, Thomas Wittek wrote:
> John Macdonald schrieb:
> > It's also, in many cases,
> > harder to edit - that's why a trailing comma in a list that
> > is surrounded by parens, or a trailing semicolon in a block
> > surr
On Tue, May 15, 2007 at 01:22:48AM +0200, Thomas Wittek wrote:
> Andrew Shitov:
> > If the line of code is not ended with ';' the parser tries first
> > to assume [..]
>
> Wouldn't that be unambigous?
>
> foo = 23
> bar = \
>42
>
> ?
>
> I think there would be no ambiguities and you o
On Mon, May 14, 2007 at 02:36:10PM +0200, Thomas Wittek wrote:
> Andy Armstrong schrieb:
> >On 14 May 2007, at 12:31, Thomas Wittek wrote:
> >>How did C, C#, Java, Ruby, Python, Lua, JavaScript, Visual Basic, etc.
> >>know?
> >>They didn't.
> >>If there is a new release, you always have to check i
On Fri, Apr 27, 2007 at 08:46:04AM -0700, [EMAIL PROTECTED] wrote:
> +The matches are guaranteed to be returned in left-to-right order with
> +respect to the starting positions. The order within each starting
> +position is not guaranteed and may depend on the nature of both the
> +pattern and the
On Tue, Apr 17, 2007 at 11:22:39AM -0700, [EMAIL PROTECTED] wrote:
> Note that unless no longer allows an else
I'm sorry to see this.
This is one item from PBP that I don't really agree with.
Personally, I find I am at least as likely to make mistakes
about the double negative in "if (!cond) ...
On Fri, Apr 13, 2007 at 08:14:42PM -0700, Geoffrey Broadwell wrote:
> [...] -- so non-dwimmy open
> variants are a good idea to keep around.
>
> This could be as simple as 'open(:!dwim)' I guess, or whatever the
> negated boolean adverb syntax is these days
open(:file), open(:dir), open(:url
On Fri, Apr 13, 2007 at 10:29:43AM +0100, Moritz Lenz wrote:
> Hi,
>
> brian d foy wrote:
> > At the moment the file test operators that I expect to return true or
> > false do, but the true is the filename.
>
> that helps chaining of file test:
>
> $fn ~~ :t ~~ :x
> or something.
> If you want
On Fri, Mar 16, 2007 at 05:29:21PM -0700, Larry Wall wrote:
> On Thu, Mar 15, 2007 at 05:14:01PM -0400, Zev Benjamin wrote:
> : If the idea of having an author attribute is to allow multiple
> : implementations of a module, why not add an API version attribute? The
> : idea would be to detach the
On Tue, Feb 27, 2007 at 06:31:31PM +, Smylers wrote:
> Geoffrey Broadwell writes:
>
> > Perhaps having both +> and ?> operators? Since "coerce to boolean and
> > then right shift" is meaningless, ...
>
> It's useless, rather than meaningless; you've neatly defined what the
> meaning of that
On Sat, Jan 27, 2007 at 06:18:50PM +, Nicholas Clark wrote:
> Is it defined that $a + $b evaluates the arguments in any particular order?
> Even guaranteeing that either the left or the right gets completely evaluated
> first would be better than C :-)
In C, that is deliberately left undefined
On Wed, Sep 20, 2006 at 07:11:42PM +0100, Andy Armstrong wrote:
> On 20 Sep 2006, at 19:05, Larry Wall wrote:
> >Let it be. :)
>
> I could just as easily have called for a revolution :)
No, you should have quoted differently:
> On 20 Sep 2006, at 19:05, Larry Wall whispered words of wisdom:
> >
On Tue, Sep 19, 2006 at 07:56:44PM -0400, [EMAIL PROTECTED] wrote:
> I envision a select, reject, and partition, where
>
> @a.partition($foo)
>
> Returns the logical equivalent of
>
> [EMAIL PROTECTED]($foo), @a.select($foo)]
>
> But only executes $foo once per item. In fact. I'd expect partit
On Tue, Sep 19, 2006 at 04:39:35PM -0700, Jonathan Lang wrote:
> >Anyway, it's not clear to me that grep always has an exact opposite.
>
> I don't see why it ever wouldn't: you test each item in the list, and
> the item either passes or fails. 'select' would filter out the items
> that fail the t
On Wed, Aug 23, 2006 at 04:10:32PM -0700, Larry Wall wrote:
> Yes, that should work eventually, given that hypers are supposed to stop
> after the longest *finite* sequence. In theory you could even say
>
> my %trans = ('a'..*) »=>« ('?' xx *);
>
> but we haven't tried to define what the sem
On Thu, Apr 06, 2006 at 02:49:33PM -0500, Patrick R. Michaud wrote:
> On Thu, Apr 06, 2006 at 03:38:59PM -0400, John Macdonald wrote:
> > On Thu, Apr 06, 2006 at 12:10:18PM -0700, Larry Wall wrote:
> > > The current consensus on #perl6 is that, in postfix position only (that
On Thu, Apr 06, 2006 at 12:10:18PM -0700, Larry Wall wrote:
> The current consensus on #perl6 is that, in postfix position only (that
> is, with no leading whitespace), m:p/\.+ \s / lets you embed
> arbitrary whitespace, comments, pod, etc, within the postfix operator.
>
> This allows both the sho
On Wed, Dec 21, 2005 at 10:25:09AM -0800, Randal L. Schwartz wrote:
> > "Uri" == Uri Guttman <[EMAIL PROTECTED]> writes:
>
> Uri> i will let damian handle this one (if he sees it). but an idea would be
> Uri> to allow some form ofkey extraction via a closure with lazy evaluation
> Uri> of the
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
On Tue, Nov 15, 2005 at 11:23:49AM -0800, Larry Wall wrote:
> On Tue, Nov 15, 2005 at 02:11:03PM -0500, Aaron Sherman wrote:
> : All of that is fine, as far as I'm concerned, as long as we give the
> : user the proviso that chained buts might be optimized down into a single
> : cloning operation or
On Mon, Oct 24, 2005 at 02:47:58PM +0100, Alberto Manuel Brandão Simões wrote:
> Another is because it will take too long to port all CPAN modules to
> Perl 6 (for this I suggest a Porters force-task to interact with current
> CPAN module owners and help and/or port their modules).
I think Autri
On Fri, Oct 21, 2005 at 09:35:12AM -0400, Rob Kinyon wrote:
> On 10/21/05, Steve Peters <[EMAIL PROTECTED]> wrote:
> > On Fri, Oct 21, 2005 at 02:37:09PM +0200, Juerd wrote:
> > > Steve Peters skribis 2005-10-21 6:07 (-0500):
> > > > Older versions of Eclipse are not able to enter these characters
On Thu, Oct 13, 2005 at 03:01:29PM -0400, Rob Kinyon wrote:
> > I think this is an opportune time for me to express that I think the
> > ability to close-source a module is important. I love open source,
> > and I couldn't imagine writing anything by myself that I wouldn't
> > share. But in order
On Sat, Oct 01, 2005 at 02:22:01PM -0600, Luke Palmer wrote:
> And the more general form was:
>
> $sum = reduce { $^a + $^b } @items;
>
> Yes, it is called reduce, because "foldl" is a miserable name.
So, the target of running a loop with both the current
and previous elements accessible cou
On Fri, Sep 30, 2005 at 08:39:58PM -0600, Luke Palmer wrote:
> Incidentally, the undef problem just vanishes here (being replaced by
> another problem).
Which reminds me that this same issue came up a while ago in a
different guise. There was a long discussion about the reduce
functionality that
On Tue, Sep 20, 2005 at 08:58:41PM +0200, Juerd wrote:
> Yuval Kogman skribis 2005-09-20 20:33 (+0300):
> > Today on #perl6 I complained about the fact that this is always
> > inelegant:
> > if ($condition) { pre }
> > unconditional midsection;
> > if ($condition) { post }
>
> I believ
On Wed, Aug 24, 2005 at 10:12:39AM -0700, Chip Salzenberg wrote:
> On Wed, Aug 24, 2005 at 08:38:39AM -0400, John Macdonald wrote:
> > When calling a function, I would like to be able to have a
> > mixture of named and positional arguments. The named argument
> > acts as a
On Wed, Aug 24, 2005 at 04:27:03PM +1000, Damian Conway wrote:
> Larry wrote:
>
> >Plus I still think it's a really bad idea to allow intermixing of
> >positionals and named. We could allow named at the beginning or end
> >but still keep a constraint that all positionals must occur together
> >in
On Mon, Jun 20, 2005 at 04:37:31PM -0600, Luke Palmer wrote:
> On 6/20/05, chromatic <[EMAIL PROTECTED]> wrote:
> > On Mon, 2005-06-20 at 12:11 +0200, Juerd wrote:
> >
> > > I think there exists an even simpler way to avoid any mess involved.
> > > Instead of letting AUTOLOAD receive and pass on a
On Thu, Jun 09, 2005 at 06:41:55PM +0200, "TSa (Thomas Sandlaß)" wrote:
> Edward Cherlin wrote:
> >That means that we have to straighten out the functions that can
> >return either a Boolean or an item of the argument type.
> >Comparison functions < > <= >= = != should return only Booleans,
>
>
On Tue, May 24, 2005 at 12:12:57PM +0200, Juerd wrote:
> Unfortunately, onion is already taken by another important Perl server:
> onion.perl.org.
>
> I'm currently considering 'ui', which is Dutch for 'onion'. I bet almost
> nobody here knows how to pronounce ui ;)
For a development machine, the
On Fri, May 20, 2005 at 10:14:26PM +, [EMAIL PROTECTED] wrote:
>
> > Mark A. Biggar wrote:
> > > Well the identity of % is +inf (also right side only).
> >
> > I read $n % any( $n..Inf ) == $n. The point is there's no
> > unique right identity and thus (Num,%) disqualifies for a
> > Monoid. B
On Fri, May 20, 2005 at 06:09:55AM -0700, Randal L. Schwartz wrote:
> > "Mark" == Mark A Biggar <[EMAIL PROTECTED]> writes:
>
> Mark> The usual definition of reduce in most languages that support it, is
> Mark> that reduce over the empty list produces the Identity value for the
> Mark> operati
On May 4, 2005 06:22 pm, Rod Adams wrote:
> John Macdonald wrote:
>
> >On Wed, May 04, 2005 at 03:02:41PM -0500, Rod Adams wrote:
> >
> >
> >>If there are good uses for coroutines that given/take does not address,
> >>I'll gladly change my opini
On Wed, May 04, 2005 at 03:02:41PM -0500, Rod Adams wrote:
> John Macdonald wrote:
>
> >The most common (and what people sometimes believe the
> >*only* usage) is as a generator - a coroutime which creates a
> >sequence of values as its "chunk" and always return
On Wed, May 04, 2005 at 10:43:22AM -0400, Aaron Sherman wrote:
> On Wed, 2005-05-04 at 10:07, Aaron Sherman wrote:
> > On Wed, 2005-05-04 at 09:47, Joshua Gatcomb wrote:
> >
> > > So without asking for S17 in its entirety to be written, is it
> > > possible to get a synopsis of how p6 will do coro
On Saturday 23 April 2005 14:19, Juerd wrote:
> Mark A. Biggar skribis 2005-04-23 10:55 (-0700):
> > After some further thought (and a phone talk with Larry), I now think
> > that all of these counted-level solutions (even my proposal of _2.foo(),
> > etc.) are a bad idea.
>
> In that case, why ev
On Thu, Apr 21, 2005 at 02:28:52PM +0100, Matthew Walton wrote:
> > On Thu, Apr 21, 2005 at 11:45:27AM +0200, Paul Johnson wrote:
>
> > It certainly makes more sense to me that the answer would be 2 2. But
> > however it ends up, so long as we know what the answer will be, we can
> > utilize it e
On Saturday 16 April 2005 01:53, Michael G Schwern wrote:
> How cwd() is implemented is not so important as what happens when it hits
> an edge case. So maybe we can try to come up with a best fit cwd(). I'd
> start by listing out the edge cases and what the possible behaviors are.
> Maybe we
On Tuesday 12 April 2005 23:46, Patrick R. Michaud wrote:
> On Tue, Apr 12, 2005 at 11:13:18PM -0400, John Macdonald wrote:
> > On Tuesday 12 April 2005 22:36, Patrick R. Michaud wrote:
> > > It's entirely possible that I have my mathematics messed up here,
> > >
On Tuesday 12 April 2005 22:36, Patrick R. Michaud wrote:
> On Tue, Apr 12, 2005 at 09:15:13PM -0400, John Macdonald wrote:
> > On Tuesday 12 April 2005 20:45, Darren Duncan wrote:
> > > At 8:27 PM -0400 4/12/05, John Macdonald wrote:
> > > >The mathematical definiti
On Tuesday 12 April 2005 20:45, Darren Duncan wrote:
> At 8:27 PM -0400 4/12/05, John Macdonald wrote:
> >The mathematical definition of xor for two arguments is "true if
> >exactly one argument is true, false otherwise".
>
> Yes.
>
> >When that gets
>
On Tuesday 12 April 2005 19:18, Andrew Savige wrote:
> It does. At least according to "Perl 6 and Parrot Essentials" book,
> page 36 it does (I couldn't find details on xor operator in S03).
> I added some xor tests which Autrijus fixed. I'm worried now that
> my tests may be wrong. On page 36 it s
Could anyone who is wanting to come to the pugs hackathon
before the Toronto YAPC::NA please contact me.
There is limited space, so if too many people want to come,
some will be disappointed. That will affect how you want to
book your travel arrangements to Toronto (unless you're willing
to take
On Wed, Apr 06, 2005 at 11:30:35AM -0700, Larry Wall wrote:
> If you want to help, earn a billion dollars and write me into your
> will. And then peg out. Nothing personal. :-)
>
> Larry
Darn. So far, I'm, 0 for 3 on that plan.
However, I promise that item two will follow very shortly in
tim
I've just had an IRC discussion with Autrijus, and we've put together
the following plan for the pugs hack-a-thon, to occur for 4 days
immediately preceeding the Toronto YAPC::NA conference.
The venue will be at my cottage, about 1 1/2 hour drive from Toronto.
Autrijus will be arriving in Toronto
On Mon, Mar 21, 2005 at 03:31:53PM +0100, Juerd wrote:
> [...] (The symmetry is slightly broken, though, because if you push
> "foo" once, you have to pop three times to get it back. I don't think
> this is a problem.))
That's not a new break to the symmetry of push and pop:
@b = (1,2,3);
On Fri, Mar 18, 2005 at 09:24:43AM -0800, Larry Wall wrote:
> [...] And if
> chomp is chomping and returning the terminator as determined by the
> line input layer, then chimp would have to return the actual line and
> leave just the terminator. :-)
With the mnemonic "Don't monkey around with my
On Thu, Mar 17, 2005 at 09:18:45PM -0800, Larry Wall wrote:
> On Thu, Mar 17, 2005 at 06:11:09PM -0500, Aaron Sherman wrote:
> : Chop removes the last character from a string. Is that no longer useful,
> : or has chomp simply replaced its most common usage?
>
> I expect chop still has its uses.
I
On Wednesday 16 March 2005 15:40, Autrijus Tang wrote:
> On Wed, Mar 16, 2005 at 12:09:40PM -0800, Larry Wall wrote:
> > So I'm thinking we'll just go back to "true", both for that reason,
> > and because it does syntactically block the naughty meaning of true as
> > a term (as long as we don't def
On Thu, Feb 17, 2005 at 09:06:47AM -0800, Larry Wall wrote:
> Junctions can short circuit when they feel like it, and might in some
> cases do a better job of picking the evaluation order than a human.
Hmm, yes, there is an interesting interaction with lazy
evaluation ranges here.
$x = any( 1
On Wed, Feb 09, 2005 at 11:57:17AM -0800, Ovid wrote:
> --- Matt Fowles <[EMAIL PROTECTED]> wrote:
>
> >Logic Programming in Perl 6
> > Ovid asked what logic programming in perl 6 would look like. No
> > answer
> > yet, but I suppose I can pick the low hanging fruit: as a
> > limiting
On Thu, Dec 09, 2004 at 11:18:34AM -0800, Larry Wall wrote:
> On Wed, Dec 08, 2004 at 08:24:20PM -0800, Ashley Winters wrote:
> : I'm still going to prefer using :=, simply as a good programming
> : practice. My mind sees a big difference between building a parse-tree
> : object and just grepping f
On Sat, Dec 04, 2004 at 11:08:38PM +0300, Alexey Trofimenko wrote:
> On Sat, 04 Dec 2004 11:03:03 -0600, Rod Adams <[EMAIL PROTECTED]> wrote:
>
> >Okay, this rant is more about the \s<\s than \s=\s. To me, it is easier
> >to understand the grouping of line 1 than line 2 below:
> >
> >if( $a<$b &
On Tue, Nov 30, 2004 at 05:54:45PM -0700, Luke Palmer wrote:
> Jim Cromie writes:
> >
> > since the qq:X family has recently come up, Id like to suggest another.
> >
> > qq:i {} is just like qq{} except that when it interpolates variables,
> > those which are undefined are preserved literally.
>
On Tue, Nov 30, 2004 at 02:26:06PM -0800, Brent 'Dax' Royal-Gordon wrote:
: Larry Wall <[EMAIL PROTECTED]> wrote:
: > * Since we already stole angles from iterators, «$fh» is not
: > how you make iterators iterate. Instead we use $fh.fetch (or
: > whatever) in scalar context, a
On Sun, Nov 28, 2004 at 12:24:08PM -0500, John Macdonald wrote:
> On Sat, Nov 27, 2004 at 08:21:06PM +0100, Juerd wrote:
> > James Mastros skribis 2004-11-27 11:36 (+0100):
> > > Much more clear, saves ` for other things
> >
> > I like the idea. But as a earl
On Sat, Nov 27, 2004 at 08:21:06PM +0100, Juerd wrote:
> James Mastros skribis 2004-11-27 11:36 (+0100):
> > Much more clear, saves ` for other things
>
> I like the idea. But as a earlier thread showed, people find backticks
> ugly. Strangely enough, only when used for something other than
> read
On Fri, Sep 17, 2004 at 10:46:36AM -0400, Jonadab the Unsightly One wrote:
> Juerd <[EMAIL PROTECTED]> writes:
>
> > Most worlds don't use file extensions, except for humans.
>
> You exaggerate their lack of importance. File extensions don't matter
> to most operating system *kernels*, but they
On Thu, Sep 09, 2004 at 03:09:47PM +0200, Michele Dondi wrote:
> On Thu, 2 Sep 2004, Larry Wall wrote:
>
> > And yes, an C can store only -1 or 0. I'm sure someone'll think of
> > a use for it...
>
> Probably OT, but I've needed something like that badly today: "working" on
> a japh that turned
On Fri, Sep 03, 2004 at 11:20:05AM -0700, Larry Wall wrote:
> On Fri, Sep 03, 2004 at 11:41:05AM +0100, Tim Bunce wrote:
> : And that a pointer would be... what? Some platforms has odd
> : sizing issues for pointers. Perhaps a "voidp" type is needed?
> : (Which would just be an intN where N is size
Hmm, this would suggest that in P6 the comment that "unlike ++,
the -- operator is not magical" should no longer apply.
On Fri, Sep 03, 2004 at 08:09:23AM -0400, Joe Gottman wrote:
>
>
> > -Original Message-
> > From: Larry Wall [mailto:[EMAIL PROTECTED]
> > Sent: Thursday, September 02,
On Wed, Aug 25, 2004 at 08:19:06PM +0100, The Perl 6 Summarizer wrote:
> A small task for the interested
> Dan posted another of his small tasks for the interested (maybe we
> should start calling them STFTIs?). This time he's after source tests to
> test the embedding interface and s
On Thu, Aug 19, 2004 at 12:31:42PM -0700, Larry Wall wrote:
> So let's rewrite the table (assuming that all the hash methods are just
> variants of .values), where N and D are non-destructing and destructive:
>
> next D next N all D all N
>
On Thu, Jun 24, 2004 at 08:23:39PM -0700, Paul Hodges wrote:
> --- Luke Palmer <[EMAIL PROTECTED]> wrote:
> So a null byte is still Boolean true.
> Ugh, yarf, ack, etc.
>
> But as long as I know -- easy enough to check explicitly.
>
> But just tell me thisam I the only guy who thinks this *fe
On Tue, May 18, 2004 at 11:14:30PM +0200, Stéphane Payrard wrote:
> I thought overloading the += operator
>
>%a += @a;
There's been lots of discussion of this, but:
> Probably that operator should be smart enough to be fed with
> a mixed list of array and hashes as well:
>
> %a += ( @a, %
On Wed, Apr 21, 2004 at 09:19:12PM +0200, Matthijs van Duin wrote:
> On Wed, Apr 21, 2004 at 01:02:15PM -0600, Luke Palmer wrote:
> > macro infix:\ ($cont, $key)
> > is parsed(/$?key := (-?\w* | \d+)/)
> > {
> > if $key ~~ /^\d+$/ {
> > "($cont).[$key]";
> > }
> >
On Fri, Apr 16, 2004 at 03:12:58PM -0400, Aaron Sherman wrote:
> On Fri, 2004-04-16 at 12:35, Juerd wrote:
>
> > backticks encourage interpolation.
>
> ... and?
>
> >From the point of view of a Web developer who deals with (potentially)
> hostile data, I see the problem (though the solution is s
On Fri, Apr 16, 2004 at 09:16:15PM +0200, Juerd wrote:
> However, I could be guessing badly. It could be that someone who says
> Perl 6 should not have a third syntax because there are already two
> really has thought about it. We have many ways of saying "foo() if not
> $bar" in Perl 5 and I use m
On Thu, Apr 15, 2004 at 12:27:12PM -0700, Scott Walters wrote:
> * Rather than eliciting public comment on %hash`foo (and indeed %hash<>)
> the proposal is being rejected out of hand (incidentally, the mantra of the Java
> community Process seems to be "you don't need X, you've got Y", and it took
On Sat, Mar 20, 2004 at 03:09:15PM -0500, Austin Hastings wrote:
> Let's look at boolean xor:
>
> if ($a xor $b xor $c) {...}
>
> should succeed only when exactly one of ($a, $b, $c) is true. This corresponds
> roughly to constructing and then collapsing a one() junction:
That's not the defin
On Mon, Feb 02, 2004 at 09:59:50AM +, Simon Cozens wrote:
> [EMAIL PROTECTED] (Andy Wardley) writes:
> > Sure, make Perl Unicode compliant, right down to variable and operator
> > names. But don't make people spend an afternoon messing around with mutt,
> > vim, emacs and all the other tools
On Thu, Jan 29, 2004 at 11:52:04AM +0100, Robin Berjon wrote:
> I have nothing against using the Unicode names for other entities for
> instance in POD. The reason I have some reserve on using those for
> entitised operators is that E RIGHTWARDS, COMBINING> isn't very readable. Or rather, it's re
On Mon, Jan 05, 2004 at 05:48:04PM -0500, Austin Hastings wrote:
> > From: Uri Guttman [mailto:[EMAIL PROTECTED]
> > > "AH" == Austin Hastings <[EMAIL PROTECTED]> writes:
> >
> > AH> PS: While I'm somewhat sympathetic to the fact that eu guys are
> > AH> trying to spin up 200 years worth of
On Wed, Dec 17, 2003 at 12:15:04AM +, Piers Cawley wrote:
> There's still a hell of a lot of stuff you can do with 'cached'
> optimization that can be thrown away if anything changes. What the
> 'final' type declarations would do is allow the compiler to throw away
> the unoptimized paths and t
On Tue, Nov 25, 2003 at 04:48:08PM -0700, Luke Palmer wrote:
> Austin Hastings writes:
> > "C" style C loops then look like:
> >
> > for (($a = 0; $b = $num_elts); $a < @arry; ($a++; $b -= $offset)) {...}
>
> By which you mean
>
> loop ($a = 0; $b = $num_elts); $a < @arry; ($a++; $b -= $of
On Thu, May 29, 2003 at 10:47:35AM -0700, Dave Whipp wrote:
> OK, we've beaten the producer/consumer thread/coro model to death. Here's a
> different use of threads: how simple can we make this in P6:
>
> sub slow_func
> {
> my $percent_done = 0;
> my $tid = thread { slow_f
Wow, what a flood.
The idea of keep the various degrees of code
parallelism similar in form yet distinct in detail
sounds good to me.
I would like to suggest a radically different
mechanism, that there be operators: fork, tfork, and
cfork to split off a process, thread, or coroutine
respectively.
en to be contained as a line in the string. (Here doc strings
are also awkward for some purposes, having the actual content of the
string on a separate line interferes with the normal flow for reading
the code, unless the string is multi-line data.)
--
Sleep should not be used as a substitute
100 matches
Mail list logo
