Browse Source

pre-merge: step 4

suites/jessie-proposed-backports
Sandro Tosi 14 years ago
parent
commit
fd9eadb10f
  1. 0
      reportbug/exceptions.py
  2. 0
      reportbug/submit.py
  3. 0
      reportbug/tempfiles.py
  4. 44
      reportbug/test_hiermatch.py
  5. 0
      reportbug/ui/next.py
  6. 0
      reportbug/ui/text.py
  7. 0
      reportbug/ui/urwid.py
  8. 0
      reportbug/utils.py

0
reportbug/reportbug_exceptions.py → reportbug/exceptions.py

0
reportbug/reportbug_submit.py → reportbug/submit.py

0
reportbug/rbtempfile.py → reportbug/tempfiles.py

44
reportbug/test_hiermatch.py

@ -0,0 +1,44 @@
# $Id: test_hiermatch.py,v 1.1.1.1 2004-02-05 04:29:08 lawrencc Exp $
from reportbuglib import hiermatch as hier
def test_list():
import sys
a = file(sys.argv[0]).readlines()
b = hier.grep_list(a, '\[.*\]')
for i in b:
print a[i].rstrip()
print '*'*40
c = hier.grep_list(a, 'print', b)
for i in c:
print a[i].rstrip()
def test_hier():
import sys
a = file(sys.argv[0]).readlines()
b = [(1, a)]
c = hier.egrep_hierarchy(b, 'print', )
print c
for i in range(len(c)):
for k in c[i]:
print b[i][1][k].rstrip()
d = hier.egrep_hierarchy(b, '\[.*\]', c)
print d
for i in range(len(d)):
for k in d[i]:
print b[i][1][k].rstrip()
def test_mhier():
import sys
a = file(sys.argv[0]).readlines()
b = [(1, a)]
c = hier.matched_hierarchy(b, 'print', )
print c
d = [len(i[1]) for i in c]
print reduce(lambda x, y: x+y, d)
test_mhier()
# vim:ts=8:sw=4:expandtab:

0
reportbug/reportbug_ui_newt.py → reportbug/ui/next.py

0
reportbug/reportbug_ui_text.py → reportbug/ui/text.py

0
reportbug/reportbug_ui_urwid.py → reportbug/ui/urwid.py

0
reportbug/reportbug.py → reportbug/utils.py

Loading…
Cancel
Save