karmada/pkg/estimator/pb/generated.pb.go

// Code generated by protoc-gen-gogo. DO NOT EDIT.
// source: github.com/karmada-io/karmada/pkg/estimator/pb/generated.proto

package pb

import (
	fmt "fmt"

	io "io"

	proto "github.com/gogo/protobuf/proto"
	github_com_gogo_protobuf_sortkeys "github.com/gogo/protobuf/sortkeys"
	k8s_io_api_core_v1 "k8s.io/api/core/v1"
	v1 "k8s.io/api/core/v1"
	"k8s.io/apimachinery/pkg/api/resource"

	math "math"
	math_bits "math/bits"
	reflect "reflect"
	strings "strings"
)

// 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

func (m *MaxAvailableReplicasRequest) Reset()      { *m = MaxAvailableReplicasRequest{} }
func (*MaxAvailableReplicasRequest) ProtoMessage() {}
func (*MaxAvailableReplicasRequest) Descriptor() ([]byte, []int) {
	return fileDescriptor_9773618571bdb725, []int{0}
}
func (m *MaxAvailableReplicasRequest) XXX_Unmarshal(b []byte) error {
	return m.Unmarshal(b)
}
func (m *MaxAvailableReplicasRequest) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {
	b = b[:cap(b)]
	n, err := m.MarshalToSizedBuffer(b)
	if err != nil {
		return nil, err
	}
	return b[:n], nil
}
func (m *MaxAvailableReplicasRequest) XXX_Merge(src proto.Message) {
	xxx_messageInfo_MaxAvailableReplicasRequest.Merge(m, src)
}
func (m *MaxAvailableReplicasRequest) XXX_Size() int {
	return m.Size()
}
func (m *MaxAvailableReplicasRequest) XXX_DiscardUnknown() {
	xxx_messageInfo_MaxAvailableReplicasRequest.DiscardUnknown(m)
}

var xxx_messageInfo_MaxAvailableReplicasRequest proto.InternalMessageInfo

func (m *MaxAvailableReplicasResponse) Reset()      { *m = MaxAvailableReplicasResponse{} }
func (*MaxAvailableReplicasResponse) ProtoMessage() {}
func (*MaxAvailableReplicasResponse) Descriptor() ([]byte, []int) {
	return fileDescriptor_9773618571bdb725, []int{1}
}
func (m *MaxAvailableReplicasResponse) XXX_Unmarshal(b []byte) error {
	return m.Unmarshal(b)
}
func (m *MaxAvailableReplicasResponse) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {
	b = b[:cap(b)]
	n, err := m.MarshalToSizedBuffer(b)
	if err != nil {
		return nil, err
	}
	return b[:n], nil
}
func (m *MaxAvailableReplicasResponse) XXX_Merge(src proto.Message) {
	xxx_messageInfo_MaxAvailableReplicasResponse.Merge(m, src)
}
func (m *MaxAvailableReplicasResponse) XXX_Size() int {
	return m.Size()
}
func (m *MaxAvailableReplicasResponse) XXX_DiscardUnknown() {
	xxx_messageInfo_MaxAvailableReplicasResponse.DiscardUnknown(m)
}

var xxx_messageInfo_MaxAvailableReplicasResponse proto.InternalMessageInfo

func (m *NodeClaim) Reset()      { *m = NodeClaim{} }
func (*NodeClaim) ProtoMessage() {}
func (*NodeClaim) Descriptor() ([]byte, []int) {
	return fileDescriptor_9773618571bdb725, []int{2}
}
func (m *NodeClaim) XXX_Unmarshal(b []byte) error {
	return m.Unmarshal(b)
}
func (m *NodeClaim) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {
	b = b[:cap(b)]
	n, err := m.MarshalToSizedBuffer(b)
	if err != nil {
		return nil, err
	}
	return b[:n], nil
}
func (m *NodeClaim) XXX_Merge(src proto.Message) {
	xxx_messageInfo_NodeClaim.Merge(m, src)
}
func (m *NodeClaim) XXX_Size() int {
	return m.Size()
}
func (m *NodeClaim) XXX_DiscardUnknown() {
	xxx_messageInfo_NodeClaim.DiscardUnknown(m)
}

var xxx_messageInfo_NodeClaim proto.InternalMessageInfo

func (m *ReplicaRequirements) Reset()      { *m = ReplicaRequirements{} }
func (*ReplicaRequirements) ProtoMessage() {}
func (*ReplicaRequirements) Descriptor() ([]byte, []int) {
	return fileDescriptor_9773618571bdb725, []int{3}
}
func (m *ReplicaRequirements) XXX_Unmarshal(b []byte) error {
	return m.Unmarshal(b)
}
func (m *ReplicaRequirements) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {
	b = b[:cap(b)]
	n, err := m.MarshalToSizedBuffer(b)
	if err != nil {
		return nil, err
	}
	return b[:n], nil
}
func (m *ReplicaRequirements) XXX_Merge(src proto.Message) {
	xxx_messageInfo_ReplicaRequirements.Merge(m, src)
}
func (m *ReplicaRequirements) XXX_Size() int {
	return m.Size()
}
func (m *ReplicaRequirements) XXX_DiscardUnknown() {
	xxx_messageInfo_ReplicaRequirements.DiscardUnknown(m)
}

var xxx_messageInfo_ReplicaRequirements proto.InternalMessageInfo

func (m *UnimplementedEstimatorServer) Reset()      { *m = UnimplementedEstimatorServer{} }
func (*UnimplementedEstimatorServer) ProtoMessage() {}
func (*UnimplementedEstimatorServer) Descriptor() ([]byte, []int) {
	return fileDescriptor_9773618571bdb725, []int{4}
}
func (m *UnimplementedEstimatorServer) XXX_Unmarshal(b []byte) error {
	return m.Unmarshal(b)
}
func (m *UnimplementedEstimatorServer) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {
	b = b[:cap(b)]
	n, err := m.MarshalToSizedBuffer(b)
	if err != nil {
		return nil, err
	}
	return b[:n], nil
}
func (m *UnimplementedEstimatorServer) XXX_Merge(src proto.Message) {
	xxx_messageInfo_UnimplementedEstimatorServer.Merge(m, src)
}
func (m *UnimplementedEstimatorServer) XXX_Size() int {
	return m.Size()
}
func (m *UnimplementedEstimatorServer) XXX_DiscardUnknown() {
	xxx_messageInfo_UnimplementedEstimatorServer.DiscardUnknown(m)
}

var xxx_messageInfo_UnimplementedEstimatorServer proto.InternalMessageInfo

func init() {
	proto.RegisterType((*MaxAvailableReplicasRequest)(nil), "github.com.karmada_io.karmada.pkg.estimator.pb.MaxAvailableReplicasRequest")
	proto.RegisterType((*MaxAvailableReplicasResponse)(nil), "github.com.karmada_io.karmada.pkg.estimator.pb.MaxAvailableReplicasResponse")
	proto.RegisterType((*NodeClaim)(nil), "github.com.karmada_io.karmada.pkg.estimator.pb.NodeClaim")
	proto.RegisterMapType((map[string]string)(nil), "github.com.karmada_io.karmada.pkg.estimator.pb.NodeClaim.NodeSelectorEntry")
	proto.RegisterType((*ReplicaRequirements)(nil), "github.com.karmada_io.karmada.pkg.estimator.pb.ReplicaRequirements")
	proto.RegisterMapType((k8s_io_api_core_v1.ResourceList)(nil), "github.com.karmada_io.karmada.pkg.estimator.pb.ReplicaRequirements.ResourceRequestEntry")
	proto.RegisterType((*UnimplementedEstimatorServer)(nil), "github.com.karmada_io.karmada.pkg.estimator.pb.UnimplementedEstimatorServer")
}

func init() {
	proto.RegisterFile("github.com/karmada-io/karmada/pkg/estimator/pb/generated.proto", fileDescriptor_9773618571bdb725)
}

var fileDescriptor_9773618571bdb725 = []byte{
	// 649 bytes of a gzipped FileDescriptorProto
	0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0xac, 0x54, 0xcf, 0x6f, 0xd3, 0x4a,
	0x10, 0x8e, 0x13, 0x55, 0x55, 0xd6, 0x7d, 0x6a, 0x9f, 0xdb, 0x43, 0x94, 0x56, 0x4e, 0x94, 0x53,
	0xde, 0xa1, 0x6b, 0x35, 0x7a, 0x48, 0x85, 0x03, 0xa8, 0x2e, 0x3d, 0x41, 0x2b, 0xb1, 0xa5, 0x08,
	0x21, 0x21, 0xb4, 0x71, 0x26, 0xe9, 0x2a, 0xb6, 0xd7, 0xac, 0xd7, 0x51, 0x7b, 0x43, 0x20, 0xee,
	0x88, 0xbf, 0xaa, 0xc7, 0x5e, 0x90, 0x7a, 0x21, 0x10, 0xf3, 0x5f, 0x70, 0x42, 0xfe, 0x15, 0x3b,
	0xa9, 0x85, 0x54, 0xc4, 0x6d, 0x77, 0x67, 0xbe, 0x6f, 0x66, 0xbe, 0x6f, 0x6c, 0xf4, 0x70, 0xc4,
	0xe4, 0x79, 0xd0, 0xc7, 0x16, 0x77, 0x8c, 0x31, 0x15, 0x0e, 0x1d, 0xd0, 0x5d, 0xc6, 0xb3, 0xa3,
	0xe1, 0x8d, 0x47, 0x06, 0xf8, 0x92, 0x39, 0x54, 0x72, 0x61, 0x78, 0x7d, 0x63, 0x04, 0x2e, 0x08,
	0x2a, 0x61, 0x80, 0x3d, 0xc1, 0x25, 0xd7, 0x70, 0x8e, 0xc7, 0x29, 0xe8, 0x0d, 0xe3, 0xd9, 0x11,
	0x7b, 0xe3, 0x11, 0x9e, 0xe3, 0xb1, 0xd7, 0x6f, 0xee, 0x16, 0xea, 0x8d, 0xf8, 0x88, 0x1b, 0x31,
	0x4d, 0x3f, 0x18, 0xc6, 0xb7, 0xf8, 0x12, 0x9f, 0x12, 0xfa, 0x66, 0x67, 0xbc, 0xef, 0x63, 0xc6,
	0x0d, 0xea, 0x31, 0xc3, 0xe2, 0x02, 0x8c, 0xc9, 0xde, 0x72, 0x0b, 0xcd, 0xff, 0xf3, 0x1c, 0x87,
	0x5a, 0xe7, 0xcc, 0x05, 0x71, 0x19, 0x37, 0x1e, 0x81, 0x04, 0xf8, 0x3c, 0x10, 0x16, 0x2c, 0xa3,
	0x3a, 0x5f, 0x15, 0xb4, 0x7d, 0x4c, 0x2f, 0x0e, 0x26, 0x94, 0xd9, 0xb4, 0x6f, 0x03, 0x01, 0xcf,
	0x66, 0x16, 0xf5, 0x09, 0xbc, 0x0d, 0xc0, 0x97, 0xda, 0x7f, 0x68, 0xd5, 0xb2, 0x03, 0x5f, 0x82,
	0x68, 0x28, 0x6d, 0xa5, 0x5b, 0x37, 0xd7, 0xaf, 0xa6, 0xad, 0x4a, 0x38, 0x6d, 0xad, 0x1e, 0x26,
	0xcf, 0x24, 0x8b, 0x6b, 0x9f, 0x15, 0xb4, 0x29, 0x12, 0x78, 0x84, 0x66, 0x02, 0x1c, 0x70, 0xa5,
	0xdf, 0xa8, 0xb6, 0x95, 0xae, 0xda, 0x3b, 0xbc, 0xa3, 0x44, 0x98, 0xdc, 0xa6, 0x32, 0xb7, 0xd3,
	0xe2, 0x9b, 0x25, 0x41, 0x52, 0x56, 0xbc, 0x73, 0x86, 0x76, 0xca, 0xc7, 0xf3, 0x3d, 0xee, 0xfa,
	0xa0, 0xdd, 0x43, 0xaa, 0x43, 0x2f, 0xb2, 0xe7, 0x78, 0xc6, 0x15, 0x73, 0x33, 0x2d, 0xa3, 0x1e,
	0xe7, 0x21, 0x52, 0xcc, 0xeb, 0x7c, 0xa8, 0xa1, 0xfa, 0x09, 0x1f, 0xc0, 0xa1, 0x4d, 0x99, 0xa3,
	0xbd, 0x40, 0x6b, 0x2e, 0x1f, 0xc0, 0xc1, 0x70, 0xc8, 0x5c, 0x26, 0x2f, 0x63, 0x16, 0xb5, 0xd7,
	0xc6, 0x89, 0x23, 0x98, 0x7a, 0x0c, 0x47, 0xae, 0xe1, 0xc9, 0x1e, 0x8e, 0x40, 0xa7, 0x60, 0x83,
	0x25, 0xb9, 0x30, 0x37, 0xc2, 0x69, 0x6b, 0xed, 0xa4, 0x80, 0x24, 0x0b, 0x3c, 0xda, 0x47, 0x25,
	0x21, 0xce, 0x00, 0x8d, 0x6a, 0xbb, 0xd6, 0x55, 0x7b, 0x4f, 0xee, 0x2a, 0xe5, 0xbc, 0xd3, 0x85,
	0xf2, 0x47, 0xae, 0x14, 0x97, 0xe6, 0x56, 0x3a, 0xeb, 0x5a, 0x31, 0x44, 0x16, 0xca, 0x6a, 0x67,
	0x48, 0x95, 0xdc, 0x8e, 0xf6, 0x86, 0x71, 0xd7, 0x6f, 0xd4, 0xe2, 0x2e, 0xf4, 0xb2, 0xf1, 0x9e,
	0xcf, 0xd3, 0x72, 0x11, 0xf3, 0x37, 0x9f, 0x14, 0x79, 0x9a, 0x8f, 0xd0, 0xbf, 0xb7, 0xfa, 0xd1,
	0x36, 0x50, 0x6d, 0x0c, 0x89, 0x84, 0x75, 0x12, 0x1d, 0xb5, 0x2d, 0xb4, 0x32, 0xa1, 0x76, 0x00,
	0xf1, 0x22, 0xd5, 0x49, 0x72, 0x79, 0x50, 0xdd, 0x57, 0x3a, 0x5f, 0x6a, 0xa8, 0x6c, 0x13, 0xb4,
	0x21, 0xaa, 0xbb, 0xd9, 0xc8, 0xa9, 0x19, 0xf7, 0xff, 0x58, 0x33, 0xf3, 0x9f, 0x70, 0xda, 0xca,
	0xcd, 0x26, 0x39, 0xb5, 0x36, 0x53, 0xd0, 0x7a, 0xf6, 0x65, 0xa5, 0x1f, 0x4c, 0x6a, 0xd1, 0xcb,
	0xbf, 0xb0, 0xed, 0x98, 0x2c, 0x52, 0x27, 0x7e, 0xbd, 0x4e, 0x65, 0x5d, 0x5f, 0x8a, 0xfe, 0x9c,
	0xb6, 0x5a, 0xb7, 0xff, 0x12, 0x73, 0x8e, 0xa7, 0xcc, 0x97, 0xef, 0xbf, 0xfd, 0x36, 0xe5, 0x84,
	0x3a, 0x40, 0x96, 0xe7, 0x69, 0x0a, 0xb4, 0x55, 0xd6, 0x47, 0x89, 0x4f, 0x8f, 0x8b, 0x3e, 0xa9,
	0x3d, 0x5c, 0xd8, 0x8f, 0xf9, 0x0f, 0x29, 0x1e, 0x3c, 0x5a, 0x98, 0xac, 0x0c, 0x7e, 0x16, 0x50,
	0x57, 0x46, 0xab, 0x5f, 0xf0, 0x55, 0x47, 0x3b, 0x67, 0x2e, 0x73, 0x3c, 0x3b, 0x16, 0x02, 0x06,
	0x47, 0x99, 0x52, 0xa7, 0x20, 0x26, 0x20, 0xcc, 0xee, 0xd5, 0x4c, 0xaf, 0x5c, 0xcf, 0xf4, 0xca,
	0xcd, 0x4c, 0xaf, 0xbc, 0x0b, 0x75, 0xe5, 0x2a, 0xd4, 0x95, 0xeb, 0x50, 0x57, 0x6e, 0x42, 0x5d,
	0xf9, 0x1e, 0xea, 0xca, 0xa7, 0x1f, 0x7a, 0xe5, 0x55, 0xd5, 0xeb, 0xff, 0x0a, 0x00, 0x00, 0xff,
	0xff, 0xe8, 0xc9, 0x85, 0xca, 0xd8, 0x05, 0x00, 0x00,
}

func (m *MaxAvailableReplicasRequest) 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 *MaxAvailableReplicasRequest) MarshalTo(dAtA []byte) (int, error) {
	size := m.Size()
	return m.MarshalToSizedBuffer(dAtA[:size])
}

func (m *MaxAvailableReplicasRequest) MarshalToSizedBuffer(dAtA []byte) (int, error) {
	i := len(dAtA)
	_ = i
	var l int
	_ = l
	{
		size, err := m.ReplicaRequirements.MarshalToSizedBuffer(dAtA[:i])
		if err != nil {
			return 0, err
		}
		i -= size
		i = encodeVarintGenerated(dAtA, i, uint64(size))
	}
	i--
	dAtA[i] = 0x12
	i -= len(m.Cluster)
	copy(dAtA[i:], m.Cluster)
	i = encodeVarintGenerated(dAtA, i, uint64(len(m.Cluster)))
	i--
	dAtA[i] = 0xa
	return len(dAtA) - i, nil
}

func (m *MaxAvailableReplicasResponse) 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 *MaxAvailableReplicasResponse) MarshalTo(dAtA []byte) (int, error) {
	size := m.Size()
	return m.MarshalToSizedBuffer(dAtA[:size])
}

func (m *MaxAvailableReplicasResponse) MarshalToSizedBuffer(dAtA []byte) (int, error) {
	i := len(dAtA)
	_ = i
	var l int
	_ = l
	i = encodeVarintGenerated(dAtA, i, uint64(m.MaxReplicas))
	i--
	dAtA[i] = 0x8
	return len(dAtA) - i, nil
}

func (m *NodeClaim) 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 *NodeClaim) MarshalTo(dAtA []byte) (int, error) {
	size := m.Size()
	return m.MarshalToSizedBuffer(dAtA[:size])
}

func (m *NodeClaim) MarshalToSizedBuffer(dAtA []byte) (int, error) {
	i := len(dAtA)
	_ = i
	var l int
	_ = l
	if len(m.Tolerations) > 0 {
		for iNdEx := len(m.Tolerations) - 1; iNdEx >= 0; iNdEx-- {
			{
				size, err := m.Tolerations[iNdEx].MarshalToSizedBuffer(dAtA[:i])
				if err != nil {
					return 0, err
				}
				i -= size
				i = encodeVarintGenerated(dAtA, i, uint64(size))
			}
			i--
			dAtA[i] = 0x1a
		}
	}
	if len(m.NodeSelector) > 0 {
		keysForNodeSelector := make([]string, 0, len(m.NodeSelector))
		for k := range m.NodeSelector {
			keysForNodeSelector = append(keysForNodeSelector, string(k))
		}
		github_com_gogo_protobuf_sortkeys.Strings(keysForNodeSelector)
		for iNdEx := len(keysForNodeSelector) - 1; iNdEx >= 0; iNdEx-- {
			v := m.NodeSelector[string(keysForNodeSelector[iNdEx])]
			baseI := i
			i -= len(v)
			copy(dAtA[i:], v)
			i = encodeVarintGenerated(dAtA, i, uint64(len(v)))
			i--
			dAtA[i] = 0x12
			i -= len(keysForNodeSelector[iNdEx])
			copy(dAtA[i:], keysForNodeSelector[iNdEx])
			i = encodeVarintGenerated(dAtA, i, uint64(len(keysForNodeSelector[iNdEx])))
			i--
			dAtA[i] = 0xa
			i = encodeVarintGenerated(dAtA, i, uint64(baseI-i))
			i--
			dAtA[i] = 0x12
		}
	}
	if m.NodeAffinity != nil {
		{
			size, err := m.NodeAffinity.MarshalToSizedBuffer(dAtA[:i])
			if err != nil {
				return 0, err
			}
			i -= size
			i = encodeVarintGenerated(dAtA, i, uint64(size))
		}
		i--
		dAtA[i] = 0xa
	}
	return len(dAtA) - i, nil
}

func (m *ReplicaRequirements) 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 *ReplicaRequirements) MarshalTo(dAtA []byte) (int, error) {
	size := m.Size()
	return m.MarshalToSizedBuffer(dAtA[:size])
}

func (m *ReplicaRequirements) MarshalToSizedBuffer(dAtA []byte) (int, error) {
	i := len(dAtA)
	_ = i
	var l int
	_ = l
	if len(m.ResourceRequest) > 0 {
		keysForResourceRequest := make([]string, 0, len(m.ResourceRequest))
		for k := range m.ResourceRequest {
			keysForResourceRequest = append(keysForResourceRequest, string(k))
		}
		github_com_gogo_protobuf_sortkeys.Strings(keysForResourceRequest)
		for iNdEx := len(keysForResourceRequest) - 1; iNdEx >= 0; iNdEx-- {
			v := m.ResourceRequest[k8s_io_api_core_v1.ResourceName(keysForResourceRequest[iNdEx])]
			baseI := i
			{
				size, err := (&v).MarshalToSizedBuffer(dAtA[:i])
				if err != nil {
					return 0, err
				}
				i -= size
				i = encodeVarintGenerated(dAtA, i, uint64(size))
			}
			i--
			dAtA[i] = 0x12
			i -= len(keysForResourceRequest[iNdEx])
			copy(dAtA[i:], keysForResourceRequest[iNdEx])
			i = encodeVarintGenerated(dAtA, i, uint64(len(keysForResourceRequest[iNdEx])))
			i--
			dAtA[i] = 0xa
			i = encodeVarintGenerated(dAtA, i, uint64(baseI-i))
			i--
			dAtA[i] = 0x12
		}
	}
	if m.NodeClaim != nil {
		{
			size, err := m.NodeClaim.MarshalToSizedBuffer(dAtA[:i])
			if err != nil {
				return 0, err
			}
			i -= size
			i = encodeVarintGenerated(dAtA, i, uint64(size))
		}
		i--
		dAtA[i] = 0xa
	}
	return len(dAtA) - i, nil
}

func (m *UnimplementedEstimatorServer) 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 *UnimplementedEstimatorServer) MarshalTo(dAtA []byte) (int, error) {
	size := m.Size()
	return m.MarshalToSizedBuffer(dAtA[:size])
}

func (m *UnimplementedEstimatorServer) MarshalToSizedBuffer(dAtA []byte) (int, error) {
	i := len(dAtA)
	_ = i
	var l int
	_ = l
	return len(dAtA) - i, nil
}

func encodeVarintGenerated(dAtA []byte, offset int, v uint64) int {
	offset -= sovGenerated(v)
	base := offset
	for v >= 1<<7 {
		dAtA[offset] = uint8(v&0x7f | 0x80)
		v >>= 7
		offset++
	}
	dAtA[offset] = uint8(v)
	return base
}
func (m *MaxAvailableReplicasRequest) Size() (n int) {
	if m == nil {
		return 0
	}
	var l int
	_ = l
	l = len(m.Cluster)
	n += 1 + l + sovGenerated(uint64(l))
	l = m.ReplicaRequirements.Size()
	n += 1 + l + sovGenerated(uint64(l))
	return n
}

func (m *MaxAvailableReplicasResponse) Size() (n int) {
	if m == nil {
		return 0
	}
	var l int
	_ = l
	n += 1 + sovGenerated(uint64(m.MaxReplicas))
	return n
}

func (m *NodeClaim) Size() (n int) {
	if m == nil {
		return 0
	}
	var l int
	_ = l
	if m.NodeAffinity != nil {
		l = m.NodeAffinity.Size()
		n += 1 + l + sovGenerated(uint64(l))
	}
	if len(m.NodeSelector) > 0 {
		for k, v := range m.NodeSelector {
			_ = k
			_ = v
			mapEntrySize := 1 + len(k) + sovGenerated(uint64(len(k))) + 1 + len(v) + sovGenerated(uint64(len(v)))
			n += mapEntrySize + 1 + sovGenerated(uint64(mapEntrySize))
		}
	}
	if len(m.Tolerations) > 0 {
		for _, e := range m.Tolerations {
			l = e.Size()
			n += 1 + l + sovGenerated(uint64(l))
		}
	}
	return n
}

func (m *ReplicaRequirements) Size() (n int) {
	if m == nil {
		return 0
	}
	var l int
	_ = l
	if m.NodeClaim != nil {
		l = m.NodeClaim.Size()
		n += 1 + l + sovGenerated(uint64(l))
	}
	if len(m.ResourceRequest) > 0 {
		for k, v := range m.ResourceRequest {
			_ = k
			_ = v
			l = v.Size()
			mapEntrySize := 1 + len(k) + sovGenerated(uint64(len(k))) + 1 + l + sovGenerated(uint64(l))
			n += mapEntrySize + 1 + sovGenerated(uint64(mapEntrySize))
		}
	}
	return n
}

func (m *UnimplementedEstimatorServer) Size() (n int) {
	if m == nil {
		return 0
	}
	var l int
	_ = l
	return n
}

func sovGenerated(x uint64) (n int) {
	return (math_bits.Len64(x|1) + 6) / 7
}
func sozGenerated(x uint64) (n int) {
	return sovGenerated(uint64((x << 1) ^ uint64((int64(x) >> 63))))
}
func (this *MaxAvailableReplicasRequest) String() string {
	if this == nil {
		return "nil"
	}
	s := strings.Join([]string{`&MaxAvailableReplicasRequest{`,
		`Cluster:` + fmt.Sprintf("%v", this.Cluster) + `,`,
		`ReplicaRequirements:` + strings.Replace(strings.Replace(this.ReplicaRequirements.String(), "ReplicaRequirements", "ReplicaRequirements", 1), `&`, ``, 1) + `,`,
		`}`,
	}, "")
	return s
}
func (this *MaxAvailableReplicasResponse) String() string {
	if this == nil {
		return "nil"
	}
	s := strings.Join([]string{`&MaxAvailableReplicasResponse{`,
		`MaxReplicas:` + fmt.Sprintf("%v", this.MaxReplicas) + `,`,
		`}`,
	}, "")
	return s
}
func (this *NodeClaim) String() string {
	if this == nil {
		return "nil"
	}
	repeatedStringForTolerations := "[]Toleration{"
	for _, f := range this.Tolerations {
		repeatedStringForTolerations += fmt.Sprintf("%v", f) + ","
	}
	repeatedStringForTolerations += "}"
	keysForNodeSelector := make([]string, 0, len(this.NodeSelector))
	for k := range this.NodeSelector {
		keysForNodeSelector = append(keysForNodeSelector, k)
	}
	github_com_gogo_protobuf_sortkeys.Strings(keysForNodeSelector)
	mapStringForNodeSelector := "map[string]string{"
	for _, k := range keysForNodeSelector {
		mapStringForNodeSelector += fmt.Sprintf("%v: %v,", k, this.NodeSelector[k])
	}
	mapStringForNodeSelector += "}"
	s := strings.Join([]string{`&NodeClaim{`,
		`NodeAffinity:` + strings.Replace(fmt.Sprintf("%v", this.NodeAffinity), "NodeSelector", "v1.NodeSelector", 1) + `,`,
		`NodeSelector:` + mapStringForNodeSelector + `,`,
		`Tolerations:` + repeatedStringForTolerations + `,`,
		`}`,
	}, "")
	return s
}
func (this *ReplicaRequirements) String() string {
	if this == nil {
		return "nil"
	}
	keysForResourceRequest := make([]string, 0, len(this.ResourceRequest))
	for k := range this.ResourceRequest {
		keysForResourceRequest = append(keysForResourceRequest, string(k))
	}
	github_com_gogo_protobuf_sortkeys.Strings(keysForResourceRequest)
	mapStringForResourceRequest := "k8s_io_api_core_v1.ResourceList{"
	for _, k := range keysForResourceRequest {
		mapStringForResourceRequest += fmt.Sprintf("%v: %v,", k, this.ResourceRequest[k8s_io_api_core_v1.ResourceName(k)])
	}
	mapStringForResourceRequest += "}"
	s := strings.Join([]string{`&ReplicaRequirements{`,
		`NodeClaim:` + strings.Replace(this.NodeClaim.String(), "NodeClaim", "NodeClaim", 1) + `,`,
		`ResourceRequest:` + mapStringForResourceRequest + `,`,
		`}`,
	}, "")
	return s
}
func (this *UnimplementedEstimatorServer) String() string {
	if this == nil {
		return "nil"
	}
	s := strings.Join([]string{`&UnimplementedEstimatorServer{`,
		`}`,
	}, "")
	return s
}
func valueToStringGenerated(v interface{}) string {
	rv := reflect.ValueOf(v)
	if rv.IsNil() {
		return "nil"
	}
	pv := reflect.Indirect(rv).Interface()
	return fmt.Sprintf("*%v", pv)
}
func (m *MaxAvailableReplicasRequest) 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 ErrIntOverflowGenerated
			}
			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: MaxAvailableReplicasRequest: wiretype end group for non-group")
		}
		if fieldNum <= 0 {
			return fmt.Errorf("proto: MaxAvailableReplicasRequest: illegal tag %d (wire type %d)", fieldNum, wire)
		}
		switch fieldNum {
		case 1:
			if wireType != 2 {
				return fmt.Errorf("proto: wrong wireType = %d for field Cluster", wireType)
			}
			var stringLen uint64
			for shift := uint(0); ; shift += 7 {
				if shift >= 64 {
					return ErrIntOverflowGenerated
				}
				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 ErrInvalidLengthGenerated
			}
			postIndex := iNdEx + intStringLen
			if postIndex < 0 {
				return ErrInvalidLengthGenerated
			}
			if postIndex > l {
				return io.ErrUnexpectedEOF
			}
			m.Cluster = string(dAtA[iNdEx:postIndex])
			iNdEx = postIndex
		case 2:
			if wireType != 2 {
				return fmt.Errorf("proto: wrong wireType = %d for field ReplicaRequirements", wireType)
			}
			var msglen int
			for shift := uint(0); ; shift += 7 {
				if shift >= 64 {
					return ErrIntOverflowGenerated
				}
				if iNdEx >= l {
					return io.ErrUnexpectedEOF
				}
				b := dAtA[iNdEx]
				iNdEx++
				msglen |= int(b&0x7F) << shift
				if b < 0x80 {
					break
				}
			}
			if msglen < 0 {
				return ErrInvalidLengthGenerated
			}
			postIndex := iNdEx + msglen
			if postIndex < 0 {
				return ErrInvalidLengthGenerated
			}
			if postIndex > l {
				return io.ErrUnexpectedEOF
			}
			if err := m.ReplicaRequirements.Unmarshal(dAtA[iNdEx:postIndex]); err != nil {
				return err
			}
			iNdEx = postIndex
		default:
			iNdEx = preIndex
			skippy, err := skipGenerated(dAtA[iNdEx:])
			if err != nil {
				return err
			}
			if (skippy < 0) || (iNdEx+skippy) < 0 {
				return ErrInvalidLengthGenerated
			}
			if (iNdEx + skippy) > l {
				return io.ErrUnexpectedEOF
			}
			iNdEx += skippy
		}
	}

	if iNdEx > l {
		return io.ErrUnexpectedEOF
	}
	return nil
}
func (m *MaxAvailableReplicasResponse) 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 ErrIntOverflowGenerated
			}
			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: MaxAvailableReplicasResponse: wiretype end group for non-group")
		}
		if fieldNum <= 0 {
			return fmt.Errorf("proto: MaxAvailableReplicasResponse: illegal tag %d (wire type %d)", fieldNum, wire)
		}
		switch fieldNum {
		case 1:
			if wireType != 0 {
				return fmt.Errorf("proto: wrong wireType = %d for field MaxReplicas", wireType)
			}
			m.MaxReplicas = 0
			for shift := uint(0); ; shift += 7 {
				if shift >= 64 {
					return ErrIntOverflowGenerated
				}
				if iNdEx >= l {
					return io.ErrUnexpectedEOF
				}
				b := dAtA[iNdEx]
				iNdEx++
				m.MaxReplicas |= int32(b&0x7F) << shift
				if b < 0x80 {
					break
				}
			}
		default:
			iNdEx = preIndex
			skippy, err := skipGenerated(dAtA[iNdEx:])
			if err != nil {
				return err
			}
			if (skippy < 0) || (iNdEx+skippy) < 0 {
				return ErrInvalidLengthGenerated
			}
			if (iNdEx + skippy) > l {
				return io.ErrUnexpectedEOF
			}
			iNdEx += skippy
		}
	}

	if iNdEx > l {
		return io.ErrUnexpectedEOF
	}
	return nil
}
func (m *NodeClaim) 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 ErrIntOverflowGenerated
			}
			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: NodeClaim: wiretype end group for non-group")
		}
		if fieldNum <= 0 {
			return fmt.Errorf("proto: NodeClaim: illegal tag %d (wire type %d)", fieldNum, wire)
		}
		switch fieldNum {
		case 1:
			if wireType != 2 {
				return fmt.Errorf("proto: wrong wireType = %d for field NodeAffinity", wireType)
			}
			var msglen int
			for shift := uint(0); ; shift += 7 {
				if shift >= 64 {
					return ErrIntOverflowGenerated
				}
				if iNdEx >= l {
					return io.ErrUnexpectedEOF
				}
				b := dAtA[iNdEx]
				iNdEx++
				msglen |= int(b&0x7F) << shift
				if b < 0x80 {
					break
				}
			}
			if msglen < 0 {
				return ErrInvalidLengthGenerated
			}
			postIndex := iNdEx + msglen
			if postIndex < 0 {
				return ErrInvalidLengthGenerated
			}
			if postIndex > l {
				return io.ErrUnexpectedEOF
			}
			if m.NodeAffinity == nil {
				m.NodeAffinity = &v1.NodeSelector{}
			}
			if err := m.NodeAffinity.Unmarshal(dAtA[iNdEx:postIndex]); err != nil {
				return err
			}
			iNdEx = postIndex
		case 2:
			if wireType != 2 {
				return fmt.Errorf("proto: wrong wireType = %d for field NodeSelector", wireType)
			}
			var msglen int
			for shift := uint(0); ; shift += 7 {
				if shift >= 64 {
					return ErrIntOverflowGenerated
				}
				if iNdEx >= l {
					return io.ErrUnexpectedEOF
				}
				b := dAtA[iNdEx]
				iNdEx++
				msglen |= int(b&0x7F) << shift
				if b < 0x80 {
					break
				}
			}
			if msglen < 0 {
				return ErrInvalidLengthGenerated
			}
			postIndex := iNdEx + msglen
			if postIndex < 0 {
				return ErrInvalidLengthGenerated
			}
			if postIndex > l {
				return io.ErrUnexpectedEOF
			}
			if m.NodeSelector == nil {
				m.NodeSelector = make(map[string]string)
			}
			var mapkey string
			var mapvalue string
			for iNdEx < postIndex {
				entryPreIndex := iNdEx
				var wire uint64
				for shift := uint(0); ; shift += 7 {
					if shift >= 64 {
						return ErrIntOverflowGenerated
					}
					if iNdEx >= l {
						return io.ErrUnexpectedEOF
					}
					b := dAtA[iNdEx]
					iNdEx++
					wire |= uint64(b&0x7F) << shift
					if b < 0x80 {
						break
					}
				}
				fieldNum := int32(wire >> 3)
				if fieldNum == 1 {
					var stringLenmapkey uint64
					for shift := uint(0); ; shift += 7 {
						if shift >= 64 {
							return ErrIntOverflowGenerated
						}
						if iNdEx >= l {
							return io.ErrUnexpectedEOF
						}
						b := dAtA[iNdEx]
						iNdEx++
						stringLenmapkey |= uint64(b&0x7F) << shift
						if b < 0x80 {
							break
						}
					}
					intStringLenmapkey := int(stringLenmapkey)
					if intStringLenmapkey < 0 {
						return ErrInvalidLengthGenerated
					}
					postStringIndexmapkey := iNdEx + intStringLenmapkey
					if postStringIndexmapkey < 0 {
						return ErrInvalidLengthGenerated
					}
					if postStringIndexmapkey > l {
						return io.ErrUnexpectedEOF
					}
					mapkey = string(dAtA[iNdEx:postStringIndexmapkey])
					iNdEx = postStringIndexmapkey
				} else if fieldNum == 2 {
					var stringLenmapvalue uint64
					for shift := uint(0); ; shift += 7 {
						if shift >= 64 {
							return ErrIntOverflowGenerated
						}
						if iNdEx >= l {
							return io.ErrUnexpectedEOF
						}
						b := dAtA[iNdEx]
						iNdEx++
						stringLenmapvalue |= uint64(b&0x7F) << shift
						if b < 0x80 {
							break
						}
					}
					intStringLenmapvalue := int(stringLenmapvalue)
					if intStringLenmapvalue < 0 {
						return ErrInvalidLengthGenerated
					}
					postStringIndexmapvalue := iNdEx + intStringLenmapvalue
					if postStringIndexmapvalue < 0 {
						return ErrInvalidLengthGenerated
					}
					if postStringIndexmapvalue > l {
						return io.ErrUnexpectedEOF
					}
					mapvalue = string(dAtA[iNdEx:postStringIndexmapvalue])
					iNdEx = postStringIndexmapvalue
				} else {
					iNdEx = entryPreIndex
					skippy, err := skipGenerated(dAtA[iNdEx:])
					if err != nil {
						return err
					}
					if (skippy < 0) || (iNdEx+skippy) < 0 {
						return ErrInvalidLengthGenerated
					}
					if (iNdEx + skippy) > postIndex {
						return io.ErrUnexpectedEOF
					}
					iNdEx += skippy
				}
			}
			m.NodeSelector[mapkey] = mapvalue
			iNdEx = postIndex
		case 3:
			if wireType != 2 {
				return fmt.Errorf("proto: wrong wireType = %d for field Tolerations", wireType)
			}
			var msglen int
			for shift := uint(0); ; shift += 7 {
				if shift >= 64 {
					return ErrIntOverflowGenerated
				}
				if iNdEx >= l {
					return io.ErrUnexpectedEOF
				}
				b := dAtA[iNdEx]
				iNdEx++
				msglen |= int(b&0x7F) << shift
				if b < 0x80 {
					break
				}
			}
			if msglen < 0 {
				return ErrInvalidLengthGenerated
			}
			postIndex := iNdEx + msglen
			if postIndex < 0 {
				return ErrInvalidLengthGenerated
			}
			if postIndex > l {
				return io.ErrUnexpectedEOF
			}
			m.Tolerations = append(m.Tolerations, v1.Toleration{})
			if err := m.Tolerations[len(m.Tolerations)-1].Unmarshal(dAtA[iNdEx:postIndex]); err != nil {
				return err
			}
			iNdEx = postIndex
		default:
			iNdEx = preIndex
			skippy, err := skipGenerated(dAtA[iNdEx:])
			if err != nil {
				return err
			}
			if (skippy < 0) || (iNdEx+skippy) < 0 {
				return ErrInvalidLengthGenerated
			}
			if (iNdEx + skippy) > l {
				return io.ErrUnexpectedEOF
			}
			iNdEx += skippy
		}
	}

	if iNdEx > l {
		return io.ErrUnexpectedEOF
	}
	return nil
}
func (m *ReplicaRequirements) 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 ErrIntOverflowGenerated
			}
			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: ReplicaRequirements: wiretype end group for non-group")
		}
		if fieldNum <= 0 {
			return fmt.Errorf("proto: ReplicaRequirements: illegal tag %d (wire type %d)", fieldNum, wire)
		}
		switch fieldNum {
		case 1:
			if wireType != 2 {
				return fmt.Errorf("proto: wrong wireType = %d for field NodeClaim", wireType)
			}
			var msglen int
			for shift := uint(0); ; shift += 7 {
				if shift >= 64 {
					return ErrIntOverflowGenerated
				}
				if iNdEx >= l {
					return io.ErrUnexpectedEOF
				}
				b := dAtA[iNdEx]
				iNdEx++
				msglen |= int(b&0x7F) << shift
				if b < 0x80 {
					break
				}
			}
			if msglen < 0 {
				return ErrInvalidLengthGenerated
			}
			postIndex := iNdEx + msglen
			if postIndex < 0 {
				return ErrInvalidLengthGenerated
			}
			if postIndex > l {
				return io.ErrUnexpectedEOF
			}
			if m.NodeClaim == nil {
				m.NodeClaim = &NodeClaim{}
			}
			if err := m.NodeClaim.Unmarshal(dAtA[iNdEx:postIndex]); err != nil {
				return err
			}
			iNdEx = postIndex
		case 2:
			if wireType != 2 {
				return fmt.Errorf("proto: wrong wireType = %d for field ResourceRequest", wireType)
			}
			var msglen int
			for shift := uint(0); ; shift += 7 {
				if shift >= 64 {
					return ErrIntOverflowGenerated
				}
				if iNdEx >= l {
					return io.ErrUnexpectedEOF
				}
				b := dAtA[iNdEx]
				iNdEx++
				msglen |= int(b&0x7F) << shift
				if b < 0x80 {
					break
				}
			}
			if msglen < 0 {
				return ErrInvalidLengthGenerated
			}
			postIndex := iNdEx + msglen
			if postIndex < 0 {
				return ErrInvalidLengthGenerated
			}
			if postIndex > l {
				return io.ErrUnexpectedEOF
			}
			if m.ResourceRequest == nil {
				m.ResourceRequest = make(k8s_io_api_core_v1.ResourceList)
			}
			var mapkey k8s_io_api_core_v1.ResourceName
			mapvalue := &resource.Quantity{}
			for iNdEx < postIndex {
				entryPreIndex := iNdEx
				var wire uint64
				for shift := uint(0); ; shift += 7 {
					if shift >= 64 {
						return ErrIntOverflowGenerated
					}
					if iNdEx >= l {
						return io.ErrUnexpectedEOF
					}
					b := dAtA[iNdEx]
					iNdEx++
					wire |= uint64(b&0x7F) << shift
					if b < 0x80 {
						break
					}
				}
				fieldNum := int32(wire >> 3)
				if fieldNum == 1 {
					var stringLenmapkey uint64
					for shift := uint(0); ; shift += 7 {
						if shift >= 64 {
							return ErrIntOverflowGenerated
						}
						if iNdEx >= l {
							return io.ErrUnexpectedEOF
						}
						b := dAtA[iNdEx]
						iNdEx++
						stringLenmapkey |= uint64(b&0x7F) << shift
						if b < 0x80 {
							break
						}
					}
					intStringLenmapkey := int(stringLenmapkey)
					if intStringLenmapkey < 0 {
						return ErrInvalidLengthGenerated
					}
					postStringIndexmapkey := iNdEx + intStringLenmapkey
					if postStringIndexmapkey < 0 {
						return ErrInvalidLengthGenerated
					}
					if postStringIndexmapkey > l {
						return io.ErrUnexpectedEOF
					}
					mapkey = k8s_io_api_core_v1.ResourceName(dAtA[iNdEx:postStringIndexmapkey])
					iNdEx = postStringIndexmapkey
				} else if fieldNum == 2 {
					var mapmsglen int
					for shift := uint(0); ; shift += 7 {
						if shift >= 64 {
							return ErrIntOverflowGenerated
						}
						if iNdEx >= l {
							return io.ErrUnexpectedEOF
						}
						b := dAtA[iNdEx]
						iNdEx++
						mapmsglen |= int(b&0x7F) << shift
						if b < 0x80 {
							break
						}
					}
					if mapmsglen < 0 {
						return ErrInvalidLengthGenerated
					}
					postmsgIndex := iNdEx + mapmsglen
					if postmsgIndex < 0 {
						return ErrInvalidLengthGenerated
					}
					if postmsgIndex > l {
						return io.ErrUnexpectedEOF
					}
					mapvalue = &resource.Quantity{}
					if err := mapvalue.Unmarshal(dAtA[iNdEx:postmsgIndex]); err != nil {
						return err
					}
					iNdEx = postmsgIndex
				} else {
					iNdEx = entryPreIndex
					skippy, err := skipGenerated(dAtA[iNdEx:])
					if err != nil {
						return err
					}
					if (skippy < 0) || (iNdEx+skippy) < 0 {
						return ErrInvalidLengthGenerated
					}
					if (iNdEx + skippy) > postIndex {
						return io.ErrUnexpectedEOF
					}
					iNdEx += skippy
				}
			}
			m.ResourceRequest[k8s_io_api_core_v1.ResourceName(mapkey)] = *mapvalue
			iNdEx = postIndex
		default:
			iNdEx = preIndex
			skippy, err := skipGenerated(dAtA[iNdEx:])
			if err != nil {
				return err
			}
			if (skippy < 0) || (iNdEx+skippy) < 0 {
				return ErrInvalidLengthGenerated
			}
			if (iNdEx + skippy) > l {
				return io.ErrUnexpectedEOF
			}
			iNdEx += skippy
		}
	}

	if iNdEx > l {
		return io.ErrUnexpectedEOF
	}
	return nil
}
func (m *UnimplementedEstimatorServer) 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 ErrIntOverflowGenerated
			}
			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: UnimplementedEstimatorServer: wiretype end group for non-group")
		}
		if fieldNum <= 0 {
			return fmt.Errorf("proto: UnimplementedEstimatorServer: illegal tag %d (wire type %d)", fieldNum, wire)
		}
		switch fieldNum {
		default:
			iNdEx = preIndex
			skippy, err := skipGenerated(dAtA[iNdEx:])
			if err != nil {
				return err
			}
			if (skippy < 0) || (iNdEx+skippy) < 0 {
				return ErrInvalidLengthGenerated
			}
			if (iNdEx + skippy) > l {
				return io.ErrUnexpectedEOF
			}
			iNdEx += skippy
		}
	}

	if iNdEx > l {
		return io.ErrUnexpectedEOF
	}
	return nil
}
func skipGenerated(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, ErrIntOverflowGenerated
			}
			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, ErrIntOverflowGenerated
				}
				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, ErrIntOverflowGenerated
				}
				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, ErrInvalidLengthGenerated
			}
			iNdEx += length
		case 3:
			depth++
		case 4:
			if depth == 0 {
				return 0, ErrUnexpectedEndOfGroupGenerated
			}
			depth--
		case 5:
			iNdEx += 4
		default:
			return 0, fmt.Errorf("proto: illegal wireType %d", wireType)
		}
		if iNdEx < 0 {
			return 0, ErrInvalidLengthGenerated
		}
		if depth == 0 {
			return iNdEx, nil
		}
	}
	return 0, io.ErrUnexpectedEOF
}

var (
	ErrInvalidLengthGenerated        = fmt.Errorf("proto: negative length found during unmarshaling")
	ErrIntOverflowGenerated          = fmt.Errorf("proto: integer overflow")
	ErrUnexpectedEndOfGroupGenerated = fmt.Errorf("proto: unexpected end of group")
)