On 31/08/2013 5:19 p.m., HillTopsGM wrote:
Amos Jeffries-2 wrote
HEAP algorithms deal with both time/age and size property of objects.
Thanks again Amos! The lru explanation is simple enough.
Could you elaborate as to how the 'size' of the object comes into play with
regards to the use of the HEAP algorithm?
Off the top of my head no (and dont have the spare time to dig into it
right now). I just know the heap algorithms normally use it in their
sorting.
Although as the LFUDA documentation stated size is ignored for that
algorithm.
Amos
