in reply to Re^2: what would you like to see in perl5.12? (trees)
in thread what would you like to see in perl5.12?

'seek' doesn't care whether the key exists or not. It just arranges for the next use of each (actually, adding a way to reverse 'each' would be prudent as well) finds the earliest key greater than or equal to the key given to 'seek'. For convenience of interface, 'seek' might return something which might be different depending on whether the requested key exists or not, but those are details best left to the (unknown) implementor.

- tye        

  • Comment on Re^3: what would you like to see in perl5.12? (seek)

Replies are listed 'Best First'.
Re^4: what would you like to see in perl5.12? (seek)
by Arunbear (Prior) on Aug 06, 2008 at 09:25 UTC
    But say you have a hash like 
    %capital = (
    France  => 'Paris',
    England => 'London',
    Hungary => 'Budapest',
);

    [download]
    and you seek to 'Russia'. Should the next call to each behave as if all the elements had been read (i.e. return end-of-hash) ?
[reply]
[d/l]

      Of course.

      - tye        

[reply]

In Section Meditations