forked from cayleygraph/cayley
-
Notifications
You must be signed in to change notification settings - Fork 0
/
result_tree_evaluator.go
70 lines (62 loc) · 1.59 KB
/
result_tree_evaluator.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
// Copyright 2014 The Cayley Authors. All rights reserved.
//
// 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 graph
import (
"container/list"
"fmt"
)
type ResultTree struct {
result TSVal
subtrees *list.List
}
func NewResultTree(result TSVal) *ResultTree {
var tree ResultTree
tree.subtrees = list.New()
tree.result = result
return &tree
}
func (tree *ResultTree) ToString() string {
base := fmt.Sprintf("(%d", tree.result)
if tree.subtrees.Len() != 0 {
for e := tree.subtrees.Front(); e != nil; e = e.Next() {
base += fmt.Sprintf(" %s", (e.Value.(*ResultTree)).ToString())
}
}
base += ")"
return base
}
func (tree *ResultTree) AddSubtree(sub *ResultTree) {
tree.subtrees.PushBack(sub)
}
func StringResultTreeEvaluator(it Iterator) string {
ok := true
out := ""
for {
_, ok = it.Next()
if !ok {
break
}
out += it.GetResultTree().ToString()
out += "\n"
for it.NextResult() == true {
out += " "
out += it.GetResultTree().ToString()
out += "\n"
}
}
return out
}
func PrintResultTreeEvaluator(it Iterator) {
fmt.Print(StringResultTreeEvaluator(it))
}