mirror of
https://github.com/genuinetools/reg.git
synced 2024-09-17 16:11:01 -04:00
501 lines
11 KiB
Go
501 lines
11 KiB
Go
|
// Code generated by protoc-gen-gogo. DO NOT EDIT.
|
||
|
// source: index.proto
|
||
|
|
||
|
/*
|
||
|
Package index is a generated protocol buffer package.
|
||
|
|
||
|
It is generated from these files:
|
||
|
index.proto
|
||
|
|
||
|
It has these top-level messages:
|
||
|
IndexQuery
|
||
|
*/
|
||
|
package index
|
||
|
|
||
|
import proto "github.com/gogo/protobuf/proto"
|
||
|
import fmt "fmt"
|
||
|
import math "math"
|
||
|
import _ "github.com/gogo/protobuf/gogoproto"
|
||
|
|
||
|
import bytes "bytes"
|
||
|
|
||
|
import io "io"
|
||
|
|
||
|
// 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.GoGoProtoPackageIsVersion2 // please upgrade the proto package
|
||
|
|
||
|
type IndexQuery struct {
|
||
|
Key *string `protobuf:"bytes,1,opt,name=Key" json:"Key,omitempty"`
|
||
|
Value *string `protobuf:"bytes,2,opt,name=Value" json:"Value,omitempty"`
|
||
|
XXX_unrecognized []byte `json:"-"`
|
||
|
}
|
||
|
|
||
|
func (m *IndexQuery) Reset() { *m = IndexQuery{} }
|
||
|
func (m *IndexQuery) String() string { return proto.CompactTextString(m) }
|
||
|
func (*IndexQuery) ProtoMessage() {}
|
||
|
func (*IndexQuery) Descriptor() ([]byte, []int) { return fileDescriptorIndex, []int{0} }
|
||
|
|
||
|
func (m *IndexQuery) GetKey() string {
|
||
|
if m != nil && m.Key != nil {
|
||
|
return *m.Key
|
||
|
}
|
||
|
return ""
|
||
|
}
|
||
|
|
||
|
func (m *IndexQuery) GetValue() string {
|
||
|
if m != nil && m.Value != nil {
|
||
|
return *m.Value
|
||
|
}
|
||
|
return ""
|
||
|
}
|
||
|
|
||
|
func init() {
|
||
|
proto.RegisterType((*IndexQuery)(nil), "index.IndexQuery")
|
||
|
}
|
||
|
func (this *IndexQuery) Equal(that interface{}) bool {
|
||
|
if that == nil {
|
||
|
if this == nil {
|
||
|
return true
|
||
|
}
|
||
|
return false
|
||
|
}
|
||
|
|
||
|
that1, ok := that.(*IndexQuery)
|
||
|
if !ok {
|
||
|
that2, ok := that.(IndexQuery)
|
||
|
if ok {
|
||
|
that1 = &that2
|
||
|
} else {
|
||
|
return false
|
||
|
}
|
||
|
}
|
||
|
if that1 == nil {
|
||
|
if this == nil {
|
||
|
return true
|
||
|
}
|
||
|
return false
|
||
|
} else if this == nil {
|
||
|
return false
|
||
|
}
|
||
|
if this.Key != nil && that1.Key != nil {
|
||
|
if *this.Key != *that1.Key {
|
||
|
return false
|
||
|
}
|
||
|
} else if this.Key != nil {
|
||
|
return false
|
||
|
} else if that1.Key != nil {
|
||
|
return false
|
||
|
}
|
||
|
if this.Value != nil && that1.Value != nil {
|
||
|
if *this.Value != *that1.Value {
|
||
|
return false
|
||
|
}
|
||
|
} else if this.Value != nil {
|
||
|
return false
|
||
|
} else if that1.Value != nil {
|
||
|
return false
|
||
|
}
|
||
|
if !bytes.Equal(this.XXX_unrecognized, that1.XXX_unrecognized) {
|
||
|
return false
|
||
|
}
|
||
|
return true
|
||
|
}
|
||
|
func (m *IndexQuery) Marshal() (dAtA []byte, err error) {
|
||
|
size := m.Size()
|
||
|
dAtA = make([]byte, size)
|
||
|
n, err := m.MarshalTo(dAtA)
|
||
|
if err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
return dAtA[:n], nil
|
||
|
}
|
||
|
|
||
|
func (m *IndexQuery) MarshalTo(dAtA []byte) (int, error) {
|
||
|
var i int
|
||
|
_ = i
|
||
|
var l int
|
||
|
_ = l
|
||
|
if m.Key != nil {
|
||
|
dAtA[i] = 0xa
|
||
|
i++
|
||
|
i = encodeVarintIndex(dAtA, i, uint64(len(*m.Key)))
|
||
|
i += copy(dAtA[i:], *m.Key)
|
||
|
}
|
||
|
if m.Value != nil {
|
||
|
dAtA[i] = 0x12
|
||
|
i++
|
||
|
i = encodeVarintIndex(dAtA, i, uint64(len(*m.Value)))
|
||
|
i += copy(dAtA[i:], *m.Value)
|
||
|
}
|
||
|
if m.XXX_unrecognized != nil {
|
||
|
i += copy(dAtA[i:], m.XXX_unrecognized)
|
||
|
}
|
||
|
return i, nil
|
||
|
}
|
||
|
|
||
|
func encodeVarintIndex(dAtA []byte, offset int, v uint64) int {
|
||
|
for v >= 1<<7 {
|
||
|
dAtA[offset] = uint8(v&0x7f | 0x80)
|
||
|
v >>= 7
|
||
|
offset++
|
||
|
}
|
||
|
dAtA[offset] = uint8(v)
|
||
|
return offset + 1
|
||
|
}
|
||
|
func NewPopulatedIndexQuery(r randyIndex, easy bool) *IndexQuery {
|
||
|
this := &IndexQuery{}
|
||
|
if r.Intn(10) != 0 {
|
||
|
v1 := string(randStringIndex(r))
|
||
|
this.Key = &v1
|
||
|
}
|
||
|
if r.Intn(10) != 0 {
|
||
|
v2 := string(randStringIndex(r))
|
||
|
this.Value = &v2
|
||
|
}
|
||
|
if !easy && r.Intn(10) != 0 {
|
||
|
this.XXX_unrecognized = randUnrecognizedIndex(r, 3)
|
||
|
}
|
||
|
return this
|
||
|
}
|
||
|
|
||
|
type randyIndex interface {
|
||
|
Float32() float32
|
||
|
Float64() float64
|
||
|
Int63() int64
|
||
|
Int31() int32
|
||
|
Uint32() uint32
|
||
|
Intn(n int) int
|
||
|
}
|
||
|
|
||
|
func randUTF8RuneIndex(r randyIndex) rune {
|
||
|
ru := r.Intn(62)
|
||
|
if ru < 10 {
|
||
|
return rune(ru + 48)
|
||
|
} else if ru < 36 {
|
||
|
return rune(ru + 55)
|
||
|
}
|
||
|
return rune(ru + 61)
|
||
|
}
|
||
|
func randStringIndex(r randyIndex) string {
|
||
|
v3 := r.Intn(100)
|
||
|
tmps := make([]rune, v3)
|
||
|
for i := 0; i < v3; i++ {
|
||
|
tmps[i] = randUTF8RuneIndex(r)
|
||
|
}
|
||
|
return string(tmps)
|
||
|
}
|
||
|
func randUnrecognizedIndex(r randyIndex, maxFieldNumber int) (dAtA []byte) {
|
||
|
l := r.Intn(5)
|
||
|
for i := 0; i < l; i++ {
|
||
|
wire := r.Intn(4)
|
||
|
if wire == 3 {
|
||
|
wire = 5
|
||
|
}
|
||
|
fieldNumber := maxFieldNumber + r.Intn(100)
|
||
|
dAtA = randFieldIndex(dAtA, r, fieldNumber, wire)
|
||
|
}
|
||
|
return dAtA
|
||
|
}
|
||
|
func randFieldIndex(dAtA []byte, r randyIndex, fieldNumber int, wire int) []byte {
|
||
|
key := uint32(fieldNumber)<<3 | uint32(wire)
|
||
|
switch wire {
|
||
|
case 0:
|
||
|
dAtA = encodeVarintPopulateIndex(dAtA, uint64(key))
|
||
|
v4 := r.Int63()
|
||
|
if r.Intn(2) == 0 {
|
||
|
v4 *= -1
|
||
|
}
|
||
|
dAtA = encodeVarintPopulateIndex(dAtA, uint64(v4))
|
||
|
case 1:
|
||
|
dAtA = encodeVarintPopulateIndex(dAtA, uint64(key))
|
||
|
dAtA = append(dAtA, byte(r.Intn(256)), byte(r.Intn(256)), byte(r.Intn(256)), byte(r.Intn(256)), byte(r.Intn(256)), byte(r.Intn(256)), byte(r.Intn(256)), byte(r.Intn(256)))
|
||
|
case 2:
|
||
|
dAtA = encodeVarintPopulateIndex(dAtA, uint64(key))
|
||
|
ll := r.Intn(100)
|
||
|
dAtA = encodeVarintPopulateIndex(dAtA, uint64(ll))
|
||
|
for j := 0; j < ll; j++ {
|
||
|
dAtA = append(dAtA, byte(r.Intn(256)))
|
||
|
}
|
||
|
default:
|
||
|
dAtA = encodeVarintPopulateIndex(dAtA, uint64(key))
|
||
|
dAtA = append(dAtA, byte(r.Intn(256)), byte(r.Intn(256)), byte(r.Intn(256)), byte(r.Intn(256)))
|
||
|
}
|
||
|
return dAtA
|
||
|
}
|
||
|
func encodeVarintPopulateIndex(dAtA []byte, v uint64) []byte {
|
||
|
for v >= 1<<7 {
|
||
|
dAtA = append(dAtA, uint8(uint64(v)&0x7f|0x80))
|
||
|
v >>= 7
|
||
|
}
|
||
|
dAtA = append(dAtA, uint8(v))
|
||
|
return dAtA
|
||
|
}
|
||
|
func (m *IndexQuery) Size() (n int) {
|
||
|
var l int
|
||
|
_ = l
|
||
|
if m.Key != nil {
|
||
|
l = len(*m.Key)
|
||
|
n += 1 + l + sovIndex(uint64(l))
|
||
|
}
|
||
|
if m.Value != nil {
|
||
|
l = len(*m.Value)
|
||
|
n += 1 + l + sovIndex(uint64(l))
|
||
|
}
|
||
|
if m.XXX_unrecognized != nil {
|
||
|
n += len(m.XXX_unrecognized)
|
||
|
}
|
||
|
return n
|
||
|
}
|
||
|
|
||
|
func sovIndex(x uint64) (n int) {
|
||
|
for {
|
||
|
n++
|
||
|
x >>= 7
|
||
|
if x == 0 {
|
||
|
break
|
||
|
}
|
||
|
}
|
||
|
return n
|
||
|
}
|
||
|
func sozIndex(x uint64) (n int) {
|
||
|
return sovIndex(uint64((x << 1) ^ uint64((int64(x) >> 63))))
|
||
|
}
|
||
|
func (m *IndexQuery) 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 ErrIntOverflowIndex
|
||
|
}
|
||
|
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: IndexQuery: wiretype end group for non-group")
|
||
|
}
|
||
|
if fieldNum <= 0 {
|
||
|
return fmt.Errorf("proto: IndexQuery: illegal tag %d (wire type %d)", fieldNum, wire)
|
||
|
}
|
||
|
switch fieldNum {
|
||
|
case 1:
|
||
|
if wireType != 2 {
|
||
|
return fmt.Errorf("proto: wrong wireType = %d for field Key", wireType)
|
||
|
}
|
||
|
var stringLen uint64
|
||
|
for shift := uint(0); ; shift += 7 {
|
||
|
if shift >= 64 {
|
||
|
return ErrIntOverflowIndex
|
||
|
}
|
||
|
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 ErrInvalidLengthIndex
|
||
|
}
|
||
|
postIndex := iNdEx + intStringLen
|
||
|
if postIndex > l {
|
||
|
return io.ErrUnexpectedEOF
|
||
|
}
|
||
|
s := string(dAtA[iNdEx:postIndex])
|
||
|
m.Key = &s
|
||
|
iNdEx = postIndex
|
||
|
case 2:
|
||
|
if wireType != 2 {
|
||
|
return fmt.Errorf("proto: wrong wireType = %d for field Value", wireType)
|
||
|
}
|
||
|
var stringLen uint64
|
||
|
for shift := uint(0); ; shift += 7 {
|
||
|
if shift >= 64 {
|
||
|
return ErrIntOverflowIndex
|
||
|
}
|
||
|
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 ErrInvalidLengthIndex
|
||
|
}
|
||
|
postIndex := iNdEx + intStringLen
|
||
|
if postIndex > l {
|
||
|
return io.ErrUnexpectedEOF
|
||
|
}
|
||
|
s := string(dAtA[iNdEx:postIndex])
|
||
|
m.Value = &s
|
||
|
iNdEx = postIndex
|
||
|
default:
|
||
|
iNdEx = preIndex
|
||
|
skippy, err := skipIndex(dAtA[iNdEx:])
|
||
|
if err != nil {
|
||
|
return err
|
||
|
}
|
||
|
if skippy < 0 {
|
||
|
return ErrInvalidLengthIndex
|
||
|
}
|
||
|
if (iNdEx + skippy) > l {
|
||
|
return io.ErrUnexpectedEOF
|
||
|
}
|
||
|
m.XXX_unrecognized = append(m.XXX_unrecognized, dAtA[iNdEx:iNdEx+skippy]...)
|
||
|
iNdEx += skippy
|
||
|
}
|
||
|
}
|
||
|
|
||
|
if iNdEx > l {
|
||
|
return io.ErrUnexpectedEOF
|
||
|
}
|
||
|
return nil
|
||
|
}
|
||
|
func skipIndex(dAtA []byte) (n int, err error) {
|
||
|
l := len(dAtA)
|
||
|
iNdEx := 0
|
||
|
for iNdEx < l {
|
||
|
var wire uint64
|
||
|
for shift := uint(0); ; shift += 7 {
|
||
|
if shift >= 64 {
|
||
|
return 0, ErrIntOverflowIndex
|
||
|
}
|
||
|
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, ErrIntOverflowIndex
|
||
|
}
|
||
|
if iNdEx >= l {
|
||
|
return 0, io.ErrUnexpectedEOF
|
||
|
}
|
||
|
iNdEx++
|
||
|
if dAtA[iNdEx-1] < 0x80 {
|
||
|
break
|
||
|
}
|
||
|
}
|
||
|
return iNdEx, nil
|
||
|
case 1:
|
||
|
iNdEx += 8
|
||
|
return iNdEx, nil
|
||
|
case 2:
|
||
|
var length int
|
||
|
for shift := uint(0); ; shift += 7 {
|
||
|
if shift >= 64 {
|
||
|
return 0, ErrIntOverflowIndex
|
||
|
}
|
||
|
if iNdEx >= l {
|
||
|
return 0, io.ErrUnexpectedEOF
|
||
|
}
|
||
|
b := dAtA[iNdEx]
|
||
|
iNdEx++
|
||
|
length |= (int(b) & 0x7F) << shift
|
||
|
if b < 0x80 {
|
||
|
break
|
||
|
}
|
||
|
}
|
||
|
iNdEx += length
|
||
|
if length < 0 {
|
||
|
return 0, ErrInvalidLengthIndex
|
||
|
}
|
||
|
return iNdEx, nil
|
||
|
case 3:
|
||
|
for {
|
||
|
var innerWire uint64
|
||
|
var start int = iNdEx
|
||
|
for shift := uint(0); ; shift += 7 {
|
||
|
if shift >= 64 {
|
||
|
return 0, ErrIntOverflowIndex
|
||
|
}
|
||
|
if iNdEx >= l {
|
||
|
return 0, io.ErrUnexpectedEOF
|
||
|
}
|
||
|
b := dAtA[iNdEx]
|
||
|
iNdEx++
|
||
|
innerWire |= (uint64(b) & 0x7F) << shift
|
||
|
if b < 0x80 {
|
||
|
break
|
||
|
}
|
||
|
}
|
||
|
innerWireType := int(innerWire & 0x7)
|
||
|
if innerWireType == 4 {
|
||
|
break
|
||
|
}
|
||
|
next, err := skipIndex(dAtA[start:])
|
||
|
if err != nil {
|
||
|
return 0, err
|
||
|
}
|
||
|
iNdEx = start + next
|
||
|
}
|
||
|
return iNdEx, nil
|
||
|
case 4:
|
||
|
return iNdEx, nil
|
||
|
case 5:
|
||
|
iNdEx += 4
|
||
|
return iNdEx, nil
|
||
|
default:
|
||
|
return 0, fmt.Errorf("proto: illegal wireType %d", wireType)
|
||
|
}
|
||
|
}
|
||
|
panic("unreachable")
|
||
|
}
|
||
|
|
||
|
var (
|
||
|
ErrInvalidLengthIndex = fmt.Errorf("proto: negative length found during unmarshaling")
|
||
|
ErrIntOverflowIndex = fmt.Errorf("proto: integer overflow")
|
||
|
)
|
||
|
|
||
|
func init() { proto.RegisterFile("index.proto", fileDescriptorIndex) }
|
||
|
|
||
|
var fileDescriptorIndex = []byte{
|
||
|
// 141 bytes of a gzipped FileDescriptorProto
|
||
|
0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0xe2, 0xe2, 0xce, 0xcc, 0x4b, 0x49,
|
||
|
0xad, 0xd0, 0x2b, 0x28, 0xca, 0x2f, 0xc9, 0x17, 0x62, 0x05, 0x73, 0xa4, 0x74, 0xd3, 0x33, 0x4b,
|
||
|
0x32, 0x4a, 0x93, 0xf4, 0x92, 0xf3, 0x73, 0xf5, 0xd3, 0xf3, 0xd3, 0xf3, 0xf5, 0xc1, 0xb2, 0x49,
|
||
|
0xa5, 0x69, 0x60, 0x1e, 0x98, 0x03, 0x66, 0x41, 0x74, 0x29, 0x99, 0x70, 0x71, 0x79, 0x82, 0xf4,
|
||
|
0x05, 0x96, 0xa6, 0x16, 0x55, 0x0a, 0x09, 0x70, 0x31, 0x7b, 0xa7, 0x56, 0x4a, 0x30, 0x2a, 0x30,
|
||
|
0x6a, 0x70, 0x06, 0x81, 0x98, 0x42, 0x22, 0x5c, 0xac, 0x61, 0x89, 0x39, 0xa5, 0xa9, 0x12, 0x4c,
|
||
|
0x60, 0x31, 0x08, 0xc7, 0x49, 0xe2, 0xc7, 0x43, 0x39, 0xc6, 0x15, 0x8f, 0xe4, 0x18, 0x77, 0x3c,
|
||
|
0x92, 0x63, 0x3c, 0xf1, 0x48, 0x8e, 0xf1, 0xc2, 0x23, 0x39, 0xc6, 0x07, 0x8f, 0xe4, 0x18, 0x01,
|
||
|
0x01, 0x00, 0x00, 0xff, 0xff, 0x7a, 0x3d, 0x8f, 0x44, 0x93, 0x00, 0x00, 0x00,
|
||
|
}
|