Fix off by one and rebase

src/bucket/BucketApplicator.cpp

@@ -45,9 +45,18 @@ BucketApplicator::BucketApplicator(Application& app,
     if (newOffersOnly && !bucket->isEmpty())
     {
         releaseAssertOrThrow(mApp.getConfig().isUsingBucketListDB());
-        auto [lowOffset, highOffset] = bucket->getOfferRange();
-        mBucketIter.seek(lowOffset);
-        mUpperBoundOffset = highOffset;
+        auto offsetOp = bucket->getOfferRange();
+        if (offsetOp)
+        {
+            auto [lowOffset, highOffset] = *offsetOp;
+            mBucketIter.seek(lowOffset);
+            mUpperBoundOffset = highOffset;
+        }
+        else
+        {
+            // No offers in Bucket
+            mOffersRemaining = false;
+        }
     }
 }
 
@@ -112,7 +121,11 @@ BucketApplicator::advance(BucketApplicator::Counters& counters)
 
     for (; mBucketIter; ++mBucketIter)
     {
-        if (mNewOffersOnly && mBucketIter.pos() >= mUpperBoundOffset)
+        // Note: mUpperBoundOffset is not inclusive. However, mBucketIter.pos()
+        // returns the file offset at the end of the currently loaded entry.
+        // This means we must read until pos is strictly greater than the upper
+        // bound so that we don't skip the last offer in the range.
+        if (mNewOffersOnly && mBucketIter.pos() > mUpperBoundOffset)
         {
             mOffersRemaining = false;
             break;

src/bucket/BucketInputIterator.cpp

@@ -52,7 +52,7 @@ BucketInputIterator::loadEntry()
     }
 }
 
-size_t
+std::streamoff
 BucketInputIterator::pos()
 {
     return mIn.pos();

src/bucket/BucketInputIterator.h

@@ -52,7 +52,7 @@ class BucketInputIterator
 
     BucketInputIterator& operator++();
 
-    size_t pos();
+    std::streamoff pos();
     size_t size() const;
     void seek(std::streamoff offset);
 };