"Joshua Hoblitt via RT" <[EMAIL PROTECTED]> writes:
> Since the rx_* ops are on the chopping block is there any objection to
> closing this bug?
No objection from me. Actually, I'm not an active Parrot developer
now, and don't see myself becoming one again in the near future, so
you can probably
"Joshua Hoblitt via RT" <[EMAIL PROTECTED]> writes:
> Isn't this a semantics issue that needs to be resolved via p6l? It is
> however a design issue so I'm passing the buck to Chip to make a call
> about this.
Parrot/perl6 was completely different then, so this bug should be
marked "irrelevant"
At Sat, 25 Sep 2004 00:53:25 -0400,
> By the way, this isn't the list for it, but it would be cool if perl6 had
> an interactive mode as good as python's. It's one of the few places I
> think python has a compelling lead.
I'm sort of partial to:
perl -MTerm::ReadLine -le '$t = new Term::ReadLine
At Tue, 24 Aug 2004 15:19:52 -0400,
Dan Sugalski wrote:
>
> At 11:47 AM -0700 8/24/04, Sean O'Rourke wrote:
> >At Tue, 24 Aug 2004 13:33:45 -0400,
> >Dan Sugalski wrote:
> >> 7) Strings are treated as floats for math operations
> >
> >I think we c
At Tue, 24 Aug 2004 13:33:45 -0400,
Dan Sugalski wrote:
> 6) Division of two ints produces a bignum
Where "bignum" means both "bigger than 32-bit integer" and "rational
number"? So
4 / 2 ==> Bignum("2/1")
which doesn't get automatically downgraded to a normal int. Ok.
> 7) Strings are tre
[EMAIL PROTECTED] (Leopold Toetsch) writes:
> The interference_graph size is n_symbols * n_symbols *
> sizeof(a_pointer). This might already be too much.
>
> 2) There is a note in the source code that the interference graph could
> be done without the N x N graph array. Any hints welcome (Angel F
fib_native.imc
Description: Binary data
fib_native_nopcc.pasm
Description: Binary data
fib_native.imc
Description: Binary data
fib_pmc.imc
Description: Binary data
>>At 5:38 PM + 11/27/03, Pete Lomax wrote:
At 12:02 PM 11/27/2003 +, Pete Lomax wrote:
>Perl6 already does interpolation without special support from IMCC.
>>>I'll rephrase. Is there anything knocking about which would help with
>>>eg:
>>>printf (pFile, "Amount %12.3f [%-10.10s]\n",
Thanks. 'bout time, I suppose, since even _I_ have stopped using
prd-perl6.pl...
/s
[EMAIL PROTECTED] (Joseph F . Ryan) writes:
> # New Ticket Created by Joseph F. Ryan
> # Please include the string: [perl #24403]
> # in the subject line of all future correspondence about this issue.
> # ht
applied thanks.
/s
thanks, applied.
/s
[EMAIL PROTECTED] (Scott Walters) writes:
> I have work-related reason to add a "B" backend for Perl 5 to the
> perl6 compiler. I'm looking at creating an assembler for Perl 5's
> "B" bytecode along the lines of IMCC, and creating patches against
> languages/perl6/IMCC.pm and languages/perl6/IMCC/*
Leopold Toetsch <[EMAIL PROTECTED]> writes:
> Luke Palmer <[EMAIL PROTECTED]> wrote:
>> Okay, considering that it's hard to pack registers into an array, and
>> that it's easy to unpack an array into registers (in the context of
>> signatures), why don't we make the unprototyped calling convention
Leopold Toetsch <[EMAIL PROTECTED]> writes:
> Gordon Henriksen <[EMAIL PROTECTED]> wrote:
>>
>> | A C D E G I|
>> | N S T V|
>>
>
> WTF ...
Hangman -- the goal is to guess the
Leopold Toetsch <[EMAIL PROTECTED]> writes:
>> This sounds like the beginning of a whole set of things like "Warning
>> #238: suboptimal implementation of xxx. Are you sure you know what you
>> are doing?"
>
> If the user turns on optimization and the compiler finds such code, yes,
> why not.
SBCL
Andy Dougherty <[EMAIL PROTECTED]> writes:
> So the problem is actually a dependency on a module not shipped with
> perl5.00503.
>
> This problem's been around a while -- I know I've reported it before. Is
> it time to give up on 5.00503? I will retest with 5.8.x, but the
> compilation takes a *l
Nicholas Clark <[EMAIL PROTECTED]> writes:
> Perl internals slow,
> nigh on unmaintainable.
> So we write parrot.
Parrot: not just Perl
but punctuated prowess
perfected -- Befunge.
/s
Benjamin Goldberg <[EMAIL PROTECTED]> writes:
> I like the ideas of a range of characters, and of variable amount of
> information. So, how about multiple setline variants?
>
>setline Ix # all code from here to the next set{line,file} op is line
> x
>setline Ix, Iy # set line,col number fr
"Tom Locke" <[EMAIL PROTECTED]> writes:
> p.s. (and at the risk of being controversial :) Why did Miguel de
> Icaza say Parrot was "based on religion"? Was it realted to this
> issue? Why is he wrong?
IIRC it is -- his take is that stack VM code provides useful
information about variable lifetimes
Leopold Toetsch <[EMAIL PROTECTED]> writes:
> We have keyed_int shortcuts to get/set items on array like aggregates.
> Is there a reason, that we not have keyed_str to access hash elements
> by STRING directly.
I'm not so sure this would be worth it; since hash lookups are much
more expensive tha
Leopold Toetsch <[EMAIL PROTECTED]> writes:
> What about one subdir per language under languages containing at least
> a README with a pointer to the author(s) webpage.
How about just a single languages/OTHER or some such (maybe in doc/
instead) with this information? Adding extra directories ma
Benjamin Goldberg <[EMAIL PROTECTED]> writes:
> There's no way, in this program, for $x to be out of scope while $y is
> in scope.
But we're in Perl6(66)-land, where "delete caller.MY{'$x'}" and
"delete %OUTER::x" (sp?) can wreak havoc on your pad from all
sorts of strange places. It ain't moral,
Luke Palmer <[EMAIL PROTECTED]> writes:
> FWIW, here's my personal imcc syntax highlighting file for vim. I've
> found it very useful in reading imc code (but then, I'm very attached
> to my syntax highlighting).
Auto-generated editor configuration? Cool...
> I'm still not sure how to add new
Kenneth A Graves (via RT) <[EMAIL PROTECTED]> writes:
> Should the word "argv" be explicitly mentioned, or is "command line
> arguments" clear enough?
Thanks, applied (w/ mention of argv).
/s
Leopold Toetsch <[EMAIL PROTECTED]> writes:
> Dan Sugalski <[EMAIL PROTECTED]> wrote:
>> And semantic differences--don't forget those.
>
> A keyed "add" vtable doesn't help to provide more semantics. The set vs
> assign thread applies here too. On the contrary: to provide all
> semantics you would
Michal Wallace <[EMAIL PROTECTED]> writes:
> Tadaa!
/me blinks at the list comprehensions.
Cool stuff. test_microthreads failed for
some reason I still need to look into, but
there's a lot of cool stuff working
already. Time for Dan to begin thinking
about which direction the pie will fly.
/s
Michal Wallace <[EMAIL PROTECTED]> writes:
> I expected getprop to behave like find_lex
> and throw an exception if the property doesn't
> exist, but it doesn't:
Are you sure that properties are what you want to use
here, rather than attributes (via get_pmc_keyed() or
similar)? IIRC parrot's prop
Luke Palmer <[EMAIL PROTECTED]> writes:
> How does one call a parrot Sub from C and get the return value(s)?
I'd vote for stuffing args into the interpreter, calling the sub's
invoke() method, then digging through the registers to pull out the
return values (see e.g. Parrot_pop_argv in method_uti
Bernhard Schmalhofer <[EMAIL PROTECTED]> writes:
> I have started an implementation of m4 in PIR.
The implications are staggering... Sure, plenty of
compilers can bootstrap themselves, but how many can
generate their own configure scripts via autoconf? With
p4rrot, we may live to see this dream.
Michal Wallace <[EMAIL PROTECTED]> writes:
> Py-pirate can now handle:
Cool...
>* make parrotclass handle "invoke"
> this strikes me as the most efficient,
> but I'm not really confident with C
> so I'm hesitant to try it
This seems to me like the way to go, except you might
Michal Wallace <[EMAIL PROTECTED]> writes:
> Okay, I definitely need some help understanding this.
Okay, I definitely did a suboptimal job trying to
clarify...
> Here's some python code that defines a closure:
>
> def make_adder(base):
> def adder(x):
>
"K Stol" <[EMAIL PROTECTED]> writes:
> invoke is defined in core.ops, and the return value
> of the PMC implementation should be an address,
> because this result is used in the GOTO macro. So,
> only an address can be returned.
Sorry, I mean "return" in the parrot sense, i.e. place
on top of the
"K Stol" <[EMAIL PROTECTED]> writes:
> I may be wrong, but where should the class be stored?
> The newclass op has an out-parameter where the newly
> created class is stored. Invoke doesn't have
> that. (right?)
Presumably it would just return the new object like an
ordinary function call.
/s
Michal Wallace <[EMAIL PROTECTED]> writes:
> 1. Should there be a new_pad that takes
> no arguments to do this, so we don't
> have to keep count manually?
>
> 2. When would you NOT want to use
> new_pad (current_depth+1) ?
Remember, the pad depth reflects lexical scope nesting,
no
"Jonathan Worthington" <[EMAIL PROTECTED]> writes:
> work something out. :-) However, Brent said "If you mean
> precompiled binaries, not yet. Parrot is still under development,
> so we aren't shipping binaries.",
This doesn't make sense to me. People who don't like hacking C can
still use a pr
"Jürgen" "Bömmels" (via RT) <[EMAIL PROTECTED]> writes:
> # New Ticket Created by Jürgen Bömmels
> # Please include the string: [perl #23203]
> # in the subject line of all future correspondence about this issue.
> # http://rt.perl.org/rt2/Ticket/Display.html?id=23203 >
>
>
> Hello,
>
> this p
On 23 Jul 2003, Luke Palmer wrote:
> Instead of having a bunch of specialized ops made for
> constructing/working on specific pmcs, have, say, four general-purpose
> ops whose meaning could be given by each pmc that uses them. So,
> instead of, for instance, newsub, we'd make a new .Sub pmc and ca
On Thu, 17 Jul 2003, Leopold Toetsch wrote:
> > Replacing the next instruction with a branch to the signal handler
> > (like adding a breakpoint) out of the question?
>
> I don't know, how to get the address of the next instruction i.e. the
> "PC" above. Going this way would either mean:
> - fill t
On Thu, 17 Jul 2003, Leopold Toetsch wrote:
> PC = ((op_func_t*) (*PC)) (PC, INTERP); // prederef functions
>
> To be able to switch function tables, this then should become:
>
> PC = ((op_func_t*) (func_table + *PC)) (PC, INTERP);
>
> Thus predereferncing the function pointer would place an of
On Sat, 5 Jul 2003, Leopold Toetsch wrote:
> This is a first attempt to iterate over hashes.
> The hash is scanned linearly, until the given integer index is found.
>
> Is there a better way to locate the next entry, either by an integer idx
> or by a key or some other means?
It's constant time i
On Tue, 24 Jun 2003, Leopold Toetsch wrote:
> Piers Cawley <[EMAIL PROTECTED]> wrote:
> > He's worried that the P6C tests
> > break,
>
> ... albeit this is still an issue. Nobody answered, if we need another
> Sub class implementing the old invoke/ret scheme ...
I'd say "no". P6C is now c
Looks good, except that this needs to make sure an int is being
returned, e.g.
+"42"-> 42
+"forty-two" -> 0
The lazy man in me would just shove it through an int reg, but that
loses precision if we go to bignums. Though for the moment I can't
think of a better way.
On 30 May 2003, Bryan C. Warnock wrote:
> Ha ha, just kidding, of course. I'm all for it, but given my record
> today, that might be an imminent sign of its rejection.
Or, given your historical record, you may have just killed the thread ;).
/s
On Wed, 28 May 2003, Luke Palmer wrote:
> I get segfaults with both imcc -Oj and parrot -j (with assemble.pl) on
> mandel.pasm and a bunch of others.
I've noticed a number of these as well (linuxppc, gcc3.3), but then again
I've been tweaking my copy of the JIT. I get these failures:
Failed Tes
On Mon, 24 Mar 2003, Benjamin Goldberg wrote:
> And what happens if a programmer wants to have two different variables,
> of two different types, with the same name, such as @data and %data?
>
> Without sigils, it cannot be done.
Actually, if you squint, other languages are far ahead of Perl in th
On Wed, 19 Mar 2003, Matthijs van Duin wrote:
> >(4) (internals) Given that Parrot has so many different control mechanisms
> >(call/ret, exceptions, closures, continuations, ...), how do we maintain
> >consistency? And how much of that is parrot's responsibility (versus the
> >perl6 compiler's)?
On Tue, 18 Mar 2003, Matthijs van Duin wrote:
> and maybe also:
> What is the current plan?
>
> although I got the impression earlier that there isn't any yet for invoking
> subrules :-)
See line 1014, languages/perl6/P6C/rule.pm. The hack I used was to call
rules like ordinary subs, and have th
still faster than parrot -j' so he's been experimenting with adding
> smarts to IMCC, making it add hardware register allocation hints to its
> emitted bytecode. Sean O'Rourke liked the basic idea, but reckoned that
> the information generated by IMCC
On Thu, 20 Feb 2003, Leopold Toetsch wrote:
> What do people think?
Cool idea -- a lot of optimization-helpers could eventually be passed on
to the jit (possibly in the metadata?). One thought -- the information
imcc computes should be platform-independent. e.g. it could pass a
control flow grap
On Sat, 25 Jan 2003, Leopold Toetsch wrote:
> Is one PBC file a small thing? Or in other words, should we have a low
> limit where we start again to malloc and copy PBC files?
> Configure option? Commandline switch?
Maybe a config option? The app I'm thinking of was pathological, in that
it mappe
On Sat, 25 Jan 2003, Dave Mitchell wrote:
> On Sat, Jan 25, 2003 at 06:18:47AM -0800, Sean O'Rourke wrote:
> > On Sat, 25 Jan 2003, Leopold Toetsch wrote:
> > > Dan Sugalski wrote:
> > >
> > > > At 5:32 PM + 1/24/03, Dave Mitchell wrote:
> >
On Sat, 25 Jan 2003, Leopold Toetsch wrote:
> Dan Sugalski wrote:
>
> > At 5:32 PM + 1/24/03, Dave Mitchell wrote:
> >
> >> I just wrote a quick C program that successfully mmap-ed in all 1639
> >> files in my Linux box's /usr/share/man/man1 directory.
> >
> >
> > Linux is not the universe, tho
On Wed, 8 Jan 2003, Dan Sugalski wrote:
> Could one of the folks working on the perl 6 parser give us a status
> update as to where it stands?
languages/perl6/README mostly reflects the status with respect to the
language definition of about 4-5 months ago. Differences include:
- IIRC hyper-assi
On Mon, 16 Dec 2002, Nicholas Clark wrote:
> Also, is the first of these a bug?
>
> $ ./perl6 -e 'print 3/undef; print "\n"'
> Can't call method "tree" on an undefined value at ./perl6 line 342.
Yes. The C function isn't fully, well, defined.
/s
# New Ticket Created by "Sean O'Rourke"
# Please include the string: [perl #19090]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=19090 >
The following defines a macro VA_TO_VAPTR(x) to convert va
On Mon, 7 Oct 2002, Dakkar wrote:
> print "Yes r\n" if "0" =~ /0/;
> print "Yes s\n" if "0" =~ "0";
>
> prints:
>
> Yes s
>
> It appears that the RE match returns a false value. If I match:
>
> print "Yes r\n" if "1" =~ /1/;
>
> it does print "Yes r". I also tried:
Probably a bug. Is thi
On Mon, 7 Oct 2002, Nicholas Clark wrote:
> On Mon, Oct 07, 2002 at 08:27:29PM +0200, Juergen Boemmels wrote:
> > But there must also be a way the higher level languages can assign
> > line numbers. Maybe C-like
> > #line 1 "foo.c"
> > directives are a solution.
> > or create dedicated assembler
On Fri, 4 Oct 2002, Tanton Gibbs wrote:
> I agree with this; however, I also think it would be nice to have it all in
> one place. It's a nuisance to have to open every file just to see what it
> is. By the time I figure out what the 60th file does, I've forgotten what
> the first does. It wou
On Fri, 4 Oct 2002, mark sparshatt wrote:
> Basically I'd like to know if there's any sort of listing that gives a
> general description of what each file is used for.
>
> If there isn't, I've started making some notes of my own and if anyone else
> thinks this would be useful then I can type them
On Wed, 2 Oct 2002, Erik Lechak wrote:
> I'm looking at it right now. Thanks for the link. This is the first
> time I have heard of doxygen.
I meant the pointer at least partly as a reminder that this is one wheel
we shouldn't have to reinvent. I think there are plenty of solutions out
there t
On Wed, 2 Oct 2002, Erik Lechak wrote:
> I was wondering if you could take a look at it and tell me if it has any
> merrit, or if I should not waste my time on it and get back to the
> "getting started guide".
Have you had a chance to look at doxygen? It doesn't support Perl, but
Perl is on the
On Thu, 26 Sep 2002, Luke Palmer wrote:
> Before people get I far on the regex engine, is there any plan to
> implement split buffers; i.e. storing one string in multiple places and
> tying them together? Has this already been done?
I don't understand how this would affect the regex engine -- w
On 26 Sep 2002, Juergen Boemmels wrote:
> These may be nice but not needed for scheme
> * get keyed with INTVAL (getting direct to the Hashes)
> * set keyed with INTVAL;STRING
Both get(INTVAL;STRING) and set(INTVAL;STRING) are needed (or at least
useful) for accessing hidden lexicals in outer
On Thu, 26 Sep 2002, Andy Dougherty wrote:
> On Thu, 26 Sep 2002, Dan Sugalski wrote:
>
> > At 5:05 PM +0200 9/26/02, H.Merijn Brand wrote:
> > >
> > >perl t/harness
> > >t/builtins/array.Can't bless non-reference value at
> > >../../assemble.pl line 163.
> >
> > Hrm. What version of perl are
On 24 Sep 2002, Juergen Boemmels wrote:
> I just got functions running in scheme.
>
> It uses a pre-version of Sean O'Rourkes scratchpad.pmc. (Sean, I had to
> reimplement some functions to get it compile, did I get them right?)
Hopefully it will be easy to reconcile our different versions (and w
On Tue, 24 Sep 2002, Leopold Toetsch wrote:
> Andy Dougherty wrote:
>
> > On Mon, 23 Sep 2002, Leopold Toetsch wrote:
>
> > ./imcc examples/sample.imc
>
> This doesn't even compile on my computer.
I'm away from parrot-source at the moment, but if sample.imc breaks, that
sounds like a bug.
/s
On Tue, 24 Sep 2002, Leopold Toetsch wrote:
> Sean O'Rourke wrote:
> > If we expect these (especially shift) to be as frequent as push/pop, and
> > we want fast indexing as well, then maybe something like the SGI STL
> > implementation of a dequeue (dequeueue?) would
On Tue, 24 Sep 2002, Leopold Toetsch wrote:
> Sean O'Rourke (via RT) wrote:
>
> > What happens if you presize the PerlArray to its final size
>
> Then it is of course faster, but this is not a real world proposal IMHO,
The real-world version would increase the array
On Tue, 24 Sep 2002, Leopold Toetsch wrote:
> intlist_3.pbc is with 1) already 10 times faster then the same test with
> PerlArray (ok, that's not fair, .PerlArray has to new_pmc, which
> accounts for ~40% difference).
What happens if you presize the PerlArray to its final size before the
loop?
On Sat, 21 Sep 2002, Leopold Toetsch wrote:
> As PBC files might be built from different core.ops aka core_ops.c, it
> is necessary to add a fingerprint to PBC files, to validate, that the
> interpreter uses the very same ops, when running the PBC.
>
> - during "make" a fingerprint of core_ops.c
On Fri, 20 Sep 2002, Clinton A. Pierce wrote:
> I have a sudden need to do signed 16-bit integer math in PASM. Any
> suggestions on where to begin?
Does shifting everything left by 16 bits (on 32-bit platforms) to operate
on, then shifting it back to the right to use, work?
/s
On Wed, 18 Sep 2002, Andy Dougherty wrote:
> That's what I would have thought, but it seems that 12! is already testing
> recursive functions. Unless there's an objection, I'll just delete the
> 14! test.
Sure.
/s
On 18 Sep 2002, Tom Hughes wrote:
> In message <[EMAIL PROTECTED]>
> Sean O'Rourke <[EMAIL PROTECTED]> wrote:
>
> > Actually, if scratchpads become proper PMC's these ops would be incredibly
> > useful and common. For example, "@a[0] = %b
Thanks, applied.
/s
On Wed, 18 Sep 2002, Leopold Toetsch wrote:
> Tom Hughes wrote:
>
> > In message <[EMAIL PROTECTED]>
> > Leopold Toetsch <[EMAIL PROTECTED]> wrote:
> >
> >
> >>op dest[dkey], src1[skey1], src2[skey2]
> >>
> >>e.g.
> >>
> >>add P0[P1], P2, P3[P4]
>
> > There was however some discussion as t
On 18 Sep 2002, Tom Hughes wrote:
> In message <[EMAIL PROTECTED]>
> Leopold Toetsch <[EMAIL PROTECTED]> wrote:
>
> > [ add Px[Ix], Py, Pz[Iz]
> >
> > 2) What PASM ops should above statement generate:
> > a) add_p_k_p_p_k (i.e. all variations of /p(_k)?/ )
> > b) add_p_k_p_k_p_k
> >if
Maybe I should wait for the entire picture here, but in cases like this
(int $x, string $y) = some_function()
it would be nice to pass in both type _and_ number of return values. Or,
more generally, to consider the type of a list to be a list of the types
of its members. This means tha
On 17 Sep 2002, Juergen Boemmels wrote:
> You do something like push_pad implicitly in the Sub class, but
> without a corresponding op in core.ops, when you invoke the Sub.
> You also get the current lexical scope implicitly at Sub creation
> time. This may be intentional so that the bytecode cant
On Tue, 17 Sep 2002, Leopold Toetsch wrote:
> ... and the default.pmc will catch any abuse of adding a "Sub" to an int
> and throw an exception.
Right. The current default.pmc non-error implementation of get_integer
(returning cache.int_val) is wrong, and should go away.
> > ... IMHO once a cla
On Thu, 12 Sep 2002, Piers Cawley wrote:
> Heh. I tried predeclaring using the apocalypse style:
>
>sub odd($n) {...}
>sub even($n) {...}
>
> And that complained about the yadda, even though the functions were
> then fully defined.
At the time I interpreted this as a stub definition, not
On Thu, 12 Sep 2002, Piers Cawley wrote:
> So, I know that recursion doesn't seem to work in the simple case, but
> at least it reaches runtime. Mutual recursion doesn't even compile
> successfully.
It should do about this, since you're calling it with parens, but for the
moment, you need to dec
On Thu, 12 Sep 2002, Piers Cawley wrote:
> So, do we have a timetable for when the Perl 6 interpreter is going
> handle closures?
When it uses find_lex/store_lex instead of registers for locals, which
will take a bit of doing, though it's near the top of more than one todo
list.
> Also, conside
On 10 Sep 2002, Aaron Sherman wrote:
> This short bit of code does a good job of pointing out two bugs. One is
> that the C<*@y> sucks up ALL of the arguments, not just C<@_[1..@_]>,
> and also that C<"\$x"> prints a lone backslash.
>
> Please correct me if I've misused these operators. Thanks!
>
On 10 Sep 2002, Aaron Sherman wrote:
>
> Here's my latest bug, which I will work on tracking down. It's a pretty
> huge blocker for everything I've been working on, so there's no sense in
> spending my time elsewhere:
>
> sub def ($arg) {
> return $arg;
> }
> $o = 25;
>
On 10 Sep 2002, Aaron Sherman wrote:
> So, I'm almost done and ready to cut the Builtins patch, but the
> following problem has come up:
>
> I get no warnings or errors while it reads and parses the Builtins, but
> then Tree.pm throws a number of uninitialized value warnings and then
> Context.pm
On Mon, 9 Sep 2002, Andy Dougherty wrote:
> Thanks for running the tests. If you're really ambitious, you could
>
> cd languages/perl6
> make
>
> and see what happens, but unless you've got bison and flex installed,
> don't bother (I submitted a patch to pregenerate the files, but it'
# New Ticket Created by "Sean O'Rourke"
# Please include the string: [perl #17070]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=17070 >
Perl arrays allow accesses to negative out-of-bounds indices with
On Sat, 7 Sep 2002, Jeff wrote:
> In attempting to figure out why tests in languages/perl6 aren't running,
> I came across something of an oddity in t/harness.
>
> > my @tests = @ARGV ? @ARGV : map { glob( "t/$_/*.t" ) } ( qw(compiler rx) );
>
> Apparently designed to loop through just compiler/
On Fri, 6 Sep 2002, Steve Fink wrote:
> > > - Make sure P6C::IMCC::code() adds a newline after every line
> > > (I was getting two consecutive lines of code smashed together)
> >
> > This will probably make the output pretty ugly. I'd rather find the
> > culprit for the smashed-together lines,
applied, thanks.
/s
On Sat, 7 Sep 2002, Steve Fink wrote:
> Apply as much or as little of this patch as you want.
Looks good to me.
> - Add a few more patterns to various .cvsignore files
> - Add a -e (or --eval) flag to perl6.
For those "quick" one-liners?
> - Reindent a bunch of code that had too few spaces
> -
On Fri, 6 Sep 2002, Mike Lambert wrote:
> t/compiler/8.t 1 256 61 16.67% 6
Good to know I can pass the buck on this one.
> t/compiler/a.t 1 256 31 33.33% 2
That sounds like P6C failing somewhere -- imcc parse errors typically are.
> t/rx/call.t1 256
And a couple others:
#16962 -- (docs) applied
#16938 -- (imcc) applied
/s
On Thu, 5 Sep 2002, Jeff wrote:
> And some more marked as committed that got missed...
>
> Most of the time I'm looking at http://www.parrotcode.org/openpatches/
> in order to find out what needs to be committed. I'm so
t yet discovered, and I'm curious what it is.
/s
On Thu, 5 Sep 2002, Steve Fink wrote:
> On Wed, Sep 04, 2002 at 08:48:29PM -0700, Sean O'Rourke wrote:
> > On Wed, 4 Sep 2002, Steve Fink wrote:
> > > I tend to create new PMC classes frequently, and they're a pai
Thanks to Joseph Ryan, P6C does interploated strings now, meaning less
underscore, which we can all agree is a Good Thing ;).
/s
Applied (see also mailing list discussion).
/s
# New Ticket Created by "Sean O'Rourke"
# Please include the string: [perl #17032]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=17032 >
>From busunsl on perlmonks (http://perlmonks.org/index.pl?
On Thu, 5 Sep 2002, Brent Dax wrote:
> Sean O'Rourke:
> # > # 4 - the other arrays boosted to the highest dimension
> # > It's already been defined to be #4.
> #
> # Argh. Then I need to whinge a bit -- what if it's a ragged
> # array? What if diffe
On Wed, 4 Sep 2002, Brent Dax wrote:
> Sean O'Rourke:
> # On Wed, 4 Sep 2002, Brent Dax wrote:
> # > What if (say) @b is a two-dimensional array?
> #
> # Then you get "interesting values of undef" :). Seriously, I
> # suspect one of the following:
> #
>
1 - 100 of 199 matches
Mail list logo
