mirror of
https://github.com/genuinetools/reg.git
synced 2024-08-22 22:40:24 -04:00
454 lines
11 KiB
Go
454 lines
11 KiB
Go
![]() |
// Code generated by protoc-gen-gogo. DO NOT EDIT.
|
||
|
// source: indeximport.proto
|
||
|
|
||
|
/*
|
||
|
Package indeximport is a generated protocol buffer package.
|
||
|
|
||
|
It is generated from these files:
|
||
|
indeximport.proto
|
||
|
|
||
|
It has these top-level messages:
|
||
|
IndexQueries
|
||
|
*/
|
||
|
package indeximport
|
||
|
|
||
|
import proto "github.com/gogo/protobuf/proto"
|
||
|
import fmt "fmt"
|
||
|
import math "math"
|
||
|
import index "github.com/gogo/protobuf/test/indeximport-issue72/index"
|
||
|
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 IndexQueries struct {
|
||
|
Queries []*index.IndexQuery `protobuf:"bytes,1,rep,name=Queries" json:"Queries,omitempty"`
|
||
|
XXX_unrecognized []byte `json:"-"`
|
||
|
}
|
||
|
|
||
|
func (m *IndexQueries) Reset() { *m = IndexQueries{} }
|
||
|
func (m *IndexQueries) String() string { return proto.CompactTextString(m) }
|
||
|
func (*IndexQueries) ProtoMessage() {}
|
||
|
func (*IndexQueries) Descriptor() ([]byte, []int) { return fileDescriptorIndeximport, []int{0} }
|
||
|
|
||
|
func (m *IndexQueries) GetQueries() []*index.IndexQuery {
|
||
|
if m != nil {
|
||
|
return m.Queries
|
||
|
}
|
||
|
return nil
|
||
|
}
|
||
|
|
||
|
func init() {
|
||
|
proto.RegisterType((*IndexQueries)(nil), "indeximport.IndexQueries")
|
||
|
}
|
||
|
func (this *IndexQueries) Equal(that interface{}) bool {
|
||
|
if that == nil {
|
||
|
if this == nil {
|
||
|
return true
|
||
|
}
|
||
|
return false
|
||
|
}
|
||
|
|
||
|
that1, ok := that.(*IndexQueries)
|
||
|
if !ok {
|
||
|
that2, ok := that.(IndexQueries)
|
||
|
if ok {
|
||
|
that1 = &that2
|
||
|
} else {
|
||
|
return false
|
||
|
}
|
||
|
}
|
||
|
if that1 == nil {
|
||
|
if this == nil {
|
||
|
return true
|
||
|
}
|
||
|
return false
|
||
|
} else if this == nil {
|
||
|
return false
|
||
|
}
|
||
|
if len(this.Queries) != len(that1.Queries) {
|
||
|
return false
|
||
|
}
|
||
|
for i := range this.Queries {
|
||
|
if !this.Queries[i].Equal(that1.Queries[i]) {
|
||
|
return false
|
||
|
}
|
||
|
}
|
||
|
if !bytes.Equal(this.XXX_unrecognized, that1.XXX_unrecognized) {
|
||
|
return false
|
||
|
}
|
||
|
return true
|
||
|
}
|
||
|
func (m *IndexQueries) 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 *IndexQueries) MarshalTo(dAtA []byte) (int, error) {
|
||
|
var i int
|
||
|
_ = i
|
||
|
var l int
|
||
|
_ = l
|
||
|
if len(m.Queries) > 0 {
|
||
|
for _, msg := range m.Queries {
|
||
|
dAtA[i] = 0xa
|
||
|
i++
|
||
|
i = encodeVarintIndeximport(dAtA, i, uint64(msg.Size()))
|
||
|
n, err := msg.MarshalTo(dAtA[i:])
|
||
|
if err != nil {
|
||
|
return 0, err
|
||
|
}
|
||
|
i += n
|
||
|
}
|
||
|
}
|
||
|
if m.XXX_unrecognized != nil {
|
||
|
i += copy(dAtA[i:], m.XXX_unrecognized)
|
||
|
}
|
||
|
return i, nil
|
||
|
}
|
||
|
|
||
|
func encodeVarintIndeximport(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 NewPopulatedIndexQueries(r randyIndeximport, easy bool) *IndexQueries {
|
||
|
this := &IndexQueries{}
|
||
|
if r.Intn(10) != 0 {
|
||
|
v1 := r.Intn(5)
|
||
|
this.Queries = make([]*index.IndexQuery, v1)
|
||
|
for i := 0; i < v1; i++ {
|
||
|
this.Queries[i] = index.NewPopulatedIndexQuery(r, easy)
|
||
|
}
|
||
|
}
|
||
|
if !easy && r.Intn(10) != 0 {
|
||
|
this.XXX_unrecognized = randUnrecognizedIndeximport(r, 2)
|
||
|
}
|
||
|
return this
|
||
|
}
|
||
|
|
||
|
type randyIndeximport interface {
|
||
|
Float32() float32
|
||
|
Float64() float64
|
||
|
Int63() int64
|
||
|
Int31() int32
|
||
|
Uint32() uint32
|
||
|
Intn(n int) int
|
||
|
}
|
||
|
|
||
|
func randUTF8RuneIndeximport(r randyIndeximport) 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 randStringIndeximport(r randyIndeximport) string {
|
||
|
v2 := r.Intn(100)
|
||
|
tmps := make([]rune, v2)
|
||
|
for i := 0; i < v2; i++ {
|
||
|
tmps[i] = randUTF8RuneIndeximport(r)
|
||
|
}
|
||
|
return string(tmps)
|
||
|
}
|
||
|
func randUnrecognizedIndeximport(r randyIndeximport, 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 = randFieldIndeximport(dAtA, r, fieldNumber, wire)
|
||
|
}
|
||
|
return dAtA
|
||
|
}
|
||
|
func randFieldIndeximport(dAtA []byte, r randyIndeximport, fieldNumber int, wire int) []byte {
|
||
|
key := uint32(fieldNumber)<<3 | uint32(wire)
|
||
|
switch wire {
|
||
|
case 0:
|
||
|
dAtA = encodeVarintPopulateIndeximport(dAtA, uint64(key))
|
||
|
v3 := r.Int63()
|
||
|
if r.Intn(2) == 0 {
|
||
|
v3 *= -1
|
||
|
}
|
||
|
dAtA = encodeVarintPopulateIndeximport(dAtA, uint64(v3))
|
||
|
case 1:
|
||
|
dAtA = encodeVarintPopulateIndeximport(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 = encodeVarintPopulateIndeximport(dAtA, uint64(key))
|
||
|
ll := r.Intn(100)
|
||
|
dAtA = encodeVarintPopulateIndeximport(dAtA, uint64(ll))
|
||
|
for j := 0; j < ll; j++ {
|
||
|
dAtA = append(dAtA, byte(r.Intn(256)))
|
||
|
}
|
||
|
default:
|
||
|
dAtA = encodeVarintPopulateIndeximport(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 encodeVarintPopulateIndeximport(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 *IndexQueries) Size() (n int) {
|
||
|
var l int
|
||
|
_ = l
|
||
|
if len(m.Queries) > 0 {
|
||
|
for _, e := range m.Queries {
|
||
|
l = e.Size()
|
||
|
n += 1 + l + sovIndeximport(uint64(l))
|
||
|
}
|
||
|
}
|
||
|
if m.XXX_unrecognized != nil {
|
||
|
n += len(m.XXX_unrecognized)
|
||
|
}
|
||
|
return n
|
||
|
}
|
||
|
|
||
|
func sovIndeximport(x uint64) (n int) {
|
||
|
for {
|
||
|
n++
|
||
|
x >>= 7
|
||
|
if x == 0 {
|
||
|
break
|
||
|
}
|
||
|
}
|
||
|
return n
|
||
|
}
|
||
|
func sozIndeximport(x uint64) (n int) {
|
||
|
return sovIndeximport(uint64((x << 1) ^ uint64((int64(x) >> 63))))
|
||
|
}
|
||
|
func (m *IndexQueries) 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 ErrIntOverflowIndeximport
|
||
|
}
|
||
|
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: IndexQueries: wiretype end group for non-group")
|
||
|
}
|
||
|
if fieldNum <= 0 {
|
||
|
return fmt.Errorf("proto: IndexQueries: illegal tag %d (wire type %d)", fieldNum, wire)
|
||
|
}
|
||
|
switch fieldNum {
|
||
|
case 1:
|
||
|
if wireType != 2 {
|
||
|
return fmt.Errorf("proto: wrong wireType = %d for field Queries", wireType)
|
||
|
}
|
||
|
var msglen int
|
||
|
for shift := uint(0); ; shift += 7 {
|
||
|
if shift >= 64 {
|
||
|
return ErrIntOverflowIndeximport
|
||
|
}
|
||
|
if iNdEx >= l {
|
||
|
return io.ErrUnexpectedEOF
|
||
|
}
|
||
|
b := dAtA[iNdEx]
|
||
|
iNdEx++
|
||
|
msglen |= (int(b) & 0x7F) << shift
|
||
|
if b < 0x80 {
|
||
|
break
|
||
|
}
|
||
|
}
|
||
|
if msglen < 0 {
|
||
|
return ErrInvalidLengthIndeximport
|
||
|
}
|
||
|
postIndex := iNdEx + msglen
|
||
|
if postIndex > l {
|
||
|
return io.ErrUnexpectedEOF
|
||
|
}
|
||
|
m.Queries = append(m.Queries, &index.IndexQuery{})
|
||
|
if err := m.Queries[len(m.Queries)-1].Unmarshal(dAtA[iNdEx:postIndex]); err != nil {
|
||
|
return err
|
||
|
}
|
||
|
iNdEx = postIndex
|
||
|
default:
|
||
|
iNdEx = preIndex
|
||
|
skippy, err := skipIndeximport(dAtA[iNdEx:])
|
||
|
if err != nil {
|
||
|
return err
|
||
|
}
|
||
|
if skippy < 0 {
|
||
|
return ErrInvalidLengthIndeximport
|
||
|
}
|
||
|
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 skipIndeximport(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, ErrIntOverflowIndeximport
|
||
|
}
|
||
|
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, ErrIntOverflowIndeximport
|
||
|
}
|
||
|
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, ErrIntOverflowIndeximport
|
||
|
}
|
||
|
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, ErrInvalidLengthIndeximport
|
||
|
}
|
||
|
return iNdEx, nil
|
||
|
case 3:
|
||
|
for {
|
||
|
var innerWire uint64
|
||
|
var start int = iNdEx
|
||
|
for shift := uint(0); ; shift += 7 {
|
||
|
if shift >= 64 {
|
||
|
return 0, ErrIntOverflowIndeximport
|
||
|
}
|
||
|
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 := skipIndeximport(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 (
|
||
|
ErrInvalidLengthIndeximport = fmt.Errorf("proto: negative length found during unmarshaling")
|
||
|
ErrIntOverflowIndeximport = fmt.Errorf("proto: integer overflow")
|
||
|
)
|
||
|
|
||
|
func init() { proto.RegisterFile("indeximport.proto", fileDescriptorIndeximport) }
|
||
|
|
||
|
var fileDescriptorIndeximport = []byte{
|
||
|
// 168 bytes of a gzipped FileDescriptorProto
|
||
|
0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0xe2, 0x12, 0xcc, 0xcc, 0x4b, 0x49,
|
||
|
0xad, 0xc8, 0xcc, 0x2d, 0xc8, 0x2f, 0x2a, 0xd1, 0x2b, 0x28, 0xca, 0x2f, 0xc9, 0x17, 0xe2, 0x46,
|
||
|
0x12, 0x92, 0x72, 0x4e, 0xcf, 0x2c, 0xc9, 0x28, 0x4d, 0xd2, 0x4b, 0xce, 0xcf, 0xd5, 0x4f, 0xcf,
|
||
|
0x4f, 0xcf, 0xd7, 0x07, 0xab, 0x49, 0x2a, 0x4d, 0xd3, 0x2f, 0x49, 0x2d, 0x2e, 0xd1, 0x47, 0x52,
|
||
|
0xaa, 0x9b, 0x59, 0x5c, 0x5c, 0x9a, 0x6a, 0x6e, 0x04, 0x11, 0x83, 0x90, 0x10, 0x13, 0xa5, 0x74,
|
||
|
0x71, 0x1a, 0x02, 0xe2, 0x81, 0x39, 0x60, 0x16, 0x44, 0xb9, 0x92, 0x35, 0x17, 0x8f, 0x27, 0x48,
|
||
|
0x77, 0x60, 0x69, 0x6a, 0x51, 0x66, 0x6a, 0xb1, 0x90, 0x36, 0x17, 0x3b, 0x94, 0x29, 0xc1, 0xa8,
|
||
|
0xc0, 0xac, 0xc1, 0x6d, 0x24, 0xa8, 0x07, 0x31, 0x1d, 0xae, 0xaa, 0x32, 0x08, 0xa6, 0xc2, 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,
|
||
|
0xd4, 0x50, 0x15, 0x6f, 0xeb, 0x00, 0x00, 0x00,
|
||
|
}
|