Safe Haskell | None |
---|---|
Language | Haskell2010 |
- insert :: forall t x proxy. Typeable t => Item x t -> TypeMap x -> TypeMap x
- lookup :: forall t x proxy. Typeable t => TypeMap x -> Maybe (Item x t)
- delete :: forall t x proxy. Typeable t => TypeMap x -> TypeMap x
- map :: forall x y. (forall t. Typeable t => Item x t -> Item y t) -> TypeMap x -> TypeMap y
- traverse :: forall f x y. Applicative f => (forall t. Typeable t => Item x t -> f (Item y t)) -> TypeMap x -> f (TypeMap y)
- newtype Typed_ x t = Typed_ (Typed x t)
- withTypeRep :: forall x. (forall t. Typeable t => Typed_ x t) -> TypeRep -> UnTyped x
Documentation
insert :: forall t x proxy. Typeable t => Item x t -> TypeMap x -> TypeMap x Source #
Insert an element indexed by type t
.
lookup :: forall t x proxy. Typeable t => TypeMap x -> Maybe (Item x t) Source #
Lookup an element indexed by type t
.
delete :: forall t x proxy. Typeable t => TypeMap x -> TypeMap x Source #
Delete a key and its value from the map. Does nothing if the key does not exist.
map :: forall x y. (forall t. Typeable t => Item x t -> Item y t) -> TypeMap x -> TypeMap y Source #
traverse :: forall f x y. Applicative f => (forall t. Typeable t => Item x t -> f (Item y t)) -> TypeMap x -> f (TypeMap y) Source #