Hackfut Security File Manager
Current Path:
/usr/lib64/python2.6/Tools/scripts
usr
/
lib64
/
python2.6
/
Tools
/
scripts
/
📁
..
📄
byext.py
(3.83 KB)
📄
byext.pyc
(4.36 KB)
📄
byext.pyo
(4.36 KB)
📄
byteyears.py
(1.6 KB)
📄
byteyears.pyc
(1.38 KB)
📄
byteyears.pyo
(1.38 KB)
📄
checkappend.py
(4.55 KB)
📄
checkappend.pyc
(4.84 KB)
📄
checkappend.pyo
(4.84 KB)
📄
checkpyc.py
(1.97 KB)
📄
checkpyc.pyc
(1.96 KB)
📄
checkpyc.pyo
(1.96 KB)
📄
classfix.py
(5.82 KB)
📄
classfix.pyc
(4.15 KB)
📄
classfix.pyo
(4.15 KB)
📄
cleanfuture.py
(8.38 KB)
📄
cleanfuture.pyc
(7.33 KB)
📄
cleanfuture.pyo
(7.3 KB)
📄
combinerefs.py
(4.28 KB)
📄
combinerefs.pyc
(4.18 KB)
📄
combinerefs.pyo
(4.14 KB)
📄
copytime.py
(667 B)
📄
copytime.pyc
(945 B)
📄
copytime.pyo
(945 B)
📄
crlf.py
(614 B)
📄
crlf.pyc
(865 B)
📄
crlf.pyo
(865 B)
📄
cvsfiles.py
(1.75 KB)
📄
cvsfiles.pyc
(2.15 KB)
📄
cvsfiles.pyo
(2.15 KB)
📄
db2pickle.py
(3.49 KB)
📄
db2pickle.pyc
(3.47 KB)
📄
db2pickle.pyo
(3.47 KB)
📄
diff.py
(1.96 KB)
📄
diff.pyc
(2.3 KB)
📄
diff.pyo
(2.3 KB)
📄
dutree.py
(1.58 KB)
📄
dutree.pyc
(2.21 KB)
📄
dutree.pyo
(2.21 KB)
📄
eptags.py
(1.45 KB)
📄
eptags.pyc
(1.84 KB)
📄
eptags.pyo
(1.84 KB)
📄
finddiv.py
(2.46 KB)
📄
finddiv.pyc
(3.25 KB)
📄
finddiv.pyo
(3.25 KB)
📄
findlinksto.py
(1.05 KB)
📄
findlinksto.pyc
(1.41 KB)
📄
findlinksto.pyo
(1.41 KB)
📄
findnocoding.py
(2.65 KB)
📄
findnocoding.pyc
(3.07 KB)
📄
findnocoding.pyo
(3.07 KB)
📄
fixcid.py
(9.75 KB)
📄
fixcid.pyc
(7.78 KB)
📄
fixcid.pyo
(7.78 KB)
📄
fixdiv.py
(13.58 KB)
📄
fixdiv.pyc
(13.84 KB)
📄
fixdiv.pyo
(13.75 KB)
📄
fixheader.py
(1.17 KB)
📄
fixheader.pyc
(1.45 KB)
📄
fixheader.pyo
(1.45 KB)
📄
fixnotice.py
(2.98 KB)
📄
fixnotice.pyc
(3.45 KB)
📄
fixnotice.pyo
(3.45 KB)
📄
fixps.py
(897 B)
📄
fixps.pyc
(977 B)
📄
fixps.pyo
(977 B)
📄
ftpmirror.py
(12.56 KB)
📄
ftpmirror.pyc
(11.03 KB)
📄
ftpmirror.pyo
(11.03 KB)
📄
google.py
(523 B)
📄
google.pyc
(802 B)
📄
google.pyo
(802 B)
📄
gprof2html.py
(2.12 KB)
📄
gprof2html.pyc
(2.26 KB)
📄
gprof2html.pyo
(2.26 KB)
📄
h2py.py
(5.62 KB)
📄
h2py.pyc
(4.24 KB)
📄
h2py.pyo
(4.24 KB)
📄
hotshotmain.py
(1.45 KB)
📄
hotshotmain.pyc
(1.82 KB)
📄
hotshotmain.pyo
(1.82 KB)
📄
ifdef.py
(3.63 KB)
📄
ifdef.pyc
(2.28 KB)
📄
ifdef.pyo
(2.28 KB)
📄
lfcr.py
(622 B)
📄
lfcr.pyc
(890 B)
📄
lfcr.pyo
(890 B)
📄
linktree.py
(2.37 KB)
📄
linktree.pyc
(2.01 KB)
📄
linktree.pyo
(2.01 KB)
📄
lll.py
(750 B)
📄
lll.pyc
(963 B)
📄
lll.pyo
(963 B)
📄
logmerge.py
(5.45 KB)
📄
logmerge.pyc
(5.04 KB)
📄
logmerge.pyo
(5.04 KB)
📄
mailerdaemon.py
(7.73 KB)
📄
mailerdaemon.pyc
(7.27 KB)
📄
mailerdaemon.pyo
(7.27 KB)
📄
md5sum.py
(2.33 KB)
📄
md5sum.pyc
(2.89 KB)
📄
md5sum.pyo
(2.89 KB)
📄
methfix.py
(5.34 KB)
📄
methfix.pyc
(4.1 KB)
📄
methfix.pyo
(4.1 KB)
📄
mkreal.py
(1.59 KB)
📄
mkreal.pyc
(1.95 KB)
📄
mkreal.pyo
(1.95 KB)
📄
ndiff.py
(3.72 KB)
📄
ndiff.pyc
(3.8 KB)
📄
ndiff.pyo
(3.8 KB)
📄
nm2def.py
(2.39 KB)
📄
nm2def.pyc
(2.93 KB)
📄
nm2def.pyo
(2.93 KB)
📄
objgraph.py
(5.88 KB)
📄
objgraph.pyc
(4.9 KB)
📄
objgraph.pyo
(4.9 KB)
📄
parseentities.py
(1.68 KB)
📄
parseentities.pyc
(2.04 KB)
📄
parseentities.pyo
(2.04 KB)
📄
patchcheck.py
(2.58 KB)
📄
patchcheck.pyc
(3.94 KB)
📄
patchcheck.pyo
(3.94 KB)
📄
pathfix.py
(4.71 KB)
📄
pathfix.pyc
(4.16 KB)
📄
pathfix.pyo
(4.16 KB)
📄
pdeps.py
(3.85 KB)
📄
pdeps.pyc
(3.2 KB)
📄
pdeps.pyo
(3.2 KB)
📄
pickle2db.py
(3.85 KB)
📄
pickle2db.pyc
(3.78 KB)
📄
pickle2db.pyo
(3.78 KB)
📄
pindent.py
(17.48 KB)
📄
pindent.pyc
(12.71 KB)
📄
pindent.pyo
(12.71 KB)
📄
ptags.py
(1.2 KB)
📄
ptags.pyc
(1.39 KB)
📄
ptags.pyo
(1.39 KB)
📄
pysource.py
(3.76 KB)
📄
pysource.pyc
(3.96 KB)
📄
pysource.pyo
(3.96 KB)
📄
redemo.py
(5.63 KB)
📄
redemo.pyc
(5.16 KB)
📄
redemo.pyo
(5.16 KB)
📄
reindent-rst.py
(841 B)
📄
reindent-rst.pyc
(1.12 KB)
📄
reindent-rst.pyo
(1.12 KB)
📄
reindent.py
(10.25 KB)
📄
reindent.pyc
(8.7 KB)
📄
reindent.pyo
(8.66 KB)
📄
rgrep.py
(1.46 KB)
📄
rgrep.pyc
(1.86 KB)
📄
rgrep.pyo
(1.86 KB)
📄
setup.py
(421 B)
📄
setup.pyc
(550 B)
📄
setup.pyo
(550 B)
📄
suff.py
(625 B)
📄
suff.pyc
(916 B)
📄
suff.pyo
(916 B)
📄
svneol.py
(2.87 KB)
📄
svneol.pyc
(2.86 KB)
📄
svneol.pyo
(2.78 KB)
📄
texcheck.py
(9.04 KB)
📄
texcheck.pyc
(8.28 KB)
📄
texcheck.pyo
(8.28 KB)
📄
texi2html.py
(68.19 KB)
📄
texi2html.pyc
(81.9 KB)
📄
texi2html.pyo
(81.9 KB)
📄
treesync.py
(5.65 KB)
📄
treesync.pyc
(5.93 KB)
📄
treesync.pyo
(5.93 KB)
📄
untabify.py
(1.16 KB)
📄
untabify.pyc
(1.53 KB)
📄
untabify.pyo
(1.53 KB)
📄
which.py
(1.6 KB)
📄
which.pyc
(1.62 KB)
📄
which.pyo
(1.62 KB)
📄
win_add2path.py
(1.58 KB)
📄
win_add2path.pyc
(2.09 KB)
📄
win_add2path.pyo
(2.09 KB)
📄
xxci.py
(2.74 KB)
📄
xxci.pyc
(3.97 KB)
📄
xxci.pyo
(3.97 KB)
Editing: pdeps.py
#! /usr/bin/env python2.6 # pdeps # # Find dependencies between a bunch of Python modules. # # Usage: # pdeps file1.py file2.py ... # # Output: # Four tables separated by lines like '--- Closure ---': # 1) Direct dependencies, listing which module imports which other modules # 2) The inverse of (1) # 3) Indirect dependencies, or the closure of the above # 4) The inverse of (3) # # To do: # - command line options to select output type # - option to automatically scan the Python library for referenced modules # - option to limit output to particular modules import sys import re import os # Main program # def main(): args = sys.argv[1:] if not args: print 'usage: pdeps file.py file.py ...' return 2 # table = {} for arg in args: process(arg, table) # print '--- Uses ---' printresults(table) # print '--- Used By ---' inv = inverse(table) printresults(inv) # print '--- Closure of Uses ---' reach = closure(table) printresults(reach) # print '--- Closure of Used By ---' invreach = inverse(reach) printresults(invreach) # return 0 # Compiled regular expressions to search for import statements # m_import = re.compile('^[ \t]*from[ \t]+([^ \t]+)[ \t]+') m_from = re.compile('^[ \t]*import[ \t]+([^#]+)') # Collect data from one file # def process(filename, table): fp = open(filename, 'r') mod = os.path.basename(filename) if mod[-3:] == '.py': mod = mod[:-3] table[mod] = list = [] while 1: line = fp.readline() if not line: break while line[-1:] == '\\': nextline = fp.readline() if not nextline: break line = line[:-1] + nextline if m_import.match(line) >= 0: (a, b), (a1, b1) = m_import.regs[:2] elif m_from.match(line) >= 0: (a, b), (a1, b1) = m_from.regs[:2] else: continue words = line[a1:b1].split(',') # print '#', line, words for word in words: word = word.strip() if word not in list: list.append(word) # Compute closure (this is in fact totally general) # def closure(table): modules = table.keys() # # Initialize reach with a copy of table # reach = {} for mod in modules: reach[mod] = table[mod][:] # # Iterate until no more change # change = 1 while change: change = 0 for mod in modules: for mo in reach[mod]: if mo in modules: for m in reach[mo]: if m not in reach[mod]: reach[mod].append(m) change = 1 # return reach # Invert a table (this is again totally general). # All keys of the original table are made keys of the inverse, # so there may be empty lists in the inverse. # def inverse(table): inv = {} for key in table.keys(): if not inv.has_key(key): inv[key] = [] for item in table[key]: store(inv, item, key) return inv # Store "item" in "dict" under "key". # The dictionary maps keys to lists of items. # If there is no list for the key yet, it is created. # def store(dict, key, item): if dict.has_key(key): dict[key].append(item) else: dict[key] = [item] # Tabulate results neatly # def printresults(table): modules = table.keys() maxlen = 0 for mod in modules: maxlen = max(maxlen, len(mod)) modules.sort() for mod in modules: list = table[mod] list.sort() print mod.ljust(maxlen), ':', if mod in list: print '(*)', for ref in list: print ref, print # Call main and honor exit status if __name__ == '__main__': try: sys.exit(main()) except KeyboardInterrupt: sys.exit(1)
Upload File
Create Folder