toy-lib-0.1.0.0

Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.DenseHashMap

Description

Dense integer hash map.

https://github.com/maspypy/library/blob/main/ds/hashmap.hpp

Synopsis

data DenseHashMap s a = DenseHashMap {
- maxCapHM :: !Int
- restCapHM :: !(MVector s Int)
- maskHM :: !Int
- keyHM :: !(MVector s Int)
- valHM :: !(MVector s a)
- usedHM :: !(MVector s Bool)
}
newHM :: (Unbox a, PrimMonad m) => Int -> m (DenseHashMap (PrimState m) a)
sizeHM :: PrimMonad m => DenseHashMap (PrimState m) a -> m Int
clearHM :: PrimMonad m => DenseHashMap (PrimState m) a -> m ()
hashHM :: DenseHashMap a s -> Int -> Int
indexHM :: PrimMonad m => DenseHashMap (PrimState m) a -> Int -> m Int
memberHM :: (HasCallStack, PrimMonad m) => DenseHashMap (PrimState m) a -> Int -> m Bool
readHM :: (HasCallStack, Unbox a, PrimMonad m) => DenseHashMap (PrimState m) a -> Int -> m a
readMayHM :: (HasCallStack, Unbox a, PrimMonad m) => DenseHashMap (PrimState m) a -> Int -> m (Maybe a)
writeHM :: (HasCallStack, Unbox a, PrimMonad m) => DenseHashMap (PrimState m) a -> Int -> a -> m ()
exchangeHM :: (HasCallStack, Unbox a, PrimMonad m) => DenseHashMap (PrimState m) a -> Int -> a -> m (Maybe a)
modifyHM :: (HasCallStack, Unbox a, PrimMonad m) => DenseHashMap (PrimState m) a -> (a -> a) -> Int -> m ()
deleteHM :: (HasCallStack, Unbox a, PrimMonad m) => DenseHashMap (PrimState m) a -> Int -> m (Maybe a)
deleteHM_ :: (HasCallStack, Unbox a, PrimMonad m) => DenseHashMap (PrimState m) a -> Int -> m ()
unsafeAssocsHM :: (HasCallStack, Unbox a, PrimMonad m) => DenseHashMap (PrimState m) a -> m (Vector (Int, a))

Documentation

data DenseHashMap s a #

Dense int map that holds up up n values.

Constructors

DenseHashMap
Fields maxCapHM :: !Int Maximum number of elements. restCapHM :: !(MVector s Int) The number of elements that can be added. maskHM :: !Int Bit mask for powerset iteration on indexing. keyHM :: !(MVector s Int) Original key to the hash index. valHM :: !(MVector s a) Values to the hash index. usedHM :: !(MVector s Bool) If the slot is used or not.

newHM :: (Unbox a, PrimMonad m) => Int -> m (DenseHashMap (PrimState m) a) #

\(O(N)\) Creates a hashmap.

sizeHM :: PrimMonad m => DenseHashMap (PrimState m) a -> m Int #

\(O(1)\) Returns the number of stored elements. Not tested

clearHM :: PrimMonad m => DenseHashMap (PrimState m) a -> m () #

\(O(1)\) Clears the buffer. Not tested

hashHM :: DenseHashMap a s -> Int -> Int #

\(O(1)\) (Internal) Hash value calculation.

indexHM :: PrimMonad m => DenseHashMap (PrimState m) a -> Int -> m Int #

\(O(1)\) (Internal) Hashed slot search.

memberHM :: (HasCallStack, PrimMonad m) => DenseHashMap (PrimState m) a -> Int -> m Bool #

\(O(1)\)

readHM :: (HasCallStack, Unbox a, PrimMonad m) => DenseHashMap (PrimState m) a -> Int -> m a #

\(O(1)\)

readMayHM :: (HasCallStack, Unbox a, PrimMonad m) => DenseHashMap (PrimState m) a -> Int -> m (Maybe a) #

\(O(1)\)

writeHM :: (HasCallStack, Unbox a, PrimMonad m) => DenseHashMap (PrimState m) a -> Int -> a -> m () #

\(O(1)\)

exchangeHM :: (HasCallStack, Unbox a, PrimMonad m) => DenseHashMap (PrimState m) a -> Int -> a -> m (Maybe a) #

\(O(1)\)

modifyHM :: (HasCallStack, Unbox a, PrimMonad m) => DenseHashMap (PrimState m) a -> (a -> a) -> Int -> m () #

\(O(1)\) Not tested.

deleteHM :: (HasCallStack, Unbox a, PrimMonad m) => DenseHashMap (PrimState m) a -> Int -> m (Maybe a) #

\(O(1)\) Deletes a value. Not tested

deleteHM_ :: (HasCallStack, Unbox a, PrimMonad m) => DenseHashMap (PrimState m) a -> Int -> m () #

\(O(1)\) Deletes a value. Not tested

unsafeAssocsHM :: (HasCallStack, Unbox a, PrimMonad m) => DenseHashMap (PrimState m) a -> m (Vector (Int, a)) #

\(O(N)\) Enumerates the stored key-value pairs.