Applies dg to elements in Bags which this Handle refers to during this call
until dg returns true for the first time.
If dg does not mutate when it returns false, then applyUntil is linearizable
to a single application of dg which returns true.
Warning: The applications of dg are NOT collectively atomic; merges and
other calls to applyUntil may take affect on elements between calls to dg.
To build a linearizable data structure using Handle, each time dg returns
false, dg should NOT modify the element through the pointer or store
information about the state of the element during that application, as if
dg is a transaction which failed and must roll-back. However, dg may modify
external state to keep track on the number of applications, for example.
Progress: Lock-free if
1. there are no more than width total concurrent threads,
2. dg does not semantically modify through its argument if it returns false,
and
3. dg returns true after a finite number of applications.
If only 2 and 3 hold, then this method is deadlock-free. Otherwise, no
progress is guaranteed.
Applies dg to elements in Bags which this Handle refers to during this call until dg returns true for the first time.
If dg does not mutate when it returns false, then applyUntil is linearizable to a single application of dg which returns true.
Warning: The applications of dg are NOT collectively atomic; merges and other calls to applyUntil may take affect on elements between calls to dg. To build a linearizable data structure using Handle, each time dg returns false, dg should NOT modify the element through the pointer or store information about the state of the element during that application, as if dg is a transaction which failed and must roll-back. However, dg may modify external state to keep track on the number of applications, for example.
Progress: Lock-free if
1. there are no more than width total concurrent threads,
2. dg does not semantically modify through its argument if it returns false, and
3. dg returns true after a finite number of applications.
If only 2 and 3 hold, then this method is deadlock-free. Otherwise, no progress is guaranteed.