|
|
Boost : |
Subject: Re: [boost] GSoC 2010: Heaps and Queues
From: iaml (lintao30_at_[hidden])
Date: 2010-04-08 12:29:45
>
> 2. Let the use update the modified value on their own. This means that heap
> will, for a short time, be invalid, but there aren't any complex side
> effects until the programmer invokes them.
Sorry to interrupt your discussion. I don't quite understand the method
mentioned above. Do you mean postponing the work for later operations? Which
means change the key in heap but not heapify them until some operation (such
as insertion) is called?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk