home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.perl
- Path: sparky!uunet!news.mentorg.com!sdl!tal
- From: tal@Warren.MENTORG.COM (Tom Limoncelli)
- Subject: How fast is... (was Re: randomize.c)
- Message-ID: <1992Sep2.135055.4659@Warren.MENTORG.COM>
- Organization: Mentor Graphics -- IC Group
- References: <Bts28y.DJA@rahul.net> <AAS.92Aug31133620@rosmer.nr.no> <1992Aug31.183903.4143@cirrus.com> <1992Sep1.210332.26149@netlabs.com>
- Date: Wed, 2 Sep 1992 13:50:55 GMT
- Lines: 19
-
- In <1992Sep1.210332.26149@netlabs.com> lwall@netlabs.com (Larry Wall) writes:
-
- > ...... Subscripting, however, happens
- >constantly, so we optimize for that.
-
- Are associative arrays optimized? For example, many times I do:
-
- if ( $foo{$thing} ne $frob ) {
- $foo{$thing} += $fratz;
- }
-
- Is there a one-entry cache or does it traverse the hash tables twice?
-
- Tom
- --
- Tom Limoncelli -- tal@warren.mentorg.com (work) -- tal@plts.uucp (play)
- "Oh! I thought it was one of those useless demos of everything that
- a GUI builder could do." -Anonymous person watching demo of
- Solaris 2.0's graphical tool for managing NIS+
-