Jonathan Scott Duff [EMAIL PROTECTED] writes:
On Wed, Feb 16, 2005 at 12:17:35PM +1100, Damian Conway wrote:
none($a, $a) == undef
True.
Isn't this one false in the case when $a is undef?
Since it is numerical comparison, it is false as long as $a == 0.
(I would hope.)
Eirik
--
So
Larry Wall wrote:
On Wed, Feb 16, 2005 at 02:29:36PM +0800, Autrijus Tang wrote:
: Just a quick question. The prettyprinter of Pugs (the thing that
: handles the .perl method) currently prints out boolean true and
: false as #t and #f, which is obviously not correct.
:
: pugs (1 2, 2 1)
:
Markus Laire skribis 2005-02-16 13:32 (+0200):
We already have +^ ~^ ?^ +| ~| ?| etc..
We have unary lc, int, etc...
Why not allow data-type prefix for the comparison operators also, so
we'd get, to mention a few, ~== (same as 'eq') ~ (same as 'lt') ~=
(same as 'le') - and of course
On Wed, 16 Feb 2005 12:17:35 +1100, [EMAIL PROTECTED] (Damian Conway) wrote:
..values tells you what raw values are inside the junction. The other kind of
introspection that's desirable is: what raw values can *match* this
junction. There would probably be a .states method for that.
To
On Wed, Feb 16, 2005 at 12:14:10AM -0600, Rod Adams wrote:
So in terms of frequency of use in the English Language, I'd rank things
in the following order:
1) Scalars
2) Sets
3) Arrays
4) Hashes
Perhaps. However, it's fairly easy to use an Array or Hash to represent
a Set, so perhaps it's
On Wed, Feb 16, 2005 at 01:06:22PM +, Nigel Sandever wrote:
Any chance that you could provide one or two simple but realistic examples of
using Junctions and their operators?
I'll give it a shot, but keep in mind that I'm somewhat new to this
also. :-)
First, junctions are an easy way
On Feb 15, 2005, at 11:16 PM, Larry Wall wrote:
I admit that calling the .brainf*ck method is problematic several
ways...
And what of .c#?
Regards,
David
HaloO All,
Luke Palmer wrote:
But what are some nice, abstract concepts that these could represent.
One that I've been thinking of is:
* @something is necessarily ordered: there is a well-defined first element
* %something is necessarily a set: adding something twice is always
redundant
Thomas Sandlaß skribis 2005-02-16 18:35 (+0100):
% with . and .«»
% with .{}
. and . imply {}
Juerd
--
http://convolution.nl/maak_juerd_blij.html
http://convolution.nl/make_juerd_happy.html
http://convolution.nl/gajigu_juerd_n.html
On Wed, 16 Feb 2005 09:18:42 -0600, [EMAIL PROTECTED] (Patrick R. Michaud)
wrote:
On Wed, Feb 16, 2005 at 01:06:22PM +, Nigel Sandever wrote:
Any chance that you could provide one or two simple but realistic examples
of
using Junctions and their operators?
I'll give it a shot,
Greetings.
I´m a novice in this conference. My name is Roberto Bisotto and interested
on use P6. I´m using PERL since version 3 and i see a fantastic evolution at
version 6.
Please, where may i download this version ? Is there an usable version
?
Cordialy.
Roberto Bisotto
Plano de fundo
On Wed, Feb 16, 2005 at 06:35:38PM +0100, Thomas Sandla wrote:
: Each of these comes with a corresponding postcicumfix dereferencer.
: with .()
: @ with .[]
: % with . and .
% with .{} (plus . and . as syntactic sugar)
: Maybe now is the time to figure out what they *do* mean.
:
: I see
On Wed, Feb 16, 2005 at 03:09:24PM -0300, LOGGOS TI wrote:
Dia claroGreetings. I´m a novice in this conference. My name is
Roberto Bisotto and interested on use P6. I´m using PERL since version
3 and i see a fantastic evolution at version 6.
Please, where may i download this version ? Is
On Wed, Feb 16, 2005 at 06:04:37PM +, Nigel Sandever wrote:
On Wed, 16 Feb 2005 09:18:42 -0600, [EMAIL PROTECTED] (Patrick R. Michaud)
wrote:
And for fun, try writing the equivalent of
if $x == one($a, $b, $c, $d) { ... }
without a junction. (Okay, one can cheat with Cgrep.)
On Wed, Feb 16, 2005 at 01:55:31PM -0600, Patrick R. Michaud wrote:
: And to
: anticipate the followup question of Well, why not make features such
: as junctions into optional modules?, I think a partial answer is that
: features like these really need deep language support to work
: effectively
Patrick R. Michaud wrote:
On Wed, Feb 16, 2005 at 06:04:37PM +, Nigel Sandever wrote:
If the hyper operator returned one boolean result for each
comparison it made, and if a list of boolean values in a
boolean context collapsed to a count of the trues/1s it contained,
I think those would
Larry Wall wrote:
That, and we'd like a novice to be able to write
given $x {
when 1 | 2 | 3 {...}
when 4 | 5 | 6 {...}
}
Or just change Cwhen to accept a list of things to compare against,
followed by a coderef.
-- Rod Adams
On Wed, 16 Feb 2005 14:29:14 -0600, Rod Adams [EMAIL PROTECTED] wrote:
Larry Wall wrote:
That, and we'd like a novice to be able to write
given $x {
when 1 | 2 | 3 {...}
when 4 | 5 | 6 {...}
}
Or just change Cwhen to accept a list of things to compare against,
It's been mentioned to me that some folks were surprised that the design team
hasn't been more effusive in it's support for the incredible job that Autrijus
is doing prototyping the Perl 6 interpreter over the top of Haskell.
We had thought that answering his questions about 1000 times faster
On Tue, Feb 15, 2005 at 11:03:09PM -0800, Larry Wall wrote:
On Wed, Feb 16, 2005 at 02:29:36PM +0800, Autrijus Tang wrote:
: Just a quick question. The prettyprinter of Pugs (the thing that
: handles the .perl method) currently prints out boolean true and
: false as #t and #f, which is
On Wed, 2005-02-16 at 08:54 -0800, David Wheeler wrote:
And what of .c#?
It's an alias for .java.
-- c
On Wed, Feb 16, 2005 at 10:07:34PM -0800, chromatic wrote:
: On Wed, 2005-02-16 at 08:54 -0800, David Wheeler wrote:
:
: And what of .c#?
:
: It's an alias for .java.
I'm sorry, but neither of those is powerful enough to represent Perl
data structures. ;-)
Larry
HaloO Larry,
you wrote:
That would be cool. I'd like to see our community build up a pool of
theoreticians who are not allergic to the practicalities of building a
language for ordinary people to think in. It is my persistent belief
(and fond hope) that theory and practice don't always have to
23 matches
Mail list logo
