diff --git a/app/App/Commands/RangeJoin.hs b/app/App/Commands/RangeJoin.hs
--- a/app/App/Commands/RangeJoin.hs
+++ b/app/App/Commands/RangeJoin.hs
@@ -82,7 +82,6 @@
   let input2StartColumn = opts ^. the @"input2StartColumn"
   let input2StopColumn  = opts ^. the @"input2StopColumn"
   let columns           = opts ^. the @"columns"
-  let rangeType         = opts ^. the @"rangeType"
   let outputFilePath    = opts ^. the @"outputFilePath"
   let outputDelimiter   = opts ^. the @"outputDelimiter"
 
diff --git a/bench/Main.hs b/bench/Main.hs
--- a/bench/Main.hs
+++ b/bench/Main.hs
@@ -18,6 +18,7 @@
 import qualified Data.Csv.Streaming                                     as CSS
 import qualified Data.Vector.Storable                                   as DVS
 import qualified HaskellWorks.Data.Dsv.Lazy.Cursor                      as SVL
+import qualified HaskellWorks.Data.Dsv.Lazy.Cursor.Lazy                 as SVLL
 import qualified HaskellWorks.Data.Dsv.Strict.Cursor                    as SVS
 import qualified HaskellWorks.Data.Dsv.Strict.Cursor.Internal           as SVS
 import qualified HaskellWorks.Data.Dsv.Strict.Cursor.Internal.Reference as SVS
@@ -58,7 +59,7 @@
 
   let c = SVL.makeCursor comma bs
 
-  pure (SVL.toListVector c)
+  pure (SVLL.toListVector c)
 
 makeBenchCsv :: IO [Benchmark]
 makeBenchCsv = do
diff --git a/hw-dsv.cabal b/hw-dsv.cabal
--- a/hw-dsv.cabal
+++ b/hw-dsv.cabal
@@ -1,7 +1,7 @@
 cabal-version: 2.2
 
 name:                   hw-dsv
-version:                0.3.8
+version:                0.4.0
 synopsis:               Unbelievably fast streaming DSV file parser
 description:            Please see the README on Github at <https://github.com/haskell-works/hw-dsv#readme>
 category:               Text, CSV, SIMD, Succinct Data Structures, Data Structures
diff --git a/src/HaskellWorks/Data/Dsv/Lazy/Cursor.hs b/src/HaskellWorks/Data/Dsv/Lazy/Cursor.hs
--- a/src/HaskellWorks/Data/Dsv/Lazy/Cursor.hs
+++ b/src/HaskellWorks/Data/Dsv/Lazy/Cursor.hs
@@ -7,14 +7,6 @@
   , advanceField
   , nextRow
   , nextPosition
-  -- Functions returning lazy bytestrings
-  , snippet
-  , toListVector
-  , toVectorVector
-  , selectListVector
-  -- Functions returning strict bytestrings
-  , getRowBetweenStrict
-  , toListVectorStrict
   ) where
 
 import Data.Function
@@ -25,15 +17,11 @@
 import HaskellWorks.Data.Vector.AsVector64s
 import Prelude
 
-import qualified Data.ByteString                          as BS
-import qualified Data.ByteString.Lazy                     as LBS
-import qualified Data.Vector                              as DV
-import qualified Data.Vector.Storable                     as DVS
-import qualified HaskellWorks.Data.Dsv.Internal.Char      as C
-import qualified HaskellWorks.Data.Dsv.Internal.Vector    as DVS
-import qualified HaskellWorks.Data.Dsv.Lazy.Cursor.Lazy   as LCL
-import qualified HaskellWorks.Data.Dsv.Lazy.Cursor.Strict as LCS
-import qualified HaskellWorks.Data.Simd.Comparison        as DVS
+import qualified Data.ByteString.Lazy                  as LBS
+import qualified Data.Vector.Storable                  as DVS
+import qualified HaskellWorks.Data.Dsv.Internal.Char   as C
+import qualified HaskellWorks.Data.Dsv.Internal.Vector as DVS
+import qualified HaskellWorks.Data.Simd.Comparison     as DVS
 
 makeIndexes :: [DVS.Vector Word64] -> [DVS.Vector Word64] -> [DVS.Vector Word64] -> ([DVS.Vector Word64], [DVS.Vector Word64])
 makeIndexes ds ns qs = unzip $ go 0 0 ds ns qs
@@ -56,33 +44,3 @@
         ibd = DVS.cmpEqWord8s delimiter     <$> ws
         (ib, nls) = makeIndexes ibd ibn ibq
 {-# INLINE makeCursor #-}
-
-snippet :: DsvCursor -> LBS.ByteString
-snippet = LCL.snippet
-{-# DEPRECATED snippet "Use HaskellWorks.Data.Dsv.Lazy.Cursor.Strict.snippet instead" #-}
-{-# INLINE snippet #-}
-
-toListVector :: DsvCursor -> [DV.Vector LBS.ByteString]
-toListVector = LCL.toListVector
-{-# DEPRECATED toListVector "Use HaskellWorks.Data.Dsv.Lazy.Cursor.toListVector instead" #-}
-{-# INLINE toListVector #-}
-
-toVectorVector :: DsvCursor -> DV.Vector (DV.Vector LBS.ByteString)
-toVectorVector = LCL.toVectorVector
-{-# DEPRECATED toVectorVector "Use HaskellWorks.Data.Dsv.Lazy.Cursor.toVectorVector instead" #-}
-{-# INLINE toVectorVector #-}
-
-selectListVector :: [Int] -> DsvCursor -> [[LBS.ByteString]]
-selectListVector = LCL.selectListList
-{-# DEPRECATED selectListVector "Use HaskellWorks.Data.Dsv.Lazy.Cursor.Lazy.selectListList instead" #-}
-{-# INLINE selectListVector #-}
-
-toListVectorStrict :: DsvCursor -> [DV.Vector BS.ByteString]
-toListVectorStrict = LCS.toListVector
-{-# DEPRECATED toListVectorStrict "Use HaskellWorks.Data.Dsv.Lazy.Cursor.Strict.toListVector instead" #-}
-{-# INLINE toListVectorStrict #-}
-
-getRowBetweenStrict :: DsvCursor -> DsvCursor -> Bool -> DV.Vector BS.ByteString
-getRowBetweenStrict = LCS.getRowVectorBetween
-{-# INLINE getRowBetweenStrict #-}
-{-# DEPRECATED getRowBetweenStrict "Use HaskellWorks.Data.Dsv.Lazy.Cursor.Strict.getRowVectorBetween instead" #-}