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

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

Issue 1537883002: Initial distributor implementation (Closed) Base URL: https://chromium.googlesource.com/external/github.com/luci/luci-go@master
Patch Set: self review 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: graph_query.proto 2 // source: graph_query.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 10
(...skipping 15 matching lines...) Expand all
26 } 26 }
27 var GraphQuery_Search_Domain_value = map[string]int32{ 27 var GraphQuery_Search_Domain_value = map[string]int32{
28 "QUEST": 0, 28 "QUEST": 0,
29 "ATTEMPT": 1, 29 "ATTEMPT": 1,
30 } 30 }
31 31
32 func (x GraphQuery_Search_Domain) String() string { 32 func (x GraphQuery_Search_Domain) String() string {
33 return proto.EnumName(GraphQuery_Search_Domain_name, int32(x)) 33 return proto.EnumName(GraphQuery_Search_Domain_name, int32(x))
34 } 34 }
35 func (GraphQuery_Search_Domain) EnumDescriptor() ([]byte, []int) { 35 func (GraphQuery_Search_Domain) EnumDescriptor() ([]byte, []int) {
36 » return fileDescriptor5, []int{0, 1, 0} 36 » return fileDescriptor4, []int{0, 1, 0}
37 } 37 }
38 38
39 // GraphQuery represents a single query into the state of DM's dependency graph. 39 // GraphQuery represents a single query into the state of DM's dependency graph.
40 // It's a required parameter for WalkGraphReq. 40 // It's a required parameter for WalkGraphReq.
41 type GraphQuery struct { 41 type GraphQuery struct {
42 // AttemptList allows you to list one or more specific attempts as the r esult 42 // AttemptList allows you to list one or more specific attempts as the r esult
43 // of the query. If a quest contains the attempt number 0, or is empty, it 43 // of the query. If a quest contains the attempt number 0, or is empty, it
44 // means 'all attempts for this quest'. 44 // means 'all attempts for this quest'.
45 AttemptList *AttemptList `protobuf:"bytes,1,opt,name=attempt_list,json=a ttemptList" json:"attempt_list,omitempty"` 45 AttemptList *AttemptList `protobuf:"bytes,1,opt,name=attempt_list,json=a ttemptList" json:"attempt_list,omitempty"`
46 // attempt_range allows you to list a range of attempts in a single ques t. 46 // attempt_range allows you to list a range of attempts in a single ques t.
47 // low must be > 0, and high must be > low. The range is [low, high). Hi gh may 47 // low must be > 0, and high must be > low. The range is [low, high). Hi gh may
48 // be higher than the highest attempt, and low may be lower than the low est 48 // be higher than the highest attempt, and low may be lower than the low est
49 // attempt (but not 0). 49 // attempt (but not 0).
50 AttemptRange []*GraphQuery_AttemptRange `protobuf:"bytes,2,rep,name=atte mpt_range,json=attemptRange" json:"attempt_range,omitempty"` 50 AttemptRange []*GraphQuery_AttemptRange `protobuf:"bytes,2,rep,name=atte mpt_range,json=attemptRange" json:"attempt_range,omitempty"`
51 Search []*GraphQuery_Search `protobuf:"bytes,3,rep,name=sear ch" json:"search,omitempty"` 51 Search []*GraphQuery_Search `protobuf:"bytes,3,rep,name=sear ch" json:"search,omitempty"`
52 } 52 }
53 53
54 func (m *GraphQuery) Reset() { *m = GraphQuery{} } 54 func (m *GraphQuery) Reset() { *m = GraphQuery{} }
55 func (m *GraphQuery) String() string { return proto.CompactTextString (m) } 55 func (m *GraphQuery) String() string { return proto.CompactTextString (m) }
56 func (*GraphQuery) ProtoMessage() {} 56 func (*GraphQuery) ProtoMessage() {}
57 func (*GraphQuery) Descriptor() ([]byte, []int) { return fileDescriptor5, []int{ 0} } 57 func (*GraphQuery) Descriptor() ([]byte, []int) { return fileDescriptor4, []int{ 0} }
58 58
59 func (m *GraphQuery) GetAttemptList() *AttemptList { 59 func (m *GraphQuery) GetAttemptList() *AttemptList {
60 if m != nil { 60 if m != nil {
61 return m.AttemptList 61 return m.AttemptList
62 } 62 }
63 return nil 63 return nil
64 } 64 }
65 65
66 func (m *GraphQuery) GetAttemptRange() []*GraphQuery_AttemptRange { 66 func (m *GraphQuery) GetAttemptRange() []*GraphQuery_AttemptRange {
67 if m != nil { 67 if m != nil {
(...skipping 11 matching lines...) Expand all
79 79
80 type GraphQuery_AttemptRange struct { 80 type GraphQuery_AttemptRange struct {
81 Quest string `protobuf:"bytes,1,opt,name=quest" json:"quest,omitempty"` 81 Quest string `protobuf:"bytes,1,opt,name=quest" json:"quest,omitempty"`
82 Low uint32 `protobuf:"varint,2,opt,name=low" json:"low,omitempty"` 82 Low uint32 `protobuf:"varint,2,opt,name=low" json:"low,omitempty"`
83 High uint32 `protobuf:"varint,3,opt,name=high" json:"high,omitempty"` 83 High uint32 `protobuf:"varint,3,opt,name=high" json:"high,omitempty"`
84 } 84 }
85 85
86 func (m *GraphQuery_AttemptRange) Reset() { *m = GraphQuery_A ttemptRange{} } 86 func (m *GraphQuery_AttemptRange) Reset() { *m = GraphQuery_A ttemptRange{} }
87 func (m *GraphQuery_AttemptRange) String() string { return proto.Comp actTextString(m) } 87 func (m *GraphQuery_AttemptRange) String() string { return proto.Comp actTextString(m) }
88 func (*GraphQuery_AttemptRange) ProtoMessage() {} 88 func (*GraphQuery_AttemptRange) ProtoMessage() {}
89 func (*GraphQuery_AttemptRange) Descriptor() ([]byte, []int) { return fileDescri ptor5, []int{0, 0} } 89 func (*GraphQuery_AttemptRange) Descriptor() ([]byte, []int) { return fileDescri ptor4, []int{0, 0} }
90 90
91 // A Search allows you to query objects whose properties match all of the 91 // A Search allows you to query objects whose properties match all of the
92 // provided filters. Filters take the form of a dot-delimited path. For 92 // provided filters. Filters take the form of a dot-delimited path. For
93 // example, say that we had the following objects: 93 // example, say that we had the following objects:
94 // 94 //
95 // Quest(id=deadbeef): 95 // Quest(id=deadbeef):
96 // created = <timestamp> #sort 96 // created = <timestamp> #sort
97 // descriptor.distributor_config_name = "foo" 97 // descriptor.distributor_config_name = "foo"
98 // descriptor.json_payload = { 98 // descriptor.json_payload = {
99 // "key": "value", 99 // "key": "value",
(...skipping 75 matching lines...) Expand 10 before | Expand all | Expand 10 after
175 // "some[1].of[2]" = "stuff" 175 // "some[1].of[2]" = "stuff"
176 // 176 //
177 // This is useful for filtering documents where the order of parameters 177 // This is useful for filtering documents where the order of parameters
178 // in a list or sublist matters. 178 // in a list or sublist matters.
179 ExactFilters map[string]*PropertyValue `protobuf:"bytes,6,rep,name=exact _filters,json=exactFilters" json:"exact_filters,omitempty" protobuf_key:"bytes,1 ,opt,name=key" protobuf_val:"bytes,2,opt,name=value"` 179 ExactFilters map[string]*PropertyValue `protobuf:"bytes,6,rep,name=exact _filters,json=exactFilters" json:"exact_filters,omitempty" protobuf_key:"bytes,1 ,opt,name=key" protobuf_val:"bytes,2,opt,name=value"`
180 } 180 }
181 181
182 func (m *GraphQuery_Search) Reset() { *m = GraphQuery_Search{ } } 182 func (m *GraphQuery_Search) Reset() { *m = GraphQuery_Search{ } }
183 func (m *GraphQuery_Search) String() string { return proto.CompactTex tString(m) } 183 func (m *GraphQuery_Search) String() string { return proto.CompactTex tString(m) }
184 func (*GraphQuery_Search) ProtoMessage() {} 184 func (*GraphQuery_Search) ProtoMessage() {}
185 func (*GraphQuery_Search) Descriptor() ([]byte, []int) { return fileDescriptor5, []int{0, 1} } 185 func (*GraphQuery_Search) Descriptor() ([]byte, []int) { return fileDescriptor4, []int{0, 1} }
186 186
187 func (m *GraphQuery_Search) GetStart() *PropertyValue { 187 func (m *GraphQuery_Search) GetStart() *PropertyValue {
188 if m != nil { 188 if m != nil {
189 return m.Start 189 return m.Start
190 } 190 }
191 return nil 191 return nil
192 } 192 }
193 193
194 func (m *GraphQuery_Search) GetEnd() *PropertyValue { 194 func (m *GraphQuery_Search) GetEnd() *PropertyValue {
195 if m != nil { 195 if m != nil {
(...skipping 16 matching lines...) Expand all
212 return nil 212 return nil
213 } 213 }
214 214
215 func init() { 215 func init() {
216 proto.RegisterType((*GraphQuery)(nil), "dm.GraphQuery") 216 proto.RegisterType((*GraphQuery)(nil), "dm.GraphQuery")
217 proto.RegisterType((*GraphQuery_AttemptRange)(nil), "dm.GraphQuery.Attem ptRange") 217 proto.RegisterType((*GraphQuery_AttemptRange)(nil), "dm.GraphQuery.Attem ptRange")
218 proto.RegisterType((*GraphQuery_Search)(nil), "dm.GraphQuery.Search") 218 proto.RegisterType((*GraphQuery_Search)(nil), "dm.GraphQuery.Search")
219 proto.RegisterEnum("dm.GraphQuery_Search_Domain", GraphQuery_Search_Doma in_name, GraphQuery_Search_Domain_value) 219 proto.RegisterEnum("dm.GraphQuery_Search_Domain", GraphQuery_Search_Doma in_name, GraphQuery_Search_Domain_value)
220 } 220 }
221 221
222 var fileDescriptor5 = []byte{ 222 var fileDescriptor4 = []byte{
223 // 437 bytes of a gzipped FileDescriptorProto 223 // 437 bytes of a gzipped FileDescriptorProto
224 0x1f, 0x8b, 0x08, 0x00, 0x00, 0x09, 0x6e, 0x88, 0x02, 0xff, 0x74, 0x93, 0x4f, 0x6f, 0xd3, 0x40, 224 0x1f, 0x8b, 0x08, 0x00, 0x00, 0x09, 0x6e, 0x88, 0x02, 0xff, 0x74, 0x93, 0x4f, 0x6f, 0xd3, 0x40,
225 0x10, 0xc5, 0x71, 0x1c, 0xbb, 0x74, 0x1c, 0x17, 0x67, 0x04, 0xc8, 0x32, 0x1c, 0xa2, 0x72, 0x48, 225 0x10, 0xc5, 0x71, 0x1c, 0xbb, 0x74, 0x1c, 0x17, 0x67, 0x04, 0xc8, 0x32, 0x1c, 0xa2, 0x72, 0x48,
226 0x0e, 0xe0, 0x83, 0xe1, 0x80, 0x38, 0x11, 0x09, 0x83, 0x54, 0xb5, 0xa2, 0xdd, 0x1a, 0xc4, 0xcd, 226 0x0e, 0xe0, 0x83, 0xe1, 0x80, 0x38, 0x11, 0x09, 0x83, 0x54, 0xb5, 0xa2, 0xdd, 0x1a, 0xc4, 0xcd,
227 0xda, 0xd6, 0x4b, 0x62, 0xe1, 0x7f, 0xac, 0x37, 0x50, 0x7f, 0x85, 0x7e, 0x6a, 0xbc, 0x6b, 0xa7, 227 0xda, 0xd6, 0x4b, 0x62, 0xe1, 0x7f, 0xac, 0x37, 0x50, 0x7f, 0x85, 0x7e, 0x6a, 0xbc, 0x6b, 0xa7,
228 0x4d, 0x5b, 0x73, 0xdb, 0x9d, 0x79, 0xef, 0x37, 0xe3, 0xb7, 0x32, 0x4c, 0x57, 0x9c, 0x56, 0xeb, 228 0x4d, 0x5b, 0x73, 0xdb, 0x9d, 0x79, 0xef, 0x37, 0xe3, 0xb7, 0x32, 0x4c, 0x57, 0x9c, 0x56, 0xeb,
229 0xf8, 0xf7, 0x86, 0xf1, 0xc6, 0xaf, 0x78, 0x29, 0x4a, 0x1c, 0x25, 0xb9, 0x67, 0x89, 0xa6, 0x62, 229 0xf8, 0xf7, 0x86, 0xf1, 0xc6, 0xaf, 0x78, 0x29, 0x4a, 0x1c, 0x25, 0xb9, 0x67, 0x89, 0xa6, 0x62,
230 0x75, 0x57, 0x38, 0xbc, 0x36, 0x01, 0xbe, 0x48, 0xd9, 0x99, 0x54, 0x61, 0x00, 0x13, 0x2a, 0x04, 230 0x75, 0x57, 0x38, 0xbc, 0x36, 0x01, 0xbe, 0x48, 0xd9, 0x99, 0x54, 0x61, 0x00, 0x13, 0x2a, 0x04,
231 0xcb, 0x2b, 0x11, 0x67, 0x69, 0x2d, 0x5c, 0x6d, 0xa6, 0x2d, 0xac, 0xe0, 0x89, 0x9f, 0xe4, 0xfe, 231 0xcb, 0x2b, 0x11, 0x67, 0x69, 0x2d, 0x5c, 0x6d, 0xa6, 0x2d, 0xac, 0xe0, 0x89, 0x9f, 0xe4, 0xfe,
232 0xb2, 0xab, 0x1f, 0xb7, 0x65, 0x62, 0xd1, 0xdb, 0x0b, 0x7e, 0x04, 0x7b, 0xeb, 0xe1, 0xb4, 0x58, 232 0xb2, 0xab, 0x1f, 0xb7, 0x65, 0x62, 0xd1, 0xdb, 0x0b, 0x7e, 0x04, 0x7b, 0xeb, 0xe1, 0xb4, 0x58,
(...skipping 10 matching lines...) Expand all
243 0x86, 0xd8, 0x74, 0xb7, 0x86, 0xc7, 0x60, 0xb3, 0x2b, 0x7a, 0x29, 0x6e, 0x78, 0xa6, 0xe2, 0xcd, 243 0x86, 0xd8, 0x74, 0xb7, 0x86, 0xc7, 0x60, 0xb3, 0x2b, 0x7a, 0x29, 0x6e, 0x78, 0xa6, 0xe2, 0xcd,
244 0x87, 0x79, 0xa1, 0x94, 0xde, 0xc1, 0x4d, 0xd8, 0x4e, 0xc9, 0xfb, 0x01, 0xf8, 0x70, 0xa4, 0x4c, 244 0x87, 0x79, 0xa1, 0x94, 0xde, 0xc1, 0x4d, 0xd8, 0x4e, 0xc9, 0xfb, 0x01, 0xf8, 0x70, 0xa4, 0x4c,
245 0xfa, 0x17, 0x6b, 0xfa, 0xf4, 0xe5, 0x11, 0x5f, 0x83, 0xf1, 0x47, 0x7e, 0x94, 0x4a, 0xdf, 0x0a, 245 0xfa, 0x17, 0x6b, 0xfa, 0xf4, 0xe5, 0x11, 0x5f, 0x83, 0xf1, 0x47, 0x7e, 0x94, 0x4a, 0xdf, 0x0a,
246 0x9e, 0xcb, 0x69, 0x27, 0x9b, 0x4c, 0xa4, 0xf7, 0x92, 0x51, 0xa2, 0x0f, 0xa3, 0xf7, 0x9a, 0x47, 246 0x9e, 0xcb, 0x69, 0x27, 0x9b, 0x4c, 0xa4, 0xf7, 0x92, 0x51, 0xa2, 0x0f, 0xa3, 0xf7, 0x9a, 0x47,
247 0x60, 0xfa, 0x60, 0xf8, 0x00, 0x78, 0x7e, 0x17, 0x3c, 0x94, 0xf6, 0x0d, 0xf3, 0x70, 0x06, 0x66, 247 0x60, 0xfa, 0x60, 0xf8, 0x00, 0x78, 0x7e, 0x17, 0x3c, 0x94, 0xf6, 0x0d, 0xf3, 0x70, 0x06, 0x66,
248 0xf7, 0x58, 0xb8, 0x0f, 0xc6, 0xd9, 0xb7, 0xf0, 0x3c, 0x72, 0x1e, 0xa1, 0x05, 0x7b, 0xcb, 0x28, 248 0xf7, 0x58, 0xb8, 0x0f, 0xc6, 0xd9, 0xb7, 0xf0, 0x3c, 0x72, 0x1e, 0xa1, 0x05, 0x7b, 0xcb, 0x28,
249 0x0a, 0x4f, 0x4e, 0x23, 0x47, 0x3b, 0x1a, 0x3f, 0x1e, 0x39, 0x3a, 0xd9, 0xab, 0x4b, 0x2e, 0xe2, 249 0x0a, 0x4f, 0x4e, 0x23, 0x47, 0x3b, 0x1a, 0x3f, 0x1e, 0x39, 0x3a, 0xd9, 0xab, 0x4b, 0x2e, 0xe2,
250 0x8b, 0xe6, 0xc2, 0x54, 0xff, 0xc4, 0xdb, 0x7f, 0x01, 0x00, 0x00, 0xff, 0xff, 0x93, 0xcb, 0xfe, 250 0x8b, 0xe6, 0xc2, 0x54, 0xff, 0xc4, 0xdb, 0x7f, 0x01, 0x00, 0x00, 0xff, 0xff, 0x93, 0xcb, 0xfe,
251 0x26, 0x39, 0x03, 0x00, 0x00, 251 0x26, 0x39, 0x03, 0x00, 0x00,
252 } 252 }
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698