-
Notifications
You must be signed in to change notification settings - Fork 0
/
xmlenum.go
133 lines (123 loc) · 2.4 KB
/
xmlenum.go
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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
package main
import (
"flag"
"fmt"
"log"
"os"
"sort"
"xml"
)
type TagMap map[string]TagMap
var (
depth = 0 // debugging
maxDepth = 10
)
func main() {
log.SetPrefix("")
log.SetFlags(0)
flag.Parse()
if flag.NArg() < 2 {
log.Fatalf("usage: xmlenum FIRST_ELEMENT_NAME FILES*\n")
}
firstElementName := flag.Args()[0]
filepaths := flag.Args()[1:]
files := make([]*os.File, len(filepaths))
for i, fp := range filepaths {
f, err := os.Open(fp)
if err != nil {
log.Fatalf("Couldn't open %s: %v\n", fp, err)
}
files[i] = f
defer f.Close()
}
toplevel := TagMap{}
for i, f := range files {
p := xml.NewParser(f)
err := start(p, firstElementName, toplevel)
if err != nil && err != os.EOF {
log.Fatalf("Couldn't parse %s: %v\n", filepaths[i], err)
}
}
sortedPrint(toplevel, 0)
}
func start(p *xml.Parser, name string, m TagMap) os.Error {
for {
// if depth > maxDepth { // debugging
// return nil
// }
tok, err := p.Token()
if err != nil {
return err
}
switch t := tok.(type) {
case xml.StartElement:
if t.Name.Local == name {
if _, found := m[name]; !found {
m[name] = TagMap{}
}
err = recurse(p, name, m[name])
}
}
if err != nil {
return err
}
}
return nil
}
func recurse(p *xml.Parser, name string, m TagMap) os.Error {
// depth++ // debugging
for {
// if depth > maxDepth { // debugging
// return nil
// }
tok, err := p.Token()
if err != nil {
return err
}
switch t := tok.(type) {
case xml.StartElement:
if m[t.Name.Local] == nil {
m[t.Name.Local] = TagMap{}
}
err = recurse(p, t.Name.Local, m[t.Name.Local])
if err != nil {
return err
}
case xml.EndElement:
// If ending the element we entered recurse for, return
if t.Name.Local == name {
return nil
}
}
}
return nil
}
// Print tags that contain only text first, then tags with children.
func sortedPrint(m TagMap, indent int) {
simple := make([]string, 0, len(m))
nested := make([]string, 0, len(m))
for k, v := range m {
if len(v) == 0 {
simple = append(simple, k)
} else {
nested = append(nested, k)
}
}
sort.Strings(simple)
sort.Strings(nested)
keys := append(simple, nested...)
for _, k := range keys {
if (indent > 0) {
fmt.Printf("%*s%s", indent, " ", k)
} else {
fmt.Printf("%s", k)
}
v := m[k]
if v != nil {
fmt.Printf("\n")
sortedPrint(v, indent+4)
} else {
fmt.Printf("\n")
}
}
}