in reply to Re: Re: retrieve next avaiable element in sorted hash
in thread retrieve next avaiable element in sorted hash

Even with the binary search, you still need to iterate after you find your target until you find a defined key.

Not so. Its trivial to adjust binary search to handle "find the node immediately preceding/following my value or the value itself" searches. If you already know one endpoint linear search makes sense, as does using it as the left boundary and range searching the appropriate side.


---
demerphq

    First they ignore you, then they laugh at you, then they fight you, then you win.
    -- Gandhi

Replies are listed 'Best First'.
Re: Re: Re: Re: retrieve next avaiable element in sorted hash
by Limbic~Region (Chancellor) on Oct 06, 2003 at 23:57 UTC
    demerphq,
    I stand by my claim. If the value before or after is undefined, then it is not desired. You need to keep moving forward until you find a key with a defined value.

    Cheers - L~R

    Update: After discussing this in the CB, I wanted to record why I interpreted next key with defined value versus just next key. It was based off of:

    without going through all the trouble of making a for loop to check each element after '2' until find one defined.

[reply]

In Section Seekers of Perl Wisdom