github.com/InjectiveLabs/sdk-go@v1.53.0/chain/peggy/types/pool.pb.go (about) 1 // Code generated by protoc-gen-gogo. DO NOT EDIT. 2 // source: injective/peggy/v1/pool.proto 3 4 package types 5 6 import ( 7 cosmossdk_io_math "cosmossdk.io/math" 8 fmt "fmt" 9 _ "github.com/cosmos/gogoproto/gogoproto" 10 proto "github.com/cosmos/gogoproto/proto" 11 io "io" 12 math "math" 13 math_bits "math/bits" 14 ) 15 16 // Reference imports to suppress errors if they are not otherwise used. 17 var _ = proto.Marshal 18 var _ = fmt.Errorf 19 var _ = math.Inf 20 21 // This is a compile-time assertion to ensure that this generated file 22 // is compatible with the proto package it is being compiled against. 23 // A compilation error at this line likely means your copy of the 24 // proto package needs to be updated. 25 const _ = proto.GoGoProtoPackageIsVersion3 // please upgrade the proto package 26 27 // IDSet represents a set of IDs 28 type IDSet struct { 29 Ids []uint64 `protobuf:"varint,1,rep,packed,name=ids,proto3" json:"ids,omitempty"` 30 } 31 32 func (m *IDSet) Reset() { *m = IDSet{} } 33 func (m *IDSet) String() string { return proto.CompactTextString(m) } 34 func (*IDSet) ProtoMessage() {} 35 func (*IDSet) Descriptor() ([]byte, []int) { 36 return fileDescriptor_36397d69759ce164, []int{0} 37 } 38 func (m *IDSet) XXX_Unmarshal(b []byte) error { 39 return m.Unmarshal(b) 40 } 41 func (m *IDSet) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) { 42 if deterministic { 43 return xxx_messageInfo_IDSet.Marshal(b, m, deterministic) 44 } else { 45 b = b[:cap(b)] 46 n, err := m.MarshalToSizedBuffer(b) 47 if err != nil { 48 return nil, err 49 } 50 return b[:n], nil 51 } 52 } 53 func (m *IDSet) XXX_Merge(src proto.Message) { 54 xxx_messageInfo_IDSet.Merge(m, src) 55 } 56 func (m *IDSet) XXX_Size() int { 57 return m.Size() 58 } 59 func (m *IDSet) XXX_DiscardUnknown() { 60 xxx_messageInfo_IDSet.DiscardUnknown(m) 61 } 62 63 var xxx_messageInfo_IDSet proto.InternalMessageInfo 64 65 func (m *IDSet) GetIds() []uint64 { 66 if m != nil { 67 return m.Ids 68 } 69 return nil 70 } 71 72 type BatchFees struct { 73 Token string `protobuf:"bytes,1,opt,name=token,proto3" json:"token,omitempty"` 74 TotalFees cosmossdk_io_math.Int `protobuf:"bytes,2,opt,name=total_fees,json=totalFees,proto3,customtype=cosmossdk.io/math.Int" json:"total_fees"` 75 } 76 77 func (m *BatchFees) Reset() { *m = BatchFees{} } 78 func (m *BatchFees) String() string { return proto.CompactTextString(m) } 79 func (*BatchFees) ProtoMessage() {} 80 func (*BatchFees) Descriptor() ([]byte, []int) { 81 return fileDescriptor_36397d69759ce164, []int{1} 82 } 83 func (m *BatchFees) XXX_Unmarshal(b []byte) error { 84 return m.Unmarshal(b) 85 } 86 func (m *BatchFees) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) { 87 if deterministic { 88 return xxx_messageInfo_BatchFees.Marshal(b, m, deterministic) 89 } else { 90 b = b[:cap(b)] 91 n, err := m.MarshalToSizedBuffer(b) 92 if err != nil { 93 return nil, err 94 } 95 return b[:n], nil 96 } 97 } 98 func (m *BatchFees) XXX_Merge(src proto.Message) { 99 xxx_messageInfo_BatchFees.Merge(m, src) 100 } 101 func (m *BatchFees) XXX_Size() int { 102 return m.Size() 103 } 104 func (m *BatchFees) XXX_DiscardUnknown() { 105 xxx_messageInfo_BatchFees.DiscardUnknown(m) 106 } 107 108 var xxx_messageInfo_BatchFees proto.InternalMessageInfo 109 110 func (m *BatchFees) GetToken() string { 111 if m != nil { 112 return m.Token 113 } 114 return "" 115 } 116 117 func init() { 118 proto.RegisterType((*IDSet)(nil), "injective.peggy.v1.IDSet") 119 proto.RegisterType((*BatchFees)(nil), "injective.peggy.v1.BatchFees") 120 } 121 122 func init() { proto.RegisterFile("injective/peggy/v1/pool.proto", fileDescriptor_36397d69759ce164) } 123 124 var fileDescriptor_36397d69759ce164 = []byte{ 125 // 267 bytes of a gzipped FileDescriptorProto 126 0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0x4c, 0x90, 0xcf, 0x4a, 0xc3, 0x40, 127 0x10, 0xc6, 0xb3, 0xd6, 0x0a, 0xd9, 0x93, 0x84, 0x0a, 0x51, 0xe8, 0xb6, 0xf4, 0xd4, 0x8b, 0xbb, 128 0x14, 0xaf, 0x9e, 0x82, 0x08, 0x41, 0x4f, 0xf1, 0xe6, 0xa5, 0xe4, 0xcf, 0x98, 0xac, 0x4d, 0x32, 129 0xa1, 0x3b, 0x0d, 0xf4, 0x2d, 0x7c, 0xac, 0x1e, 0x7b, 0x14, 0x0f, 0x45, 0x92, 0x17, 0x91, 0xa4, 130 0x5a, 0xbc, 0x7d, 0x1f, 0xbf, 0x99, 0x81, 0xdf, 0xf0, 0xb1, 0x2e, 0xdf, 0x21, 0x26, 0x5d, 0x83, 131 0xaa, 0x20, 0x4d, 0xb7, 0xaa, 0x5e, 0xa8, 0x0a, 0x31, 0x97, 0xd5, 0x1a, 0x09, 0x1d, 0xe7, 0x84, 132 0x65, 0x8f, 0x65, 0xbd, 0xb8, 0x19, 0xa5, 0x98, 0x62, 0x8f, 0x55, 0x97, 0x8e, 0x93, 0xb3, 0x6b, 133 0x3e, 0xf4, 0x1f, 0x5e, 0x80, 0x9c, 0x4b, 0x3e, 0xd0, 0x89, 0x71, 0xd9, 0x74, 0x30, 0x3f, 0x0f, 134 0xba, 0x38, 0x5b, 0x72, 0xdb, 0x0b, 0x29, 0xce, 0x1e, 0x01, 0x8c, 0x33, 0xe2, 0x43, 0xc2, 0x15, 135 0x94, 0x2e, 0x9b, 0xb2, 0xb9, 0x1d, 0x1c, 0x8b, 0x73, 0xcf, 0x39, 0x21, 0x85, 0xf9, 0xf2, 0x0d, 136 0xc0, 0xb8, 0x67, 0x1d, 0xf2, 0xc6, 0xbb, 0xc3, 0xc4, 0xfa, 0x3a, 0x4c, 0xae, 0x62, 0x34, 0x05, 137 0x1a, 0x93, 0xac, 0xa4, 0x46, 0x55, 0x84, 0x94, 0x49, 0xbf, 0xa4, 0xc0, 0xee, 0x17, 0xba, 0x9b, 138 0x1e, 0xec, 0x1a, 0xc1, 0xf6, 0x8d, 0x60, 0xdf, 0x8d, 0x60, 0x1f, 0xad, 0xb0, 0xf6, 0xad, 0xb0, 139 0x3e, 0x5b, 0x61, 0xbd, 0x3e, 0xa5, 0x9a, 0xb2, 0x4d, 0x24, 0x63, 0x2c, 0x94, 0xff, 0xa7, 0xf2, 140 0x1c, 0x46, 0x46, 0x9d, 0xc4, 0x6e, 0x63, 0x5c, 0xc3, 0xff, 0x9a, 0x85, 0xba, 0x54, 0x05, 0x26, 141 0x9b, 0x1c, 0xcc, 0xef, 0x53, 0x68, 0x5b, 0x81, 0x89, 0x2e, 0x7a, 0xd3, 0xbb, 0x9f, 0x00, 0x00, 142 0x00, 0xff, 0xff, 0x38, 0x4c, 0x07, 0x7f, 0x34, 0x01, 0x00, 0x00, 143 } 144 145 func (m *IDSet) Marshal() (dAtA []byte, err error) { 146 size := m.Size() 147 dAtA = make([]byte, size) 148 n, err := m.MarshalToSizedBuffer(dAtA[:size]) 149 if err != nil { 150 return nil, err 151 } 152 return dAtA[:n], nil 153 } 154 155 func (m *IDSet) MarshalTo(dAtA []byte) (int, error) { 156 size := m.Size() 157 return m.MarshalToSizedBuffer(dAtA[:size]) 158 } 159 160 func (m *IDSet) MarshalToSizedBuffer(dAtA []byte) (int, error) { 161 i := len(dAtA) 162 _ = i 163 var l int 164 _ = l 165 if len(m.Ids) > 0 { 166 dAtA2 := make([]byte, len(m.Ids)*10) 167 var j1 int 168 for _, num := range m.Ids { 169 for num >= 1<<7 { 170 dAtA2[j1] = uint8(uint64(num)&0x7f | 0x80) 171 num >>= 7 172 j1++ 173 } 174 dAtA2[j1] = uint8(num) 175 j1++ 176 } 177 i -= j1 178 copy(dAtA[i:], dAtA2[:j1]) 179 i = encodeVarintPool(dAtA, i, uint64(j1)) 180 i-- 181 dAtA[i] = 0xa 182 } 183 return len(dAtA) - i, nil 184 } 185 186 func (m *BatchFees) Marshal() (dAtA []byte, err error) { 187 size := m.Size() 188 dAtA = make([]byte, size) 189 n, err := m.MarshalToSizedBuffer(dAtA[:size]) 190 if err != nil { 191 return nil, err 192 } 193 return dAtA[:n], nil 194 } 195 196 func (m *BatchFees) MarshalTo(dAtA []byte) (int, error) { 197 size := m.Size() 198 return m.MarshalToSizedBuffer(dAtA[:size]) 199 } 200 201 func (m *BatchFees) MarshalToSizedBuffer(dAtA []byte) (int, error) { 202 i := len(dAtA) 203 _ = i 204 var l int 205 _ = l 206 { 207 size := m.TotalFees.Size() 208 i -= size 209 if _, err := m.TotalFees.MarshalTo(dAtA[i:]); err != nil { 210 return 0, err 211 } 212 i = encodeVarintPool(dAtA, i, uint64(size)) 213 } 214 i-- 215 dAtA[i] = 0x12 216 if len(m.Token) > 0 { 217 i -= len(m.Token) 218 copy(dAtA[i:], m.Token) 219 i = encodeVarintPool(dAtA, i, uint64(len(m.Token))) 220 i-- 221 dAtA[i] = 0xa 222 } 223 return len(dAtA) - i, nil 224 } 225 226 func encodeVarintPool(dAtA []byte, offset int, v uint64) int { 227 offset -= sovPool(v) 228 base := offset 229 for v >= 1<<7 { 230 dAtA[offset] = uint8(v&0x7f | 0x80) 231 v >>= 7 232 offset++ 233 } 234 dAtA[offset] = uint8(v) 235 return base 236 } 237 func (m *IDSet) Size() (n int) { 238 if m == nil { 239 return 0 240 } 241 var l int 242 _ = l 243 if len(m.Ids) > 0 { 244 l = 0 245 for _, e := range m.Ids { 246 l += sovPool(uint64(e)) 247 } 248 n += 1 + sovPool(uint64(l)) + l 249 } 250 return n 251 } 252 253 func (m *BatchFees) Size() (n int) { 254 if m == nil { 255 return 0 256 } 257 var l int 258 _ = l 259 l = len(m.Token) 260 if l > 0 { 261 n += 1 + l + sovPool(uint64(l)) 262 } 263 l = m.TotalFees.Size() 264 n += 1 + l + sovPool(uint64(l)) 265 return n 266 } 267 268 func sovPool(x uint64) (n int) { 269 return (math_bits.Len64(x|1) + 6) / 7 270 } 271 func sozPool(x uint64) (n int) { 272 return sovPool(uint64((x << 1) ^ uint64((int64(x) >> 63)))) 273 } 274 func (m *IDSet) Unmarshal(dAtA []byte) error { 275 l := len(dAtA) 276 iNdEx := 0 277 for iNdEx < l { 278 preIndex := iNdEx 279 var wire uint64 280 for shift := uint(0); ; shift += 7 { 281 if shift >= 64 { 282 return ErrIntOverflowPool 283 } 284 if iNdEx >= l { 285 return io.ErrUnexpectedEOF 286 } 287 b := dAtA[iNdEx] 288 iNdEx++ 289 wire |= uint64(b&0x7F) << shift 290 if b < 0x80 { 291 break 292 } 293 } 294 fieldNum := int32(wire >> 3) 295 wireType := int(wire & 0x7) 296 if wireType == 4 { 297 return fmt.Errorf("proto: IDSet: wiretype end group for non-group") 298 } 299 if fieldNum <= 0 { 300 return fmt.Errorf("proto: IDSet: illegal tag %d (wire type %d)", fieldNum, wire) 301 } 302 switch fieldNum { 303 case 1: 304 if wireType == 0 { 305 var v uint64 306 for shift := uint(0); ; shift += 7 { 307 if shift >= 64 { 308 return ErrIntOverflowPool 309 } 310 if iNdEx >= l { 311 return io.ErrUnexpectedEOF 312 } 313 b := dAtA[iNdEx] 314 iNdEx++ 315 v |= uint64(b&0x7F) << shift 316 if b < 0x80 { 317 break 318 } 319 } 320 m.Ids = append(m.Ids, v) 321 } else if wireType == 2 { 322 var packedLen int 323 for shift := uint(0); ; shift += 7 { 324 if shift >= 64 { 325 return ErrIntOverflowPool 326 } 327 if iNdEx >= l { 328 return io.ErrUnexpectedEOF 329 } 330 b := dAtA[iNdEx] 331 iNdEx++ 332 packedLen |= int(b&0x7F) << shift 333 if b < 0x80 { 334 break 335 } 336 } 337 if packedLen < 0 { 338 return ErrInvalidLengthPool 339 } 340 postIndex := iNdEx + packedLen 341 if postIndex < 0 { 342 return ErrInvalidLengthPool 343 } 344 if postIndex > l { 345 return io.ErrUnexpectedEOF 346 } 347 var elementCount int 348 var count int 349 for _, integer := range dAtA[iNdEx:postIndex] { 350 if integer < 128 { 351 count++ 352 } 353 } 354 elementCount = count 355 if elementCount != 0 && len(m.Ids) == 0 { 356 m.Ids = make([]uint64, 0, elementCount) 357 } 358 for iNdEx < postIndex { 359 var v uint64 360 for shift := uint(0); ; shift += 7 { 361 if shift >= 64 { 362 return ErrIntOverflowPool 363 } 364 if iNdEx >= l { 365 return io.ErrUnexpectedEOF 366 } 367 b := dAtA[iNdEx] 368 iNdEx++ 369 v |= uint64(b&0x7F) << shift 370 if b < 0x80 { 371 break 372 } 373 } 374 m.Ids = append(m.Ids, v) 375 } 376 } else { 377 return fmt.Errorf("proto: wrong wireType = %d for field Ids", wireType) 378 } 379 default: 380 iNdEx = preIndex 381 skippy, err := skipPool(dAtA[iNdEx:]) 382 if err != nil { 383 return err 384 } 385 if (skippy < 0) || (iNdEx+skippy) < 0 { 386 return ErrInvalidLengthPool 387 } 388 if (iNdEx + skippy) > l { 389 return io.ErrUnexpectedEOF 390 } 391 iNdEx += skippy 392 } 393 } 394 395 if iNdEx > l { 396 return io.ErrUnexpectedEOF 397 } 398 return nil 399 } 400 func (m *BatchFees) Unmarshal(dAtA []byte) error { 401 l := len(dAtA) 402 iNdEx := 0 403 for iNdEx < l { 404 preIndex := iNdEx 405 var wire uint64 406 for shift := uint(0); ; shift += 7 { 407 if shift >= 64 { 408 return ErrIntOverflowPool 409 } 410 if iNdEx >= l { 411 return io.ErrUnexpectedEOF 412 } 413 b := dAtA[iNdEx] 414 iNdEx++ 415 wire |= uint64(b&0x7F) << shift 416 if b < 0x80 { 417 break 418 } 419 } 420 fieldNum := int32(wire >> 3) 421 wireType := int(wire & 0x7) 422 if wireType == 4 { 423 return fmt.Errorf("proto: BatchFees: wiretype end group for non-group") 424 } 425 if fieldNum <= 0 { 426 return fmt.Errorf("proto: BatchFees: illegal tag %d (wire type %d)", fieldNum, wire) 427 } 428 switch fieldNum { 429 case 1: 430 if wireType != 2 { 431 return fmt.Errorf("proto: wrong wireType = %d for field Token", wireType) 432 } 433 var stringLen uint64 434 for shift := uint(0); ; shift += 7 { 435 if shift >= 64 { 436 return ErrIntOverflowPool 437 } 438 if iNdEx >= l { 439 return io.ErrUnexpectedEOF 440 } 441 b := dAtA[iNdEx] 442 iNdEx++ 443 stringLen |= uint64(b&0x7F) << shift 444 if b < 0x80 { 445 break 446 } 447 } 448 intStringLen := int(stringLen) 449 if intStringLen < 0 { 450 return ErrInvalidLengthPool 451 } 452 postIndex := iNdEx + intStringLen 453 if postIndex < 0 { 454 return ErrInvalidLengthPool 455 } 456 if postIndex > l { 457 return io.ErrUnexpectedEOF 458 } 459 m.Token = string(dAtA[iNdEx:postIndex]) 460 iNdEx = postIndex 461 case 2: 462 if wireType != 2 { 463 return fmt.Errorf("proto: wrong wireType = %d for field TotalFees", wireType) 464 } 465 var stringLen uint64 466 for shift := uint(0); ; shift += 7 { 467 if shift >= 64 { 468 return ErrIntOverflowPool 469 } 470 if iNdEx >= l { 471 return io.ErrUnexpectedEOF 472 } 473 b := dAtA[iNdEx] 474 iNdEx++ 475 stringLen |= uint64(b&0x7F) << shift 476 if b < 0x80 { 477 break 478 } 479 } 480 intStringLen := int(stringLen) 481 if intStringLen < 0 { 482 return ErrInvalidLengthPool 483 } 484 postIndex := iNdEx + intStringLen 485 if postIndex < 0 { 486 return ErrInvalidLengthPool 487 } 488 if postIndex > l { 489 return io.ErrUnexpectedEOF 490 } 491 if err := m.TotalFees.Unmarshal(dAtA[iNdEx:postIndex]); err != nil { 492 return err 493 } 494 iNdEx = postIndex 495 default: 496 iNdEx = preIndex 497 skippy, err := skipPool(dAtA[iNdEx:]) 498 if err != nil { 499 return err 500 } 501 if (skippy < 0) || (iNdEx+skippy) < 0 { 502 return ErrInvalidLengthPool 503 } 504 if (iNdEx + skippy) > l { 505 return io.ErrUnexpectedEOF 506 } 507 iNdEx += skippy 508 } 509 } 510 511 if iNdEx > l { 512 return io.ErrUnexpectedEOF 513 } 514 return nil 515 } 516 func skipPool(dAtA []byte) (n int, err error) { 517 l := len(dAtA) 518 iNdEx := 0 519 depth := 0 520 for iNdEx < l { 521 var wire uint64 522 for shift := uint(0); ; shift += 7 { 523 if shift >= 64 { 524 return 0, ErrIntOverflowPool 525 } 526 if iNdEx >= l { 527 return 0, io.ErrUnexpectedEOF 528 } 529 b := dAtA[iNdEx] 530 iNdEx++ 531 wire |= (uint64(b) & 0x7F) << shift 532 if b < 0x80 { 533 break 534 } 535 } 536 wireType := int(wire & 0x7) 537 switch wireType { 538 case 0: 539 for shift := uint(0); ; shift += 7 { 540 if shift >= 64 { 541 return 0, ErrIntOverflowPool 542 } 543 if iNdEx >= l { 544 return 0, io.ErrUnexpectedEOF 545 } 546 iNdEx++ 547 if dAtA[iNdEx-1] < 0x80 { 548 break 549 } 550 } 551 case 1: 552 iNdEx += 8 553 case 2: 554 var length int 555 for shift := uint(0); ; shift += 7 { 556 if shift >= 64 { 557 return 0, ErrIntOverflowPool 558 } 559 if iNdEx >= l { 560 return 0, io.ErrUnexpectedEOF 561 } 562 b := dAtA[iNdEx] 563 iNdEx++ 564 length |= (int(b) & 0x7F) << shift 565 if b < 0x80 { 566 break 567 } 568 } 569 if length < 0 { 570 return 0, ErrInvalidLengthPool 571 } 572 iNdEx += length 573 case 3: 574 depth++ 575 case 4: 576 if depth == 0 { 577 return 0, ErrUnexpectedEndOfGroupPool 578 } 579 depth-- 580 case 5: 581 iNdEx += 4 582 default: 583 return 0, fmt.Errorf("proto: illegal wireType %d", wireType) 584 } 585 if iNdEx < 0 { 586 return 0, ErrInvalidLengthPool 587 } 588 if depth == 0 { 589 return iNdEx, nil 590 } 591 } 592 return 0, io.ErrUnexpectedEOF 593 } 594 595 var ( 596 ErrInvalidLengthPool = fmt.Errorf("proto: negative length found during unmarshaling") 597 ErrIntOverflowPool = fmt.Errorf("proto: integer overflow") 598 ErrUnexpectedEndOfGroupPool = fmt.Errorf("proto: unexpected end of group") 599 )