You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

unadorned.go 4.2KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161
  1. // Copyright (c) 2020 Couchbase, Inc.
  2. //
  3. // Licensed under the Apache License, Version 2.0 (the "License");
  4. // you may not use this file except in compliance with the License.
  5. // You may obtain a copy of the License at
  6. //
  7. // http://www.apache.org/licenses/LICENSE-2.0
  8. //
  9. // Unless required by applicable law or agreed to in writing, software
  10. // distributed under the License is distributed on an "AS IS" BASIS,
  11. // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12. // See the License for the specific language governing permissions and
  13. // limitations under the License.
  14. package scorch
  15. import (
  16. "github.com/RoaringBitmap/roaring"
  17. segment "github.com/blevesearch/scorch_segment_api/v2"
  18. "math"
  19. "reflect"
  20. )
  21. var reflectStaticSizeUnadornedPostingsIteratorBitmap int
  22. var reflectStaticSizeUnadornedPostingsIterator1Hit int
  23. var reflectStaticSizeUnadornedPosting int
  24. func init() {
  25. var pib unadornedPostingsIteratorBitmap
  26. reflectStaticSizeUnadornedPostingsIteratorBitmap = int(reflect.TypeOf(pib).Size())
  27. var pi1h unadornedPostingsIterator1Hit
  28. reflectStaticSizeUnadornedPostingsIterator1Hit = int(reflect.TypeOf(pi1h).Size())
  29. var up UnadornedPosting
  30. reflectStaticSizeUnadornedPosting = int(reflect.TypeOf(up).Size())
  31. }
  32. type unadornedPostingsIteratorBitmap struct {
  33. actual roaring.IntPeekable
  34. actualBM *roaring.Bitmap
  35. }
  36. func (i *unadornedPostingsIteratorBitmap) Next() (segment.Posting, error) {
  37. return i.nextAtOrAfter(0)
  38. }
  39. func (i *unadornedPostingsIteratorBitmap) Advance(docNum uint64) (segment.Posting, error) {
  40. return i.nextAtOrAfter(docNum)
  41. }
  42. func (i *unadornedPostingsIteratorBitmap) nextAtOrAfter(atOrAfter uint64) (segment.Posting, error) {
  43. docNum, exists := i.nextDocNumAtOrAfter(atOrAfter)
  44. if !exists {
  45. return nil, nil
  46. }
  47. return UnadornedPosting(docNum), nil
  48. }
  49. func (i *unadornedPostingsIteratorBitmap) nextDocNumAtOrAfter(atOrAfter uint64) (uint64, bool) {
  50. if i.actual == nil || !i.actual.HasNext() {
  51. return 0, false
  52. }
  53. i.actual.AdvanceIfNeeded(uint32(atOrAfter))
  54. if !i.actual.HasNext() {
  55. return 0, false // couldn't find anything
  56. }
  57. return uint64(i.actual.Next()), true
  58. }
  59. func (i *unadornedPostingsIteratorBitmap) Size() int {
  60. return reflectStaticSizeUnadornedPostingsIteratorBitmap
  61. }
  62. func (i *unadornedPostingsIteratorBitmap) ActualBitmap() *roaring.Bitmap {
  63. return i.actualBM
  64. }
  65. func (i *unadornedPostingsIteratorBitmap) DocNum1Hit() (uint64, bool) {
  66. return 0, false
  67. }
  68. func (i *unadornedPostingsIteratorBitmap) ReplaceActual(actual *roaring.Bitmap) {
  69. i.actualBM = actual
  70. i.actual = actual.Iterator()
  71. }
  72. func newUnadornedPostingsIteratorFromBitmap(bm *roaring.Bitmap) segment.PostingsIterator {
  73. return &unadornedPostingsIteratorBitmap{
  74. actualBM: bm,
  75. actual: bm.Iterator(),
  76. }
  77. }
  78. const docNum1HitFinished = math.MaxUint64
  79. type unadornedPostingsIterator1Hit struct {
  80. docNum uint64
  81. }
  82. func (i *unadornedPostingsIterator1Hit) Next() (segment.Posting, error) {
  83. return i.nextAtOrAfter(0)
  84. }
  85. func (i *unadornedPostingsIterator1Hit) Advance(docNum uint64) (segment.Posting, error) {
  86. return i.nextAtOrAfter(docNum)
  87. }
  88. func (i *unadornedPostingsIterator1Hit) nextAtOrAfter(atOrAfter uint64) (segment.Posting, error) {
  89. docNum, exists := i.nextDocNumAtOrAfter(atOrAfter)
  90. if !exists {
  91. return nil, nil
  92. }
  93. return UnadornedPosting(docNum), nil
  94. }
  95. func (i *unadornedPostingsIterator1Hit) nextDocNumAtOrAfter(atOrAfter uint64) (uint64, bool) {
  96. if i.docNum == docNum1HitFinished {
  97. return 0, false
  98. }
  99. if i.docNum < atOrAfter {
  100. // advanced past our 1-hit
  101. i.docNum = docNum1HitFinished // consume our 1-hit docNum
  102. return 0, false
  103. }
  104. docNum := i.docNum
  105. i.docNum = docNum1HitFinished // consume our 1-hit docNum
  106. return docNum, true
  107. }
  108. func (i *unadornedPostingsIterator1Hit) Size() int {
  109. return reflectStaticSizeUnadornedPostingsIterator1Hit
  110. }
  111. func newUnadornedPostingsIteratorFrom1Hit(docNum1Hit uint64) segment.PostingsIterator {
  112. return &unadornedPostingsIterator1Hit{
  113. docNum1Hit,
  114. }
  115. }
  116. type UnadornedPosting uint64
  117. func (p UnadornedPosting) Number() uint64 {
  118. return uint64(p)
  119. }
  120. func (p UnadornedPosting) Frequency() uint64 {
  121. return 0
  122. }
  123. func (p UnadornedPosting) Norm() float64 {
  124. return 0
  125. }
  126. func (p UnadornedPosting) Locations() []segment.Location {
  127. return nil
  128. }
  129. func (p UnadornedPosting) Size() int {
  130. return reflectStaticSizeUnadornedPosting
  131. }