Make sure keys are unsliced in compact index search

If they're not unsliced, then tests will fail.

Author: jorisdral

src/Database/LSMTree/Internal/Index/Compact.hs

@@ -418,7 +418,7 @@ search k IndexCompact{..} =
                 bitIndexFromToRev (BoundInclusive 0) (BoundInclusive i) (Bit False) icClashes
               -- The TB map is consulted to find the closest key smaller than k.
               !i2 = maybe (PageNo 0) snd $
-                Map.lookupLE (unsafeNoAssertMakeUnslicedKey k) icTieBreaker
+                Map.lookupLE (makeUnslicedKey k) icTieBreaker
               -- If i2 < i1, then it means the clashing pages were all just part
               -- of the same larger-than-page value. Entries are only included
               -- in the TB map if the clash was a *proper* clash.

src/Database/LSMTree/Internal/Unsliced.hs

@@ -11,7 +11,6 @@ module Database.LSMTree.Internal.Unsliced (
   , makeUnslicedKey
   , unsafeMakeUnslicedKey
   , fromUnslicedKey
-  , unsafeNoAssertMakeUnslicedKey
   ) where
 
 import           Control.DeepSeq (NFData)
@@ -43,9 +42,6 @@ makeUnsliced bytes
 unsafeMakeUnsliced :: RawBytes -> Unsliced RawBytes
 unsafeMakeUnsliced bytes = assert (precondition bytes) (Unsliced (getByteArray bytes))
 
-unsafeNoAssertMakeUnsliced :: RawBytes -> Unsliced RawBytes
-unsafeNoAssertMakeUnsliced bytes = Unsliced (getByteArray bytes)
-
 fromUnsliced :: Unsliced RawBytes -> RawBytes
 fromUnsliced (Unsliced ba) = RawBytes (mkPrimVector 0 (sizeofByteArray ba) ba)
 
@@ -65,9 +61,6 @@ makeUnslicedKey (SerialisedKey rb) = from (makeUnsliced rb)
 unsafeMakeUnslicedKey :: SerialisedKey -> Unsliced SerialisedKey
 unsafeMakeUnslicedKey (SerialisedKey rb) = from (unsafeMakeUnsliced rb)
 
-unsafeNoAssertMakeUnslicedKey :: SerialisedKey -> Unsliced SerialisedKey
-unsafeNoAssertMakeUnslicedKey (SerialisedKey rb) = from (unsafeNoAssertMakeUnsliced rb)
-
 fromUnslicedKey :: Unsliced SerialisedKey -> SerialisedKey
 fromUnslicedKey x = SerialisedKey (fromUnsliced (to x))