Data.Parameterized.HashTable

This module provides a ST-based hashtable for parameterized keys and values.

NOTE: This API makes use of unsafeCoerce to implement the parameterized hashtable abstraction. This should be type-safe provided that the TestEquality instance on the key type is implemented soundly.

Documentation

data HashTable s (key :: k -> Type) (val :: k -> Type)

A hash table mapping nonces to values.

new :: ST s (HashTable s key val)

Create a new empty table.

newSized :: Int -> ST s (HashTable s k v)

Create a new empty table to hold n elements.

clone :: (HashableF key, TestEquality key) => HashTable s key val -> ST s (HashTable s key val)

Create a hash table that is a copy of the current one.

lookup :: (HashableF key, TestEquality key) => HashTable s key val -> key tp -> ST s (Maybe (val tp))

Lookup value of key in table.

insert :: (HashableF key, TestEquality key) => HashTable s (key :: k -> Type) (val :: k -> Type) -> key tp -> val tp -> ST s ()

Insert new key and value mapping into table.

member :: (HashableF key, TestEquality key) => HashTable s (key :: k -> Type) (val :: k -> Type) -> key (tp :: k) -> ST s Bool

Return true if the key is in the hash table.

delete :: (HashableF key, TestEquality key) => HashTable s (key :: k -> Type) (val :: k -> Type) -> key (tp :: k) -> ST s ()

Delete an element from the hash table.

clear :: (HashableF key, TestEquality key) => HashTable s (key :: k -> Type) (val :: k -> Type) -> ST s ()

class HashableF (f :: k -> Type) where

A parameterized type that is hashable on all instances.

Minimal complete definition

hashWithSaltF

Methods

hashWithSaltF :: Int -> f tp -> Int

hashF :: f tp -> Int

Hash with default salt.

Instances

HashableF NatRepr

Defined in Data.Parameterized.NatRepr.Internal

Methods

hashWithSaltF :: forall (tp :: k). Int -> NatRepr tp -> Int

hashF :: forall (tp :: k). NatRepr tp -> Int

HashableF PeanoRepr

Defined in Data.Parameterized.Peano

Methods

hashWithSaltF :: forall (tp :: k). Int -> PeanoRepr tp -> Int

hashF :: forall (tp :: k). PeanoRepr tp -> Int

HashableF BoolRepr

Defined in Data.Parameterized.BoolRepr

Methods

hashWithSaltF :: forall (tp :: k). Int -> BoolRepr tp -> Int

hashF :: forall (tp :: k). BoolRepr tp -> Int

HashableF SymbolRepr

Defined in Data.Parameterized.SymbolRepr

Methods

hashWithSaltF :: forall (tp :: k). Int -> SymbolRepr tp -> Int

hashF :: forall (tp :: k). SymbolRepr tp -> Int

HashableF (Nonce :: k -> Type)

Defined in Data.Parameterized.Nonce.Unsafe

Methods

hashWithSaltF :: forall (tp :: k0). Int -> Nonce tp -> Int

hashF :: forall (tp :: k0). Nonce tp -> Int

Hashable a => HashableF (Const a :: k -> Type)

Defined in Data.Parameterized.Classes

Methods

hashWithSaltF :: forall (tp :: k0). Int -> Const a tp -> Int

hashF :: forall (tp :: k0). Const a tp -> Int

HashableF (Index ctx :: k -> Type)

Defined in Data.Parameterized.Context.Unsafe

Methods

hashWithSaltF :: forall (tp :: k0). Int -> Index ctx tp -> Int

hashF :: forall (tp :: k0). Index ctx tp -> Int

HashableF (Nonce s :: k -> Type)

Defined in Data.Parameterized.Nonce

Methods

hashWithSaltF :: forall (tp :: k0). Int -> Nonce s tp -> Int

hashF :: forall (tp :: k0). Nonce s tp -> Int

(HashableF f, TestEquality f) => HashableF (Assignment f :: Ctx k -> Type)

Defined in Data.Parameterized.Context.Unsafe

Methods

hashWithSaltF :: forall (tp :: k0). Int -> Assignment f tp -> Int

hashF :: forall (tp :: k0). Assignment f tp -> Int

data RealWorld

RealWorld is deeply magical. It is primitive, but it is not unlifted (hence ptrArg). We never manipulate values of type RealWorld; it's only used in the type system, to parameterise State#.