-
Notifications
You must be signed in to change notification settings - Fork 3
/
graphviz.go
127 lines (114 loc) · 3.45 KB
/
graphviz.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
//
// Copyright 2022 Google LLC
//
// 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 main
import (
"fmt"
"io"
"sort"
"sync"
"time"
"github.com/cloudspannerecosystem/spanner-change-streams-tail/changestreams"
)
const (
rootPartitionToken = "root"
)
type Partition struct {
Token string
StartTimestamp time.Time
RecordSequence string
Parents []*Partition
}
type PartitionVisualizer struct {
partitions map[string]*Partition
mu sync.Mutex
out io.Writer
}
func NewPartitionVisualizer(out io.Writer) *PartitionVisualizer {
partitions := make(map[string]*Partition)
// Root partition.
partitions[rootPartitionToken] = &Partition{Token: rootPartitionToken}
return &PartitionVisualizer{
partitions: partitions,
out: out,
}
}
func (v *PartitionVisualizer) Read(result *changestreams.ReadResult) error {
v.mu.Lock()
defer v.mu.Unlock()
for _, changeRecord := range result.ChangeRecords {
for _, partitionRecord := range changeRecord.ChildPartitionsRecords {
for _, childPartition := range partitionRecord.ChildPartitions {
token := childPartition.Token
if _, ok := v.partitions[token]; ok {
continue
}
var parents []*Partition
for _, parentToken := range childPartition.ParentPartitionTokens {
parent, ok := v.partitions[parentToken]
// It's possible that parent partition is not included in the specified time range.
if !ok {
parent = &Partition{
Token: parentToken,
}
v.partitions[parentToken] = parent
}
parents = append(parents, parent)
}
if len(parents) == 0 {
parents = append(parents, v.partitions[rootPartitionToken])
}
childPartition := &Partition{
Token: token,
StartTimestamp: partitionRecord.StartTimestamp,
RecordSequence: partitionRecord.RecordSequence,
Parents: parents,
}
v.partitions[token] = childPartition
}
}
}
return nil
}
func (v *PartitionVisualizer) Draw() {
fmt.Fprintf(v.out, "digraph {\n")
fmt.Fprintf(v.out, " node [shape=record];\n")
partitions := sortPartitions(v.partitions)
for _, partition := range partitions {
var timestamp string
if !partition.StartTimestamp.IsZero() {
timestamp = partition.StartTimestamp.Format(time.RFC3339)
}
fmt.Fprintf(v.out, ` "%s" [label="{token|start_timestamp|record_sequence}|{{%s}|{%s}|{%s}}"];`, partition.Token, partition.Token, timestamp, partition.RecordSequence)
fmt.Fprintln(v.out, "")
}
for _, partition := range partitions {
for _, parent := range partition.Parents {
fmt.Fprintf(v.out, ` "%s" -> "%s"`, parent.Token, partition.Token)
fmt.Fprintln(v.out, "")
}
}
fmt.Fprintf(v.out, "}\n")
}
func sortPartitions(partitionsMap map[string]*Partition) []*Partition {
var partitions []*Partition
for _, p := range partitionsMap {
partitions = append(partitions, p)
}
sort.Slice(partitions, func(i, j int) bool {
return partitions[i].Token < partitions[j].Token
})
return partitions
}