Name	Size	Mode	Actions
abc.cpython-33.pyc	9615	0644	editdlrm
abc.cpython-33.pyo	9549	0644	editdlrm
aifc.cpython-33.pyc	36116	0644	editdlrm
aifc.cpython-33.pyo	36116	0644	editdlrm
antigravity.cpython-33.pyc	1069	0644	editdlrm
antigravity.cpython-33.pyo	1069	0644	editdlrm
argparse.cpython-33.pyc	94013	0644	editdlrm
argparse.cpython-33.pyo	93820	0644	editdlrm
ast.cpython-33.pyc	15387	0644	editdlrm
ast.cpython-33.pyo	15387	0644	editdlrm
asynchat.cpython-33.pyc	11341	0644	editdlrm
asynchat.cpython-33.pyo	11341	0644	editdlrm
asyncore.cpython-33.pyc	25473	0644	editdlrm
asyncore.cpython-33.pyo	25473	0644	editdlrm
base64.cpython-33.pyc	15459	0644	editdlrm
base64.cpython-33.pyo	15198	0644	editdlrm
bdb.cpython-33.pyc	26012	0644	editdlrm
bdb.cpython-33.pyo	26012	0644	editdlrm
binhex.cpython-33.pyc	19102	0644	editdlrm
binhex.cpython-33.pyo	19102	0644	editdlrm
bisect.cpython-33.pyc	3368	0644	editdlrm
bisect.cpython-33.pyo	3368	0644	editdlrm
bz2.cpython-33.pyc	19212	0644	editdlrm
bz2.cpython-33.pyo	19212	0644	editdlrm
calendar.cpython-33.pyc	38795	0644	editdlrm
calendar.cpython-33.pyo	38795	0644	editdlrm
cgi.cpython-33.pyc	36926	0644	editdlrm
cgi.cpython-33.pyo	36926	0644	editdlrm
cgitb.cpython-33.pyc	13789	0644	editdlrm
cgitb.cpython-33.pyo	13789	0644	editdlrm
chunk.cpython-33.pyc	6422	0644	editdlrm
chunk.cpython-33.pyo	6422	0644	editdlrm
cmd.cpython-33.pyc	16074	0644	editdlrm
cmd.cpython-33.pyo	16074	0644	editdlrm
code.cpython-33.pyc	11733	0644	editdlrm
code.cpython-33.pyo	11733	0644	editdlrm
codecs.cpython-33.pyc	46438	0644	editdlrm
codecs.cpython-33.pyo	46438	0644	editdlrm
codeop.cpython-33.pyc	7681	0644	editdlrm
codeop.cpython-33.pyo	7681	0644	editdlrm
colorsys.cpython-33.pyc	4371	0644	editdlrm
colorsys.cpython-33.pyo	4371	0644	editdlrm
compileall.cpython-33.pyc	8787	0644	editdlrm
compileall.cpython-33.pyo	8787	0644	editdlrm
configparser.cpython-33.pyc	60884	0644	editdlrm
configparser.cpython-33.pyo	60884	0644	editdlrm
contextlib.cpython-33.pyc	11514	0644	editdlrm
contextlib.cpython-33.pyo	11514	0644	editdlrm
copy.cpython-33.pyc	10040	0644	editdlrm
copy.cpython-33.pyo	9948	0644	editdlrm
copyreg.cpython-33.pyc	5748	0644	editdlrm
copyreg.cpython-33.pyo	5704	0644	editdlrm
cProfile.cpython-33.pyc	7083	0644	editdlrm
cProfile.cpython-33.pyo	7083	0644	editdlrm
crypt.cpython-33.pyc	3078	0644	editdlrm
crypt.cpython-33.pyo	3078	0644	editdlrm
csv.cpython-33.pyc	17840	0644	editdlrm
csv.cpython-33.pyo	17840	0644	editdlrm
datetime.cpython-33.pyc	78003	0644	editdlrm
datetime.cpython-33.pyo	75679	0644	editdlrm
decimal.cpython-33.pyc	212781	0644	editdlrm
decimal.cpython-33.pyo	212781	0644	editdlrm
difflib.cpython-33.pyc	69840	0644	editdlrm
difflib.cpython-33.pyo	69789	0644	editdlrm
dis.cpython-33.pyc	11233	0644	editdlrm
dis.cpython-33.pyo	11233	0644	editdlrm
doctest.cpython-33.pyc	98525	0644	editdlrm
doctest.cpython-33.pyo	98163	0644	editdlrm
dummy_threading.cpython-33.pyc	1363	0644	editdlrm
dummy_threading.cpython-33.pyo	1363	0644	editdlrm
filecmp.cpython-33.pyc	11331	0644	editdlrm
filecmp.cpython-33.pyo	11331	0644	editdlrm
fileinput.cpython-33.pyc	17744	0644	editdlrm
fileinput.cpython-33.pyo	17744	0644	editdlrm
fnmatch.cpython-33.pyc	3821	0644	editdlrm
fnmatch.cpython-33.pyo	3821	0644	editdlrm
formatter.cpython-33.pyc	27424	0644	editdlrm
formatter.cpython-33.pyo	27424	0644	editdlrm
fractions.cpython-33.pyc	24213	0644	editdlrm
fractions.cpython-33.pyo	24213	0644	editdlrm
ftplib.cpython-33.pyc	45029	0644	editdlrm
ftplib.cpython-33.pyo	45029	0644	editdlrm
functools.cpython-33.pyc	15821	0644	editdlrm
functools.cpython-33.pyo	15821	0644	editdlrm
genericpath.cpython-33.pyc	3765	0644	editdlrm
genericpath.cpython-33.pyo	3765	0644	editdlrm
getopt.cpython-33.pyc	8113	0644	editdlrm
getopt.cpython-33.pyo	8068	0644	editdlrm
getpass.cpython-33.pyc	5556	0644	editdlrm
getpass.cpython-33.pyo	5556	0644	editdlrm
gettext.cpython-33.pyc	20913	0644	editdlrm
gettext.cpython-33.pyo	20913	0644	editdlrm
glob.cpython-33.pyc	3293	0644	editdlrm
glob.cpython-33.pyo	3293	0644	editdlrm
gzip.cpython-33.pyc	24876	0644	editdlrm
gzip.cpython-33.pyo	24816	0644	editdlrm
hashlib.cpython-33.pyc	6206	0644	editdlrm
hashlib.cpython-33.pyo	6206	0644	editdlrm
heapq.cpython-33.pyc	16235	0644	editdlrm
heapq.cpython-33.pyo	16235	0644	editdlrm
hmac.cpython-33.pyc	5817	0644	editdlrm
hmac.cpython-33.pyo	5817	0644	editdlrm
imaplib.cpython-33.pyc	56995	0644	editdlrm
imaplib.cpython-33.pyo	53726	0644	editdlrm
imghdr.cpython-33.pyc	5530	0644	editdlrm
imghdr.cpython-33.pyo	5530	0644	editdlrm
imp.cpython-33.pyc	12577	0644	editdlrm
imp.cpython-33.pyo	12577	0644	editdlrm
inspect.cpython-33.pyc	81711	0644	editdlrm
inspect.cpython-33.pyo	81711	0644	editdlrm
io.cpython-33.pyc	4283	0644	editdlrm
io.cpython-33.pyo	4283	0644	editdlrm
ipaddress.cpython-33.pyc	81798	0644	editdlrm
ipaddress.cpython-33.pyo	81798	0644	editdlrm
keyword.cpython-33.pyc	2210	0644	editdlrm
keyword.cpython-33.pyo	2210	0644	editdlrm
linecache.cpython-33.pyc	3870	0644	editdlrm
linecache.cpython-33.pyo	3870	0644	editdlrm
locale.cpython-33.pyc	53862	0644	editdlrm
locale.cpython-33.pyo	53862	0644	editdlrm
lzma.cpython-33.pyc	18663	0644	editdlrm
lzma.cpython-33.pyo	18663	0644	editdlrm
macpath.cpython-33.pyc	8021	0644	editdlrm
macpath.cpython-33.pyo	8021	0644	editdlrm
macurl2path.cpython-33.pyc	2561	0644	editdlrm
macurl2path.cpython-33.pyo	2561	0644	editdlrm
mailbox.cpython-33.pyc	99289	0644	editdlrm
mailbox.cpython-33.pyo	99150	0644	editdlrm
mailcap.cpython-33.pyc	8115	0644	editdlrm
mailcap.cpython-33.pyo	8115	0644	editdlrm
mimetypes.cpython-33.pyc	20248	0644	editdlrm
mimetypes.cpython-33.pyo	20248	0644	editdlrm
modulefinder.cpython-33.pyc	22852	0644	editdlrm
modulefinder.cpython-33.pyo	22770	0644	editdlrm
netrc.cpython-33.pyc	5522	0644	editdlrm
netrc.cpython-33.pyo	5522	0644	editdlrm
nntplib.cpython-33.pyc	46984	0644	editdlrm
nntplib.cpython-33.pyo	46984	0644	editdlrm
ntpath.cpython-33.pyc	17636	0644	editdlrm
ntpath.cpython-33.pyo	17636	0644	editdlrm
nturl2path.cpython-33.pyc	2083	0644	editdlrm
nturl2path.cpython-33.pyo	2083	0644	editdlrm
numbers.cpython-33.pyc	18859	0644	editdlrm
numbers.cpython-33.pyo	18859	0644	editdlrm
opcode.cpython-33.pyc	5971	0644	editdlrm
opcode.cpython-33.pyo	5971	0644	editdlrm
optparse.cpython-33.pyc	70761	0644	editdlrm
optparse.cpython-33.pyo	70678	0644	editdlrm
os.cpython-33.pyc	38431	0644	editdlrm
os.cpython-33.pyo	38431	0644	editdlrm
os2emxpath.cpython-33.pyc	5238	0644	editdlrm
os2emxpath.cpython-33.pyo	5238	0644	editdlrm
pdb.cpython-33.pyc	62964	0644	editdlrm
pdb.cpython-33.pyo	62892	0644	editdlrm
pickle.cpython-33.pyc	53130	0644	editdlrm
pickle.cpython-33.pyo	52897	0644	editdlrm
pickletools.cpython-33.pyc	67504	0644	editdlrm
pickletools.cpython-33.pyo	66335	0644	editdlrm
pipes.cpython-33.pyc	10147	0644	editdlrm
pipes.cpython-33.pyo	10147	0644	editdlrm
pkgutil.cpython-33.pyc	23376	0644	editdlrm
pkgutil.cpython-33.pyo	23376	0644	editdlrm
platform.cpython-33.pyc	40453	0644	editdlrm
platform.cpython-33.pyo	40453	0644	editdlrm
plistlib.cpython-33.pyc	23543	0644	editdlrm
plistlib.cpython-33.pyo	23449	0644	editdlrm
poplib.cpython-33.pyc	14603	0644	editdlrm
poplib.cpython-33.pyo	14603	0644	editdlrm
posixpath.cpython-33.pyc	13689	0644	editdlrm
posixpath.cpython-33.pyo	13689	0644	editdlrm
pprint.cpython-33.pyc	13300	0644	editdlrm
pprint.cpython-33.pyo	13123	0644	editdlrm
profile.cpython-33.pyc	18780	0644	editdlrm
profile.cpython-33.pyo	18489	0644	editdlrm
pstats.cpython-33.pyc	32301	0644	editdlrm
pstats.cpython-33.pyo	32301	0644	editdlrm
pty.cpython-33.pyc	5795	0644	editdlrm
pty.cpython-33.pyo	5795	0644	editdlrm
pyclbr.cpython-33.pyc	11045	0644	editdlrm
pyclbr.cpython-33.pyo	11045	0644	editdlrm
pydoc.cpython-33.pyc	122558	0644	editdlrm
pydoc.cpython-33.pyo	122480	0644	editdlrm
py_compile.cpython-33.pyc	7699	0644	editdlrm
py_compile.cpython-33.pyo	7699	0644	editdlrm
queue.cpython-33.pyc	12038	0644	editdlrm
queue.cpython-33.pyo	12038	0644	editdlrm
quopri.cpython-33.pyc	7997	0644	editdlrm
quopri.cpython-33.pyo	7687	0644	editdlrm
random.cpython-33.pyc	23774	0644	editdlrm
random.cpython-33.pyo	23774	0644	editdlrm
re.cpython-33.pyc	16452	0644	editdlrm
re.cpython-33.pyo	16452	0644	editdlrm
reprlib.cpython-33.pyc	8314	0644	editdlrm
reprlib.cpython-33.pyo	8314	0644	editdlrm
rlcompleter.cpython-33.pyc	6476	0644	editdlrm
rlcompleter.cpython-33.pyo	6476	0644	editdlrm
runpy.cpython-33.pyc	10485	0644	editdlrm
runpy.cpython-33.pyo	10485	0644	editdlrm
sched.cpython-33.pyc	8247	0644	editdlrm
sched.cpython-33.pyo	8247	0644	editdlrm
shelve.cpython-33.pyc	12762	0644	editdlrm
shelve.cpython-33.pyo	12762	0644	editdlrm
shlex.cpython-33.pyc	9394	0644	editdlrm
shlex.cpython-33.pyo	9394	0644	editdlrm
shutil.cpython-33.pyc	41374	0644	editdlrm
shutil.cpython-33.pyo	41374	0644	editdlrm
site.cpython-33.pyc	25597	0644	editdlrm
site.cpython-33.pyo	25597	0644	editdlrm
smtpd.cpython-33.pyc	34327	0644	editdlrm
smtpd.cpython-33.pyo	34327	0644	editdlrm
smtplib.cpython-33.pyc	41175	0644	editdlrm
smtplib.cpython-33.pyo	41081	0644	editdlrm
sndhdr.cpython-33.pyc	8548	0644	editdlrm
sndhdr.cpython-33.pyo	8548	0644	editdlrm
socket.cpython-33.pyc	18435	0644	editdlrm
socket.cpython-33.pyo	18382	0644	editdlrm
socketserver.cpython-33.pyc	31375	0644	editdlrm
socketserver.cpython-33.pyo	31375	0644	editdlrm
sre_compile.cpython-33.pyc	12319	0644	editdlrm
sre_compile.cpython-33.pyo	12138	0644	editdlrm
sre_constants.cpython-33.pyc	6492	0644	editdlrm
sre_constants.cpython-33.pyo	6492	0644	editdlrm
sre_parse.cpython-33.pyc	25561	0644	editdlrm
sre_parse.cpython-33.pyo	25561	0644	editdlrm
ssl.cpython-33.pyc	28264	0644	editdlrm
ssl.cpython-33.pyo	28264	0644	editdlrm
stat.cpython-33.pyc	4583	0644	editdlrm
stat.cpython-33.pyo	4583	0644	editdlrm
string.cpython-33.pyc	10335	0644	editdlrm
string.cpython-33.pyo	10335	0644	editdlrm
stringprep.cpython-33.pyc	16103	0644	editdlrm
stringprep.cpython-33.pyo	16031	0644	editdlrm
struct.cpython-33.pyc	407	0644	editdlrm
struct.cpython-33.pyo	407	0644	editdlrm
subprocess.cpython-33.pyc	55978	0644	editdlrm
subprocess.cpython-33.pyo	55845	0644	editdlrm
sunau.cpython-33.pyc	23677	0644	editdlrm
sunau.cpython-33.pyo	23677	0644	editdlrm
symbol.cpython-33.pyc	3049	0644	editdlrm
symbol.cpython-33.pyo	3049	0644	editdlrm
symtable.cpython-33.pyc	17349	0644	editdlrm
symtable.cpython-33.pyo	17212	0644	editdlrm
sysconfig.cpython-33.pyc	22306	0644	editdlrm
sysconfig.cpython-33.pyo	22306	0644	editdlrm
tabnanny.cpython-33.pyc	10182	0644	editdlrm
tabnanny.cpython-33.pyo	10182	0644	editdlrm
tarfile.cpython-33.pyc	88130	0644	editdlrm
tarfile.cpython-33.pyo	88130	0644	editdlrm
telnetlib.cpython-33.pyc	27123	0644	editdlrm
telnetlib.cpython-33.pyo	27123	0644	editdlrm
tempfile.cpython-33.pyc	30850	0644	editdlrm
tempfile.cpython-33.pyo	30850	0644	editdlrm
textwrap.cpython-33.pyc	14175	0644	editdlrm
textwrap.cpython-33.pyo	14083	0644	editdlrm
this.cpython-33.pyc	1429	0644	editdlrm
this.cpython-33.pyo	1429	0644	editdlrm
threading.cpython-33.pyc	49631	0644	editdlrm
threading.cpython-33.pyo	48770	0644	editdlrm
timeit.cpython-33.pyc	13617	0644	editdlrm
timeit.cpython-33.pyo	13617	0644	editdlrm
token.cpython-33.pyc	4397	0644	editdlrm
token.cpython-33.pyo	4397	0644	editdlrm
tokenize.cpython-33.pyc	24620	0644	editdlrm
tokenize.cpython-33.pyo	24564	0644	editdlrm
trace.cpython-33.pyc	31619	0644	editdlrm
trace.cpython-33.pyo	31556	0644	editdlrm
traceback.cpython-33.pyc	14513	0644	editdlrm
traceback.cpython-33.pyo	14513	0644	editdlrm
tty.cpython-33.pyc	1479	0644	editdlrm
tty.cpython-33.pyo	1479	0644	editdlrm
types.cpython-33.pyc	3769	0644	editdlrm
types.cpython-33.pyo	3769	0644	editdlrm
uu.cpython-33.pyc	4876	0644	editdlrm
uu.cpython-33.pyo	4876	0644	editdlrm
uuid.cpython-33.pyc	25917	0644	editdlrm
uuid.cpython-33.pyo	25839	0644	editdlrm
warnings.cpython-33.pyc	15838	0644	editdlrm
warnings.cpython-33.pyo	14881	0644	editdlrm
wave.cpython-33.pyc	25025	0644	editdlrm
wave.cpython-33.pyo	24817	0644	editdlrm
weakref.cpython-33.pyc	18442	0644	editdlrm
weakref.cpython-33.pyo	18442	0644	editdlrm
webbrowser.cpython-33.pyc	26111	0644	editdlrm
webbrowser.cpython-33.pyo	26066	0644	editdlrm
xdrlib.cpython-33.pyc	12523	0644	editdlrm
xdrlib.cpython-33.pyo	12523	0644	editdlrm
zipfile.cpython-33.pyc	59010	0644	editdlrm
zipfile.cpython-33.pyo	58945	0644	editdlrm
_compat_pickle.cpython-33.pyc	5506	0644	editdlrm
_compat_pickle.cpython-33.pyo	5506	0644	editdlrm
_dummy_thread.cpython-33.pyc	6049	0644	editdlrm
_dummy_thread.cpython-33.pyo	6049	0644	editdlrm
_markupbase.cpython-33.pyc	11456	0644	editdlrm
_markupbase.cpython-33.pyo	11240	0644	editdlrm
_osx_support.cpython-33.pyc	13834	0644	editdlrm
_osx_support.cpython-33.pyo	13834	0644	editdlrm
_pyio.cpython-33.pyc	85319	0644	editdlrm
_pyio.cpython-33.pyo	85293	0644	editdlrm
_strptime.cpython-33.pyc	19649	0644	editdlrm
_strptime.cpython-33.pyo	19649	0644	editdlrm
_sysconfigdata.cpython-33.pyc	23672	0644	editdlrm
_sysconfigdata.cpython-33.pyo	23672	0644	editdlrm
_threading_local.cpython-33.pyc	8725	0644	editdlrm
_threading_local.cpython-33.pyo	8725	0644	editdlrm
_weakrefset.cpython-33.pyc	13308	0644	editdlrm
_weakrefset.cpython-33.pyo	13308	0644	editdlrm
__future__.cpython-33.pyc	5011	0644	editdlrm
__future__.cpython-33.pyo	5011	0644	editdlrm
__phello__.cpython-33.pyc	146	0644	editdlrm
__phello__.cpython-33.pyo	146	0644	editdlrm

ž ÈúfMFc@sâ
dZd
Z
dddddddd gZd dlmZmZmZmZ
dd„Zd d„Z dd„Z dd „Zdd„Zdd„Z dd„Zdd„Zdd„Zdd„Zdd„Zdd„Zdd„Zyd dlTWnek r



Yn
Xd d„ZeZd-d!d„
ZeZd-d"d„
Zed#krÞ
gZd$d%d&d'd(d)d*d+d,d g ZxeD]Zeeeƒ
q~
WgZxerº
ej e eƒ
ƒ

qž
We!eƒ

d d-l"Z"e"j#ƒ
nd-S(.uïHeap queue algorithm (a.k.a. priority queue). Heaps are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for all k, counting elements from 0. For the sake of comparison, non-existing elements are considered to be infinite. The interesting property of a heap is that a[0] is always its smallest element. Usage: heap = [] # creates an empty heap heappush(heap, item) # pushes a new item on the heap item = heappop(heap) # pops the smallest item from the heap item = heap[0] # smallest item on the heap without popping it heapify(x) # transforms list into a heap, in-place, in linear time item = heapreplace(heap, item) # pops and returns smallest item, and adds # new item; the heap size is unchanged Our API differs from textbook heap algorithms as follows: - We use 0-based indexing. This makes the relationship between the index for a node and the indexes for its children slightly less obvious, but is more suitable since Python uses 0-based indexing. - Our heappop() method returns the smallest item, not the largest. These two make it possible to view the heap as a regular Python list without surprises: heap[0] is the smallest item, and heap.sort() maintains the heap invariant! upHeap queues [explanation by François Pinard] Heaps are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for all k, counting elements from 0. For the sake of comparison, non-existing elements are considered to be infinite. The interesting property of a heap is that a[0] is always its smallest element. The strange invariant above is meant to be an efficient memory representation for a tournament. The numbers below are `k', not a[k]: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 In the tree above, each cell `k' is topping `2*k+1' and `2*k+2'. In an usual binary tournament we see in sports, each cell is the winner over the two cells it tops, and we can trace the winner down the tree to see all opponents s/he had. However, in many computer applications of such tournaments, we do not need to trace the history of a winner. To be more memory efficient, when a winner is promoted, we try to replace it by something else at a lower level, and the rule becomes that a cell and the two cells it tops contain three different items, but the top cell "wins" over the two topped cells. If this heap invariant is protected at all time, index 0 is clearly the overall winner. The simplest algorithmic way to remove it and find the "next" winner is to move some loser (let's say cell 30 in the diagram above) into the 0 position, and then percolate this new 0 down the tree, exchanging values, until the invariant is re-established. This is clearly logarithmic on the total number of items in the tree. By iterating over all items, you get an O(n ln n) sort. A nice feature of this sort is that you can efficiently insert new items while the sort is going on, provided that the inserted items are not "better" than the last 0'th element you extracted. This is especially useful in simulation contexts, where the tree holds all incoming events, and the "win" condition means the smallest scheduled time. When an event schedule other events for execution, they are scheduled into the future, so they can easily go into the heap. So, a heap is a good structure for implementing schedulers (this is what I used for my MIDI sequencer :-). Various structures for implementing schedulers have been extensively studied, and heaps are good for this, as they are reasonably speedy, the speed is almost constant, and the worst case is not much different than the average case. However, there are other representations which are more efficient overall, yet the worst cases might be terrible. Heaps are also very useful in big disk sorts. You most probably all know that a big sort implies producing "runs" (which are pre-sorted sequences, which size is usually related to the amount of CPU memory), followed by a merging passes for these runs, which merging is often very cleverly organised[1]. It is very important that the initial sort produces the longest runs possible. Tournaments are a good way to that. If, using all the memory available to hold a tournament, you replace and percolate items that happen to fit the current run, you'll produce runs which are twice the size of the memory for random input, and much better for input fuzzily ordered. Moreover, if you output the 0'th item on disk and get an input which may not fit in the current tournament (because the value "wins" over the last output value), it cannot fit in the heap, so the size of the heap decreases. The freed memory could be cleverly reused immediately for progressively building a second heap, which grows at exactly the same rate the first heap is melting. When the first heap completely vanishes, you switch heaps and start a new run. Clever and quite effective! In a word, heaps are useful memory structures to know. I use them in a few applications, and I think it is good to keep a `heap' module around. :-) -------------------- [1] The disk balancing algorithms which are current, nowadays, are more annoying than clever, and this is a consequence of the seeking capabilities of the disks. On devices which cannot seek, like big tape drives, the story was quite different, and one had to be very clever to ensure (far in advance) that each tape movement will be the most effective possible (that is, will best participate at "progressing" the merge). Some tapes were even able to read backwards, and this was also used to avoid the rewinding time. Believe me, real good tape sorts were quite spectacular to watch! From all times, sorting has always been a Great Art! :-) uheappushuheappopuheapifyuheapreplaceumergeunlargestu nsmallestuheappushpopi(uisliceucountuteeuchaincCs+|j|
ƒ

t
|d
t|ƒ
dƒ
dS(u4Push item onto heap, maintaining the heap invariant.ii
N(uappendu _siftdownulen(uheapuitem((u*/opt/alt/python33/lib64/python3.3/heapq.pyuheappush„s
c
Cs@|jƒ}
|r6|d
}|
|d
heap[0]: item = heapreplace(heap, item) i(
u_siftup(uheapuitemu returnitem((u*/opt/alt/python33/lib64/python3.3/heapq.pyuheapreplace”s


cCs?|r;|d
|
kr;|d
|
}
|d
t|ƒ
}
x+t
t|
d
ƒ
ƒ
D]}t||ƒ
q#WdS(u8Transform list into a heap, in-place, in O(len(x)) time.iN(ulenureversedurangeu_siftup(u
xu
nu
i((u*/opt/alt/python33/lib64/python3.3/heapq.pyuheapify«s
cCs?|r;|
|d
kr;|d
|
}
|d
t|ƒ
}
x+t
t|
d
ƒ
ƒ
D]}t||ƒ
q#WdS(u;Transform list into a maxheap, in-place, in O(len(x)) time.iN(ulenureversedurangeu_siftup_max(u
xu
nu
i((u*/opt/alt/python33/lib64/python3.3/heapq.pyu_heapify_max½s

u_heapify_maxcCs}|d
krgSt|
ƒ
}t
t||ƒƒ
}|s;|St|ƒ

t}x|D]}|||ƒ
qRW|jddƒ

|S(ufFind the n largest elements in a dataset. Equivalent to: sorted(iterable, reverse=True)[:n] iureverseT(uiterulistuisliceuheapifyuheappushpopusortuTrue(u
nuiterableuituresultu_heappushpopuelem((u*/opt/alt/python33/lib64/python3.3/heapq.pyunlargestÃs










cCsw|d
krgSt|
ƒ
}t
t||ƒƒ
}|s;|St|ƒ

t}x|D]}|||ƒ
qRW|jƒ
|S(uYFind the n smallest elements in a dataset. Equivalent to: sorted(iterable)[:n] i(uiterulistuisliceu_heapify_maxu_heappushpop_maxusort(u
nuiterableuituresultu_heappushpopuelem((u*/opt/alt/python33/lib64/python3.3/heapq.pyu nsmallestÕs










cCsf||}xK||
krW|d
d
?}||}||krS|||<|}q nPq W|||>> list(merge([1,3,5,7], [0,2,4,8], [5,10,15,20], [], [25])) [0, 1, 2, 3, 4, 5, 5, 7, 8, 10, 15, 20, 25] i
iN(uheappopuheapreplaceu StopIterationulenuappendu enumerateumapuiteru__next__uheapifyu__self__(u iterablesu_heappopu_heapreplaceu_StopIterationu_lenu
huh_appenduitnumuitunextu
vu
s((u*/opt/alt/python33/lib64/python3.3/heapq.pyumerge]
s0


"
















c CsT
|d
krut|
ƒ
}t
t|d
ƒƒ
}|s7gS|dkrYtt||ƒƒ
g
Stt||ƒd|ƒ

g
Syt|
ƒ
}Wnttfk rŸ


Yn'X||krÆt |
d|ƒ

d|…S|dkr
t |
tƒƒ}t||ƒ}dd„|Dƒ
St |
ƒ
\}}t t||ƒtƒ|ƒ}t||ƒ}dd„|Dƒ
S(ubFind the n smallest elements in a dataset. Equivalent to: sorted(iterable, key=key)[:n] i
ukeyNc
Ssg|]}
|
d‘qS(
i((u.0u
r((u*/opt/alt/python33/lib64/python3.3/heapq.pyu ¢
s unsmallest..c
Ssg|]}
|
d‘qS(
i((u.0u
r((u*/opt/alt/python33/lib64/python3.3/heapq.pyu ¨
s (uiterulistuisliceuNoneuminuchainulenu TypeErroruAttributeErrorusorteduzipucountu _nsmallestuteeumap( u
nuiterableukeyuituheadusizeuresultuin1uin2((u*/opt/alt/python33/lib64/python3.3/heapq.pyu nsmallest†
s,
















c Csf
|d
krut|
ƒ
}t
t|d
ƒƒ
}|s7gS|dkrYtt||ƒƒ
g
Stt||ƒd|ƒ

g
Syt|
ƒ
}Wnttfk rŸ


Yn-X||krÌt |
d|dd ƒ
d|…S|dkr
t|
tdd ƒƒ}t ||ƒ}dd„|Dƒ
St|
ƒ
\}}tt||ƒtddƒ|ƒ}t ||ƒ}dd„|Dƒ
S(uoFind the n largest elements in a dataset. Equivalent to: sorted(iterable, key=key, reverse=True)[:n] i
ukeyureverseNic
Ssg|]}
|
d‘qS(
i((u.0u
r((u*/opt/alt/python33/lib64/python3.3/heapq.pyu È
s unlargest..c
Ssg|]}
|
d‘qS(
i((u.0u
r((u*/opt/alt/python33/lib64/python3.3/heapq.pyu Î
s Tiÿÿÿÿiÿÿÿÿ(uiterulistuisliceuNoneumaxuchainulenu TypeErroruAttributeErrorusorteduTrueuzipucountu _nlargestuteeumap( u
nuiterableukeyuituheadusizeuresultuin1uin2((u*/opt/alt/python33/lib64/python3.3/heapq.pyunlargest«
s,














$

u__main__i
iiii iiiiN($u__doc__u __about__u__all__u itertoolsuisliceucountuteeuchainuheappushuheappopuheapreplaceuheappushpopuheapifyu_heappushpop_maxu_heapify_maxunlargestu nsmallestu _siftdownu_siftupu _siftdown_maxu_siftup_maxu_heapquImportErrorumergeu _nsmallestuNoneu _nlargestu__name__uheapudatauitemusortuappenduprintudoctestutestmod(((u*/opt/alt/python33/lib64/python3.3/heapq.pyusJ`
"5


(
$
%
$