Larry Wall skribis 2005-04-24 18:50 (-0700):
> [EMAIL PROTECTED] = (1..2:by(0));
[EMAIL PROTECTED] = 1 xx Inf;
[EMAIL PROTECTED] = 1 xx @bar;
Juerd
--
http://convolution.nl/maak_juerd_blij.html
http://convolution.nl/make_juerd_happy.html
http://convolution.nl/gajigu_juerd_n.html
This patch fills in two holes in pdd04 (internal data types). The information
came from include/parrot/pobj.h.
Christoph Otto
--- parrot/docs/pdds/pdd04_datatypes.pod2005-04-19 10:12:52.667126432
-0700
+++ parrot-local/docs/pdds/pdd04_datatypes.pod 2005-04-24 21:42:47.460178912
-0700
@
I image we've all written logging code that looks something like this
(Perl5 syntax):
sub foo {
my ($x,$y) = @_;
note("Entering frobnitz(). params: '$x', '$y'");
...
}
This, of course, throws an 'uninitialized value in concatenation or
string' warning when your test suite
On Sun, Apr 24, 2005 at 06:14:35PM -0700, Darren Duncan wrote:
: At 4:39 PM -0700 4/24/05, Larry Wall wrote:
: >On Mon, Apr 25, 2005 at 02:13:26AM +0800, Autrijus Tang wrote:
: >: A while ago I posted a conflict between a block containing a pair
: >: constructor, vs. a hash constructor:
: >:
: >:
A former employer of mine was about to throw out some old Alphas in
order to avoid paying the Tru64 licensing fees, until I suggested (a)
Linux and/or (b) donating them to Open Source development projects.
They liked both ideas, with the result that one such machine can be made
available; if the
At 4:39 PM -0700 4/24/05, Larry Wall wrote:
On Mon, Apr 25, 2005 at 02:13:26AM +0800, Autrijus Tang wrote:
: A while ago I posted a conflict between a block containing a pair
: constructor, vs. a hash constructor:
:
: map { $_ => $_ } @foo;
: And maybe it can be extended over adverbial blocks,
On Mon, Apr 25, 2005 at 02:13:26AM +0800, Autrijus Tang wrote:
: A while ago I posted a conflict between a block containing a pair
: constructor, vs. a hash constructor:
:
: map { $_ => $_ } @foo;
:
: Larry suggested that to keep it from being collapsed, we somehow
: augment toplevel AST:
:
From: Leopold Toetsch <[EMAIL PROTECTED]>
Date: Sun, 24 Apr 2005 09:25:43 +0200
Nicholas Clark <[EMAIL PROTECTED]> wrote:
> In effect morph has to be friends of both A and B, because it needs to
break
> encapsulation?
Yep. The same is true for C, which additionally to C,
get
A while ago I posted a conflict between a block containing a pair
constructor, vs. a hash constructor:
map { $_ => $_ } @foo;
Larry suggested that to keep it from being collapsed, we somehow
augment toplevel AST:
map { $_ => $_; } @foo;
map { +($_ => $_) } @foo;
But here is a new id
On Sun, 2005-04-24 at 07:51 +, Nigel Sandever wrote:
> On Sat, 23 Apr 2005 21:00:11 -0700, [EMAIL PROTECTED] (Larry Wall) wrote:
> > From what I've read, the trend in most modern implementations of
> > concurrency is away from shared state by default, essentially because
> > shared memory simp
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
> With cons based lists, past stream values are no longer referred to
> so can be reclaimed, but we have random access arrays.
>
> That's about where my wondering stopped.
It started again. @primesquares.shift would do it
Brad
On 21 Apr, fayland wrote:
: It has been published at perl6.language, but have no reply.
That was to be expected, as it's no language-design specific issue,
and therefore, unsuitable for p6l.
: In perl v5.8.6 built for MSWin32-x86-multi-thread:
:
: my $i = 1;
: print $i++, ++$i; # 1 3
: my $i =
konovalo skribis 2005-04-24 10:24 (+0400):
> interp interpreter
I don't recall having seen that used.
> i iterator?
Used as such, but I think discouraging i in favour of iter is a better
idea, because i is also often used as index.
> anon anonymous
Is this used?
> interestingly, among r
On Sun, Jan 23, 2005 at 08:22:37PM +, Fergal Daly wrote:
> Attached is a patch that fixes this test case without breaking any others so
> I think it's OK. It basically centralises the circular ref checking into
> _deep_check and then reroutes eq_array and eq_hash into that. This ensures
> that
Nicholas Clark <[EMAIL PROTECTED]> wrote:
> When writing morph methods for PMC classes, am I right in thinking that if
> morphing from class A to class B, where both use the PMC_struct_val to
> store structures of different types, it's totally up to the morph method
> to know how to correctly dispo
Nicholas Clark <[EMAIL PROTECTED]> wrote:
> Looking at the code in array.pmc's set_integer_same I see:
>=item C
> Sets the length of the array to the number of elements in C<*value>.
>=cut
> */
> void set_integer_same (PMC* value) {
> INTVAL size = DYNSELF.elements();
> lis
[EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
> Well I started the AMD64 code generator. I don't have much available yet --
> just enough for what seems to be necessary to run anything at all.
> Parrot_jit_begin makes calls to MOV instructions that are implemented, and I
> have a NOP implemented.
[ CC'ed to list again ]
Roger Hale wrote:
Leo,
I find myself on the horns of a variant of Warnock's dilemma here:
Sorry about that.
Having done my best to clarify why I think the return context cannot
helpfully be attached to either @IN_ARGS nor @OUT_ARGS, the thread has
no further response from
Hi,
I've been wondering how to lazy lists will work.
The answer "Correctly, don't worry about it", is entirely acceptable...
The intent of this example in S06 seems clear, make @oddsquares
a lazily filled array of squares of odd @nums:
S06/Pipe operators
It [==>] binds the (potentially lazy
On Sat, 23 Apr 2005 21:00:11 -0700, [EMAIL PROTECTED] (Larry Wall) wrote:
> On Sun, Apr 24, 2005 at 03:37:23AM +, Nigel Sandever wrote:
> : On Sun, 24 Apr 2005 03:47:42 +0800, [EMAIL PROTECTED] (Autrijus Tang)
wrote:
> : >
> : > Oh well. At least the same code can be salvaged to make iThread
21 matches
Mail list logo
