MCPcopy Create free account
hub / github.com/ActiveState/code / recipe-299058.py

File recipe-299058.py

recipes/Python/299058_winnowing_data_with_a_heap/recipe-299058.py:None–None  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1class winnow:
2 """A heap structure allows you to easily keep track of one extreme of a
3 set of values, at the expense of most other forms of order. The
4 theory is explained in many places, including the heapq documentation

Callers

nothing calls this directly

Calls 5

rangeFunction · 0.85
lowestFunction · 0.85
highestFunction · 0.85
most_3sFunction · 0.85
shuffleMethod · 0.45

Tested by

no test coverage detected