Lines Matching refs:value
104 may not fit in the current tournament (because the value "wins" over
105 the last output value), it cannot fit in the heap, so the size of the
148 """Pop and return the current smallest value, and add the new item.
151 more appropriate when using a fixed-size heap. Note that the value
205 # is the index of a leaf with a possibly out-of-order value. Restore the
359 value, order, next = s = h[0]
360 yield value
367 value, order, next = h[0]
368 yield value
375 value = next()
376 h_append([key(value), order * direction, value, next])
383 key_value, order, value, next = s = h[0]
384 yield value
385 value = next()
386 s[0] = key(value)
387 s[2] = value
392 key_value, order, value, next = h[0]
393 yield value
420 # 3 k * (1 + lg2(k)) * ln(n/k) replace the topmost value on the heap
429 # * For the i-th new value from the iterable, the probability of being in the
431 # value seen being in the 100 most extreme values is 100/101.
432 # * If the value is a new extreme value, the cost of inserting it into the