Paul Menage wrote: > On Sat, Jun 21, 2008 at 1:05 AM, Balbir Singh <balbir@xxxxxxxxxxxxxxxxxx> wrote: >> I would like to be able to drop the smallest value. Since we cannot drop the >> smallest value, dropping a leaf (heap->size) should be sufficiently good enough. >> I want a max heap and losing the root of the heap does not work for me. >> > > What are you actually trying to do? Can you get round this by just > inverting your "gt" operator? i.e. provide one that actually > implements "less-than"? Paul, That would convert the entire heap to a min-heap. With my soft limit patches, that I am working on for the memory controller; I want the controller that has exceeded it's soft limit by the maximum amount to be picked off the heap, so that we can reclaim from it on memory contention. Ideally, I would also like to be able to find an existing node in the heap, but that is hard. I can work around that problem for now. -- Warm Regards, Balbir Singh Linux Technology Center IBM, ISTL _______________________________________________ Containers mailing list Containers@xxxxxxxxxxxxxxxxxxxxxxxxxx https://lists.linux-foundation.org/mailman/listinfo/containers
