Initial distributor implementation

common/api/dm/service/v1/graph_query.pb.go

 // Code generated by protoc-gen-go.
 // source: graph_query.proto
 // DO NOT EDIT!
 
 package dm
 
 import proto "github.com/golang/protobuf/proto"
 import fmt "fmt"
 import math "math"
 
@@ skipping 15 matching lines @@
 }
 var GraphQuery_Search_Domain_value = map[string]int32{
         "QUEST":   0,
         "ATTEMPT": 1,
 }
 
 func (x GraphQuery_Search_Domain) String() string {
         return proto.EnumName(GraphQuery_Search_Domain_name, int32(x))
 }
 func (GraphQuery_Search_Domain) EnumDescriptor() ([]byte, []int) {
-        return fileDescriptor5, []int{0, 1, 0}
+        return fileDescriptor4, []int{0, 1, 0}
 }
 
 // GraphQuery represents a single query into the state of DM's dependency graph.
 // It's a required parameter for WalkGraphReq.
 type GraphQuery struct {
         // AttemptList allows you to list one or more specific attempts as the result
         // of the query. If a quest contains the attempt number 0, or is empty, it
         // means 'all attempts for this quest'.
         AttemptList *AttemptList `protobuf:"bytes,1,opt,name=attempt_list,json=attemptList" json:"attempt_list,omitempty"`
         // attempt_range allows you to list a range of attempts in a single quest.
         // low must be > 0, and high must be > low. The range is [low, high). High may
         // be higher than the highest attempt, and low may be lower than the lowest
         // attempt (but not 0).
         AttemptRange []*GraphQuery_AttemptRange `protobuf:"bytes,2,rep,name=attempt_range,json=attemptRange" json:"attempt_range,omitempty"`
         Search       []*GraphQuery_Search       `protobuf:"bytes,3,rep,name=search" json:"search,omitempty"`
 }
 
 func (m *GraphQuery) Reset()                    { *m = GraphQuery{} }
 func (m *GraphQuery) String() string            { return proto.CompactTextString(m) }
 func (*GraphQuery) ProtoMessage()               {}
-func (*GraphQuery) Descriptor() ([]byte, []int) { return fileDescriptor5, []int{0} }
+func (*GraphQuery) Descriptor() ([]byte, []int) { return fileDescriptor4, []int{0} }
 
 func (m *GraphQuery) GetAttemptList() *AttemptList {
         if m != nil {
                 return m.AttemptList
         }
         return nil
 }
 
 func (m *GraphQuery) GetAttemptRange() []*GraphQuery_AttemptRange {
         if m != nil {
@@ skipping 11 matching lines @@
 
 type GraphQuery_AttemptRange struct {
         Quest string `protobuf:"bytes,1,opt,name=quest" json:"quest,omitempty"`
         Low   uint32 `protobuf:"varint,2,opt,name=low" json:"low,omitempty"`
         High  uint32 `protobuf:"varint,3,opt,name=high" json:"high,omitempty"`
 }
 
 func (m *GraphQuery_AttemptRange) Reset()                    { *m = GraphQuery_AttemptRange{} }
 func (m *GraphQuery_AttemptRange) String() string            { return proto.CompactTextString(m) }
 func (*GraphQuery_AttemptRange) ProtoMessage()               {}
-func (*GraphQuery_AttemptRange) Descriptor() ([]byte, []int) { return fileDescriptor5, []int{0, 0} }
+func (*GraphQuery_AttemptRange) Descriptor() ([]byte, []int) { return fileDescriptor4, []int{0, 0} }
 
 // A Search allows you to query objects whose properties match all of the
 // provided filters. Filters take the form of a dot-delimited path. For
 // example, say that we had the following objects:
 //
 //   Quest(id=deadbeef):
 //     created = <timestamp>  #sort
 //     descriptor.distributor_config_name = "foo"
 //     descriptor.json_payload = {
 //       "key": "value",
@@ skipping 75 matching lines @@
         //   "some[1].of[2]" = "stuff"
         //
         // This is useful for filtering documents where the order of parameters
         // in a list or sublist matters.
         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"`
 }
 
 func (m *GraphQuery_Search) Reset()                    { *m = GraphQuery_Search{} }
 func (m *GraphQuery_Search) String() string            { return proto.CompactTextString(m) }
 func (*GraphQuery_Search) ProtoMessage()               {}
-func (*GraphQuery_Search) Descriptor() ([]byte, []int) { return fileDescriptor5, []int{0, 1} }
+func (*GraphQuery_Search) Descriptor() ([]byte, []int) { return fileDescriptor4, []int{0, 1} }
 
 func (m *GraphQuery_Search) GetStart() *PropertyValue {
         if m != nil {
                 return m.Start
         }
         return nil
 }
 
 func (m *GraphQuery_Search) GetEnd() *PropertyValue {
         if m != nil {
@@ skipping 16 matching lines @@
         return nil
 }
 
 func init() {
         proto.RegisterType((*GraphQuery)(nil), "dm.GraphQuery")
         proto.RegisterType((*GraphQuery_AttemptRange)(nil), "dm.GraphQuery.AttemptRange")
         proto.RegisterType((*GraphQuery_Search)(nil), "dm.GraphQuery.Search")
         proto.RegisterEnum("dm.GraphQuery_Search_Domain", GraphQuery_Search_Domain_name, GraphQuery_Search_Domain_value)
 }
 
-var fileDescriptor5 = []byte{
+var fileDescriptor4 = []byte{
         // 437 bytes of a gzipped FileDescriptorProto
         0x1f, 0x8b, 0x08, 0x00, 0x00, 0x09, 0x6e, 0x88, 0x02, 0xff, 0x74, 0x93, 0x4f, 0x6f, 0xd3, 0x40,
         0x10, 0xc5, 0x71, 0x1c, 0xbb, 0x74, 0x1c, 0x17, 0x67, 0x04, 0xc8, 0x32, 0x1c, 0xa2, 0x72, 0x48,
         0x0e, 0xe0, 0x83, 0xe1, 0x80, 0x38, 0x11, 0x09, 0x83, 0x54, 0xb5, 0xa2, 0xdd, 0x1a, 0xc4, 0xcd,
         0xda, 0xd6, 0x4b, 0x62, 0xe1, 0x7f, 0xac, 0x37, 0x50, 0x7f, 0x85, 0x7e, 0x6a, 0xbc, 0x6b, 0xa7,
         0x4d, 0x5b, 0x73, 0xdb, 0x9d, 0x79, 0xef, 0x37, 0xe3, 0xb7, 0x32, 0x4c, 0x57, 0x9c, 0x56, 0xeb,
         0xf8, 0xf7, 0x86, 0xf1, 0xc6, 0xaf, 0x78, 0x29, 0x4a, 0x1c, 0x25, 0xb9, 0x67, 0x89, 0xa6, 0x62,
         0x75, 0x57, 0x38, 0xbc, 0x36, 0x01, 0xbe, 0x48, 0xd9, 0x99, 0x54, 0x61, 0x00, 0x13, 0x2a, 0x04,
         0xcb, 0x2b, 0x11, 0x67, 0x69, 0x2d, 0x5c, 0x6d, 0xa6, 0x2d, 0xac, 0xe0, 0x89, 0x9f, 0xe4, 0xfe,
         0xb2, 0xab, 0x1f, 0xb7, 0x65, 0x62, 0xd1, 0xdb, 0x0b, 0x7e, 0x04, 0x7b, 0xeb, 0xe1, 0xb4, 0x58,
@@ skipping 10 matching lines @@
         0x86, 0xd8, 0x74, 0xb7, 0x86, 0xc7, 0x60, 0xb3, 0x2b, 0x7a, 0x29, 0x6e, 0x78, 0xa6, 0xe2, 0xcd,
         0x87, 0x79, 0xa1, 0x94, 0xde, 0xc1, 0x4d, 0xd8, 0x4e, 0xc9, 0xfb, 0x01, 0xf8, 0x70, 0xa4, 0x4c,
         0xfa, 0x17, 0x6b, 0xfa, 0xf4, 0xe5, 0x11, 0x5f, 0x83, 0xf1, 0x47, 0x7e, 0x94, 0x4a, 0xdf, 0x0a,
         0x9e, 0xcb, 0x69, 0x27, 0x9b, 0x4c, 0xa4, 0xf7, 0x92, 0x51, 0xa2, 0x0f, 0xa3, 0xf7, 0x9a, 0x47,
         0x60, 0xfa, 0x60, 0xf8, 0x00, 0x78, 0x7e, 0x17, 0x3c, 0x94, 0xf6, 0x0d, 0xf3, 0x70, 0x06, 0x66,
         0xf7, 0x58, 0xb8, 0x0f, 0xc6, 0xd9, 0xb7, 0xf0, 0x3c, 0x72, 0x1e, 0xa1, 0x05, 0x7b, 0xcb, 0x28,
         0x0a, 0x4f, 0x4e, 0x23, 0x47, 0x3b, 0x1a, 0x3f, 0x1e, 0x39, 0x3a, 0xd9, 0xab, 0x4b, 0x2e, 0xe2,
         0x8b, 0xe6, 0xc2, 0x54, 0xff, 0xc4, 0xdb, 0x7f, 0x01, 0x00, 0x00, 0xff, 0xff, 0x93, 0xcb, 0xfe,
         0x26, 0x39, 0x03, 0x00, 0x00,
 }