[PATCH] Speed up hybrid_search_bitmap

[Daniel Berlin]

On Monday, April 21, 2003, at 10:59  AM, Zdenek Dvorak wrote:
>
> maybe, but you will never make it as fast as simple ordinary heaps (the
> reason to use Fibonacci heaps would be if you used decrease key 
> operation,
> as here really matters that you can do it in constant time).

If this were true, people wouldn't use fibheaps in priority queues in 
general,
since decreasekey isn't used that often.
i've seen plenty of well performing priority queues using fibheaps that 
don't even expose decreasekey.
If what you say were true, you'd not expect to see this.
>