summaryrefslogtreecommitdiffstats
path: root/bin
diff options
context:
space:
mode:
authorSteven Knight <knight@baldmt.com>2005-10-13 13:26:39 (GMT)
committerSteven Knight <knight@baldmt.com>2005-10-13 13:26:39 (GMT)
commit23cba392cd6b316d2e641948954b4e2f001de73b (patch)
treec6aab9a69e418efb3736aaa92dc5e5952c3511ba /bin
parentb66cc02737a68972e1302ea2ce041928a05720d1 (diff)
downloadSCons-23cba392cd6b316d2e641948954b4e2f001de73b.zip
SCons-23cba392cd6b316d2e641948954b4e2f001de73b.tar.gz
SCons-23cba392cd6b316d2e641948954b4e2f001de73b.tar.bz2
Have the QT UIC Scanner use the env.FindFile method. (Leanid Nazdrynau)
Diffstat (limited to 'bin')
-rw-r--r--bin/import-test.py98
1 files changed, 98 insertions, 0 deletions
diff --git a/bin/import-test.py b/bin/import-test.py
new file mode 100644
index 0000000..1399557
--- /dev/null
+++ b/bin/import-test.py
@@ -0,0 +1,98 @@
+#!/usr/bin/env python
+#
+# __COPYRIGHT__
+#
+# tree2test.py - turn a directory tree into TestSCons code
+#
+# A quick script for importing directory hierarchies containing test
+# cases that people supply (typically in a .zip or .tar.gz file) into a
+# TestSCons.py script. No error checking or options yet, it just walks
+# the first command-line argument (assumed to be the directory containing
+# the test case) and spits out code looking like the following:
+#
+# test.subdir(['sub1'],
+# ['sub1', 'sub2'])
+#
+# test.write(['sub1', 'file1'], """\
+# contents of file1
+# """)
+#
+# test.write(['sub1', 'sub2', 'file2'], """\
+# contents of file2
+# """)
+#
+# There's no massaging of contents, so any files that themselves contain
+# """ triple-quotes will need to have their contents edited by hand.
+#
+
+__revision__ = "__FILE__ __REVISION__ __DATE__ __DEVELOPER__"
+
+import os.path
+import sys
+
+directory = sys.argv[1]
+
+Top = None
+TopPath = None
+
+class Dir:
+ def __init__(self, path):
+ self.path = path
+ self.entries = {}
+ def call_for_each_entry(self, func):
+ entries = self.entries
+ names = entries.keys()
+ names.sort()
+ for name in names:
+ func(name, entries[name])
+
+def lookup(dirname):
+ global Top, TopPath
+ if not Top:
+ Top = Dir([])
+ TopPath = dirname + os.sep
+ return Top
+ dirname = dirname.replace(TopPath, '')
+ dirs = dirname.split(os.sep)
+ t = Top
+ for d in dirs[:-1]:
+ t = t.entries[d]
+ node = t.entries[dirs[-1]] = Dir(dirs)
+ return node
+
+def make_nodes(arg, dirname, fnames):
+ dir = lookup(dirname)
+ for f in fnames:
+ dir.entries[f] = None
+
+def collect_dirs(l, dir):
+ if dir.path:
+ l.append(dir.path)
+ def recurse(n, d):
+ if d:
+ collect_dirs(l, d)
+ dir.call_for_each_entry(recurse)
+
+def print_files(dir):
+ def print_a_file(n, d):
+ if not d:
+ l = dir.path + [n]
+ sys.stdout.write('\ntest.write(%s, """\\\n' % l)
+ p = os.path.join(*([directory] + l))
+ sys.stdout.write(open(p, 'r').read())
+ sys.stdout.write('""")\n')
+ dir.call_for_each_entry(print_a_file)
+
+ def recurse(n, d):
+ if d:
+ print_files(d)
+ dir.call_for_each_entry(recurse)
+
+os.path.walk(directory, make_nodes, None)
+
+subdir_list = []
+collect_dirs(subdir_list, Top)
+subdir_list = [ str(l) for l in subdir_list ]
+sys.stdout.write('test.subdir(' + ',\n '.join(subdir_list) + ')\n')
+
+print_files(Top)