Safe Haskell | None |
---|---|

Language | Haskell2010 |

# Documentation

## Instances

Functor Ptr Source # | |

Foldable Ptr Source # | |

Defined in Agda.Utils.Pointer fold :: Monoid m => Ptr m -> m # foldMap :: Monoid m => (a -> m) -> Ptr a -> m # foldr :: (a -> b -> b) -> b -> Ptr a -> b # foldr' :: (a -> b -> b) -> b -> Ptr a -> b # foldl :: (b -> a -> b) -> b -> Ptr a -> b # foldl' :: (b -> a -> b) -> b -> Ptr a -> b # foldr1 :: (a -> a -> a) -> Ptr a -> a # foldl1 :: (a -> a -> a) -> Ptr a -> a # elem :: Eq a => a -> Ptr a -> Bool # maximum :: Ord a => Ptr a -> a # | |

Traversable Ptr Source # | |

Eq (Ptr a) Source # | |

Data a => Data (Ptr a) Source # | |

Defined in Agda.Utils.Pointer gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Ptr a -> c (Ptr a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Ptr a) # dataTypeOf :: Ptr a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Ptr a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Ptr a)) # gmapT :: (forall b. Data b => b -> b) -> Ptr a -> Ptr a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Ptr a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Ptr a -> r # gmapQ :: (forall d. Data d => d -> u) -> Ptr a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Ptr a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Ptr a -> m (Ptr a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Ptr a -> m (Ptr a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Ptr a -> m (Ptr a) # | |

Ord (Ptr a) Source # | |

Show a => Show (Ptr a) Source # | |

Hashable (Ptr a) Source # | |

Defined in Agda.Utils.Pointer | |

NFData (Ptr a) Source # | |

Defined in Agda.Utils.Pointer |

updatePtrM :: Functor f => (a -> f a) -> Ptr a -> f (Ptr a) Source #

If `f a`

contains many copies of `a`

they will all be the same pointer in
the result. If the function is well-behaved (i.e. preserves the implicit
equivalence, this shouldn't matter).

# Orphan instances

Typeable a => Data (IORef a) Source # | |

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IORef a -> c (IORef a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (IORef a) # toConstr :: IORef a -> Constr # dataTypeOf :: IORef a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (IORef a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (IORef a)) # gmapT :: (forall b. Data b => b -> b) -> IORef a -> IORef a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IORef a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IORef a -> r # gmapQ :: (forall d. Data d => d -> u) -> IORef a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> IORef a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> IORef a -> m (IORef a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IORef a -> m (IORef a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IORef a -> m (IORef a) # |