This example is from Wikipedia and may be reused under a CC BY-SA license.
Each cost stack in the set will contain a selected costcentre nearest the top of the stack.
The reason for this is that in the cost-centre stack a, b, a 1 the inheritance function adds 1 to costcentre a twice.
Firstly the costcentre and costing methodologies were different and secondly the patient morbidity is known to be different for the two types of treatment.
The programmer can view the cost-centre stacks, select cost centres or choose different profiling options from this window.
During profiling the programmer may annotate the code with an scc expression (set costcentre) which is followed by the cost-centre name.
Cost centres in the stacks become graph nodes and adjacent cost centres in a cost-centre stack are connected with directed arcs.
Compressed stacks ensure that cost centres will only appear in a cost-centre stack once, therefore removing the possibility of loops from the final call-graph.
These examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors.