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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
|
#
# Copyright (C) 2000 Stephen Davies
# Copyright (C) 2000 Stefan Seefeld
# All rights reserved.
# Licensed to the public under the terms of the GNU LGPL (>= 2),
# see the file COPYING for details.
#
from Synopsis import config
from Synopsis.Processor import Parameter
from Synopsis import AST, Util
from JSTree import JSTree
from Synopsis.Formatters.HTML.Tags import *
import os
class FileTree(JSTree):
link_to_views = Parameter(False, 'some docs...')
def register(self, processor):
JSTree.register(self, processor)
filename = self.processor.file_layout.special('FileTree')
self.processor.add_root_view(filename, 'File Tree', 'contents', 2)
def filename(self):
"""since FileTree generates a whole file hierarchy, this method returns the current filename,
which may change over the lifetime of this object"""
return self.__filename
def title(self):
"""since FileTree generates a while file hierarchy, this method returns the current title,
which may change over the lifetime of this object"""
return self.__title
def process(self, start):
# Init tree
share = config.datadir
self.js_init(os.path.join(share, 'syn-down.png'),
os.path.join(share, 'syn-right.png'),
os.path.join(share, 'syn-dot.png'),
'tree_%s.png', 0)
# Start the file
filename = self.processor.file_layout.special('FileTree')
self.start_file(filename, 'File Tree')
self.write(self.processor.navigation_bar(filename, 2))
# recursively visit all nodes
self.process_file_tree_node(self.processor.fileTree.root())
self.end_file()
# recursively create all node views
self.process_file_tree_node_view(self.processor.file_tree.root())
def _node_sorter(self, a, b):
a_leaf = hasattr(a, 'decls')
b_leaf = hasattr(b, 'decls')
if a_leaf != b_leaf:
return cmp(b_leaf, a_leaf)
return cmp(string.upper(a.path[-1]), string.upper(b.path[-1]))
def process_file_tree_node(self, node):
if hasattr(node, 'decls'):
# Leaf node
text = href(self.processor.file_layout.file_index(string.join(node.path,
os.sep)),
node.path[-1], target='index')
self.writeLeaf(text)
return
# Non-leaf node
children = node.children.values()
children.sort(self._node_sorter)
if len(node.path):
self.writeNodeStart(node.path[-1]+os.sep)
if len(children):
for child in children:
#self.write('<div class="files">')
self.process_file_tree_node(child)
#self.write('</div>')
if len(node.path):
self.write_node_end()
def process_file_tree_node_view(self, node):
for child in node.children.values():
self.process_file_tree_node_view(child)
if not hasattr(node, 'decls'): return
# set up filename and title for the current view
self.__filename = self.processor.file_layout.file_index(string.join(node.path,
os.sep))
name = list(node.path)
while len(name) and name[0] == '..': del name[0]
self.__title = string.join(name, os.sep)
self.start_file()
self.write(entity('b', string.join(name, os.sep))+'<br/>')
if self.link_to_views:
link = self.processor.file_layout.scoped_special('view', name)
self.write(href(link, '[Source]', target="main")+'<br/>')
for name, decl in node.decls.items():
# TODO make this nicer :)
entry = self.processor.toc[name]
if not entry: print "no entry for",name
else:
# Print link to declaration's view
if isinstance(decl, AST.Function):
self.write(div('href',href(entry.link,escape(Util.ccolonName(decl.realname())),target='main')))
else:
self.write(div('href',href(entry.link,Util.ccolonName(name),target='main')))
# Print comment
#self.write(self.summarizer.getSummary(node.decls[name]))
self.end_file()
|
