/
data.go
229 lines (207 loc) · 4.9 KB
/
data.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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
// Copyright 2017 The go-hep Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package server
import (
"bytes"
"fmt"
"math"
"net/url"
"strings"
"sync"
"gonum.org/v1/plot/vg"
"gonum.org/v1/plot/vg/draw"
"gonum.org/v1/plot/vg/vgsvg"
"go-hep.org/x/hep/hplot"
"go-hep.org/x/hep/rootio"
)
type dbFiles struct {
sync.RWMutex
files map[string]*rootio.File
}
func newDbFiles() *dbFiles {
return &dbFiles{
files: make(map[string]*rootio.File),
}
}
func (db *dbFiles) close() {
db.Lock()
defer db.Unlock()
for _, f := range db.files {
f.Close()
}
db.files = nil
}
func (db *dbFiles) get(name string) *rootio.File {
db.RLock()
defer db.RUnlock()
f, _ := db.files[name]
return f
}
func (db *dbFiles) set(name string, f *rootio.File) {
db.Lock()
defer db.Unlock()
if old, dup := db.files[name]; dup {
old.Close()
}
db.files[name] = f
}
func (db *dbFiles) del(name string) {
db.Lock()
defer db.Unlock()
f, ok := db.files[name]
if !ok {
return
}
f.Close()
delete(db.files, name)
}
type jsNode struct {
ID string `json:"id,omitempty"`
Text string `json:"text,omitempty"`
Icon string `json:"icon,omitempty"`
State struct {
Opened bool `json:"opened,omitempty"`
Disabled bool `json:"disabled,omitempty"`
Selected bool `json:"selected,omitempty"`
} `json:"state,omitempty"`
Children []jsNode `json:"children,omitempty"`
LiAttr jsAttr `json:"li_attr,omitempty"`
Attr jsAttr `json:"a_attr,omitempty"`
}
type jsAttr map[string]interface{}
type brancher interface {
Branches() []rootio.Branch
}
type jsNodes []jsNode
func (p jsNodes) Len() int { return len(p) }
func (p jsNodes) Less(i, j int) bool { return p[i].ID < p[j].ID }
func (p jsNodes) Swap(i, j int) { p[i], p[j] = p[j], p[i] }
func newJsNodes(bres brancher, id string) ([]jsNode, error) {
var err error
branches := bres.Branches()
if len(branches) <= 0 {
return nil, err
}
var nodes []jsNode
for _, b := range branches {
id := strings.Join([]string{id, b.Name()}, "/")
node := jsNode{
ID: id,
Text: b.Name(),
Icon: "fa fa-leaf",
Attr: attrFor(b.(rootio.Object), id),
}
node.Children, err = newJsNodes(b, node.ID)
if err != nil {
return nil, err
}
nodes = append(nodes, node)
}
return nodes, nil
}
func fileJsTree(f *rootio.File, fname string) ([]jsNode, error) {
root := jsNode{
ID: fname,
Text: fmt.Sprintf("%s (version=%v)", fname, f.Version()),
Icon: "fa fa-file",
}
root.State.Opened = true
return dirTree(f, fname, root)
}
func dirTree(dir rootio.Directory, path string, root jsNode) ([]jsNode, error) {
var nodes []jsNode
for _, k := range dir.Keys() {
obj, err := k.Object()
if err != nil {
return nil, fmt.Errorf("failed to extract key %q: %v", k.Name(), err)
}
switch obj := obj.(type) {
case rootio.Tree:
tree := obj
node := jsNode{
ID: strings.Join([]string{path, k.Name()}, "/"),
Text: fmt.Sprintf("%s (entries=%d)", k.Name(), tree.Entries()),
Icon: "fa fa-tree",
}
node.Children, err = newJsNodes(tree, node.ID)
if err != nil {
return nil, err
}
nodes = append(nodes, node)
case rootio.Directory:
dir := obj
node := jsNode{
ID: strings.Join([]string{path, k.Name()}, "/"),
Text: k.Name(),
Icon: "fa fa-folder",
}
node.Children, err = dirTree(dir, path+"/"+k.Name(), node)
if err != nil {
return nil, err
}
node.Children = node.Children[0].Children
nodes = append(nodes, node)
default:
id := strings.Join([]string{path, k.Name() + fmt.Sprintf(";%d", k.Cycle())}, "/")
nodes = append(nodes, jsNode{
ID: id,
Text: fmt.Sprintf("%s;%d", k.Name(), k.Cycle()),
Icon: iconFor(obj),
Attr: attrFor(obj, id),
})
}
}
root.Children = nodes
return []jsNode{root}, nil
}
func iconFor(obj rootio.Object) string {
cls := obj.Class()
switch {
case strings.HasPrefix(cls, "TH1"):
return "fa fa-bar-chart-o"
case strings.HasPrefix(cls, "TH2"):
return "fa fa-bar-chart-o"
case strings.HasPrefix(cls, "TGraph"):
return "fa fa-bar-chart-o"
}
return "fa fa-cube"
}
func attrFor(obj rootio.Object, id string) jsAttr {
id = url.PathEscape(id)
cls := obj.Class()
switch {
case strings.HasPrefix(cls, "TH1"):
return jsAttr{
"plot": true,
"href": "/plot-h1/" + id,
}
case strings.HasPrefix(cls, "TH2"):
return jsAttr{
"plot": true,
"href": "/plot-h2/" + id,
}
case strings.HasPrefix(cls, "TGraph"):
return jsAttr{
"plot": true,
"href": "/plot-s2/" + id,
}
case strings.HasPrefix(cls, "TBranch"):
return jsAttr{
"plot": true,
"href": "/plot-branch/" + id,
}
}
return nil
}
func renderSVG(p *hplot.Plot) ([]byte, error) {
size := 20 * vg.Centimeter
canvas := vgsvg.New(size, size/vg.Length(math.Phi))
p.Draw(draw.New(canvas))
out := new(bytes.Buffer)
_, err := canvas.WriteTo(out)
if err != nil {
return nil, err
}
return out.Bytes(), nil
}