Commit 0da2963f authored by Mike Ledger's avatar Mike Ledger

make haddock happy

parent 98abe619
Pipeline #15891475 passed with stage
in 23 minutes and 51 seconds
......@@ -150,8 +150,9 @@ fromTrie = go . compress
Skip m -> RadixSkip . V.map (uncurry radixNode) . mapToVector $! m
data TextSlice = TextSlice
{-# UNPACK #-} !Int -- ^ offset (in units of Word16)
{-# UNPACK #-} !Int -- ^ length (in units of Word16)
{ tsOffset16 :: {-# UNPACK #-} !Int -- ^ offset (in units of Word16)
, tsLength16 :: {-# UNPACK #-} !Int -- ^ length (in units of Word16)
}
-- | Probably dangerous magic
--
......@@ -163,7 +164,7 @@ magicallySaveSpaceSometimes full s@(TI.Text _ _ slen) =
case T.breakOn s full of
(TI.Text{}, r@(TI.Text _ remoffs _))
| T.null r -> Nothing
| otherwise -> Just (TextSlice remoffs slen)
| otherwise -> Just TextSlice{tsOffset16 = remoffs, tsLength16 = slen}
-- | A normal 'RadixTree' stores a new 'Text' at every node. In contrast, a
-- 'CompressedRadixTree' takes a single corpus 'Text' which is indexed into by
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment