Data.Transient.WordMap.Internal

Contents

• Utilities
• WordMaps
• Transient WordMaps
• Construction
• Instances

Description

Synopsis

• type Mask = Word16
• type Offset = Int
• ptrEq :: a -> a -> Bool
• ptrNeq :: a -> a -> Bool
• index :: Word16 -> Word16 -> Int
• level :: Word64 -> Int
• maskBit :: Word64 -> Offset -> Int
• mask :: Word64 -> Offset -> Word16
• apogeeBit :: Word64 -> Word64 -> Int
• apogee :: Word64 -> Word64 -> Mask
• data Node a
  • = Full !Word64 !Offset !(SmallArray (Node a))
  • | Node !Word64 !Offset !Mask !(SmallArray (Node a))
  • | Tip !Word64 a
• data WordMap a = WordMap {
  • fingerKey :: !Word64
  • fingerMask :: !Mask
  • fingerValue :: !(Maybe a)
  • fingerPath :: !(SmallArray (Node a))
  }
• data TNode s a
  • = TFull !Word64 !Offset !(SmallMutableArray s (TNode s a))
  • | TNode !Word64 !Offset !Mask !(SmallMutableArray s (TNode s a))
  • | TTip !Word64 a
• data TWordMap s a = TWordMap {
  • transientFingerKey :: !Word64
  • transientFingerMask :: !Mask
  • transientFingerValue :: !(Maybe a)
  • transientFingerPath :: !(SmallMutableArray s (TNode s a))
  }
• persisted :: (forall s. TWordMap s a) -> WordMap a
• unsafePersistentTNode :: TNode s a -> Node a
• unsafePersistent :: TWordMap s a -> WordMap a
• newtype MWordMap s a = MWordMap {
  • runMWordMap :: MutVar s (TWordMap s a)
  }
• thaw :: PrimMonad m => WordMap a -> m (MWordMap (PrimState m) a)
• freeze :: PrimMonad m => MWordMap (PrimState m) a -> m (WordMap a)
• transient :: WordMap a -> TWordMap s a
• persistent :: PrimMonad m => TWordMap (PrimState m) a -> m (WordMap a)
• empty :: WordMap a
• emptySmallMutableArray :: SmallMutableArray s a
• emptyT :: TWordMap s a
• emptyM :: PrimMonad m => m (MWordMap (PrimState m) a)
• singleton :: Word64 -> a -> WordMap a
• singletonT :: Word64 -> a -> TWordMap s a
• singletonM :: PrimMonad m => Word64 -> a -> m (MWordMap (PrimState m) a)
• lookupTNode :: Word64 -> TNode s a -> ST s (Maybe a)
• lookupT :: PrimMonad m => Word64 -> TWordMap (PrimState m) a -> m (Maybe a)
• lookupM :: PrimMonad m => Word64 -> MWordMap (PrimState m) a -> m (Maybe a)
• lookup0 :: Word64 -> WordMap a -> Maybe a
• lookupNode :: Word64 -> Node a -> Maybe a
• lookup :: Word64 -> WordMap a -> Maybe a
• modify :: (forall s. TWordMap s a -> ST s (TWordMap s b)) -> WordMap a -> WordMap b
• modifyM :: PrimMonad m => (TWordMap (PrimState m) a -> m (TWordMap (PrimState m) a)) -> MWordMap (PrimState m) a -> m ()
• query :: PrimMonad m => (WordMap a -> r) -> TWordMap (PrimState m) a -> m r
• queryM :: PrimMonad m => (WordMap a -> r) -> MWordMap (PrimState m) a -> m r
• type Hint s = forall x. SmallMutableArray# s x -> State# s -> State# s
• warm :: Hint s
• cold :: Hint s
• apply :: PrimMonad m => Hint (PrimState m) -> SmallMutableArray (PrimState m) a -> m ()
• insertSmallMutableArray :: Hint s -> SmallMutableArray s a -> Int -> a -> ST s (SmallMutableArray s a)
• insertSmallArray :: SmallArray a -> Int -> a -> SmallArray a
• deleteSmallMutableArray :: Hint s -> SmallMutableArray s a -> Int -> ST s (SmallMutableArray s a)
• deleteSmallArray :: SmallArray a -> Int -> SmallArray a
• node :: Word64 -> Offset -> Mask -> SmallArray (Node a) -> Node a
• nodeT :: Word64 -> Offset -> Mask -> SmallMutableArray s (TNode s a) -> TNode s a
• forkT :: Hint s -> Word64 -> TNode s a -> Word64 -> TNode s a -> ST s (TNode s a)
• fork :: Word64 -> Node a -> Word64 -> Node a -> Node a
• unplug :: Word64 -> Node a -> Node a
• unplugT :: Hint s -> Word64 -> TNode s a -> ST s (TNode s a)
• canonical :: WordMap a -> Maybe (Node a)
• plug :: Word64 -> Node a -> Node a -> Node a
• plugT :: Hint s -> Word64 -> TNode s a -> TNode s a -> ST s (TNode s a)
• plugPathT :: Hint s -> Word64 -> Int -> Int -> TNode s a -> SmallMutableArray s (TNode s a) -> ST s (TNode s a)
• plugPath :: Word64 -> Int -> Int -> Node a -> SmallArray (Node a) -> Node a
• unplugPathT :: Hint s -> Word64 -> Int -> Int -> SmallMutableArray s (TNode s a) -> ST s (TNode s a)
• unplugPath :: Word64 -> Int -> Int -> SmallArray (Node a) -> Node a
• replugPathT :: PrimMonad m => Hint (PrimState m) -> Word64 -> Int -> Int -> Maybe v -> SmallMutableArray (PrimState m) (TNode (PrimState m) v) -> m (TNode (PrimState m) v)
• replugPath :: Word64 -> Int -> Int -> Maybe v -> SmallArray (Node v) -> Node v
• unI# :: Int -> Int#
• trimWithHint :: PrimMonad m => Hint (PrimState m) -> TWordMap (PrimState m) a -> m (TWordMap (PrimState m) a)
• trimT :: PrimMonad m => TWordMap (PrimState m) a -> m (TWordMap (PrimState m) a)
• trimM :: PrimMonad m => MWordMap (PrimState m) a -> m ()
• trim :: WordMap a -> WordMap a
• focusWithHint :: PrimMonad m => Hint (PrimState m) -> Word64 -> TWordMap (PrimState m) a -> m (TWordMap (PrimState m) a)
• focusT :: PrimMonad m => Word64 -> TWordMap (PrimState m) a -> m (TWordMap (PrimState m) a)
• focusM :: PrimMonad m => Word64 -> MWordMap (PrimState m) a -> m ()
• focus0 :: Word64 -> WordMap a -> WordMap a
• focus :: Word64 -> WordMap a -> WordMap a
• insertWithHint :: PrimMonad m => Hint (PrimState m) -> Word64 -> a -> TWordMap (PrimState m) a -> m (TWordMap (PrimState m) a)
• insertT :: PrimMonad m => Word64 -> a -> TWordMap (PrimState m) a -> m (TWordMap (PrimState m) a)
• insertM :: PrimMonad m => Word64 -> a -> MWordMap (PrimState m) a -> m ()
• insert0 :: Word64 -> a -> WordMap a -> WordMap a
• insert :: Word64 -> a -> WordMap a -> WordMap a
• deleteWithHint :: PrimMonad m => Hint (PrimState m) -> Word64 -> TWordMap (PrimState m) a -> m (TWordMap (PrimState m) a)
• deleteT :: PrimMonad m => Word64 -> TWordMap (PrimState m) a -> m (TWordMap (PrimState m) a)
• deleteM :: PrimMonad m => Word64 -> MWordMap (PrimState m) a -> m ()
• delete0 :: Word64 -> WordMap a -> WordMap a
• delete :: Word64 -> WordMap a -> WordMap a
• stToPrim :: PrimMonad m => ST (PrimState m) a -> m a
• fromListT :: PrimMonad m => [(Word64, a)] -> m (TWordMap (PrimState m) a)
• toListT :: PrimMonad m => TWordMap (PrimState m) a -> m [(Word64, a)]
• fromListM :: PrimMonad m => [(Word64, a)] -> m (MWordMap (PrimState m) a)
• toListM :: PrimMonad m => MWordMap (PrimState m) a -> m [(Word64, a)]

Documentation

Utilities

apogeeBit k ok = unsafeShiftR (level (xor k ok)) 2
level (xor k ok) = unsafeShiftL (apogeeBit k ok) 2

WordMaps

Transient WordMaps

Construction

Instances