mirror of
https://github.com/temporalio/temporal.git
synced 2026-08-30 18:41:49 -07:00
1843 lines
48 KiB
Go
1843 lines
48 KiB
Go
// The MIT License
|
|
//
|
|
// Copyright (c) 2020 Temporal Technologies Inc. All rights reserved.
|
|
//
|
|
// Copyright (c) 2020 Uber Technologies, Inc.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
// of this software and associated documentation files (the "Software"), to deal
|
|
// in the Software without restriction, including without limitation the rights
|
|
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
// copies of the Software, and to permit persons to whom the Software is
|
|
// furnished to do so, subject to the following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included in
|
|
// all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
// THE SOFTWARE.
|
|
|
|
// Code generated by protoc-gen-gogo. DO NOT EDIT.
|
|
// source: temporal/server/api/persistence/v1/task_queues.proto
|
|
|
|
package persistence
|
|
|
|
import (
|
|
fmt "fmt"
|
|
io "io"
|
|
math "math"
|
|
math_bits "math/bits"
|
|
reflect "reflect"
|
|
strconv "strconv"
|
|
strings "strings"
|
|
|
|
proto "github.com/gogo/protobuf/proto"
|
|
v1 "go.temporal.io/server/api/clock/v1"
|
|
)
|
|
|
|
// Reference imports to suppress errors if they are not otherwise used.
|
|
var _ = proto.Marshal
|
|
var _ = fmt.Errorf
|
|
var _ = math.Inf
|
|
|
|
// This is a compile-time assertion to ensure that this generated file
|
|
// is compatible with the proto package it is being compiled against.
|
|
// A compilation error at this line likely means your copy of the
|
|
// proto package needs to be updated.
|
|
const _ = proto.GoGoProtoPackageIsVersion3 // please upgrade the proto package
|
|
|
|
type BuildID_State int32
|
|
|
|
const (
|
|
STATE_UNSPECIFIED BuildID_State = 0
|
|
STATE_ACTIVE BuildID_State = 1
|
|
STATE_DELETED BuildID_State = 2
|
|
)
|
|
|
|
var BuildID_State_name = map[int32]string{
|
|
0: "StateUnspecified",
|
|
1: "StateActive",
|
|
2: "StateDeleted",
|
|
}
|
|
|
|
var BuildID_State_value = map[string]int32{
|
|
"StateUnspecified": 0,
|
|
"StateActive": 1,
|
|
"StateDeleted": 2,
|
|
}
|
|
|
|
func (BuildID_State) EnumDescriptor() ([]byte, []int) {
|
|
return fileDescriptor_0cb9a0f256d1327d, []int{0, 0}
|
|
}
|
|
|
|
// BuildID is an identifier with a timestamped status used to identify workers for task queue versioning purposes.
|
|
type BuildID struct {
|
|
Id string `protobuf:"bytes,1,opt,name=id,proto3" json:"id,omitempty"`
|
|
State BuildID_State `protobuf:"varint,2,opt,name=state,proto3,enum=temporal.server.api.persistence.v1.BuildID_State" json:"state,omitempty"`
|
|
// HLC timestamp representing when the state was updated or the when build ID was originally inserted.
|
|
// (-- api-linter: core::0142::time-field-type=disabled
|
|
// aip.dev/not-precedent: Using HLC instead of wall clock. --)
|
|
StateUpdateTimestamp *v1.HybridLogicalClock `protobuf:"bytes,3,opt,name=state_update_timestamp,json=stateUpdateTimestamp,proto3" json:"state_update_timestamp,omitempty"`
|
|
}
|
|
|
|
func (m *BuildID) Reset() { *m = BuildID{} }
|
|
func (*BuildID) ProtoMessage() {}
|
|
func (*BuildID) Descriptor() ([]byte, []int) {
|
|
return fileDescriptor_0cb9a0f256d1327d, []int{0}
|
|
}
|
|
func (m *BuildID) XXX_Unmarshal(b []byte) error {
|
|
return m.Unmarshal(b)
|
|
}
|
|
func (m *BuildID) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {
|
|
if deterministic {
|
|
return xxx_messageInfo_BuildID.Marshal(b, m, deterministic)
|
|
} else {
|
|
b = b[:cap(b)]
|
|
n, err := m.MarshalToSizedBuffer(b)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return b[:n], nil
|
|
}
|
|
}
|
|
func (m *BuildID) XXX_Merge(src proto.Message) {
|
|
xxx_messageInfo_BuildID.Merge(m, src)
|
|
}
|
|
func (m *BuildID) XXX_Size() int {
|
|
return m.Size()
|
|
}
|
|
func (m *BuildID) XXX_DiscardUnknown() {
|
|
xxx_messageInfo_BuildID.DiscardUnknown(m)
|
|
}
|
|
|
|
var xxx_messageInfo_BuildID proto.InternalMessageInfo
|
|
|
|
func (m *BuildID) GetId() string {
|
|
if m != nil {
|
|
return m.Id
|
|
}
|
|
return ""
|
|
}
|
|
|
|
func (m *BuildID) GetState() BuildID_State {
|
|
if m != nil {
|
|
return m.State
|
|
}
|
|
return STATE_UNSPECIFIED
|
|
}
|
|
|
|
func (m *BuildID) GetStateUpdateTimestamp() *v1.HybridLogicalClock {
|
|
if m != nil {
|
|
return m.StateUpdateTimestamp
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// An internal represenation of temporal.api.taskqueue.v1.CompatibleVersionSet
|
|
type CompatibleVersionSet struct {
|
|
// Set IDs are used internally by matching.
|
|
// A set typically has one set ID and extra care is taken to enforce this.
|
|
// In split brain scenarios, there may be conflicting concurrent writes to the task queue versioning data, in which
|
|
// case a set might end up with more than one ID.
|
|
SetIds []string `protobuf:"bytes,1,rep,name=set_ids,json=setIds,proto3" json:"set_ids,omitempty"`
|
|
// All the compatible versions, unordered except for the last element, which is considered the set "default".
|
|
BuildIds []*BuildID `protobuf:"bytes,2,rep,name=build_ids,json=buildIds,proto3" json:"build_ids,omitempty"`
|
|
// HLC timestamp representing when the set default was updated. Different from BuildID.state_update_timestamp, which
|
|
// refers to the build ID status.
|
|
// (-- api-linter: core::0142::time-field-type=disabled
|
|
// aip.dev/not-precedent: Using HLC instead of wall clock. --)
|
|
DefaultUpdateTimestamp *v1.HybridLogicalClock `protobuf:"bytes,3,opt,name=default_update_timestamp,json=defaultUpdateTimestamp,proto3" json:"default_update_timestamp,omitempty"`
|
|
}
|
|
|
|
func (m *CompatibleVersionSet) Reset() { *m = CompatibleVersionSet{} }
|
|
func (*CompatibleVersionSet) ProtoMessage() {}
|
|
func (*CompatibleVersionSet) Descriptor() ([]byte, []int) {
|
|
return fileDescriptor_0cb9a0f256d1327d, []int{1}
|
|
}
|
|
func (m *CompatibleVersionSet) XXX_Unmarshal(b []byte) error {
|
|
return m.Unmarshal(b)
|
|
}
|
|
func (m *CompatibleVersionSet) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {
|
|
if deterministic {
|
|
return xxx_messageInfo_CompatibleVersionSet.Marshal(b, m, deterministic)
|
|
} else {
|
|
b = b[:cap(b)]
|
|
n, err := m.MarshalToSizedBuffer(b)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return b[:n], nil
|
|
}
|
|
}
|
|
func (m *CompatibleVersionSet) XXX_Merge(src proto.Message) {
|
|
xxx_messageInfo_CompatibleVersionSet.Merge(m, src)
|
|
}
|
|
func (m *CompatibleVersionSet) XXX_Size() int {
|
|
return m.Size()
|
|
}
|
|
func (m *CompatibleVersionSet) XXX_DiscardUnknown() {
|
|
xxx_messageInfo_CompatibleVersionSet.DiscardUnknown(m)
|
|
}
|
|
|
|
var xxx_messageInfo_CompatibleVersionSet proto.InternalMessageInfo
|
|
|
|
func (m *CompatibleVersionSet) GetSetIds() []string {
|
|
if m != nil {
|
|
return m.SetIds
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (m *CompatibleVersionSet) GetBuildIds() []*BuildID {
|
|
if m != nil {
|
|
return m.BuildIds
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (m *CompatibleVersionSet) GetDefaultUpdateTimestamp() *v1.HybridLogicalClock {
|
|
if m != nil {
|
|
return m.DefaultUpdateTimestamp
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// Holds all the data related to worker versioning for a task queue.
|
|
// Backwards-incompatible changes cannot be made, as this would make existing stored data unreadable.
|
|
type VersioningData struct {
|
|
// All the incompatible version sets, unordered except for the last element, which is considered the set "default".
|
|
VersionSets []*CompatibleVersionSet `protobuf:"bytes,1,rep,name=version_sets,json=versionSets,proto3" json:"version_sets,omitempty"`
|
|
// HLC timestamp representing when the default set was last updated or established.
|
|
// (-- api-linter: core::0142::time-field-type=disabled
|
|
// aip.dev/not-precedent: Using HLC instead of wall clock. --)
|
|
DefaultUpdateTimestamp *v1.HybridLogicalClock `protobuf:"bytes,2,opt,name=default_update_timestamp,json=defaultUpdateTimestamp,proto3" json:"default_update_timestamp,omitempty"`
|
|
}
|
|
|
|
func (m *VersioningData) Reset() { *m = VersioningData{} }
|
|
func (*VersioningData) ProtoMessage() {}
|
|
func (*VersioningData) Descriptor() ([]byte, []int) {
|
|
return fileDescriptor_0cb9a0f256d1327d, []int{2}
|
|
}
|
|
func (m *VersioningData) XXX_Unmarshal(b []byte) error {
|
|
return m.Unmarshal(b)
|
|
}
|
|
func (m *VersioningData) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {
|
|
if deterministic {
|
|
return xxx_messageInfo_VersioningData.Marshal(b, m, deterministic)
|
|
} else {
|
|
b = b[:cap(b)]
|
|
n, err := m.MarshalToSizedBuffer(b)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return b[:n], nil
|
|
}
|
|
}
|
|
func (m *VersioningData) XXX_Merge(src proto.Message) {
|
|
xxx_messageInfo_VersioningData.Merge(m, src)
|
|
}
|
|
func (m *VersioningData) XXX_Size() int {
|
|
return m.Size()
|
|
}
|
|
func (m *VersioningData) XXX_DiscardUnknown() {
|
|
xxx_messageInfo_VersioningData.DiscardUnknown(m)
|
|
}
|
|
|
|
var xxx_messageInfo_VersioningData proto.InternalMessageInfo
|
|
|
|
func (m *VersioningData) GetVersionSets() []*CompatibleVersionSet {
|
|
if m != nil {
|
|
return m.VersionSets
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (m *VersioningData) GetDefaultUpdateTimestamp() *v1.HybridLogicalClock {
|
|
if m != nil {
|
|
return m.DefaultUpdateTimestamp
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// Container for all persistent user provided data for a task queue.
|
|
// Task queue as a named concept here is close to how users interpret them, rather than relating to some specific type
|
|
// (workflow vs activity, etc) and thus, as a consequence, any data that applies to a specific type (say, activity rate
|
|
// limiting) should be defined as such within this structure.
|
|
// This data must all fit in a single DB column and is kept cached in-memory, take extra care to ensure data added here
|
|
// has reasonable size limits imposed on it.
|
|
type TaskQueueUserData struct {
|
|
// The last recorded cluster-local Hybrid Logical Clock timestamp for _this_ task queue.
|
|
// Updated whenever user data is directly updated due to a user action but not when applying replication events.
|
|
// The clock is referenced when new timestamps are generated to ensure it produces monotonically increasing
|
|
// timestamps.
|
|
Clock *v1.HybridLogicalClock `protobuf:"bytes,1,opt,name=clock,proto3" json:"clock,omitempty"`
|
|
VersioningData *VersioningData `protobuf:"bytes,2,opt,name=versioning_data,json=versioningData,proto3" json:"versioning_data,omitempty"`
|
|
}
|
|
|
|
func (m *TaskQueueUserData) Reset() { *m = TaskQueueUserData{} }
|
|
func (*TaskQueueUserData) ProtoMessage() {}
|
|
func (*TaskQueueUserData) Descriptor() ([]byte, []int) {
|
|
return fileDescriptor_0cb9a0f256d1327d, []int{3}
|
|
}
|
|
func (m *TaskQueueUserData) XXX_Unmarshal(b []byte) error {
|
|
return m.Unmarshal(b)
|
|
}
|
|
func (m *TaskQueueUserData) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {
|
|
if deterministic {
|
|
return xxx_messageInfo_TaskQueueUserData.Marshal(b, m, deterministic)
|
|
} else {
|
|
b = b[:cap(b)]
|
|
n, err := m.MarshalToSizedBuffer(b)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return b[:n], nil
|
|
}
|
|
}
|
|
func (m *TaskQueueUserData) XXX_Merge(src proto.Message) {
|
|
xxx_messageInfo_TaskQueueUserData.Merge(m, src)
|
|
}
|
|
func (m *TaskQueueUserData) XXX_Size() int {
|
|
return m.Size()
|
|
}
|
|
func (m *TaskQueueUserData) XXX_DiscardUnknown() {
|
|
xxx_messageInfo_TaskQueueUserData.DiscardUnknown(m)
|
|
}
|
|
|
|
var xxx_messageInfo_TaskQueueUserData proto.InternalMessageInfo
|
|
|
|
func (m *TaskQueueUserData) GetClock() *v1.HybridLogicalClock {
|
|
if m != nil {
|
|
return m.Clock
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (m *TaskQueueUserData) GetVersioningData() *VersioningData {
|
|
if m != nil {
|
|
return m.VersioningData
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// Simple wrapper that includes a TaskQueueUserData and its storage version.
|
|
type VersionedTaskQueueUserData struct {
|
|
Data *TaskQueueUserData `protobuf:"bytes,1,opt,name=data,proto3" json:"data,omitempty"`
|
|
Version int64 `protobuf:"varint,2,opt,name=version,proto3" json:"version,omitempty"`
|
|
}
|
|
|
|
func (m *VersionedTaskQueueUserData) Reset() { *m = VersionedTaskQueueUserData{} }
|
|
func (*VersionedTaskQueueUserData) ProtoMessage() {}
|
|
func (*VersionedTaskQueueUserData) Descriptor() ([]byte, []int) {
|
|
return fileDescriptor_0cb9a0f256d1327d, []int{4}
|
|
}
|
|
func (m *VersionedTaskQueueUserData) XXX_Unmarshal(b []byte) error {
|
|
return m.Unmarshal(b)
|
|
}
|
|
func (m *VersionedTaskQueueUserData) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {
|
|
if deterministic {
|
|
return xxx_messageInfo_VersionedTaskQueueUserData.Marshal(b, m, deterministic)
|
|
} else {
|
|
b = b[:cap(b)]
|
|
n, err := m.MarshalToSizedBuffer(b)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return b[:n], nil
|
|
}
|
|
}
|
|
func (m *VersionedTaskQueueUserData) XXX_Merge(src proto.Message) {
|
|
xxx_messageInfo_VersionedTaskQueueUserData.Merge(m, src)
|
|
}
|
|
func (m *VersionedTaskQueueUserData) XXX_Size() int {
|
|
return m.Size()
|
|
}
|
|
func (m *VersionedTaskQueueUserData) XXX_DiscardUnknown() {
|
|
xxx_messageInfo_VersionedTaskQueueUserData.DiscardUnknown(m)
|
|
}
|
|
|
|
var xxx_messageInfo_VersionedTaskQueueUserData proto.InternalMessageInfo
|
|
|
|
func (m *VersionedTaskQueueUserData) GetData() *TaskQueueUserData {
|
|
if m != nil {
|
|
return m.Data
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (m *VersionedTaskQueueUserData) GetVersion() int64 {
|
|
if m != nil {
|
|
return m.Version
|
|
}
|
|
return 0
|
|
}
|
|
|
|
func init() {
|
|
proto.RegisterEnum("temporal.server.api.persistence.v1.BuildID_State", BuildID_State_name, BuildID_State_value)
|
|
proto.RegisterType((*BuildID)(nil), "temporal.server.api.persistence.v1.BuildID")
|
|
proto.RegisterType((*CompatibleVersionSet)(nil), "temporal.server.api.persistence.v1.CompatibleVersionSet")
|
|
proto.RegisterType((*VersioningData)(nil), "temporal.server.api.persistence.v1.VersioningData")
|
|
proto.RegisterType((*TaskQueueUserData)(nil), "temporal.server.api.persistence.v1.TaskQueueUserData")
|
|
proto.RegisterType((*VersionedTaskQueueUserData)(nil), "temporal.server.api.persistence.v1.VersionedTaskQueueUserData")
|
|
}
|
|
|
|
func init() {
|
|
proto.RegisterFile("temporal/server/api/persistence/v1/task_queues.proto", fileDescriptor_0cb9a0f256d1327d)
|
|
}
|
|
|
|
var fileDescriptor_0cb9a0f256d1327d = []byte{
|
|
// 577 bytes of a gzipped FileDescriptorProto
|
|
0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0xac, 0x94, 0x41, 0x6f, 0xd3, 0x3c,
|
|
0x1c, 0xc6, 0xe3, 0xf4, 0xdd, 0xf6, 0xce, 0x1d, 0xa5, 0xb5, 0xc6, 0x88, 0x76, 0xb0, 0xaa, 0x9e,
|
|
0x2a, 0x90, 0x52, 0x5a, 0x86, 0x84, 0xc4, 0x69, 0x6b, 0x33, 0x16, 0x69, 0x42, 0x90, 0xa6, 0x3b,
|
|
0xb0, 0x43, 0xe4, 0x36, 0x5e, 0xe5, 0x35, 0x6d, 0x42, 0xec, 0x46, 0xe2, 0x06, 0x9f, 0x00, 0x3e,
|
|
0x06, 0x1f, 0x81, 0x8f, 0xc0, 0xb1, 0xc7, 0x71, 0xa3, 0xa9, 0x90, 0x38, 0xee, 0x23, 0xa0, 0x38,
|
|
0xe9, 0xd8, 0x58, 0x81, 0x82, 0x76, 0xaa, 0xfd, 0x6f, 0x9e, 0xdf, 0xe3, 0xe7, 0x51, 0x62, 0xb8,
|
|
0x23, 0xe8, 0x30, 0xf0, 0x43, 0xe2, 0xd5, 0x38, 0x0d, 0x23, 0x1a, 0xd6, 0x48, 0xc0, 0x6a, 0x01,
|
|
0x0d, 0x39, 0xe3, 0x82, 0x8e, 0x7a, 0xb4, 0x16, 0xd5, 0x6b, 0x82, 0xf0, 0x81, 0xf3, 0x6a, 0x4c,
|
|
0xc7, 0x94, 0xeb, 0x41, 0xe8, 0x0b, 0x1f, 0x55, 0xe6, 0x2a, 0x3d, 0x55, 0xe9, 0x24, 0x60, 0xfa,
|
|
0x25, 0x95, 0x1e, 0xd5, 0xb7, 0xef, 0x2d, 0x22, 0xf7, 0x3c, 0xbf, 0x37, 0x48, 0x98, 0x43, 0xca,
|
|
0x39, 0xe9, 0xd3, 0x94, 0x57, 0x79, 0xa7, 0xc2, 0xb5, 0xbd, 0x31, 0xf3, 0x5c, 0xb3, 0x85, 0x0a,
|
|
0x50, 0x65, 0xae, 0x06, 0xca, 0xa0, 0xba, 0x6e, 0xa9, 0xcc, 0x45, 0x4f, 0xe1, 0x0a, 0x17, 0x44,
|
|
0x50, 0x4d, 0x2d, 0x83, 0x6a, 0xa1, 0x51, 0xd7, 0xff, 0xec, 0xad, 0x67, 0x2c, 0xbd, 0x9d, 0x08,
|
|
0xad, 0x54, 0x8f, 0x4e, 0xe0, 0x96, 0x5c, 0x38, 0xe3, 0xc0, 0x4d, 0x7e, 0x04, 0x1b, 0x52, 0x2e,
|
|
0xc8, 0x30, 0xd0, 0x72, 0x65, 0x50, 0xcd, 0x37, 0x1e, 0x2c, 0x24, 0xcb, 0x13, 0x27, 0xcc, 0x83,
|
|
0xd7, 0xdd, 0x90, 0xb9, 0x87, 0x7e, 0x9f, 0xf5, 0x88, 0xd7, 0x4c, 0xa6, 0xd6, 0xa6, 0xe4, 0x75,
|
|
0x24, 0xce, 0x9e, 0xd3, 0x2a, 0x4d, 0xb8, 0x22, 0x7d, 0xd1, 0x1d, 0x58, 0x6a, 0xdb, 0xbb, 0xb6,
|
|
0xe1, 0x74, 0x9e, 0xb5, 0x9f, 0x1b, 0x4d, 0x73, 0xdf, 0x34, 0x5a, 0x45, 0x05, 0x15, 0xe1, 0x46,
|
|
0x3a, 0xde, 0x6d, 0xda, 0xe6, 0x91, 0x51, 0x04, 0xa8, 0x04, 0x6f, 0xa5, 0x93, 0x96, 0x71, 0x68,
|
|
0xd8, 0x46, 0xab, 0xa8, 0x56, 0xbe, 0x02, 0xb8, 0xd9, 0xf4, 0x87, 0x01, 0x11, 0xac, 0xeb, 0xd1,
|
|
0xa3, 0x24, 0x9e, 0x3f, 0x6a, 0x53, 0x81, 0xee, 0xc2, 0x35, 0x4e, 0x85, 0xc3, 0x5c, 0xae, 0x81,
|
|
0x72, 0xae, 0xba, 0x6e, 0xad, 0x72, 0x2a, 0x4c, 0x97, 0xa3, 0x03, 0xb8, 0xde, 0x4d, 0x62, 0xcb,
|
|
0xbf, 0xd4, 0x72, 0xae, 0x9a, 0x6f, 0xdc, 0xff, 0x8b, 0xae, 0xac, 0xff, 0xa5, 0x3a, 0x21, 0x9d,
|
|
0x42, 0xcd, 0xa5, 0x27, 0x64, 0xec, 0x89, 0x9b, 0xab, 0x6a, 0x2b, 0x23, 0xfe, 0x5c, 0xd6, 0x67,
|
|
0x00, 0x0b, 0x59, 0x3a, 0x36, 0xea, 0xb7, 0x88, 0x20, 0xe8, 0x18, 0x6e, 0x44, 0xe9, 0xc4, 0xe1,
|
|
0x54, 0xa4, 0x31, 0xf3, 0x8d, 0xc7, 0xcb, 0x64, 0x59, 0xd4, 0x98, 0x95, 0x8f, 0x2e, 0xd6, 0xbf,
|
|
0xcf, 0xa6, 0xde, 0x70, 0xb6, 0x8f, 0x00, 0x96, 0x6c, 0xc2, 0x07, 0x2f, 0x92, 0x4f, 0xa7, 0xc3,
|
|
0x69, 0x28, 0xe3, 0xed, 0xc3, 0x15, 0x09, 0x93, 0xaf, 0xf8, 0xbf, 0xd8, 0xa5, 0x72, 0x74, 0x0c,
|
|
0x6f, 0x47, 0x17, 0xc5, 0x39, 0x2e, 0x11, 0x24, 0x0b, 0xd0, 0x58, 0xa6, 0xa9, 0xab, 0x9d, 0x5b,
|
|
0x85, 0xe8, 0xca, 0xbe, 0xf2, 0x16, 0xc0, 0xed, 0xec, 0x11, 0xea, 0x5e, 0xcf, 0x60, 0xc2, 0xff,
|
|
0xa4, 0x61, 0x1a, 0xe1, 0xd1, 0x32, 0x86, 0xd7, 0x20, 0x96, 0x44, 0x20, 0x0d, 0xae, 0x65, 0xde,
|
|
0xf2, 0xf8, 0x39, 0x6b, 0xbe, 0xdd, 0x3b, 0x9d, 0x4c, 0xb1, 0x72, 0x36, 0xc5, 0xca, 0xf9, 0x14,
|
|
0x83, 0x37, 0x31, 0x06, 0x1f, 0x62, 0x0c, 0x3e, 0xc5, 0x18, 0x4c, 0x62, 0x0c, 0xbe, 0xc4, 0x18,
|
|
0x7c, 0x8b, 0xb1, 0x72, 0x1e, 0x63, 0xf0, 0x7e, 0x86, 0x95, 0xc9, 0x0c, 0x2b, 0x67, 0x33, 0xac,
|
|
0xbc, 0xdc, 0xe9, 0xfb, 0x3f, 0x8e, 0xc3, 0xfc, 0x5f, 0x5f, 0x6b, 0x4f, 0x2e, 0x6d, 0xbb, 0xab,
|
|
0xf2, 0x1e, 0x7a, 0xf8, 0x3d, 0x00, 0x00, 0xff, 0xff, 0x5d, 0xb3, 0x9f, 0xdd, 0x0f, 0x05, 0x00,
|
|
0x00,
|
|
}
|
|
|
|
func (x BuildID_State) String() string {
|
|
s, ok := BuildID_State_name[int32(x)]
|
|
if ok {
|
|
return s
|
|
}
|
|
return strconv.Itoa(int(x))
|
|
}
|
|
func (this *BuildID) Equal(that interface{}) bool {
|
|
if that == nil {
|
|
return this == nil
|
|
}
|
|
|
|
that1, ok := that.(*BuildID)
|
|
if !ok {
|
|
that2, ok := that.(BuildID)
|
|
if ok {
|
|
that1 = &that2
|
|
} else {
|
|
return false
|
|
}
|
|
}
|
|
if that1 == nil {
|
|
return this == nil
|
|
} else if this == nil {
|
|
return false
|
|
}
|
|
if this.Id != that1.Id {
|
|
return false
|
|
}
|
|
if this.State != that1.State {
|
|
return false
|
|
}
|
|
if !this.StateUpdateTimestamp.Equal(that1.StateUpdateTimestamp) {
|
|
return false
|
|
}
|
|
return true
|
|
}
|
|
func (this *CompatibleVersionSet) Equal(that interface{}) bool {
|
|
if that == nil {
|
|
return this == nil
|
|
}
|
|
|
|
that1, ok := that.(*CompatibleVersionSet)
|
|
if !ok {
|
|
that2, ok := that.(CompatibleVersionSet)
|
|
if ok {
|
|
that1 = &that2
|
|
} else {
|
|
return false
|
|
}
|
|
}
|
|
if that1 == nil {
|
|
return this == nil
|
|
} else if this == nil {
|
|
return false
|
|
}
|
|
if len(this.SetIds) != len(that1.SetIds) {
|
|
return false
|
|
}
|
|
for i := range this.SetIds {
|
|
if this.SetIds[i] != that1.SetIds[i] {
|
|
return false
|
|
}
|
|
}
|
|
if len(this.BuildIds) != len(that1.BuildIds) {
|
|
return false
|
|
}
|
|
for i := range this.BuildIds {
|
|
if !this.BuildIds[i].Equal(that1.BuildIds[i]) {
|
|
return false
|
|
}
|
|
}
|
|
if !this.DefaultUpdateTimestamp.Equal(that1.DefaultUpdateTimestamp) {
|
|
return false
|
|
}
|
|
return true
|
|
}
|
|
func (this *VersioningData) Equal(that interface{}) bool {
|
|
if that == nil {
|
|
return this == nil
|
|
}
|
|
|
|
that1, ok := that.(*VersioningData)
|
|
if !ok {
|
|
that2, ok := that.(VersioningData)
|
|
if ok {
|
|
that1 = &that2
|
|
} else {
|
|
return false
|
|
}
|
|
}
|
|
if that1 == nil {
|
|
return this == nil
|
|
} else if this == nil {
|
|
return false
|
|
}
|
|
if len(this.VersionSets) != len(that1.VersionSets) {
|
|
return false
|
|
}
|
|
for i := range this.VersionSets {
|
|
if !this.VersionSets[i].Equal(that1.VersionSets[i]) {
|
|
return false
|
|
}
|
|
}
|
|
if !this.DefaultUpdateTimestamp.Equal(that1.DefaultUpdateTimestamp) {
|
|
return false
|
|
}
|
|
return true
|
|
}
|
|
func (this *TaskQueueUserData) Equal(that interface{}) bool {
|
|
if that == nil {
|
|
return this == nil
|
|
}
|
|
|
|
that1, ok := that.(*TaskQueueUserData)
|
|
if !ok {
|
|
that2, ok := that.(TaskQueueUserData)
|
|
if ok {
|
|
that1 = &that2
|
|
} else {
|
|
return false
|
|
}
|
|
}
|
|
if that1 == nil {
|
|
return this == nil
|
|
} else if this == nil {
|
|
return false
|
|
}
|
|
if !this.Clock.Equal(that1.Clock) {
|
|
return false
|
|
}
|
|
if !this.VersioningData.Equal(that1.VersioningData) {
|
|
return false
|
|
}
|
|
return true
|
|
}
|
|
func (this *VersionedTaskQueueUserData) Equal(that interface{}) bool {
|
|
if that == nil {
|
|
return this == nil
|
|
}
|
|
|
|
that1, ok := that.(*VersionedTaskQueueUserData)
|
|
if !ok {
|
|
that2, ok := that.(VersionedTaskQueueUserData)
|
|
if ok {
|
|
that1 = &that2
|
|
} else {
|
|
return false
|
|
}
|
|
}
|
|
if that1 == nil {
|
|
return this == nil
|
|
} else if this == nil {
|
|
return false
|
|
}
|
|
if !this.Data.Equal(that1.Data) {
|
|
return false
|
|
}
|
|
if this.Version != that1.Version {
|
|
return false
|
|
}
|
|
return true
|
|
}
|
|
func (this *BuildID) GoString() string {
|
|
if this == nil {
|
|
return "nil"
|
|
}
|
|
s := make([]string, 0, 7)
|
|
s = append(s, "&persistence.BuildID{")
|
|
s = append(s, "Id: "+fmt.Sprintf("%#v", this.Id)+",\n")
|
|
s = append(s, "State: "+fmt.Sprintf("%#v", this.State)+",\n")
|
|
if this.StateUpdateTimestamp != nil {
|
|
s = append(s, "StateUpdateTimestamp: "+fmt.Sprintf("%#v", this.StateUpdateTimestamp)+",\n")
|
|
}
|
|
s = append(s, "}")
|
|
return strings.Join(s, "")
|
|
}
|
|
func (this *CompatibleVersionSet) GoString() string {
|
|
if this == nil {
|
|
return "nil"
|
|
}
|
|
s := make([]string, 0, 7)
|
|
s = append(s, "&persistence.CompatibleVersionSet{")
|
|
s = append(s, "SetIds: "+fmt.Sprintf("%#v", this.SetIds)+",\n")
|
|
if this.BuildIds != nil {
|
|
s = append(s, "BuildIds: "+fmt.Sprintf("%#v", this.BuildIds)+",\n")
|
|
}
|
|
if this.DefaultUpdateTimestamp != nil {
|
|
s = append(s, "DefaultUpdateTimestamp: "+fmt.Sprintf("%#v", this.DefaultUpdateTimestamp)+",\n")
|
|
}
|
|
s = append(s, "}")
|
|
return strings.Join(s, "")
|
|
}
|
|
func (this *VersioningData) GoString() string {
|
|
if this == nil {
|
|
return "nil"
|
|
}
|
|
s := make([]string, 0, 6)
|
|
s = append(s, "&persistence.VersioningData{")
|
|
if this.VersionSets != nil {
|
|
s = append(s, "VersionSets: "+fmt.Sprintf("%#v", this.VersionSets)+",\n")
|
|
}
|
|
if this.DefaultUpdateTimestamp != nil {
|
|
s = append(s, "DefaultUpdateTimestamp: "+fmt.Sprintf("%#v", this.DefaultUpdateTimestamp)+",\n")
|
|
}
|
|
s = append(s, "}")
|
|
return strings.Join(s, "")
|
|
}
|
|
func (this *TaskQueueUserData) GoString() string {
|
|
if this == nil {
|
|
return "nil"
|
|
}
|
|
s := make([]string, 0, 6)
|
|
s = append(s, "&persistence.TaskQueueUserData{")
|
|
if this.Clock != nil {
|
|
s = append(s, "Clock: "+fmt.Sprintf("%#v", this.Clock)+",\n")
|
|
}
|
|
if this.VersioningData != nil {
|
|
s = append(s, "VersioningData: "+fmt.Sprintf("%#v", this.VersioningData)+",\n")
|
|
}
|
|
s = append(s, "}")
|
|
return strings.Join(s, "")
|
|
}
|
|
func (this *VersionedTaskQueueUserData) GoString() string {
|
|
if this == nil {
|
|
return "nil"
|
|
}
|
|
s := make([]string, 0, 6)
|
|
s = append(s, "&persistence.VersionedTaskQueueUserData{")
|
|
if this.Data != nil {
|
|
s = append(s, "Data: "+fmt.Sprintf("%#v", this.Data)+",\n")
|
|
}
|
|
s = append(s, "Version: "+fmt.Sprintf("%#v", this.Version)+",\n")
|
|
s = append(s, "}")
|
|
return strings.Join(s, "")
|
|
}
|
|
func valueToGoStringTaskQueues(v interface{}, typ string) string {
|
|
rv := reflect.ValueOf(v)
|
|
if rv.IsNil() {
|
|
return "nil"
|
|
}
|
|
pv := reflect.Indirect(rv).Interface()
|
|
return fmt.Sprintf("func(v %v) *%v { return &v } ( %#v )", typ, typ, pv)
|
|
}
|
|
func (m *BuildID) Marshal() (dAtA []byte, err error) {
|
|
size := m.Size()
|
|
dAtA = make([]byte, size)
|
|
n, err := m.MarshalToSizedBuffer(dAtA[:size])
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return dAtA[:n], nil
|
|
}
|
|
|
|
func (m *BuildID) MarshalTo(dAtA []byte) (int, error) {
|
|
size := m.Size()
|
|
return m.MarshalToSizedBuffer(dAtA[:size])
|
|
}
|
|
|
|
func (m *BuildID) MarshalToSizedBuffer(dAtA []byte) (int, error) {
|
|
i := len(dAtA)
|
|
_ = i
|
|
var l int
|
|
_ = l
|
|
if m.StateUpdateTimestamp != nil {
|
|
{
|
|
size, err := m.StateUpdateTimestamp.MarshalToSizedBuffer(dAtA[:i])
|
|
if err != nil {
|
|
return 0, err
|
|
}
|
|
i -= size
|
|
i = encodeVarintTaskQueues(dAtA, i, uint64(size))
|
|
}
|
|
i--
|
|
dAtA[i] = 0x1a
|
|
}
|
|
if m.State != 0 {
|
|
i = encodeVarintTaskQueues(dAtA, i, uint64(m.State))
|
|
i--
|
|
dAtA[i] = 0x10
|
|
}
|
|
if len(m.Id) > 0 {
|
|
i -= len(m.Id)
|
|
copy(dAtA[i:], m.Id)
|
|
i = encodeVarintTaskQueues(dAtA, i, uint64(len(m.Id)))
|
|
i--
|
|
dAtA[i] = 0xa
|
|
}
|
|
return len(dAtA) - i, nil
|
|
}
|
|
|
|
func (m *CompatibleVersionSet) Marshal() (dAtA []byte, err error) {
|
|
size := m.Size()
|
|
dAtA = make([]byte, size)
|
|
n, err := m.MarshalToSizedBuffer(dAtA[:size])
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return dAtA[:n], nil
|
|
}
|
|
|
|
func (m *CompatibleVersionSet) MarshalTo(dAtA []byte) (int, error) {
|
|
size := m.Size()
|
|
return m.MarshalToSizedBuffer(dAtA[:size])
|
|
}
|
|
|
|
func (m *CompatibleVersionSet) MarshalToSizedBuffer(dAtA []byte) (int, error) {
|
|
i := len(dAtA)
|
|
_ = i
|
|
var l int
|
|
_ = l
|
|
if m.DefaultUpdateTimestamp != nil {
|
|
{
|
|
size, err := m.DefaultUpdateTimestamp.MarshalToSizedBuffer(dAtA[:i])
|
|
if err != nil {
|
|
return 0, err
|
|
}
|
|
i -= size
|
|
i = encodeVarintTaskQueues(dAtA, i, uint64(size))
|
|
}
|
|
i--
|
|
dAtA[i] = 0x1a
|
|
}
|
|
if len(m.BuildIds) > 0 {
|
|
for iNdEx := len(m.BuildIds) - 1; iNdEx >= 0; iNdEx-- {
|
|
{
|
|
size, err := m.BuildIds[iNdEx].MarshalToSizedBuffer(dAtA[:i])
|
|
if err != nil {
|
|
return 0, err
|
|
}
|
|
i -= size
|
|
i = encodeVarintTaskQueues(dAtA, i, uint64(size))
|
|
}
|
|
i--
|
|
dAtA[i] = 0x12
|
|
}
|
|
}
|
|
if len(m.SetIds) > 0 {
|
|
for iNdEx := len(m.SetIds) - 1; iNdEx >= 0; iNdEx-- {
|
|
i -= len(m.SetIds[iNdEx])
|
|
copy(dAtA[i:], m.SetIds[iNdEx])
|
|
i = encodeVarintTaskQueues(dAtA, i, uint64(len(m.SetIds[iNdEx])))
|
|
i--
|
|
dAtA[i] = 0xa
|
|
}
|
|
}
|
|
return len(dAtA) - i, nil
|
|
}
|
|
|
|
func (m *VersioningData) Marshal() (dAtA []byte, err error) {
|
|
size := m.Size()
|
|
dAtA = make([]byte, size)
|
|
n, err := m.MarshalToSizedBuffer(dAtA[:size])
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return dAtA[:n], nil
|
|
}
|
|
|
|
func (m *VersioningData) MarshalTo(dAtA []byte) (int, error) {
|
|
size := m.Size()
|
|
return m.MarshalToSizedBuffer(dAtA[:size])
|
|
}
|
|
|
|
func (m *VersioningData) MarshalToSizedBuffer(dAtA []byte) (int, error) {
|
|
i := len(dAtA)
|
|
_ = i
|
|
var l int
|
|
_ = l
|
|
if m.DefaultUpdateTimestamp != nil {
|
|
{
|
|
size, err := m.DefaultUpdateTimestamp.MarshalToSizedBuffer(dAtA[:i])
|
|
if err != nil {
|
|
return 0, err
|
|
}
|
|
i -= size
|
|
i = encodeVarintTaskQueues(dAtA, i, uint64(size))
|
|
}
|
|
i--
|
|
dAtA[i] = 0x12
|
|
}
|
|
if len(m.VersionSets) > 0 {
|
|
for iNdEx := len(m.VersionSets) - 1; iNdEx >= 0; iNdEx-- {
|
|
{
|
|
size, err := m.VersionSets[iNdEx].MarshalToSizedBuffer(dAtA[:i])
|
|
if err != nil {
|
|
return 0, err
|
|
}
|
|
i -= size
|
|
i = encodeVarintTaskQueues(dAtA, i, uint64(size))
|
|
}
|
|
i--
|
|
dAtA[i] = 0xa
|
|
}
|
|
}
|
|
return len(dAtA) - i, nil
|
|
}
|
|
|
|
func (m *TaskQueueUserData) Marshal() (dAtA []byte, err error) {
|
|
size := m.Size()
|
|
dAtA = make([]byte, size)
|
|
n, err := m.MarshalToSizedBuffer(dAtA[:size])
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return dAtA[:n], nil
|
|
}
|
|
|
|
func (m *TaskQueueUserData) MarshalTo(dAtA []byte) (int, error) {
|
|
size := m.Size()
|
|
return m.MarshalToSizedBuffer(dAtA[:size])
|
|
}
|
|
|
|
func (m *TaskQueueUserData) MarshalToSizedBuffer(dAtA []byte) (int, error) {
|
|
i := len(dAtA)
|
|
_ = i
|
|
var l int
|
|
_ = l
|
|
if m.VersioningData != nil {
|
|
{
|
|
size, err := m.VersioningData.MarshalToSizedBuffer(dAtA[:i])
|
|
if err != nil {
|
|
return 0, err
|
|
}
|
|
i -= size
|
|
i = encodeVarintTaskQueues(dAtA, i, uint64(size))
|
|
}
|
|
i--
|
|
dAtA[i] = 0x12
|
|
}
|
|
if m.Clock != nil {
|
|
{
|
|
size, err := m.Clock.MarshalToSizedBuffer(dAtA[:i])
|
|
if err != nil {
|
|
return 0, err
|
|
}
|
|
i -= size
|
|
i = encodeVarintTaskQueues(dAtA, i, uint64(size))
|
|
}
|
|
i--
|
|
dAtA[i] = 0xa
|
|
}
|
|
return len(dAtA) - i, nil
|
|
}
|
|
|
|
func (m *VersionedTaskQueueUserData) Marshal() (dAtA []byte, err error) {
|
|
size := m.Size()
|
|
dAtA = make([]byte, size)
|
|
n, err := m.MarshalToSizedBuffer(dAtA[:size])
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return dAtA[:n], nil
|
|
}
|
|
|
|
func (m *VersionedTaskQueueUserData) MarshalTo(dAtA []byte) (int, error) {
|
|
size := m.Size()
|
|
return m.MarshalToSizedBuffer(dAtA[:size])
|
|
}
|
|
|
|
func (m *VersionedTaskQueueUserData) MarshalToSizedBuffer(dAtA []byte) (int, error) {
|
|
i := len(dAtA)
|
|
_ = i
|
|
var l int
|
|
_ = l
|
|
if m.Version != 0 {
|
|
i = encodeVarintTaskQueues(dAtA, i, uint64(m.Version))
|
|
i--
|
|
dAtA[i] = 0x10
|
|
}
|
|
if m.Data != nil {
|
|
{
|
|
size, err := m.Data.MarshalToSizedBuffer(dAtA[:i])
|
|
if err != nil {
|
|
return 0, err
|
|
}
|
|
i -= size
|
|
i = encodeVarintTaskQueues(dAtA, i, uint64(size))
|
|
}
|
|
i--
|
|
dAtA[i] = 0xa
|
|
}
|
|
return len(dAtA) - i, nil
|
|
}
|
|
|
|
func encodeVarintTaskQueues(dAtA []byte, offset int, v uint64) int {
|
|
offset -= sovTaskQueues(v)
|
|
base := offset
|
|
for v >= 1<<7 {
|
|
dAtA[offset] = uint8(v&0x7f | 0x80)
|
|
v >>= 7
|
|
offset++
|
|
}
|
|
dAtA[offset] = uint8(v)
|
|
return base
|
|
}
|
|
func (m *BuildID) Size() (n int) {
|
|
if m == nil {
|
|
return 0
|
|
}
|
|
var l int
|
|
_ = l
|
|
l = len(m.Id)
|
|
if l > 0 {
|
|
n += 1 + l + sovTaskQueues(uint64(l))
|
|
}
|
|
if m.State != 0 {
|
|
n += 1 + sovTaskQueues(uint64(m.State))
|
|
}
|
|
if m.StateUpdateTimestamp != nil {
|
|
l = m.StateUpdateTimestamp.Size()
|
|
n += 1 + l + sovTaskQueues(uint64(l))
|
|
}
|
|
return n
|
|
}
|
|
|
|
func (m *CompatibleVersionSet) Size() (n int) {
|
|
if m == nil {
|
|
return 0
|
|
}
|
|
var l int
|
|
_ = l
|
|
if len(m.SetIds) > 0 {
|
|
for _, s := range m.SetIds {
|
|
l = len(s)
|
|
n += 1 + l + sovTaskQueues(uint64(l))
|
|
}
|
|
}
|
|
if len(m.BuildIds) > 0 {
|
|
for _, e := range m.BuildIds {
|
|
l = e.Size()
|
|
n += 1 + l + sovTaskQueues(uint64(l))
|
|
}
|
|
}
|
|
if m.DefaultUpdateTimestamp != nil {
|
|
l = m.DefaultUpdateTimestamp.Size()
|
|
n += 1 + l + sovTaskQueues(uint64(l))
|
|
}
|
|
return n
|
|
}
|
|
|
|
func (m *VersioningData) Size() (n int) {
|
|
if m == nil {
|
|
return 0
|
|
}
|
|
var l int
|
|
_ = l
|
|
if len(m.VersionSets) > 0 {
|
|
for _, e := range m.VersionSets {
|
|
l = e.Size()
|
|
n += 1 + l + sovTaskQueues(uint64(l))
|
|
}
|
|
}
|
|
if m.DefaultUpdateTimestamp != nil {
|
|
l = m.DefaultUpdateTimestamp.Size()
|
|
n += 1 + l + sovTaskQueues(uint64(l))
|
|
}
|
|
return n
|
|
}
|
|
|
|
func (m *TaskQueueUserData) Size() (n int) {
|
|
if m == nil {
|
|
return 0
|
|
}
|
|
var l int
|
|
_ = l
|
|
if m.Clock != nil {
|
|
l = m.Clock.Size()
|
|
n += 1 + l + sovTaskQueues(uint64(l))
|
|
}
|
|
if m.VersioningData != nil {
|
|
l = m.VersioningData.Size()
|
|
n += 1 + l + sovTaskQueues(uint64(l))
|
|
}
|
|
return n
|
|
}
|
|
|
|
func (m *VersionedTaskQueueUserData) Size() (n int) {
|
|
if m == nil {
|
|
return 0
|
|
}
|
|
var l int
|
|
_ = l
|
|
if m.Data != nil {
|
|
l = m.Data.Size()
|
|
n += 1 + l + sovTaskQueues(uint64(l))
|
|
}
|
|
if m.Version != 0 {
|
|
n += 1 + sovTaskQueues(uint64(m.Version))
|
|
}
|
|
return n
|
|
}
|
|
|
|
func sovTaskQueues(x uint64) (n int) {
|
|
return (math_bits.Len64(x|1) + 6) / 7
|
|
}
|
|
func sozTaskQueues(x uint64) (n int) {
|
|
return sovTaskQueues(uint64((x << 1) ^ uint64((int64(x) >> 63))))
|
|
}
|
|
func (this *BuildID) String() string {
|
|
if this == nil {
|
|
return "nil"
|
|
}
|
|
s := strings.Join([]string{`&BuildID{`,
|
|
`Id:` + fmt.Sprintf("%v", this.Id) + `,`,
|
|
`State:` + fmt.Sprintf("%v", this.State) + `,`,
|
|
`StateUpdateTimestamp:` + strings.Replace(fmt.Sprintf("%v", this.StateUpdateTimestamp), "HybridLogicalClock", "v1.HybridLogicalClock", 1) + `,`,
|
|
`}`,
|
|
}, "")
|
|
return s
|
|
}
|
|
func (this *CompatibleVersionSet) String() string {
|
|
if this == nil {
|
|
return "nil"
|
|
}
|
|
repeatedStringForBuildIds := "[]*BuildID{"
|
|
for _, f := range this.BuildIds {
|
|
repeatedStringForBuildIds += strings.Replace(f.String(), "BuildID", "BuildID", 1) + ","
|
|
}
|
|
repeatedStringForBuildIds += "}"
|
|
s := strings.Join([]string{`&CompatibleVersionSet{`,
|
|
`SetIds:` + fmt.Sprintf("%v", this.SetIds) + `,`,
|
|
`BuildIds:` + repeatedStringForBuildIds + `,`,
|
|
`DefaultUpdateTimestamp:` + strings.Replace(fmt.Sprintf("%v", this.DefaultUpdateTimestamp), "HybridLogicalClock", "v1.HybridLogicalClock", 1) + `,`,
|
|
`}`,
|
|
}, "")
|
|
return s
|
|
}
|
|
func (this *VersioningData) String() string {
|
|
if this == nil {
|
|
return "nil"
|
|
}
|
|
repeatedStringForVersionSets := "[]*CompatibleVersionSet{"
|
|
for _, f := range this.VersionSets {
|
|
repeatedStringForVersionSets += strings.Replace(f.String(), "CompatibleVersionSet", "CompatibleVersionSet", 1) + ","
|
|
}
|
|
repeatedStringForVersionSets += "}"
|
|
s := strings.Join([]string{`&VersioningData{`,
|
|
`VersionSets:` + repeatedStringForVersionSets + `,`,
|
|
`DefaultUpdateTimestamp:` + strings.Replace(fmt.Sprintf("%v", this.DefaultUpdateTimestamp), "HybridLogicalClock", "v1.HybridLogicalClock", 1) + `,`,
|
|
`}`,
|
|
}, "")
|
|
return s
|
|
}
|
|
func (this *TaskQueueUserData) String() string {
|
|
if this == nil {
|
|
return "nil"
|
|
}
|
|
s := strings.Join([]string{`&TaskQueueUserData{`,
|
|
`Clock:` + strings.Replace(fmt.Sprintf("%v", this.Clock), "HybridLogicalClock", "v1.HybridLogicalClock", 1) + `,`,
|
|
`VersioningData:` + strings.Replace(this.VersioningData.String(), "VersioningData", "VersioningData", 1) + `,`,
|
|
`}`,
|
|
}, "")
|
|
return s
|
|
}
|
|
func (this *VersionedTaskQueueUserData) String() string {
|
|
if this == nil {
|
|
return "nil"
|
|
}
|
|
s := strings.Join([]string{`&VersionedTaskQueueUserData{`,
|
|
`Data:` + strings.Replace(this.Data.String(), "TaskQueueUserData", "TaskQueueUserData", 1) + `,`,
|
|
`Version:` + fmt.Sprintf("%v", this.Version) + `,`,
|
|
`}`,
|
|
}, "")
|
|
return s
|
|
}
|
|
func valueToStringTaskQueues(v interface{}) string {
|
|
rv := reflect.ValueOf(v)
|
|
if rv.IsNil() {
|
|
return "nil"
|
|
}
|
|
pv := reflect.Indirect(rv).Interface()
|
|
return fmt.Sprintf("*%v", pv)
|
|
}
|
|
func (m *BuildID) Unmarshal(dAtA []byte) error {
|
|
l := len(dAtA)
|
|
iNdEx := 0
|
|
for iNdEx < l {
|
|
preIndex := iNdEx
|
|
var wire uint64
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
wire |= uint64(b&0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
fieldNum := int32(wire >> 3)
|
|
wireType := int(wire & 0x7)
|
|
if wireType == 4 {
|
|
return fmt.Errorf("proto: BuildID: wiretype end group for non-group")
|
|
}
|
|
if fieldNum <= 0 {
|
|
return fmt.Errorf("proto: BuildID: illegal tag %d (wire type %d)", fieldNum, wire)
|
|
}
|
|
switch fieldNum {
|
|
case 1:
|
|
if wireType != 2 {
|
|
return fmt.Errorf("proto: wrong wireType = %d for field Id", wireType)
|
|
}
|
|
var stringLen uint64
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
stringLen |= uint64(b&0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
intStringLen := int(stringLen)
|
|
if intStringLen < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
postIndex := iNdEx + intStringLen
|
|
if postIndex < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if postIndex > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
m.Id = string(dAtA[iNdEx:postIndex])
|
|
iNdEx = postIndex
|
|
case 2:
|
|
if wireType != 0 {
|
|
return fmt.Errorf("proto: wrong wireType = %d for field State", wireType)
|
|
}
|
|
m.State = 0
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
m.State |= BuildID_State(b&0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
case 3:
|
|
if wireType != 2 {
|
|
return fmt.Errorf("proto: wrong wireType = %d for field StateUpdateTimestamp", wireType)
|
|
}
|
|
var msglen int
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
msglen |= int(b&0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
if msglen < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
postIndex := iNdEx + msglen
|
|
if postIndex < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if postIndex > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
if m.StateUpdateTimestamp == nil {
|
|
m.StateUpdateTimestamp = &v1.HybridLogicalClock{}
|
|
}
|
|
if err := m.StateUpdateTimestamp.Unmarshal(dAtA[iNdEx:postIndex]); err != nil {
|
|
return err
|
|
}
|
|
iNdEx = postIndex
|
|
default:
|
|
iNdEx = preIndex
|
|
skippy, err := skipTaskQueues(dAtA[iNdEx:])
|
|
if err != nil {
|
|
return err
|
|
}
|
|
if skippy < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if (iNdEx + skippy) < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if (iNdEx + skippy) > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
iNdEx += skippy
|
|
}
|
|
}
|
|
|
|
if iNdEx > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
return nil
|
|
}
|
|
func (m *CompatibleVersionSet) Unmarshal(dAtA []byte) error {
|
|
l := len(dAtA)
|
|
iNdEx := 0
|
|
for iNdEx < l {
|
|
preIndex := iNdEx
|
|
var wire uint64
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
wire |= uint64(b&0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
fieldNum := int32(wire >> 3)
|
|
wireType := int(wire & 0x7)
|
|
if wireType == 4 {
|
|
return fmt.Errorf("proto: CompatibleVersionSet: wiretype end group for non-group")
|
|
}
|
|
if fieldNum <= 0 {
|
|
return fmt.Errorf("proto: CompatibleVersionSet: illegal tag %d (wire type %d)", fieldNum, wire)
|
|
}
|
|
switch fieldNum {
|
|
case 1:
|
|
if wireType != 2 {
|
|
return fmt.Errorf("proto: wrong wireType = %d for field SetIds", wireType)
|
|
}
|
|
var stringLen uint64
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
stringLen |= uint64(b&0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
intStringLen := int(stringLen)
|
|
if intStringLen < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
postIndex := iNdEx + intStringLen
|
|
if postIndex < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if postIndex > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
m.SetIds = append(m.SetIds, string(dAtA[iNdEx:postIndex]))
|
|
iNdEx = postIndex
|
|
case 2:
|
|
if wireType != 2 {
|
|
return fmt.Errorf("proto: wrong wireType = %d for field BuildIds", wireType)
|
|
}
|
|
var msglen int
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
msglen |= int(b&0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
if msglen < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
postIndex := iNdEx + msglen
|
|
if postIndex < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if postIndex > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
m.BuildIds = append(m.BuildIds, &BuildID{})
|
|
if err := m.BuildIds[len(m.BuildIds)-1].Unmarshal(dAtA[iNdEx:postIndex]); err != nil {
|
|
return err
|
|
}
|
|
iNdEx = postIndex
|
|
case 3:
|
|
if wireType != 2 {
|
|
return fmt.Errorf("proto: wrong wireType = %d for field DefaultUpdateTimestamp", wireType)
|
|
}
|
|
var msglen int
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
msglen |= int(b&0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
if msglen < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
postIndex := iNdEx + msglen
|
|
if postIndex < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if postIndex > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
if m.DefaultUpdateTimestamp == nil {
|
|
m.DefaultUpdateTimestamp = &v1.HybridLogicalClock{}
|
|
}
|
|
if err := m.DefaultUpdateTimestamp.Unmarshal(dAtA[iNdEx:postIndex]); err != nil {
|
|
return err
|
|
}
|
|
iNdEx = postIndex
|
|
default:
|
|
iNdEx = preIndex
|
|
skippy, err := skipTaskQueues(dAtA[iNdEx:])
|
|
if err != nil {
|
|
return err
|
|
}
|
|
if skippy < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if (iNdEx + skippy) < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if (iNdEx + skippy) > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
iNdEx += skippy
|
|
}
|
|
}
|
|
|
|
if iNdEx > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
return nil
|
|
}
|
|
func (m *VersioningData) Unmarshal(dAtA []byte) error {
|
|
l := len(dAtA)
|
|
iNdEx := 0
|
|
for iNdEx < l {
|
|
preIndex := iNdEx
|
|
var wire uint64
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
wire |= uint64(b&0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
fieldNum := int32(wire >> 3)
|
|
wireType := int(wire & 0x7)
|
|
if wireType == 4 {
|
|
return fmt.Errorf("proto: VersioningData: wiretype end group for non-group")
|
|
}
|
|
if fieldNum <= 0 {
|
|
return fmt.Errorf("proto: VersioningData: illegal tag %d (wire type %d)", fieldNum, wire)
|
|
}
|
|
switch fieldNum {
|
|
case 1:
|
|
if wireType != 2 {
|
|
return fmt.Errorf("proto: wrong wireType = %d for field VersionSets", wireType)
|
|
}
|
|
var msglen int
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
msglen |= int(b&0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
if msglen < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
postIndex := iNdEx + msglen
|
|
if postIndex < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if postIndex > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
m.VersionSets = append(m.VersionSets, &CompatibleVersionSet{})
|
|
if err := m.VersionSets[len(m.VersionSets)-1].Unmarshal(dAtA[iNdEx:postIndex]); err != nil {
|
|
return err
|
|
}
|
|
iNdEx = postIndex
|
|
case 2:
|
|
if wireType != 2 {
|
|
return fmt.Errorf("proto: wrong wireType = %d for field DefaultUpdateTimestamp", wireType)
|
|
}
|
|
var msglen int
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
msglen |= int(b&0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
if msglen < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
postIndex := iNdEx + msglen
|
|
if postIndex < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if postIndex > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
if m.DefaultUpdateTimestamp == nil {
|
|
m.DefaultUpdateTimestamp = &v1.HybridLogicalClock{}
|
|
}
|
|
if err := m.DefaultUpdateTimestamp.Unmarshal(dAtA[iNdEx:postIndex]); err != nil {
|
|
return err
|
|
}
|
|
iNdEx = postIndex
|
|
default:
|
|
iNdEx = preIndex
|
|
skippy, err := skipTaskQueues(dAtA[iNdEx:])
|
|
if err != nil {
|
|
return err
|
|
}
|
|
if skippy < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if (iNdEx + skippy) < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if (iNdEx + skippy) > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
iNdEx += skippy
|
|
}
|
|
}
|
|
|
|
if iNdEx > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
return nil
|
|
}
|
|
func (m *TaskQueueUserData) Unmarshal(dAtA []byte) error {
|
|
l := len(dAtA)
|
|
iNdEx := 0
|
|
for iNdEx < l {
|
|
preIndex := iNdEx
|
|
var wire uint64
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
wire |= uint64(b&0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
fieldNum := int32(wire >> 3)
|
|
wireType := int(wire & 0x7)
|
|
if wireType == 4 {
|
|
return fmt.Errorf("proto: TaskQueueUserData: wiretype end group for non-group")
|
|
}
|
|
if fieldNum <= 0 {
|
|
return fmt.Errorf("proto: TaskQueueUserData: illegal tag %d (wire type %d)", fieldNum, wire)
|
|
}
|
|
switch fieldNum {
|
|
case 1:
|
|
if wireType != 2 {
|
|
return fmt.Errorf("proto: wrong wireType = %d for field Clock", wireType)
|
|
}
|
|
var msglen int
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
msglen |= int(b&0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
if msglen < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
postIndex := iNdEx + msglen
|
|
if postIndex < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if postIndex > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
if m.Clock == nil {
|
|
m.Clock = &v1.HybridLogicalClock{}
|
|
}
|
|
if err := m.Clock.Unmarshal(dAtA[iNdEx:postIndex]); err != nil {
|
|
return err
|
|
}
|
|
iNdEx = postIndex
|
|
case 2:
|
|
if wireType != 2 {
|
|
return fmt.Errorf("proto: wrong wireType = %d for field VersioningData", wireType)
|
|
}
|
|
var msglen int
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
msglen |= int(b&0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
if msglen < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
postIndex := iNdEx + msglen
|
|
if postIndex < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if postIndex > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
if m.VersioningData == nil {
|
|
m.VersioningData = &VersioningData{}
|
|
}
|
|
if err := m.VersioningData.Unmarshal(dAtA[iNdEx:postIndex]); err != nil {
|
|
return err
|
|
}
|
|
iNdEx = postIndex
|
|
default:
|
|
iNdEx = preIndex
|
|
skippy, err := skipTaskQueues(dAtA[iNdEx:])
|
|
if err != nil {
|
|
return err
|
|
}
|
|
if skippy < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if (iNdEx + skippy) < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if (iNdEx + skippy) > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
iNdEx += skippy
|
|
}
|
|
}
|
|
|
|
if iNdEx > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
return nil
|
|
}
|
|
func (m *VersionedTaskQueueUserData) Unmarshal(dAtA []byte) error {
|
|
l := len(dAtA)
|
|
iNdEx := 0
|
|
for iNdEx < l {
|
|
preIndex := iNdEx
|
|
var wire uint64
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
wire |= uint64(b&0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
fieldNum := int32(wire >> 3)
|
|
wireType := int(wire & 0x7)
|
|
if wireType == 4 {
|
|
return fmt.Errorf("proto: VersionedTaskQueueUserData: wiretype end group for non-group")
|
|
}
|
|
if fieldNum <= 0 {
|
|
return fmt.Errorf("proto: VersionedTaskQueueUserData: illegal tag %d (wire type %d)", fieldNum, wire)
|
|
}
|
|
switch fieldNum {
|
|
case 1:
|
|
if wireType != 2 {
|
|
return fmt.Errorf("proto: wrong wireType = %d for field Data", wireType)
|
|
}
|
|
var msglen int
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
msglen |= int(b&0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
if msglen < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
postIndex := iNdEx + msglen
|
|
if postIndex < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if postIndex > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
if m.Data == nil {
|
|
m.Data = &TaskQueueUserData{}
|
|
}
|
|
if err := m.Data.Unmarshal(dAtA[iNdEx:postIndex]); err != nil {
|
|
return err
|
|
}
|
|
iNdEx = postIndex
|
|
case 2:
|
|
if wireType != 0 {
|
|
return fmt.Errorf("proto: wrong wireType = %d for field Version", wireType)
|
|
}
|
|
m.Version = 0
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
m.Version |= int64(b&0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
default:
|
|
iNdEx = preIndex
|
|
skippy, err := skipTaskQueues(dAtA[iNdEx:])
|
|
if err != nil {
|
|
return err
|
|
}
|
|
if skippy < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if (iNdEx + skippy) < 0 {
|
|
return ErrInvalidLengthTaskQueues
|
|
}
|
|
if (iNdEx + skippy) > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
iNdEx += skippy
|
|
}
|
|
}
|
|
|
|
if iNdEx > l {
|
|
return io.ErrUnexpectedEOF
|
|
}
|
|
return nil
|
|
}
|
|
func skipTaskQueues(dAtA []byte) (n int, err error) {
|
|
l := len(dAtA)
|
|
iNdEx := 0
|
|
depth := 0
|
|
for iNdEx < l {
|
|
var wire uint64
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return 0, ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return 0, io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
wire |= (uint64(b) & 0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
wireType := int(wire & 0x7)
|
|
switch wireType {
|
|
case 0:
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return 0, ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return 0, io.ErrUnexpectedEOF
|
|
}
|
|
iNdEx++
|
|
if dAtA[iNdEx-1] < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
case 1:
|
|
iNdEx += 8
|
|
case 2:
|
|
var length int
|
|
for shift := uint(0); ; shift += 7 {
|
|
if shift >= 64 {
|
|
return 0, ErrIntOverflowTaskQueues
|
|
}
|
|
if iNdEx >= l {
|
|
return 0, io.ErrUnexpectedEOF
|
|
}
|
|
b := dAtA[iNdEx]
|
|
iNdEx++
|
|
length |= (int(b) & 0x7F) << shift
|
|
if b < 0x80 {
|
|
break
|
|
}
|
|
}
|
|
if length < 0 {
|
|
return 0, ErrInvalidLengthTaskQueues
|
|
}
|
|
iNdEx += length
|
|
case 3:
|
|
depth++
|
|
case 4:
|
|
if depth == 0 {
|
|
return 0, ErrUnexpectedEndOfGroupTaskQueues
|
|
}
|
|
depth--
|
|
case 5:
|
|
iNdEx += 4
|
|
default:
|
|
return 0, fmt.Errorf("proto: illegal wireType %d", wireType)
|
|
}
|
|
if iNdEx < 0 {
|
|
return 0, ErrInvalidLengthTaskQueues
|
|
}
|
|
if depth == 0 {
|
|
return iNdEx, nil
|
|
}
|
|
}
|
|
return 0, io.ErrUnexpectedEOF
|
|
}
|
|
|
|
var (
|
|
ErrInvalidLengthTaskQueues = fmt.Errorf("proto: negative length found during unmarshaling")
|
|
ErrIntOverflowTaskQueues = fmt.Errorf("proto: integer overflow")
|
|
ErrUnexpectedEndOfGroupTaskQueues = fmt.Errorf("proto: unexpected end of group")
|
|
)
|