This and other RFCs are available on the web at
http://dev.perl.org/rfc/
=head1 TITLE
Implementation of hash iterators
=head1 VERSION
Maintainer: Tom Hughes <[EMAIL PROTECTED]>
Date: 20 Aug 2000
Version: 1
Mailing List: [EMAIL PROTECTED]
Number: 136
=head1 ABSTRACT
Perl 5 makes v
David L . Nicol <[EMAIL PROTECTED]> writes:
>No, because each table lookup takes less time than comparing one
>letter of a text string.
Er, I don't think so.
A lookup takes serveral cycles on a RISC machine
due to memory latency even to the cache. A pipelined string compare takes
less than a c
Simon Cozens <[EMAIL PROTECTED]> writes:
>I'm obviously missing something about vtables. It'll be obvious when someone
>corrects me, but...
>
>Currently, SvPVX(foo) requires one lookup; with a vtable, it would necessitate
>two, (One to find the functino in "foo", and then the functino must find th
On 20 Aug 2000, Chaim Frenkel wrote:
> SWM> Does Perl6 support Symmetric MultiProcessing (SMP)?
Perl5 does - see 'fork'. I'm guessing that Perl6 will have at
least that much support.
> SWM> This is a *huge* issue. It affects everything else that we do with
> SWM> threads.
Most operating syst
