| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Data.MultiSetVec
Description
Synopsis
- data MultiSetVec s = MultiSetVec (MVector s Int) (MVector s Int)
- showMSV :: PrimMonad m => MultiSetVec (PrimState m) -> m String
- newMSV :: PrimMonad m => Int -> m (MultiSetVec (PrimState m))
- clearMSV :: PrimMonad m => MultiSetVec (PrimState m) -> m ()
- fromVecMSV :: PrimMonad m => Int -> Vector Int -> m (MultiSetVec (PrimState m))
- countMSV :: PrimMonad m => MultiSetVec (PrimState m) -> m Int
- nullMSV :: PrimMonad m => MultiSetVec (PrimState m) -> m Bool
- readMSV :: PrimMonad m => MultiSetVec (PrimState m) -> Int -> m Int
- incMSV :: PrimMonad m => MultiSetVec (PrimState m) -> Int -> m ()
- decMSV :: PrimMonad m => MultiSetVec (PrimState m) -> Int -> m ()
- minMSV :: PrimMonad m => MultiSetVec (PrimState m) -> m (Maybe (Int, Int))
- maxMSV :: PrimMonad m => MultiSetVec (PrimState m) -> m (Maybe (Int, Int))
- unsafeFreezeMSV :: PrimMonad m => MultiSetVec (PrimState m) -> m (Int, Vector Int)
Documentation
data MultiSetVec s #
Dense, mutable multi set.
Constructors
| MultiSetVec (MVector s Int) (MVector s Int) |
showMSV :: PrimMonad m => MultiSetVec (PrimState m) -> m String #
Monadic show over MultiSetVec.
clearMSV :: PrimMonad m => MultiSetVec (PrimState m) -> m () #
\(O(N)\)
fromVecMSV :: PrimMonad m => Int -> Vector Int -> m (MultiSetVec (PrimState m)) #
countMSV :: PrimMonad m => MultiSetVec (PrimState m) -> m Int #
\(O(1)\) Returns the number of keys in the multiset.
minMSV :: PrimMonad m => MultiSetVec (PrimState m) -> m (Maybe (Int, Int)) #
\(O(N)\) Finds the minimum key element
maxMSV :: PrimMonad m => MultiSetVec (PrimState m) -> m (Maybe (Int, Int)) #
\(O(N)\) Finds the maximum key element
unsafeFreezeMSV :: PrimMonad m => MultiSetVec (PrimState m) -> m (Int, Vector Int) #
\(O(N)\)