Rank2018.pb.go 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753
  1. // Code generated by protoc-gen-gogo. DO NOT EDIT.
  2. // source: v1/Rank2018.proto
  3. package v1
  4. import proto "github.com/gogo/protobuf/proto"
  5. import fmt "fmt"
  6. import math "math"
  7. import _ "github.com/gogo/protobuf/gogoproto"
  8. import io "io"
  9. // Reference imports to suppress errors if they are not otherwise used.
  10. var _ = proto.Marshal
  11. var _ = fmt.Errorf
  12. var _ = math.Inf
  13. // This is a compile-time assertion to ensure that this generated file
  14. // is compatible with the proto package it is being compiled against.
  15. // A compilation error at this line likely means your copy of the
  16. // proto package needs to be updated.
  17. const _ = proto.GoGoProtoPackageIsVersion2 // please upgrade the proto package
  18. type Rank2018GetHourRankReq struct {
  19. // 父分区id
  20. AreaV2ParentId int64 `protobuf:"varint,1,opt,name=area_v2_parent_id,json=areaV2ParentId,proto3" json:"area_v2_parent_id"`
  21. // 子分区id
  22. AreaV2Id int64 `protobuf:"varint,2,opt,name=area_v2_id,json=areaV2Id,proto3" json:"area_v2_id"`
  23. // 不传则为上小时
  24. Hour string `protobuf:"bytes,3,opt,name=hour,proto3" json:"hour"`
  25. // N
  26. Top int64 `protobuf:"varint,4,opt,name=top,proto3" json:"top"`
  27. }
  28. func (m *Rank2018GetHourRankReq) Reset() { *m = Rank2018GetHourRankReq{} }
  29. func (m *Rank2018GetHourRankReq) String() string { return proto.CompactTextString(m) }
  30. func (*Rank2018GetHourRankReq) ProtoMessage() {}
  31. func (*Rank2018GetHourRankReq) Descriptor() ([]byte, []int) {
  32. return fileDescriptor_Rank2018_eaa61d01276fe5ed, []int{0}
  33. }
  34. func (m *Rank2018GetHourRankReq) XXX_Unmarshal(b []byte) error {
  35. return m.Unmarshal(b)
  36. }
  37. func (m *Rank2018GetHourRankReq) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {
  38. if deterministic {
  39. return xxx_messageInfo_Rank2018GetHourRankReq.Marshal(b, m, deterministic)
  40. } else {
  41. b = b[:cap(b)]
  42. n, err := m.MarshalTo(b)
  43. if err != nil {
  44. return nil, err
  45. }
  46. return b[:n], nil
  47. }
  48. }
  49. func (dst *Rank2018GetHourRankReq) XXX_Merge(src proto.Message) {
  50. xxx_messageInfo_Rank2018GetHourRankReq.Merge(dst, src)
  51. }
  52. func (m *Rank2018GetHourRankReq) XXX_Size() int {
  53. return m.Size()
  54. }
  55. func (m *Rank2018GetHourRankReq) XXX_DiscardUnknown() {
  56. xxx_messageInfo_Rank2018GetHourRankReq.DiscardUnknown(m)
  57. }
  58. var xxx_messageInfo_Rank2018GetHourRankReq proto.InternalMessageInfo
  59. func (m *Rank2018GetHourRankReq) GetAreaV2ParentId() int64 {
  60. if m != nil {
  61. return m.AreaV2ParentId
  62. }
  63. return 0
  64. }
  65. func (m *Rank2018GetHourRankReq) GetAreaV2Id() int64 {
  66. if m != nil {
  67. return m.AreaV2Id
  68. }
  69. return 0
  70. }
  71. func (m *Rank2018GetHourRankReq) GetHour() string {
  72. if m != nil {
  73. return m.Hour
  74. }
  75. return ""
  76. }
  77. func (m *Rank2018GetHourRankReq) GetTop() int64 {
  78. if m != nil {
  79. return m.Top
  80. }
  81. return 0
  82. }
  83. type Rank2018GetHourRankResp struct {
  84. //
  85. Code int64 `protobuf:"varint,1,opt,name=code,proto3" json:"code"`
  86. //
  87. Msg string `protobuf:"bytes,2,opt,name=msg,proto3" json:"msg"`
  88. //
  89. Data []int64 `protobuf:"varint,3,rep,packed,name=data" json:"data"`
  90. }
  91. func (m *Rank2018GetHourRankResp) Reset() { *m = Rank2018GetHourRankResp{} }
  92. func (m *Rank2018GetHourRankResp) String() string { return proto.CompactTextString(m) }
  93. func (*Rank2018GetHourRankResp) ProtoMessage() {}
  94. func (*Rank2018GetHourRankResp) Descriptor() ([]byte, []int) {
  95. return fileDescriptor_Rank2018_eaa61d01276fe5ed, []int{1}
  96. }
  97. func (m *Rank2018GetHourRankResp) XXX_Unmarshal(b []byte) error {
  98. return m.Unmarshal(b)
  99. }
  100. func (m *Rank2018GetHourRankResp) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {
  101. if deterministic {
  102. return xxx_messageInfo_Rank2018GetHourRankResp.Marshal(b, m, deterministic)
  103. } else {
  104. b = b[:cap(b)]
  105. n, err := m.MarshalTo(b)
  106. if err != nil {
  107. return nil, err
  108. }
  109. return b[:n], nil
  110. }
  111. }
  112. func (dst *Rank2018GetHourRankResp) XXX_Merge(src proto.Message) {
  113. xxx_messageInfo_Rank2018GetHourRankResp.Merge(dst, src)
  114. }
  115. func (m *Rank2018GetHourRankResp) XXX_Size() int {
  116. return m.Size()
  117. }
  118. func (m *Rank2018GetHourRankResp) XXX_DiscardUnknown() {
  119. xxx_messageInfo_Rank2018GetHourRankResp.DiscardUnknown(m)
  120. }
  121. var xxx_messageInfo_Rank2018GetHourRankResp proto.InternalMessageInfo
  122. func (m *Rank2018GetHourRankResp) GetCode() int64 {
  123. if m != nil {
  124. return m.Code
  125. }
  126. return 0
  127. }
  128. func (m *Rank2018GetHourRankResp) GetMsg() string {
  129. if m != nil {
  130. return m.Msg
  131. }
  132. return ""
  133. }
  134. func (m *Rank2018GetHourRankResp) GetData() []int64 {
  135. if m != nil {
  136. return m.Data
  137. }
  138. return nil
  139. }
  140. func init() {
  141. proto.RegisterType((*Rank2018GetHourRankReq)(nil), "rankdb.v1.Rank2018GetHourRankReq")
  142. proto.RegisterType((*Rank2018GetHourRankResp)(nil), "rankdb.v1.Rank2018GetHourRankResp")
  143. }
  144. func (m *Rank2018GetHourRankReq) Marshal() (dAtA []byte, err error) {
  145. size := m.Size()
  146. dAtA = make([]byte, size)
  147. n, err := m.MarshalTo(dAtA)
  148. if err != nil {
  149. return nil, err
  150. }
  151. return dAtA[:n], nil
  152. }
  153. func (m *Rank2018GetHourRankReq) MarshalTo(dAtA []byte) (int, error) {
  154. var i int
  155. _ = i
  156. var l int
  157. _ = l
  158. if m.AreaV2ParentId != 0 {
  159. dAtA[i] = 0x8
  160. i++
  161. i = encodeVarintRank2018(dAtA, i, uint64(m.AreaV2ParentId))
  162. }
  163. if m.AreaV2Id != 0 {
  164. dAtA[i] = 0x10
  165. i++
  166. i = encodeVarintRank2018(dAtA, i, uint64(m.AreaV2Id))
  167. }
  168. if len(m.Hour) > 0 {
  169. dAtA[i] = 0x1a
  170. i++
  171. i = encodeVarintRank2018(dAtA, i, uint64(len(m.Hour)))
  172. i += copy(dAtA[i:], m.Hour)
  173. }
  174. if m.Top != 0 {
  175. dAtA[i] = 0x20
  176. i++
  177. i = encodeVarintRank2018(dAtA, i, uint64(m.Top))
  178. }
  179. return i, nil
  180. }
  181. func (m *Rank2018GetHourRankResp) Marshal() (dAtA []byte, err error) {
  182. size := m.Size()
  183. dAtA = make([]byte, size)
  184. n, err := m.MarshalTo(dAtA)
  185. if err != nil {
  186. return nil, err
  187. }
  188. return dAtA[:n], nil
  189. }
  190. func (m *Rank2018GetHourRankResp) MarshalTo(dAtA []byte) (int, error) {
  191. var i int
  192. _ = i
  193. var l int
  194. _ = l
  195. if m.Code != 0 {
  196. dAtA[i] = 0x8
  197. i++
  198. i = encodeVarintRank2018(dAtA, i, uint64(m.Code))
  199. }
  200. if len(m.Msg) > 0 {
  201. dAtA[i] = 0x12
  202. i++
  203. i = encodeVarintRank2018(dAtA, i, uint64(len(m.Msg)))
  204. i += copy(dAtA[i:], m.Msg)
  205. }
  206. if len(m.Data) > 0 {
  207. dAtA2 := make([]byte, len(m.Data)*10)
  208. var j1 int
  209. for _, num1 := range m.Data {
  210. num := uint64(num1)
  211. for num >= 1<<7 {
  212. dAtA2[j1] = uint8(uint64(num)&0x7f | 0x80)
  213. num >>= 7
  214. j1++
  215. }
  216. dAtA2[j1] = uint8(num)
  217. j1++
  218. }
  219. dAtA[i] = 0x1a
  220. i++
  221. i = encodeVarintRank2018(dAtA, i, uint64(j1))
  222. i += copy(dAtA[i:], dAtA2[:j1])
  223. }
  224. return i, nil
  225. }
  226. func encodeVarintRank2018(dAtA []byte, offset int, v uint64) int {
  227. for v >= 1<<7 {
  228. dAtA[offset] = uint8(v&0x7f | 0x80)
  229. v >>= 7
  230. offset++
  231. }
  232. dAtA[offset] = uint8(v)
  233. return offset + 1
  234. }
  235. func (m *Rank2018GetHourRankReq) Size() (n int) {
  236. if m == nil {
  237. return 0
  238. }
  239. var l int
  240. _ = l
  241. if m.AreaV2ParentId != 0 {
  242. n += 1 + sovRank2018(uint64(m.AreaV2ParentId))
  243. }
  244. if m.AreaV2Id != 0 {
  245. n += 1 + sovRank2018(uint64(m.AreaV2Id))
  246. }
  247. l = len(m.Hour)
  248. if l > 0 {
  249. n += 1 + l + sovRank2018(uint64(l))
  250. }
  251. if m.Top != 0 {
  252. n += 1 + sovRank2018(uint64(m.Top))
  253. }
  254. return n
  255. }
  256. func (m *Rank2018GetHourRankResp) Size() (n int) {
  257. if m == nil {
  258. return 0
  259. }
  260. var l int
  261. _ = l
  262. if m.Code != 0 {
  263. n += 1 + sovRank2018(uint64(m.Code))
  264. }
  265. l = len(m.Msg)
  266. if l > 0 {
  267. n += 1 + l + sovRank2018(uint64(l))
  268. }
  269. if len(m.Data) > 0 {
  270. l = 0
  271. for _, e := range m.Data {
  272. l += sovRank2018(uint64(e))
  273. }
  274. n += 1 + sovRank2018(uint64(l)) + l
  275. }
  276. return n
  277. }
  278. func sovRank2018(x uint64) (n int) {
  279. for {
  280. n++
  281. x >>= 7
  282. if x == 0 {
  283. break
  284. }
  285. }
  286. return n
  287. }
  288. func sozRank2018(x uint64) (n int) {
  289. return sovRank2018(uint64((x << 1) ^ uint64((int64(x) >> 63))))
  290. }
  291. func (m *Rank2018GetHourRankReq) Unmarshal(dAtA []byte) error {
  292. l := len(dAtA)
  293. iNdEx := 0
  294. for iNdEx < l {
  295. preIndex := iNdEx
  296. var wire uint64
  297. for shift := uint(0); ; shift += 7 {
  298. if shift >= 64 {
  299. return ErrIntOverflowRank2018
  300. }
  301. if iNdEx >= l {
  302. return io.ErrUnexpectedEOF
  303. }
  304. b := dAtA[iNdEx]
  305. iNdEx++
  306. wire |= (uint64(b) & 0x7F) << shift
  307. if b < 0x80 {
  308. break
  309. }
  310. }
  311. fieldNum := int32(wire >> 3)
  312. wireType := int(wire & 0x7)
  313. if wireType == 4 {
  314. return fmt.Errorf("proto: Rank2018GetHourRankReq: wiretype end group for non-group")
  315. }
  316. if fieldNum <= 0 {
  317. return fmt.Errorf("proto: Rank2018GetHourRankReq: illegal tag %d (wire type %d)", fieldNum, wire)
  318. }
  319. switch fieldNum {
  320. case 1:
  321. if wireType != 0 {
  322. return fmt.Errorf("proto: wrong wireType = %d for field AreaV2ParentId", wireType)
  323. }
  324. m.AreaV2ParentId = 0
  325. for shift := uint(0); ; shift += 7 {
  326. if shift >= 64 {
  327. return ErrIntOverflowRank2018
  328. }
  329. if iNdEx >= l {
  330. return io.ErrUnexpectedEOF
  331. }
  332. b := dAtA[iNdEx]
  333. iNdEx++
  334. m.AreaV2ParentId |= (int64(b) & 0x7F) << shift
  335. if b < 0x80 {
  336. break
  337. }
  338. }
  339. case 2:
  340. if wireType != 0 {
  341. return fmt.Errorf("proto: wrong wireType = %d for field AreaV2Id", wireType)
  342. }
  343. m.AreaV2Id = 0
  344. for shift := uint(0); ; shift += 7 {
  345. if shift >= 64 {
  346. return ErrIntOverflowRank2018
  347. }
  348. if iNdEx >= l {
  349. return io.ErrUnexpectedEOF
  350. }
  351. b := dAtA[iNdEx]
  352. iNdEx++
  353. m.AreaV2Id |= (int64(b) & 0x7F) << shift
  354. if b < 0x80 {
  355. break
  356. }
  357. }
  358. case 3:
  359. if wireType != 2 {
  360. return fmt.Errorf("proto: wrong wireType = %d for field Hour", wireType)
  361. }
  362. var stringLen uint64
  363. for shift := uint(0); ; shift += 7 {
  364. if shift >= 64 {
  365. return ErrIntOverflowRank2018
  366. }
  367. if iNdEx >= l {
  368. return io.ErrUnexpectedEOF
  369. }
  370. b := dAtA[iNdEx]
  371. iNdEx++
  372. stringLen |= (uint64(b) & 0x7F) << shift
  373. if b < 0x80 {
  374. break
  375. }
  376. }
  377. intStringLen := int(stringLen)
  378. if intStringLen < 0 {
  379. return ErrInvalidLengthRank2018
  380. }
  381. postIndex := iNdEx + intStringLen
  382. if postIndex > l {
  383. return io.ErrUnexpectedEOF
  384. }
  385. m.Hour = string(dAtA[iNdEx:postIndex])
  386. iNdEx = postIndex
  387. case 4:
  388. if wireType != 0 {
  389. return fmt.Errorf("proto: wrong wireType = %d for field Top", wireType)
  390. }
  391. m.Top = 0
  392. for shift := uint(0); ; shift += 7 {
  393. if shift >= 64 {
  394. return ErrIntOverflowRank2018
  395. }
  396. if iNdEx >= l {
  397. return io.ErrUnexpectedEOF
  398. }
  399. b := dAtA[iNdEx]
  400. iNdEx++
  401. m.Top |= (int64(b) & 0x7F) << shift
  402. if b < 0x80 {
  403. break
  404. }
  405. }
  406. default:
  407. iNdEx = preIndex
  408. skippy, err := skipRank2018(dAtA[iNdEx:])
  409. if err != nil {
  410. return err
  411. }
  412. if skippy < 0 {
  413. return ErrInvalidLengthRank2018
  414. }
  415. if (iNdEx + skippy) > l {
  416. return io.ErrUnexpectedEOF
  417. }
  418. iNdEx += skippy
  419. }
  420. }
  421. if iNdEx > l {
  422. return io.ErrUnexpectedEOF
  423. }
  424. return nil
  425. }
  426. func (m *Rank2018GetHourRankResp) Unmarshal(dAtA []byte) error {
  427. l := len(dAtA)
  428. iNdEx := 0
  429. for iNdEx < l {
  430. preIndex := iNdEx
  431. var wire uint64
  432. for shift := uint(0); ; shift += 7 {
  433. if shift >= 64 {
  434. return ErrIntOverflowRank2018
  435. }
  436. if iNdEx >= l {
  437. return io.ErrUnexpectedEOF
  438. }
  439. b := dAtA[iNdEx]
  440. iNdEx++
  441. wire |= (uint64(b) & 0x7F) << shift
  442. if b < 0x80 {
  443. break
  444. }
  445. }
  446. fieldNum := int32(wire >> 3)
  447. wireType := int(wire & 0x7)
  448. if wireType == 4 {
  449. return fmt.Errorf("proto: Rank2018GetHourRankResp: wiretype end group for non-group")
  450. }
  451. if fieldNum <= 0 {
  452. return fmt.Errorf("proto: Rank2018GetHourRankResp: illegal tag %d (wire type %d)", fieldNum, wire)
  453. }
  454. switch fieldNum {
  455. case 1:
  456. if wireType != 0 {
  457. return fmt.Errorf("proto: wrong wireType = %d for field Code", wireType)
  458. }
  459. m.Code = 0
  460. for shift := uint(0); ; shift += 7 {
  461. if shift >= 64 {
  462. return ErrIntOverflowRank2018
  463. }
  464. if iNdEx >= l {
  465. return io.ErrUnexpectedEOF
  466. }
  467. b := dAtA[iNdEx]
  468. iNdEx++
  469. m.Code |= (int64(b) & 0x7F) << shift
  470. if b < 0x80 {
  471. break
  472. }
  473. }
  474. case 2:
  475. if wireType != 2 {
  476. return fmt.Errorf("proto: wrong wireType = %d for field Msg", wireType)
  477. }
  478. var stringLen uint64
  479. for shift := uint(0); ; shift += 7 {
  480. if shift >= 64 {
  481. return ErrIntOverflowRank2018
  482. }
  483. if iNdEx >= l {
  484. return io.ErrUnexpectedEOF
  485. }
  486. b := dAtA[iNdEx]
  487. iNdEx++
  488. stringLen |= (uint64(b) & 0x7F) << shift
  489. if b < 0x80 {
  490. break
  491. }
  492. }
  493. intStringLen := int(stringLen)
  494. if intStringLen < 0 {
  495. return ErrInvalidLengthRank2018
  496. }
  497. postIndex := iNdEx + intStringLen
  498. if postIndex > l {
  499. return io.ErrUnexpectedEOF
  500. }
  501. m.Msg = string(dAtA[iNdEx:postIndex])
  502. iNdEx = postIndex
  503. case 3:
  504. if wireType == 0 {
  505. var v int64
  506. for shift := uint(0); ; shift += 7 {
  507. if shift >= 64 {
  508. return ErrIntOverflowRank2018
  509. }
  510. if iNdEx >= l {
  511. return io.ErrUnexpectedEOF
  512. }
  513. b := dAtA[iNdEx]
  514. iNdEx++
  515. v |= (int64(b) & 0x7F) << shift
  516. if b < 0x80 {
  517. break
  518. }
  519. }
  520. m.Data = append(m.Data, v)
  521. } else if wireType == 2 {
  522. var packedLen int
  523. for shift := uint(0); ; shift += 7 {
  524. if shift >= 64 {
  525. return ErrIntOverflowRank2018
  526. }
  527. if iNdEx >= l {
  528. return io.ErrUnexpectedEOF
  529. }
  530. b := dAtA[iNdEx]
  531. iNdEx++
  532. packedLen |= (int(b) & 0x7F) << shift
  533. if b < 0x80 {
  534. break
  535. }
  536. }
  537. if packedLen < 0 {
  538. return ErrInvalidLengthRank2018
  539. }
  540. postIndex := iNdEx + packedLen
  541. if postIndex > l {
  542. return io.ErrUnexpectedEOF
  543. }
  544. var elementCount int
  545. var count int
  546. for _, integer := range dAtA {
  547. if integer < 128 {
  548. count++
  549. }
  550. }
  551. elementCount = count
  552. if elementCount != 0 && len(m.Data) == 0 {
  553. m.Data = make([]int64, 0, elementCount)
  554. }
  555. for iNdEx < postIndex {
  556. var v int64
  557. for shift := uint(0); ; shift += 7 {
  558. if shift >= 64 {
  559. return ErrIntOverflowRank2018
  560. }
  561. if iNdEx >= l {
  562. return io.ErrUnexpectedEOF
  563. }
  564. b := dAtA[iNdEx]
  565. iNdEx++
  566. v |= (int64(b) & 0x7F) << shift
  567. if b < 0x80 {
  568. break
  569. }
  570. }
  571. m.Data = append(m.Data, v)
  572. }
  573. } else {
  574. return fmt.Errorf("proto: wrong wireType = %d for field Data", wireType)
  575. }
  576. default:
  577. iNdEx = preIndex
  578. skippy, err := skipRank2018(dAtA[iNdEx:])
  579. if err != nil {
  580. return err
  581. }
  582. if skippy < 0 {
  583. return ErrInvalidLengthRank2018
  584. }
  585. if (iNdEx + skippy) > l {
  586. return io.ErrUnexpectedEOF
  587. }
  588. iNdEx += skippy
  589. }
  590. }
  591. if iNdEx > l {
  592. return io.ErrUnexpectedEOF
  593. }
  594. return nil
  595. }
  596. func skipRank2018(dAtA []byte) (n int, err error) {
  597. l := len(dAtA)
  598. iNdEx := 0
  599. for iNdEx < l {
  600. var wire uint64
  601. for shift := uint(0); ; shift += 7 {
  602. if shift >= 64 {
  603. return 0, ErrIntOverflowRank2018
  604. }
  605. if iNdEx >= l {
  606. return 0, io.ErrUnexpectedEOF
  607. }
  608. b := dAtA[iNdEx]
  609. iNdEx++
  610. wire |= (uint64(b) & 0x7F) << shift
  611. if b < 0x80 {
  612. break
  613. }
  614. }
  615. wireType := int(wire & 0x7)
  616. switch wireType {
  617. case 0:
  618. for shift := uint(0); ; shift += 7 {
  619. if shift >= 64 {
  620. return 0, ErrIntOverflowRank2018
  621. }
  622. if iNdEx >= l {
  623. return 0, io.ErrUnexpectedEOF
  624. }
  625. iNdEx++
  626. if dAtA[iNdEx-1] < 0x80 {
  627. break
  628. }
  629. }
  630. return iNdEx, nil
  631. case 1:
  632. iNdEx += 8
  633. return iNdEx, nil
  634. case 2:
  635. var length int
  636. for shift := uint(0); ; shift += 7 {
  637. if shift >= 64 {
  638. return 0, ErrIntOverflowRank2018
  639. }
  640. if iNdEx >= l {
  641. return 0, io.ErrUnexpectedEOF
  642. }
  643. b := dAtA[iNdEx]
  644. iNdEx++
  645. length |= (int(b) & 0x7F) << shift
  646. if b < 0x80 {
  647. break
  648. }
  649. }
  650. iNdEx += length
  651. if length < 0 {
  652. return 0, ErrInvalidLengthRank2018
  653. }
  654. return iNdEx, nil
  655. case 3:
  656. for {
  657. var innerWire uint64
  658. var start int = iNdEx
  659. for shift := uint(0); ; shift += 7 {
  660. if shift >= 64 {
  661. return 0, ErrIntOverflowRank2018
  662. }
  663. if iNdEx >= l {
  664. return 0, io.ErrUnexpectedEOF
  665. }
  666. b := dAtA[iNdEx]
  667. iNdEx++
  668. innerWire |= (uint64(b) & 0x7F) << shift
  669. if b < 0x80 {
  670. break
  671. }
  672. }
  673. innerWireType := int(innerWire & 0x7)
  674. if innerWireType == 4 {
  675. break
  676. }
  677. next, err := skipRank2018(dAtA[start:])
  678. if err != nil {
  679. return 0, err
  680. }
  681. iNdEx = start + next
  682. }
  683. return iNdEx, nil
  684. case 4:
  685. return iNdEx, nil
  686. case 5:
  687. iNdEx += 4
  688. return iNdEx, nil
  689. default:
  690. return 0, fmt.Errorf("proto: illegal wireType %d", wireType)
  691. }
  692. }
  693. panic("unreachable")
  694. }
  695. var (
  696. ErrInvalidLengthRank2018 = fmt.Errorf("proto: negative length found during unmarshaling")
  697. ErrIntOverflowRank2018 = fmt.Errorf("proto: integer overflow")
  698. )
  699. func init() { proto.RegisterFile("v1/Rank2018.proto", fileDescriptor_Rank2018_eaa61d01276fe5ed) }
  700. var fileDescriptor_Rank2018_eaa61d01276fe5ed = []byte{
  701. // 336 bytes of a gzipped FileDescriptorProto
  702. 0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0x84, 0x91, 0xc1, 0x4e, 0xfa, 0x40,
  703. 0x10, 0xc6, 0x59, 0x4a, 0xfe, 0x7f, 0x58, 0x13, 0x12, 0x36, 0x51, 0x2b, 0x21, 0x2d, 0x72, 0xe2,
  704. 0xa0, 0xc5, 0xd6, 0x8b, 0x47, 0xc3, 0x45, 0xb9, 0x99, 0x8d, 0xf1, 0xe0, 0x05, 0xb7, 0x6c, 0x2d,
  705. 0x84, 0xc0, 0xae, 0xdb, 0x6d, 0x9f, 0xc3, 0x57, 0xf2, 0xe6, 0x91, 0xa3, 0xa7, 0xc6, 0xc0, 0xad,
  706. 0x4f, 0x61, 0x76, 0xb0, 0x6a, 0x22, 0x89, 0x97, 0x2f, 0xfd, 0x4d, 0xe7, 0xfb, 0x66, 0xda, 0xc1,
  707. 0xad, 0xcc, 0x1f, 0x50, 0xb6, 0x9c, 0x07, 0x67, 0xfe, 0x85, 0x27, 0x95, 0xd0, 0x82, 0x34, 0x14,
  708. 0x5b, 0xce, 0x79, 0xe8, 0x65, 0x7e, 0xfb, 0x34, 0x9e, 0xe9, 0x69, 0x1a, 0x7a, 0x13, 0xb1, 0x18,
  709. 0xc4, 0x22, 0x16, 0x03, 0xe8, 0x08, 0xd3, 0x47, 0x20, 0x00, 0x78, 0xda, 0x3a, 0x7b, 0x2f, 0x08,
  710. 0x1f, 0x94, 0x61, 0x57, 0x91, 0xbe, 0x16, 0xa9, 0x32, 0x48, 0xa3, 0x27, 0x72, 0x89, 0x5b, 0x4c,
  711. 0x45, 0x6c, 0x9c, 0x05, 0x63, 0xc9, 0x54, 0xb4, 0xd4, 0xe3, 0x19, 0xb7, 0x51, 0x17, 0xf5, 0xad,
  712. 0xe1, 0x7e, 0x91, 0xbb, 0xbf, 0x5f, 0xd2, 0xa6, 0x29, 0xdd, 0x05, 0x37, 0x50, 0x18, 0x71, 0x72,
  713. 0x82, 0x71, 0xd9, 0x34, 0xe3, 0x76, 0x15, 0xac, 0xcd, 0x22, 0x77, 0x7f, 0x54, 0x69, 0x7d, 0xeb,
  714. 0x19, 0x71, 0xd2, 0xc1, 0xb5, 0xa9, 0x48, 0x95, 0x6d, 0x75, 0x51, 0xbf, 0x31, 0xac, 0x17, 0xb9,
  715. 0x0b, 0x4c, 0x41, 0xc9, 0x11, 0xb6, 0xb4, 0x90, 0x76, 0x0d, 0x42, 0xfe, 0x17, 0xb9, 0x6b, 0x90,
  716. 0x1a, 0xe9, 0x49, 0x7c, 0xb8, 0xf3, 0x13, 0x12, 0x69, 0x32, 0x27, 0x82, 0x47, 0x9f, 0x6b, 0x43,
  717. 0xa6, 0x61, 0x0a, 0x6a, 0x32, 0x17, 0x49, 0x0c, 0x8b, 0x35, 0xb6, 0x99, 0x8b, 0x24, 0xa6, 0x46,
  718. 0x8c, 0x91, 0x33, 0xcd, 0x6c, 0xab, 0x6b, 0x95, 0x46, 0xc3, 0x14, 0x34, 0x78, 0xc0, 0xf5, 0x72,
  719. 0x22, 0xb9, 0xc5, 0x7b, 0xf1, 0xf7, 0x54, 0x72, 0xec, 0x7d, 0xdd, 0xc2, 0xdb, 0xfd, 0x63, 0xdb,
  720. 0xbd, 0xbf, 0x5a, 0x12, 0x39, 0xec, 0xbc, 0xae, 0x1d, 0xb4, 0x5a, 0x3b, 0xe8, 0x7d, 0xed, 0xa0,
  721. 0xe7, 0x8d, 0x53, 0x59, 0x6d, 0x9c, 0xca, 0xdb, 0xc6, 0xa9, 0xdc, 0x57, 0x33, 0x3f, 0xfc, 0x07,
  722. 0xc7, 0x3b, 0xff, 0x08, 0x00, 0x00, 0xff, 0xff, 0x39, 0x8a, 0x7b, 0xf7, 0x0b, 0x02, 0x00, 0x00,
  723. }