Data.Registry.Class

Documentation

class IRegistry reg where

IRegistry typeclass presents a registry interface. The complexity O(1) in the operations can be "amortized" complexity.

Minimal complete definition

(!?), write, register, insert, delete, asVec

Methods

has :: MonadIO m => reg v -> Text -> m Bool

O(1) Checking if the specified key exists

(!) :: MonadIO m => reg v -> Text -> m v infixl 9

O(1) Indexing

(!?) :: MonadIO m => reg v -> Text -> m (Maybe v) infixl 9

O(1) Safe indexing

update :: MonadIO m => reg v -> Text -> (v -> m v) -> m ()

O(1) Update, raise an exception if the key does not exist.

write :: MonadIO m => reg v -> Text -> v -> m ()

O(1) Write, raise an exception if the key does not exist.

register :: MonadIO m => reg v -> Text -> v -> m ()

O(1) Adding a new value to the last position

insert :: MonadIO m => reg v -> Int -> Text -> v -> m ()

O(n) Inserting a new value to the specified position (in the underlying vector)

delete :: MonadIO m => reg v -> Text -> m ()

O(n) Deleting the specified value (this is a slow operation).

asVec :: reg v -> IOVector v

O(1) Get the underlying vector. Be careful: modifying the vector might cause a problem.

Instances

IRegistry Registry

Defined in Data.Registry

Methods

has :: MonadIO m => Registry v -> Text -> m Bool

(!) :: MonadIO m => Registry v -> Text -> m v

(!?) :: MonadIO m => Registry v -> Text -> m (Maybe v)

update :: MonadIO m => Registry v -> Text -> (v -> m v) -> m ()

write :: MonadIO m => Registry v -> Text -> v -> m ()

register :: MonadIO m => Registry v -> Text -> v -> m ()

insert :: MonadIO m => Registry v -> Int -> Text -> v -> m ()

delete :: MonadIO m => Registry v -> Text -> m ()

asVec :: Registry v -> IOVector v

IRegistry (HashTableImpl Text)

Defined in Data.Registry.HashTable

Methods

has :: MonadIO m => HashTableImpl Text v -> Text -> m Bool

(!) :: MonadIO m => HashTableImpl Text v -> Text -> m v

(!?) :: MonadIO m => HashTableImpl Text v -> Text -> m (Maybe v)

update :: MonadIO m => HashTableImpl Text v -> Text -> (v -> m v) -> m ()

write :: MonadIO m => HashTableImpl Text v -> Text -> v -> m ()

register :: MonadIO m => HashTableImpl Text v -> Text -> v -> m ()

insert :: MonadIO m => HashTableImpl Text v -> Int -> Text -> v -> m ()

delete :: MonadIO m => HashTableImpl Text v -> Text -> m ()

asVec :: HashTableImpl Text v -> IOVector v

forV_ :: (MonadIO m, IRegistry reg) => reg v -> (v -> m ()) -> m ()

For-loop over the registry, ignoring the key order.

iforV_ :: (MonadIO m, IRegistry reg) => reg v -> (Int -> v -> m ()) -> m ()

For-loop over the registry with the index, ignoring the key order.

modifyV_ :: (MonadIO m, IRegistry reg) => reg v -> (v -> m v) -> m ()

Modifying the item one by one, ignoring the key order.