-
Notifications
You must be signed in to change notification settings - Fork 4
/
ddt.go
50 lines (41 loc) · 1.31 KB
/
ddt.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
package ddt
import (
"errors"
"github.com/sgrodriguez/ddt/function"
)
// Tree Type
type Tree struct {
Root *Node `json:"-"`
Functions map[string]function.PreProcessFn `json:"-"`
Name string `json:"name"`
}
// NewTree creates a tree
func NewTree(name string, rootNode *Node, fn ...function.PreProcessFn) (*Tree, error) {
if !isValidRootNode(rootNode) {
return nil, errors.New("invalid root node")
}
return &Tree{Name: name, Functions: addNewPreProcessFn(fn), Root: rootNode}, nil
}
// ResolveTree resolves a tree given a input
func ResolveTree(t *Tree, input interface{}) (interface{}, error) {
return t.Root.NextNode(input)
}
// DefaultFns default function
var DefaultFns = []function.PreProcessFn{
{Function: function.CallStructMethod, Name: "CallStructMethod"},
{Function: function.GetStructAttribute, Name: "GetStructAttribute"},
}
func addNewPreProcessFn(newPreProcessFn []function.PreProcessFn) map[string]function.PreProcessFn {
newPreProcessFn = append(newPreProcessFn, DefaultFns...)
res := map[string]function.PreProcessFn{}
for _, p := range newPreProcessFn {
res[p.Name] = p
}
return res
}
func isRoot(n *Node) bool {
return n.ID == 0
}
func isValidRootNode(n *Node) bool {
return n.ID == 0 && n.ParentID == -1 && n.Result == nil
}