/
util.go
114 lines (102 loc) · 3.15 KB
/
util.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
// Licensed to the Apache Software Foundation (ASF) under one or more
// contributor license agreements. See the NOTICE file distributed with
// this work for additional information regarding copyright ownership.
// The ASF licenses this file to You 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 pipelinex
import (
"sort"
pipepb "github.com/apache/beam/sdks/v2/go/pkg/beam/model/pipeline_v1"
"github.com/golang/protobuf/proto"
)
// Bounded returns true iff all PCollections are bounded.
func Bounded(p *pipepb.Pipeline) bool {
for _, col := range p.GetComponents().GetPcollections() {
if col.IsBounded == pipepb.IsBounded_UNBOUNDED {
return false
}
}
return true
}
// ContainerImages returns the set of container images used
// in the given pipeline.
func ContainerImages(p *pipepb.Pipeline) []string {
var ret []string
for _, t := range p.GetComponents().GetEnvironments() {
// TODO(angoenka) 09/14/2018 Check t.Urn before parsing the payload.
var payload pipepb.DockerPayload
proto.Unmarshal(t.GetPayload(), &payload)
ret = append(ret, payload.ContainerImage)
}
return ret
}
// TopologicalSort returns a topologically sorted list of the given
// ids, generally from the same scope/composite. Assumes acyclic graph.
func TopologicalSort(xforms map[string]*pipepb.PTransform, ids []string) []string {
if len(ids) == 0 {
return ids
}
v := newVisiter(xforms, ids)
for _, id := range ids {
v.visit(xforms, id)
}
return v.output
}
type visiter struct {
output []string
index int
seen map[string]bool
next map[string][]string // collection -> transforms
}
func newVisiter(xforms map[string]*pipepb.PTransform, ids []string) *visiter {
ret := &visiter{
output: make([]string, len(ids)),
index: len(ids) - 1,
seen: make(map[string]bool),
next: make(map[string][]string),
}
for _, id := range ids {
for _, in := range xforms[id].Inputs {
ret.next[in] = append(ret.next[in], id)
}
}
for _, ns := range ret.next {
sort.Strings(ns)
}
return ret
}
func (v *visiter) visit(xforms map[string]*pipepb.PTransform, id string) {
if v.seen[id] {
return
}
v.seen[id] = true
// Deterministically iterate through the output keys.
outputKeys := make([]string, 0, len(xforms[id].Outputs))
for _, k := range xforms[id].Outputs {
outputKeys = append(outputKeys, k)
}
sort.Strings(outputKeys)
for _, out := range outputKeys {
for _, next := range v.next[out] {
v.visit(xforms, next)
}
}
v.output[v.index] = id
v.index--
}
// BoolToBounded is a convenience function to get an IsBounded enum value.
func BoolToBounded(bounded bool) pipepb.IsBounded_Enum {
if bounded {
return pipepb.IsBounded_BOUNDED
}
return pipepb.IsBounded_UNBOUNDED
}