GHC.Debug.Client.Search

Documentation

findClosures :: (HeapGraphEntry a -> Bool) -> HeapGraph a -> [HeapGraphEntry a]

findConstructors :: String -> HeapGraph a -> [HeapGraphEntry a]

findWithInfoTable :: InfoTablePtr -> HeapGraph a -> [HeapGraphEntry a]

data HeapGraph a

Constructors

HeapGraph

Fields

• roots :: !(NonEmpty ClosurePtr)
• graph :: !(IntMap (HeapGraphEntry a))

Instances

Foldable HeapGraph

Defined in GHC.Debug.Types.Graph

Methods

fold :: Monoid m => HeapGraph m -> m

foldMap :: Monoid m => (a -> m) -> HeapGraph a -> m

foldMap' :: Monoid m => (a -> m) -> HeapGraph a -> m

foldr :: (a -> b -> b) -> b -> HeapGraph a -> b

foldr' :: (a -> b -> b) -> b -> HeapGraph a -> b

foldl :: (b -> a -> b) -> b -> HeapGraph a -> b

foldl' :: (b -> a -> b) -> b -> HeapGraph a -> b

foldr1 :: (a -> a -> a) -> HeapGraph a -> a

foldl1 :: (a -> a -> a) -> HeapGraph a -> a

toList :: HeapGraph a -> [a]

null :: HeapGraph a -> Bool

length :: HeapGraph a -> Int

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

maximum :: Ord a => HeapGraph a -> a

minimum :: Ord a => HeapGraph a -> a

sum :: Num a => HeapGraph a -> a

product :: Num a => HeapGraph a -> a

Traversable HeapGraph

Defined in GHC.Debug.Types.Graph

Methods

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

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

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

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

Functor HeapGraph

Defined in GHC.Debug.Types.Graph

Methods

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

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

Show a => Show (HeapGraph a)

Defined in GHC.Debug.Types.Graph

Methods

showsPrec :: Int -> HeapGraph a -> ShowS

show :: HeapGraph a -> String

showList :: [HeapGraph a] -> ShowS

data HeapGraphEntry a

Constructors

HeapGraphEntry

Fields

• hgeClosurePtr :: ClosurePtr
• hgeClosure :: DebugClosure PapHI ConstrDesc StackHI (Maybe HeapGraphIndex)
• hgeData :: a

Instances

Foldable HeapGraphEntry

Defined in GHC.Debug.Types.Graph

Methods

fold :: Monoid m => HeapGraphEntry m -> m

foldMap :: Monoid m => (a -> m) -> HeapGraphEntry a -> m

foldMap' :: Monoid m => (a -> m) -> HeapGraphEntry a -> m

foldr :: (a -> b -> b) -> b -> HeapGraphEntry a -> b

foldr' :: (a -> b -> b) -> b -> HeapGraphEntry a -> b

foldl :: (b -> a -> b) -> b -> HeapGraphEntry a -> b

foldl' :: (b -> a -> b) -> b -> HeapGraphEntry a -> b

foldr1 :: (a -> a -> a) -> HeapGraphEntry a -> a

foldl1 :: (a -> a -> a) -> HeapGraphEntry a -> a

toList :: HeapGraphEntry a -> [a]

null :: HeapGraphEntry a -> Bool

length :: HeapGraphEntry a -> Int

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

maximum :: Ord a => HeapGraphEntry a -> a

minimum :: Ord a => HeapGraphEntry a -> a

sum :: Num a => HeapGraphEntry a -> a

product :: Num a => HeapGraphEntry a -> a

Traversable HeapGraphEntry

Defined in GHC.Debug.Types.Graph

Methods

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

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

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

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

Functor HeapGraphEntry

Defined in GHC.Debug.Types.Graph

Methods

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

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

Show a => Show (HeapGraphEntry a)

Defined in GHC.Debug.Types.Graph

Methods

showsPrec :: Int -> HeapGraphEntry a -> ShowS

show :: HeapGraphEntry a -> String

showList :: [HeapGraphEntry a] -> ShowS