An efficient sparse-set data structure 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-
Notifications
You must be signed in to change notification settings - Fork 0
An efficient sparse-set data structure for Haskell
License
aztecs-hs/sparse-set
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An efficient sparse-set data structure for Haskell
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published