Casey R. Tweten wrote: > > Removing intermediate data structures is easy in Perl, but not this case, C<each>, etc. must have data structures to work on. There's no "getting rid" of them. "I want find /usr to search the directory tree, but, um, I don't want to actually *have* a directory tree..." > Especially since it's not documented. Oh, it is. The documentation of C<each>, C<keys>, and C<values> all state clearly that they operate on HASH variables. And perldata and perlref clearly describe how to make a HASH variable on the fly. { foo => bar } # create a HASH, getting a ref to it. %{ ... } # dereference a HASH ref -- John Porter We're building the house of the future together.
- Re: functions that deal with hash should be more libera Casey R. Tweten
- Re: functions that deal with hash should be more libera Tom Christiansen
- Re: functions that deal with hash should be more libera Nathan Torkington
- Re: functions that deal with hash should be more libera John Porter
- Re: functions that deal with hash should be more libera Buddha Buck
- Re: functions that deal with hash should be more libera John Porter
- Re: functions that deal with hash should be more libera John Porter
- Re: functions that deal with hash should be more libera Tom Christiansen
- Re: functions that deal with hash should be more libera Tom Christiansen
- Re: functions that deal with hash should be more libera Casey R. Tweten
- Re: functions that deal with hash should be more libera John Porter
- Re: functions that deal with hash should be more libera Casey R. Tweten