Agda.Utils.Pointer

Documentation

data Ptr a

Instances

Functor Ptr

Defined in Agda.Utils.Pointer

Methods

fmap :: (a -> b) -> Ptr a -> Ptr b

(<$) :: a -> Ptr b -> Ptr a

Foldable Ptr

Defined in Agda.Utils.Pointer

Methods

fold :: Monoid m => Ptr m -> m

foldMap :: Monoid m => (a -> m) -> Ptr a -> 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

toList :: Ptr a -> [a]

null :: Ptr a -> Bool

length :: Ptr a -> Int

elem :: Eq a => a -> Ptr a -> Bool

maximum :: Ord a => Ptr a -> a

minimum :: Ord a => Ptr a -> a

sum :: Num a => Ptr a -> a

product :: Num a => Ptr a -> a

Traversable Ptr

Defined in Agda.Utils.Pointer

Methods

traverse :: Applicative f => (a -> f b) -> Ptr a -> f (Ptr b)

sequenceA :: Applicative f => Ptr (f a) -> f (Ptr a)

mapM :: Monad m => (a -> m b) -> Ptr a -> m (Ptr b)

sequence :: Monad m => Ptr (m a) -> m (Ptr a)

Eq (Ptr a)

Defined in Agda.Utils.Pointer

Methods

(==) :: Ptr a -> Ptr a -> Bool

(/=) :: Ptr a -> Ptr a -> Bool

Data a => Data (Ptr a)

Defined in Agda.Utils.Pointer

Methods

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)

toConstr :: Ptr a -> Constr

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 :: forall r r'. (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)

Defined in Agda.Utils.Pointer

Methods

compare :: Ptr a -> Ptr a -> Ordering

(<) :: Ptr a -> Ptr a -> Bool

(<=) :: Ptr a -> Ptr a -> Bool

(>) :: Ptr a -> Ptr a -> Bool

(>=) :: Ptr a -> Ptr a -> Bool

max :: Ptr a -> Ptr a -> Ptr a

min :: Ptr a -> Ptr a -> Ptr a

Show a => Show (Ptr a)

Defined in Agda.Utils.Pointer

Methods

showsPrec :: Int -> Ptr a -> ShowS

show :: Ptr a -> String

showList :: [Ptr a] -> ShowS

NFData (Ptr a)

Defined in Agda.Utils.Pointer

Methods

rnf :: Ptr a -> ()

Hashable (Ptr a)

Defined in Agda.Utils.Pointer

Methods

hashWithSalt :: Int -> Ptr a -> Int

hash :: Ptr a -> Int

newPtr :: a -> Ptr a

derefPtr :: Ptr a -> a

setPtr :: a -> Ptr a -> Ptr a

updatePtr :: (a -> a) -> Ptr a -> Ptr a

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

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)

Methods

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 :: forall r r'. (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)