Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: Re: Re: Re: Data Structure needed for Event Queue

by danger (Priest)
on May 28, 2002 at 16:29 UTC ( #169817=note: print w/replies, xml ) Need Help??

in reply to Re: Re: Re: Data Structure needed for Event Queue
in thread Data Structure needed for Event Queue

Just curious, but without my references im not really sure but what kind of heap is that? Fibonnacci?

Assuming you are referring to the EoPwP heap that educated_foo points to, then (as stated by educated_foo, who refers to me in the plural :-) it is strictly a simple, array-based implementation of a binary heap. It isn't documented except as it is built in the book.

A main difference between this and the Heap model is that this one contains the comparison routines internally and works on the model of selecting a comparison method on heap creation and supplying a suitable key and satellite data for each inserted element (it is easy to use any objects for which you can supply a key) --- to use objects with the Heap version you need all of your objects to supply their own cmp() method for comparing themselves with any other object type in the heap. The latter is more flexible because the comparison routines may be arbitrarily complex, but does require that all your objects either inherit or supply their own common comparison method.

  • Comment on Re: Re: Re: Re: Data Structure needed for Event Queue

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://169817]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (5)
As of 2023-04-02 09:27 GMT
Find Nodes?
    Voting Booth?

    No recent polls found