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 typesafe provided the TestEquality instance on the key type is implemented soundly.

Documentation

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

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 -> *) (val :: k -> *) -> key tp -> val tp -> ST s ()

Insert new key and value mapping into table.

member :: (HashableF key, TestEquality key) => HashTable s (key :: k -> *) (val :: k -> *) -> 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 -> *) (val :: k -> *) -> key (tp :: k) -> ST s ()

Delete an element from the hash table.

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

class HashableF (f :: k -> *) 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 Nat NatRepr

Methods

hashWithSaltF :: Int -> f tp -> Int

hashF :: f tp -> Int

HashableF Symbol SymbolRepr

Methods

hashWithSaltF :: Int -> f tp -> Int

hashF :: f tp -> Int

HashableF k (Nonce k)

Methods

hashWithSaltF :: Int -> f tp -> Int

hashF :: f tp -> Int

Hashable a => HashableF k (Const k a)

Methods

hashWithSaltF :: Int -> f tp -> Int

hashF :: f tp -> Int

HashableF k (Nonce k s)

Methods

hashWithSaltF :: Int -> f tp -> Int

hashF :: f tp -> Int

HashableF k (Index k ctx)

Methods

hashWithSaltF :: Int -> f tp -> Int

hashF :: f tp -> Int

HashableF k (Index k ctx)

Methods

hashWithSaltF :: Int -> f tp -> Int

hashF :: f tp -> Int

HashableF k f => HashableF (Ctx k) (Assignment k f)

Methods

hashWithSaltF :: Int -> f tp -> Int

hashF :: f tp -> Int

HashableF k f => HashableF (Ctx k) (Assignment k f)

Methods

hashWithSaltF :: Int -> f tp -> Int

hashF :: 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#.