/
path.go
57 lines (51 loc) · 1.35 KB
/
path.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
// Copyright 2020 Soluble Inc
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package print
import (
"sort"
"github.com/soluble-ai/go-jnode"
)
type PathSupport struct {
Filter
Path []string
SortBy []string
ComputedColumns map[string]ColumnFunction
Limit int
}
func (p *PathSupport) GetRows(result *jnode.Node) []*jnode.Node {
r := Nav(result, p.Path)
rows := []*jnode.Node{}
for _, row := range r.Elements() {
if p.Filter != nil && !p.Matches(row) {
continue
}
for name, f := range p.ComputedColumns {
row.Put(name, f(row))
}
rows = append(rows, row)
}
if p.SortBy != nil {
sort.Sort(&rowsSort{rows, p.SortBy})
}
if p.Limit > 0 && len(rows) > p.Limit {
rows = rows[:p.Limit]
}
return rows
}
func Nav(n *jnode.Node, path []string) *jnode.Node {
for _, p := range path {
n = n.Path(p)
}
return n
}