sparse-set

Efficient sparse-set data structures for Haskell

import qualified Data.SparseSet as S

main :: IO ()
main = print $ S.intersection as bs
  where
    as = S.insert (10 :: Int) "B" $ S.insert 0 "A" S.empty
    bs = S.insert (10 :: Int) "B" S.empty