Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(297)

Side by Side Diff: common/api/dm/service/v1/walk_graph.pb.go

Issue 1537883002: Initial distributor implementation (Closed) Base URL: https://chromium.googlesource.com/external/github.com/luci/luci-go@master
Patch Set: fix imports and make dummy.go a real file Created 4 years, 6 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
1 // Code generated by protoc-gen-go. 1 // Code generated by protoc-gen-go.
2 // source: walk_graph.proto 2 // source: walk_graph.proto
3 // DO NOT EDIT! 3 // DO NOT EDIT!
4 4
5 package dm 5 package dm
6 6
7 import proto "github.com/golang/protobuf/proto" 7 import proto "github.com/golang/protobuf/proto"
8 import fmt "fmt" 8 import fmt "fmt"
9 import math "math" 9 import math "math"
10 import google_protobuf2 "github.com/luci/luci-go/common/proto/google" 10 import google_protobuf1 "github.com/luci/luci-go/common/proto/google"
11 import _ "github.com/luci/luci-go/common/proto/google" 11 import _ "github.com/luci/luci-go/common/proto/google"
12 12
13 // Reference imports to suppress errors if they are not otherwise used. 13 // Reference imports to suppress errors if they are not otherwise used.
14 var _ = proto.Marshal 14 var _ = proto.Marshal
15 var _ = fmt.Errorf 15 var _ = fmt.Errorf
16 var _ = math.Inf 16 var _ = math.Inf
17 17
18 // Direction indicates that direction of dependencies that the request should 18 // Direction indicates that direction of dependencies that the request should
19 // walk. 19 // walk.
20 type WalkGraphReq_Mode_Direction int32 20 type WalkGraphReq_Mode_Direction int32
(...skipping 12 matching lines...) Expand all
33 var WalkGraphReq_Mode_Direction_value = map[string]int32{ 33 var WalkGraphReq_Mode_Direction_value = map[string]int32{
34 "FORWARDS": 0, 34 "FORWARDS": 0,
35 "BACKWARDS": 1, 35 "BACKWARDS": 1,
36 "BOTH": 2, 36 "BOTH": 2,
37 } 37 }
38 38
39 func (x WalkGraphReq_Mode_Direction) String() string { 39 func (x WalkGraphReq_Mode_Direction) String() string {
40 return proto.EnumName(WalkGraphReq_Mode_Direction_name, int32(x)) 40 return proto.EnumName(WalkGraphReq_Mode_Direction_name, int32(x))
41 } 41 }
42 func (WalkGraphReq_Mode_Direction) EnumDescriptor() ([]byte, []int) { 42 func (WalkGraphReq_Mode_Direction) EnumDescriptor() ([]byte, []int) {
43 » return fileDescriptor8, []int{0, 0, 0} 43 » return fileDescriptor7, []int{0, 0, 0}
44 } 44 }
45 45
46 // WalkGraphReq allows you to walk from one or more Quests through their 46 // WalkGraphReq allows you to walk from one or more Quests through their
47 // Attempt's forward dependencies. 47 // Attempt's forward dependencies.
48 // 48 //
49 // 49 //
50 // The handler will evaluate all of the queries, executing them in parallel. 50 // The handler will evaluate all of the queries, executing them in parallel.
51 // For each attempt or quest produced by the query, it will queue a walk 51 // For each attempt or quest produced by the query, it will queue a walk
52 // operation for that node, respecting the options set (max_depth, etc.). 52 // operation for that node, respecting the options set (max_depth, etc.).
53 type WalkGraphReq struct { 53 type WalkGraphReq struct {
54 // optional. See Include.AttemptResult for restrictions. 54 // optional. See Include.AttemptResult for restrictions.
55 Auth *Execution_Auth `protobuf:"bytes,1,opt,name=auth" json:"auth,omitem pty"` 55 Auth *Execution_Auth `protobuf:"bytes,1,opt,name=auth" json:"auth,omitem pty"`
56 // Query specifies a list of queries to start the graph traversal on. Th e 56 // Query specifies a list of queries to start the graph traversal on. Th e
57 // traversal will occur as a union of the query results. Redundant 57 // traversal will occur as a union of the query results. Redundant
58 // specification will not cause additional heavy work; every graph node will 58 // specification will not cause additional heavy work; every graph node will
59 // be processed exactly once, regardless of how many times it appears in the 59 // be processed exactly once, regardless of how many times it appears in the
60 // query results. However, redundancy in the queries will cause the serv er to 60 // query results. However, redundancy in the queries will cause the serv er to
61 // retrieve and discard more information. 61 // retrieve and discard more information.
62 Query *GraphQuery `protobuf:"bytes,2,opt,name=query" json:"query ,omitempty"` 62 Query *GraphQuery `protobuf:"bytes,2,opt,name=query" json:"query ,omitempty"`
63 Mode *WalkGraphReq_Mode `protobuf:"bytes,3,opt,name=mode" json:"mode,o mitempty"` 63 Mode *WalkGraphReq_Mode `protobuf:"bytes,3,opt,name=mode" json:"mode,o mitempty"`
64 Limit *WalkGraphReq_Limit `protobuf:"bytes,4,opt,name=limit" json:"limit ,omitempty"` 64 Limit *WalkGraphReq_Limit `protobuf:"bytes,4,opt,name=limit" json:"limit ,omitempty"`
65 // Include allows you to add additional information to the returned 65 // Include allows you to add additional information to the returned
66 // GraphData which is typically medium-to-large sized. 66 // GraphData which is typically medium-to-large sized.
67 Include *WalkGraphReq_Include `protobuf:"bytes,5,opt,name=include" json: "include,omitempty"` 67 Include *WalkGraphReq_Include `protobuf:"bytes,5,opt,name=include" json: "include,omitempty"`
68 } 68 }
69 69
70 func (m *WalkGraphReq) Reset() { *m = WalkGraphReq{} } 70 func (m *WalkGraphReq) Reset() { *m = WalkGraphReq{} }
71 func (m *WalkGraphReq) String() string { return proto.CompactTextStri ng(m) } 71 func (m *WalkGraphReq) String() string { return proto.CompactTextStri ng(m) }
72 func (*WalkGraphReq) ProtoMessage() {} 72 func (*WalkGraphReq) ProtoMessage() {}
73 func (*WalkGraphReq) Descriptor() ([]byte, []int) { return fileDescriptor8, []in t{0} } 73 func (*WalkGraphReq) Descriptor() ([]byte, []int) { return fileDescriptor7, []in t{0} }
74 74
75 func (m *WalkGraphReq) GetAuth() *Execution_Auth { 75 func (m *WalkGraphReq) GetAuth() *Execution_Auth {
76 if m != nil { 76 if m != nil {
77 return m.Auth 77 return m.Auth
78 } 78 }
79 return nil 79 return nil
80 } 80 }
81 81
82 func (m *WalkGraphReq) GetQuery() *GraphQuery { 82 func (m *WalkGraphReq) GetQuery() *GraphQuery {
83 if m != nil { 83 if m != nil {
(...skipping 28 matching lines...) Expand all
112 // Since the load operation is multi-threaded, the search order is best 112 // Since the load operation is multi-threaded, the search order is best
113 // effort, but will actually be some hybrid between DFS and BFS. This se tting 113 // effort, but will actually be some hybrid between DFS and BFS. This se tting
114 // controls the bias direction of the hybrid loading algorithm. 114 // controls the bias direction of the hybrid loading algorithm.
115 Dfs bool `protobuf:"varint,1,opt,name=dfs" json:"dfs,omitempty"` 115 Dfs bool `protobuf:"varint,1,opt,name=dfs" json:"dfs,omitempty"`
116 Direction WalkGraphReq_Mode_Direction `protobuf:"varint,2,opt,name=direc tion,enum=dm.WalkGraphReq_Mode_Direction" json:"direction,omitempty"` 116 Direction WalkGraphReq_Mode_Direction `protobuf:"varint,2,opt,name=direc tion,enum=dm.WalkGraphReq_Mode_Direction" json:"direction,omitempty"`
117 } 117 }
118 118
119 func (m *WalkGraphReq_Mode) Reset() { *m = WalkGraphReq_Mode{ } } 119 func (m *WalkGraphReq_Mode) Reset() { *m = WalkGraphReq_Mode{ } }
120 func (m *WalkGraphReq_Mode) String() string { return proto.CompactTex tString(m) } 120 func (m *WalkGraphReq_Mode) String() string { return proto.CompactTex tString(m) }
121 func (*WalkGraphReq_Mode) ProtoMessage() {} 121 func (*WalkGraphReq_Mode) ProtoMessage() {}
122 func (*WalkGraphReq_Mode) Descriptor() ([]byte, []int) { return fileDescriptor8, []int{0, 0} } 122 func (*WalkGraphReq_Mode) Descriptor() ([]byte, []int) { return fileDescriptor7, []int{0, 0} }
123 123
124 type WalkGraphReq_Limit struct { 124 type WalkGraphReq_Limit struct {
125 // MaxDepth sets the number of attempts to traverse; 0 means 'immediate' 125 // MaxDepth sets the number of attempts to traverse; 0 means 'immediate'
126 // (no dependencies), -1 means 'no limit', and >0 is a limit. 126 // (no dependencies), -1 means 'no limit', and >0 is a limit.
127 // 127 //
128 // Any negative value besides -1 is an error. 128 // Any negative value besides -1 is an error.
129 MaxDepth int64 `protobuf:"varint,1,opt,name=max_depth,json=maxDepth" jso n:"max_depth,omitempty"` 129 MaxDepth int64 `protobuf:"varint,1,opt,name=max_depth,json=maxDepth" jso n:"max_depth,omitempty"`
130 // MaxTime sets the maximum amount of time that the query processor shou ld 130 // MaxTime sets the maximum amount of time that the query processor shou ld
131 // take. Application of this deadline is 'best effort', which means the query 131 // take. Application of this deadline is 'best effort', which means the query
132 // may take a bit longer than this timeout and still attempt to return d ata. 132 // may take a bit longer than this timeout and still attempt to return d ata.
133 // 133 //
134 // This is different than the grpc timeout header, which will set a hard 134 // This is different than the grpc timeout header, which will set a hard
135 // deadline for the request. 135 // deadline for the request.
136 » MaxTime *google_protobuf2.Duration `protobuf:"bytes,2,opt,name=max_time, json=maxTime" json:"max_time,omitempty"` 136 » MaxTime *google_protobuf1.Duration `protobuf:"bytes,2,opt,name=max_time, json=maxTime" json:"max_time,omitempty"`
137 // MaxDataSize sets the maximum amount of 'Data' (in bytes) that can be 137 // MaxDataSize sets the maximum amount of 'Data' (in bytes) that can be
138 // returned, if include.quest_data, include.attempt_data, and/or 138 // returned, if include.quest_data, include.attempt_data, and/or
139 // include.attempt_result are set. If this limit is hit, then the 139 // include.attempt_result are set. If this limit is hit, then the
140 // appropriate 'partial' value will be set for that object, but the base 140 // appropriate 'partial' value will be set for that object, but the base
141 // object would still be included in the result. 141 // object would still be included in the result.
142 // 142 //
143 // If this limit is 0, a default limit of 16MB will be used. If this lim it 143 // If this limit is 0, a default limit of 16MB will be used. If this lim it
144 // exceeds 30MB, it will be reduced to 30MB. 144 // exceeds 30MB, it will be reduced to 30MB.
145 MaxDataSize uint32 `protobuf:"varint,3,opt,name=max_data_size,json=maxDa taSize" json:"max_data_size,omitempty"` 145 MaxDataSize uint32 `protobuf:"varint,3,opt,name=max_data_size,json=maxDa taSize" json:"max_data_size,omitempty"`
146 } 146 }
147 147
148 func (m *WalkGraphReq_Limit) Reset() { *m = WalkGraphReq_Limi t{} } 148 func (m *WalkGraphReq_Limit) Reset() { *m = WalkGraphReq_Limi t{} }
149 func (m *WalkGraphReq_Limit) String() string { return proto.CompactTe xtString(m) } 149 func (m *WalkGraphReq_Limit) String() string { return proto.CompactTe xtString(m) }
150 func (*WalkGraphReq_Limit) ProtoMessage() {} 150 func (*WalkGraphReq_Limit) ProtoMessage() {}
151 func (*WalkGraphReq_Limit) Descriptor() ([]byte, []int) { return fileDescriptor8 , []int{0, 1} } 151 func (*WalkGraphReq_Limit) Descriptor() ([]byte, []int) { return fileDescriptor7 , []int{0, 1} }
152 152
153 func (m *WalkGraphReq_Limit) GetMaxTime() *google_protobuf2.Duration { 153 func (m *WalkGraphReq_Limit) GetMaxTime() *google_protobuf1.Duration {
154 if m != nil { 154 if m != nil {
155 return m.MaxTime 155 return m.MaxTime
156 } 156 }
157 return nil 157 return nil
158 } 158 }
159 159
160 type WalkGraphReq_Include struct { 160 type WalkGraphReq_Include struct {
161 // ObjectIds fills the 'Id' field of Quest, Attempt, and Execution objec ts. 161 // ObjectIds fills the 'Id' field of Quest, Attempt, and Execution objec ts.
162 // If this is false, then those fields will be omitted. 162 // If this is false, then those fields will be omitted.
163 ObjectIds bool `protobuf:"varint,1,opt,name=object_ids,json=objectIds" j son:"object_ids,omitempty"` 163 ObjectIds bool `protobuf:"varint,1,opt,name=object_ids,json=objectIds" j son:"object_ids,omitempty"`
(...skipping 13 matching lines...) Expand all
177 // 177 //
178 // If the request would return more than limit.max_data_size of data, th e 178 // If the request would return more than limit.max_data_size of data, th e
179 // remaining attempt results will have their Partial.Data field set to t rue. 179 // remaining attempt results will have their Partial.Data field set to t rue.
180 AttemptResult bool `protobuf:"varint,4,opt,name=attempt_result,json=atte mptResult" json:"attempt_result,omitempty"` 180 AttemptResult bool `protobuf:"varint,4,opt,name=attempt_result,json=atte mptResult" json:"attempt_result,omitempty"`
181 // ExpiredAttempts allows you to view attempts which have expired result s, 181 // ExpiredAttempts allows you to view attempts which have expired result s,
182 // which are normally excluded from the graph. 182 // which are normally excluded from the graph.
183 ExpiredAttempts bool `protobuf:"varint,5,opt,name=expired_attempts,json= expiredAttempts" json:"expired_attempts,omitempty"` 183 ExpiredAttempts bool `protobuf:"varint,5,opt,name=expired_attempts,json= expiredAttempts" json:"expired_attempts,omitempty"`
184 // Executions is the number of Executions to include per Attempt. If thi s 184 // Executions is the number of Executions to include per Attempt. If thi s
185 // is 0, then the execution data will be omitted completely. 185 // is 0, then the execution data will be omitted completely.
186 NumExecutions uint32 `protobuf:"varint,6,opt,name=num_executions,json=nu mExecutions" json:"num_executions,omitempty"` 186 NumExecutions uint32 `protobuf:"varint,6,opt,name=num_executions,json=nu mExecutions" json:"num_executions,omitempty"`
187 // ExecutionInfoUrl fills in the Execution.DistributorInfo.Url value. Th is
188 // has some minor overhead, but is useful if you need to present clickab le
189 // links for humans.
190 ExecutionInfoUrl bool `protobuf:"varint,7,opt,name=execution_info_url,js on=executionInfoUrl" json:"execution_info_url,omitempty"`
187 // FwdDeps instructs WalkGraph to include forward dependency information 191 // FwdDeps instructs WalkGraph to include forward dependency information
188 // from the result. This only changes the presence of information in the 192 // from the result. This only changes the presence of information in the
189 // result; if the query is walking forward attempt dependencies, that wi ll 193 // result; if the query is walking forward attempt dependencies, that wi ll
190 // still occur even if this is false. 194 // still occur even if this is false.
191 » FwdDeps bool `protobuf:"varint,7,opt,name=fwd_deps,json=fwdDeps" json:"f wd_deps,omitempty"` 195 » FwdDeps bool `protobuf:"varint,8,opt,name=fwd_deps,json=fwdDeps" json:"f wd_deps,omitempty"`
192 // BackDeps instructs WalkGraph to include the backwards dependency 196 // BackDeps instructs WalkGraph to include the backwards dependency
193 // information. This only changes the presence of information in the res ult; 197 // information. This only changes the presence of information in the res ult;
194 // if the query is walking backward attempt dependencies, that will stil l 198 // if the query is walking backward attempt dependencies, that will stil l
195 // occur even if this is false. 199 // occur even if this is false.
196 » BackDeps bool `protobuf:"varint,8,opt,name=back_deps,json=backDeps" json :"back_deps,omitempty"` 200 » BackDeps bool `protobuf:"varint,9,opt,name=back_deps,json=backDeps" json :"back_deps,omitempty"`
197 } 201 }
198 202
199 func (m *WalkGraphReq_Include) Reset() { *m = WalkGraphReq_In clude{} } 203 func (m *WalkGraphReq_Include) Reset() { *m = WalkGraphReq_In clude{} }
200 func (m *WalkGraphReq_Include) String() string { return proto.Compact TextString(m) } 204 func (m *WalkGraphReq_Include) String() string { return proto.Compact TextString(m) }
201 func (*WalkGraphReq_Include) ProtoMessage() {} 205 func (*WalkGraphReq_Include) ProtoMessage() {}
202 func (*WalkGraphReq_Include) Descriptor() ([]byte, []int) { return fileDescripto r8, []int{0, 2} } 206 func (*WalkGraphReq_Include) Descriptor() ([]byte, []int) { return fileDescripto r7, []int{0, 2} }
203 207
204 func init() { 208 func init() {
205 proto.RegisterType((*WalkGraphReq)(nil), "dm.WalkGraphReq") 209 proto.RegisterType((*WalkGraphReq)(nil), "dm.WalkGraphReq")
206 proto.RegisterType((*WalkGraphReq_Mode)(nil), "dm.WalkGraphReq.Mode") 210 proto.RegisterType((*WalkGraphReq_Mode)(nil), "dm.WalkGraphReq.Mode")
207 proto.RegisterType((*WalkGraphReq_Limit)(nil), "dm.WalkGraphReq.Limit") 211 proto.RegisterType((*WalkGraphReq_Limit)(nil), "dm.WalkGraphReq.Limit")
208 proto.RegisterType((*WalkGraphReq_Include)(nil), "dm.WalkGraphReq.Includ e") 212 proto.RegisterType((*WalkGraphReq_Include)(nil), "dm.WalkGraphReq.Includ e")
209 proto.RegisterEnum("dm.WalkGraphReq_Mode_Direction", WalkGraphReq_Mode_D irection_name, WalkGraphReq_Mode_Direction_value) 213 proto.RegisterEnum("dm.WalkGraphReq_Mode_Direction", WalkGraphReq_Mode_D irection_name, WalkGraphReq_Mode_Direction_value)
210 } 214 }
211 215
212 var fileDescriptor8 = []byte{ 216 var fileDescriptor7 = []byte{
213 » // 536 bytes of a gzipped FileDescriptorProto 217 » // 556 bytes of a gzipped FileDescriptorProto
214 » 0x1f, 0x8b, 0x08, 0x00, 0x00, 0x09, 0x6e, 0x88, 0x02, 0xff, 0x6c, 0x92, 0xdd, 0x6f, 0xd3, 0x30, 218 » 0x1f, 0x8b, 0x08, 0x00, 0x00, 0x09, 0x6e, 0x88, 0x02, 0xff, 0x6c, 0x92, 0xcb, 0x6e, 0xd3, 0x40,
215 » 0x14, 0xc5, 0xe9, 0x77, 0x7a, 0xfb, 0x41, 0xb0, 0x04, 0xca, 0x82, 0x60, 0x50, 0x01, 0x02, 0x09, 219 » 0x14, 0x86, 0xc9, 0xdd, 0x3e, 0xb9, 0x60, 0x46, 0x02, 0xb9, 0x46, 0x50, 0x88, 0x00, 0x81, 0x84,
216 » 0x65, 0x52, 0xe1, 0x95, 0x87, 0x8e, 0xf2, 0x31, 0x01, 0x9a, 0xf0, 0x26, 0xed, 0x31, 0x72, 0x6b, 220 » 0x5c, 0x29, 0xb0, 0x65, 0x91, 0x12, 0x2e, 0x11, 0xa0, 0x8a, 0x69, 0x51, 0x97, 0x96, 0x93, 0x99,
217 » 0xb7, 0x0b, 0x4b, 0x9a, 0x2c, 0x76, 0xb4, 0x8e, 0x07, 0xfe, 0x01, 0x9e, 0x79, 0xe2, 0x9f, 0xc5, 221 » 0xa4, 0xa6, 0x76, 0xec, 0x7a, 0xc6, 0x6a, 0xca, 0x82, 0x17, 0xe0, 0xb1, 0x58, 0xf1, 0x56, 0xcc,
218 » 0xbe, 0x76, 0x06, 0x62, 0x7b, 0xab, 0xcf, 0xf9, 0xf5, 0xc4, 0xf7, 0xf8, 0x82, 0x7f, 0xc1, 0xd2, 222 » 0x9c, 0x19, 0x07, 0x44, 0xd9, 0x65, 0xfe, 0xff, 0xcb, 0xef, 0x73, 0x03, 0xef, 0x32, 0x4e, 0xcf,
219 » 0xb3, 0x78, 0x5d, 0xb2, 0xe2, 0x34, 0x2a, 0xca, 0x5c, 0xe5, 0xa4, 0xc9, 0xb3, 0xf0, 0xe1, 0x3a, 223 » 0xa3, 0x75, 0x19, 0x17, 0x67, 0x61, 0x51, 0xe6, 0x32, 0x27, 0x4d, 0x96, 0x05, 0xf7, 0xd7, 0x79,
220 » 0xcf, 0xd7, 0xa9, 0xd8, 0x43, 0x65, 0x51, 0xad, 0xf6, 0x78, 0x55, 0x32, 0x95, 0xe4, 0x1b, 0xcb, 224 » 0xbe, 0x4e, 0xf9, 0x01, 0x2a, 0x8b, 0x6a, 0x75, 0xc0, 0xaa, 0x32, 0x96, 0x49, 0xbe, 0x31, 0x4c,
221 » 0x84, 0xbb, 0xff, 0xfb, 0x2a, 0xc9, 0x84, 0x54, 0x2c, 0x2b, 0x1c, 0xe0, 0x63, 0x62, 0xcc, 0x99, 225 » 0xb0, 0xff, 0xaf, 0x2f, 0x93, 0x8c, 0x0b, 0x19, 0x67, 0x85, 0x05, 0x3c, 0x4c, 0x8c, 0x58, 0x2c,
222 » 0x62, 0x4e, 0xb9, 0x63, 0x95, 0xf3, 0x4a, 0x94, 0x97, 0x4e, 0x1a, 0xa8, 0xcb, 0x42, 0x48, 0x7b, 226 » 0x63, 0xab, 0xdc, 0x32, 0xca, 0x45, 0xc5, 0xcb, 0x2b, 0x2b, 0xf5, 0xe5, 0x55, 0xc1, 0x85, 0x79,
223 » 0x98, 0xfc, 0xea, 0xc2, 0xf0, 0x44, 0xdf, 0xe5, 0x83, 0xc1, 0xa8, 0x38, 0x27, 0xcf, 0xa0, 0xcd, 227 » 0x8c, 0x7f, 0x76, 0x61, 0x70, 0xaa, 0x6a, 0x79, 0xa7, 0x31, 0xca, 0x2f, 0xc8, 0x13, 0x68, 0xc7,
224 » 0x2a, 0x75, 0x1a, 0x34, 0x1e, 0x35, 0x9e, 0x0f, 0xa6, 0x24, 0xe2, 0x59, 0xf4, 0x6e, 0x2b, 0x96, 228 » 0x95, 0x3c, 0xf3, 0x1b, 0x0f, 0x1a, 0x4f, 0xfb, 0x13, 0x12, 0xb2, 0x2c, 0x7c, 0xb3, 0xe5, 0xcb,
225 » 0x15, 0x5e, 0x63, 0xa6, 0x1d, 0x8a, 0x3e, 0x79, 0x02, 0x1d, 0x0c, 0x0d, 0x9a, 0x08, 0x8e, 0x0d, 229 » 0x0a, 0xcb, 0x98, 0x2a, 0x87, 0xa2, 0x4f, 0x1e, 0x41, 0x07, 0x43, 0xfd, 0x26, 0x82, 0x23, 0x0d,
226 » 0x88, 0x21, 0x5f, 0x8d, 0x4a, 0xad, 0x49, 0x5e, 0x40, 0x3b, 0xcb, 0xb9, 0x08, 0x5a, 0x08, 0xdd, 230 » 0x62, 0xc8, 0x67, 0xad, 0x52, 0x63, 0x92, 0x67, 0xd0, 0xce, 0x72, 0xc6, 0xfd, 0x16, 0x42, 0xb7,
227 » 0x35, 0xd0, 0xbf, 0x5f, 0x8b, 0xbe, 0x68, 0x93, 0x22, 0x42, 0x5e, 0x42, 0x27, 0x4d, 0xb2, 0x44, 231 » 0x35, 0xf4, 0xf7, 0xd7, 0xc2, 0x4f, 0xca, 0xa4, 0x88, 0x90, 0xe7, 0xd0, 0x49, 0x93, 0x2c, 0x91,
228 » 0x05, 0x6d, 0x64, 0xef, 0x5d, 0x63, 0x3f, 0x1b, 0x97, 0x5a, 0x88, 0x4c, 0xa1, 0x97, 0x6c, 0x96, 232 » 0x7e, 0x1b, 0xd9, 0x3b, 0xd7, 0xd8, 0x8f, 0xda, 0xa5, 0x06, 0x22, 0x13, 0xe8, 0x25, 0x9b, 0x65,
229 » 0x69, 0xa5, 0xb3, 0x3b, 0xc8, 0x07, 0xd7, 0xf8, 0x03, 0xeb, 0xd3, 0x1a, 0x0c, 0x7f, 0x36, 0xa0, 233 » 0x5a, 0xa9, 0xec, 0x0e, 0xf2, 0xfe, 0x35, 0x7e, 0x6e, 0x7c, 0x5a, 0x83, 0xc1, 0x8f, 0x06, 0xb4,
230 » 0x6d, 0x3e, 0x48, 0x7c, 0x68, 0xf1, 0x95, 0xc4, 0x11, 0x3d, 0x6a, 0x7e, 0x92, 0x37, 0xd0, 0xe7, 234 » 0xf5, 0x07, 0x89, 0x07, 0x2d, 0xb6, 0x12, 0xd8, 0xa2, 0x43, 0xf5, 0x4f, 0xf2, 0x0a, 0x5c, 0x96,
231 » 0x49, 0x29, 0x96, 0x66, 0x4a, 0x9c, 0x68, 0x3c, 0xdd, 0xbd, 0xf1, 0xb2, 0xd1, 0xbc, 0xc6, 0xe8, 235 » 0x94, 0x7c, 0xa9, 0xbb, 0xc4, 0x8e, 0x46, 0x93, 0xfd, 0xff, 0x16, 0x1b, 0xce, 0x6a, 0x8c, 0xfe,
232 » 0xdf, 0x7f, 0x4c, 0xa6, 0xd0, 0xbf, 0xd2, 0xc9, 0x10, 0xbc, 0xf7, 0x87, 0xf4, 0x64, 0x46, 0xe7, 236 » 0xf9, 0xc7, 0x78, 0x02, 0xee, 0x4e, 0x27, 0x03, 0x70, 0xde, 0x1e, 0xd1, 0xd3, 0x29, 0x9d, 0x1d,
233 » 0x47, 0xfe, 0x2d, 0x32, 0x82, 0xfe, 0xfe, 0xec, 0xed, 0x27, 0x7b, 0x6c, 0x10, 0x0f, 0xda, 0xfb, 237 » 0x7b, 0x37, 0xc8, 0x10, 0xdc, 0xc3, 0xe9, 0xeb, 0x0f, 0xe6, 0xd9, 0x20, 0x0e, 0xb4, 0x0f, 0x8f,
234 » 0x87, 0xc7, 0x1f, 0xfd, 0x66, 0xf8, 0x03, 0x3a, 0x38, 0x11, 0xb9, 0x0f, 0xfd, 0x8c, 0x6d, 0x63, 238 » 0x4e, 0xde, 0x7b, 0xcd, 0xe0, 0x3b, 0x74, 0xb0, 0x23, 0x72, 0x17, 0xdc, 0x2c, 0xde, 0x46, 0x8c,
235 » 0x2e, 0x0a, 0x57, 0x7b, 0x8b, 0x7a, 0x5a, 0x98, 0x9b, 0x33, 0x79, 0x0d, 0xe6, 0x77, 0x6c, 0x1e, 239 » 0x17, 0x76, 0xec, 0x2d, 0xea, 0x28, 0x61, 0xa6, 0xdf, 0xe4, 0x25, 0xe8, 0xdf, 0x91, 0x5e, 0xb4,
236 » 0xda, 0x35, 0xbd, 0x13, 0xd9, 0x2d, 0x88, 0xea, 0x2d, 0x88, 0xe6, 0x6e, 0x4b, 0x68, 0x4f, 0xa3, 240 » 0x9d, 0xf4, 0x5e, 0x68, 0xae, 0x20, 0xac, 0xaf, 0x20, 0x9c, 0xd9, 0x2b, 0xa1, 0x3d, 0x85, 0x9e,
237 » 0xc7, 0x9a, 0x24, 0x13, 0x18, 0x61, 0xa4, 0xde, 0x83, 0x58, 0x26, 0xdf, 0x6d, 0xff, 0x23, 0x3a, 241 » 0x28, 0x92, 0x8c, 0x61, 0x88, 0x91, 0xea, 0x0e, 0x22, 0x91, 0x7c, 0x33, 0xf3, 0x1f, 0xd2, 0xbe,
238 » 0x30, 0xb1, 0x5a, 0x3b, 0xd2, 0x52, 0xf8, 0xbb, 0x09, 0x3d, 0x57, 0x11, 0x79, 0x00, 0x90, 0x2f, 242 » 0x8e, 0x55, 0xda, 0xb1, 0x92, 0x82, 0x5f, 0x4d, 0xe8, 0xd9, 0x11, 0x91, 0x7b, 0x00, 0xf9, 0xe2,
239 » 0xbe, 0xe9, 0xfb, 0xc7, 0x09, 0xaf, 0x7b, 0xe9, 0x5b, 0xe5, 0x80, 0x4b, 0x63, 0xeb, 0xe7, 0x94, 243 » 0xab, 0xaa, 0x3f, 0x4a, 0x58, 0x3d, 0x17, 0xd7, 0x28, 0x73, 0x26, 0xb4, 0xad, 0xd6, 0x29, 0x24,
240 » 0x0a, 0x03, 0xf1, 0x1a, 0xda, 0x46, 0xc5, 0xa4, 0x91, 0xc7, 0x30, 0x64, 0x4a, 0x89, 0xac, 0x70, 244 » 0x06, 0x62, 0x19, 0xca, 0x46, 0x45, 0xa7, 0x91, 0x87, 0x30, 0x88, 0xa5, 0xe4, 0x59, 0x61, 0x81,
241 » 0x40, 0x0b, 0x81, 0x81, 0xd3, 0x10, 0x79, 0x0a, 0xe3, 0x1a, 0x29, 0x85, 0xac, 0x52, 0xfb, 0xca, 245 » 0x16, 0x02, 0x7d, 0xab, 0x21, 0xf2, 0x18, 0x46, 0x35, 0x52, 0x72, 0x51, 0xa5, 0x66, 0xcb, 0x0e,
242 » 0x1e, 0x1d, 0x39, 0x95, 0xa2, 0xa8, 0xd7, 0xc5, 0x17, 0xdb, 0x42, 0x37, 0xc9, 0x63, 0x67, 0x48, 246 » 0x1d, 0x5a, 0x95, 0xa2, 0xa8, 0xce, 0xc5, 0xe3, 0xdb, 0x42, 0x4d, 0x92, 0x45, 0xd6, 0x10, 0xb8,
243 » 0x7c, 0x5e, 0x8f, 0xde, 0x76, 0xfa, 0xcc, 0xc9, 0x26, 0x71, 0x53, 0x65, 0xb1, 0xa8, 0x77, 0x53, 247 » 0x5e, 0x87, 0xde, 0xb4, 0xfa, 0xd4, 0xca, 0x3a, 0x71, 0x53, 0x65, 0x11, 0xaf, 0x6f, 0x53, 0xf8,
244 » 0x06, 0x5d, 0x9c, 0x71, 0xa4, 0xd5, 0xab, 0x85, 0x95, 0x64, 0x07, 0xbc, 0xd5, 0x05, 0x37, 0xe5, 248 » 0x5d, 0xec, 0x71, 0xa8, 0xd4, 0xdd, 0xc1, 0x0a, 0x75, 0x55, 0x64, 0x87, 0x44, 0xc9, 0x66, 0x95,
245 » 0xca, 0xa0, 0x87, 0x49, 0x3d, 0x7d, 0xd6, 0xdd, 0x4a, 0xd3, 0xfb, 0x82, 0x2d, 0xcf, 0xac, 0xe7, 249 » 0x47, 0x55, 0x99, 0xfa, 0x3d, 0xcc, 0xf4, 0x76, 0xce, 0x5c, 0x19, 0x5f, 0xca, 0x94, 0xec, 0x81,
246 » 0xa1, 0xe7, 0x19, 0xc1, 0x98, 0x8b, 0x2e, 0xb6, 0xfb, 0xea, 0x4f, 0x00, 0x00, 0x00, 0xff, 0xff, 250 » 0xb3, 0xba, 0x64, 0x7a, 0x15, 0xc2, 0x77, 0x90, 0xe9, 0xa9, 0xb7, 0xda, 0x84, 0xd0, 0x5b, 0x5a,
247 » 0x81, 0x23, 0xf5, 0x35, 0xa9, 0x03, 0x00, 0x00, 251 » 0xc4, 0xcb, 0x73, 0xe3, 0xb9, 0xe8, 0x39, 0x5a, 0xd0, 0xe6, 0xa2, 0x8b, 0xbb, 0x78, 0xf1, 0x3b,
252 » 0x00, 0x00, 0xff, 0xff, 0x3c, 0x97, 0x90, 0x19, 0xd7, 0x03, 0x00, 0x00,
248 } 253 }
OLDNEW
« no previous file with comments | « common/api/dm/service/v1/walk_graph.proto ('k') | common/api/dm/service/v1/walk_graph_normalize.go » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698