 hp2anygraph0.5.1: Realtime heap graphing utility and profile stream server with a reusable graphing module.  Source code  Contents  Index 





Description 
This module provides some halfready solutions to visualise heap
profiles both during and after execution with the help of OpenGL. All
the rendering functions will fill the viewport if the model view
matrix is the identity (they also change the matrix), assuming the
projection matrix is the following:
matrixMode $= Projection
loadIdentity
translate $ Vector3 (1) (1) 0
scale 2 2 1
In other words, these functions fill the unit square at the origin.


Synopsis 



Documentation 


A list of highly different colours, where the differences diminish
as we advance in the list. The first element is black, and there is
no white.



The colour of the background (white). It is not a member of
colours.



The colour used for unimportant cost centres (black). It is the
first element of colours.


Processing raw samples (full profiles)



Two heap profile samples which contain the exact same cost centres
in the exact same order.
 Constructors   Instances  



Create a list of sample pairs where each cost centre is paired up
with the consecutive one, so it is easier to render them. Cost
centres with small costs (below costLimit) are lumped together under
identifier 0, reserved for "Other".



Render a given list of prepared samples in the given mode. The
third argument is the maximum time of the graph, which affects
horizontal scaling.



Integrating a new sample into the list of merged sample pairs we
have so far. The input list should start with the latest sample, and
the new sample pair will be the head of the result.


Processing optimised renders (profile streams)



An optimised graph rendering designed to be easily updated when a
new sample arrives.




The names of cost centres in a graph rendering.



An empty rendering.



Integrate a new sample in an extensible graph.



Render a stream in the given graph mode.



The possible ways of displaying heap profiles.
 Constructors  Accumulated  Cost centres are stacked on top of each other without
overlapping.
 Separate  Each cost centre yields a separate line graph on the same
scale.

 Instances  



A cyclic successor function for graph modes.


Produced by Haddock version 2.7.2 