mercurylang/mercury
1
0
Fork 0
mirror of https://github.com/Mercury-Language/mercury.git synced 2026-04-15 01:13:30 +00:00
Code Issues Projects Releases Wiki Activity

Fix a persistent spelling error.

Browse Source 
s/descendent/descendant/
This commit is contained in:
Zoltan Somogyi
2025-07-02 12:19:45 +02:00
parent c9537f3a3e
commit aaf8e77cb1
2 changed files with 19 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
doc/user_guide.texi
View File

@@ -4892,7 +4892,7 @@ questions about the correctness of calls executed in your program.
Because pure Mercury code does not have any side effects, the declarative
debugger can make inferences such as ``if a call produces incorrect output
from correct input, then there must be a bug in the code executed by one of
the descendents of the call''.
the descendants of the call''.
The declarative debugger is therefore able to automate much of the
`detective work' that must be done manually when using the
@@ -6061,12 +6061,12 @@ For each procedure it shows
the parents (callers) and children (callees) of that procedure,
and shows the execution time and call counts for each parent and child.
It is sorted on the total amount of time spent
in the procedure and all of its descendents
in the procedure and all of its descendants
(i.e.@: all of the procedures that it calls, directly or indirectly.)
@cindex Flat profile
The flat profile presents the just execution time spent in each procedure.
It does not count the time spent in descendents of a procedure.
It does not count the time spent in descendants of a procedure.
The alphabetic listing just lists the procedures in alphabetical order,
along with their index number in the call graph profile,
@@ -6086,7 +6086,7 @@ that calls to a procedure from different callers have roughly similar costs
is not true,
the graph profile can be quite misleading.
The time spent in a procedure and its descendents is calculated by
The time spent in a procedure and its descendants is calculated by
propagating the times up the call graph,
assuming that each call to a procedure from a particular caller
takes the same amount of time.
@@ -6105,7 +6105,7 @@ Here is a small portion of the call graph profile from an example program.
@example
called/total parents
index %time self descendents called+self name index
index %time self descendants called+self name index
called/total children
<spontaneous>
@@ -6197,7 +6197,7 @@ a particular entry in the call graph.)
@item
The percentage of total execution time spent in the current procedure
and all its descendents.
and all its descendants.
As noted above, this is only a statistical approximation.
@item
@@ -6206,8 +6206,8 @@ part of current procedure.
As noted above, this is only a statistical approximation.
@item
The descendent time: the time spent in the
current procedure and all its descendents.
The descendant time: the time spent in the
current procedure and all its descendants.
As noted above, this is only a statistical approximation.
@item
@@ -6227,9 +6227,9 @@ declaration of that predicate in the source code. For example,
@samp{list.delete/3(3)} corresponds to the @samp{(out, out, in)} mode
of @samp{list.delete/3}.
Now for the parent and child procedures the self and descendent time have
slightly different meanings. For the parent procedures the self and descendent
time represent the proportion of the current procedure's self and descendent
Now for the parent and child procedures the self and descendant time have
slightly different meanings. For the parent procedures the self and descendant
time represent the proportion of the current procedure's self and descendant
time due to that parent. These times are obtained using the assumption that
each call contributes equally to the total time of the current procedure.

16
profiler/output.m
View File

@@ -126,7 +126,7 @@ output_call_graph_headers(OutputStream, !IO) :-
"\t\tthe program %s this procedure and its\n",
[s(SpentIn)], !IO),
io.write_string(OutputStream,
"\t\tdescendents.\n\n", !IO),
"\t\tdescendants.\n\n", !IO),
io.format(OutputStream,
"self\t\tthe number of %s actually %s\n",
@@ -135,10 +135,10 @@ output_call_graph_headers(OutputStream, !IO) :-
"\t\tthe procedure's own code.\n\n", !IO),
io.format(OutputStream,
"descendents\tthe number of %s %s the\n",
"descendants\tthe number of %s %s the\n",
[s(Units), s(SpentIn)], !IO),
io.write_string(OutputStream,
"\t\tdescendents of the current procedure.\n\n", !IO),
"\t\tdescendants of the current procedure.\n\n", !IO),
io.write_string(OutputStream,
"called\t\tthe number of times the current procedure is\n", !IO),
@@ -165,8 +165,8 @@ output_call_graph_headers(OutputStream, !IO) :-
"\t\t%s due to calls from this parent.\n\n", [s(What)], !IO),
io.format(OutputStream,
"descendents*\tthe number of %s of the current " ++
"procedure's descendent\n", [s(Units)], !IO),
"descendants*\tthe number of %s of the current " ++
"procedure's descendant\n", [s(Units)], !IO),
io.format(OutputStream,
"\t\t%s which is due to calls from this parent.\n\n", [s(What)], !IO),
@@ -196,7 +196,7 @@ output_call_graph_headers(OutputStream, !IO) :-
"\t\tdue to being called by the current procedure.\n\n", !IO),
io.format(OutputStream,
"descendent*\tthe number of %s of this child's descendent %s which\n",
"descendant*\tthe number of %s of this child's descendant %s which\n",
[s(Units), s(What)], !IO),
io.write_string(OutputStream,
"\t\tis due to the current procedure.\n\n", !IO),
@@ -222,7 +222,7 @@ output_call_graph_headers(OutputStream, !IO) :-
io.write_string(OutputStream,
" parents\n", !IO),
io.format(OutputStream,
"index %6s self descendents called+self",
"index %6s self descendants called+self",
[s("%" ++ ShortWhat)], !IO),
io.write_string(OutputStream,
" name index\n", !IO),
@@ -423,7 +423,7 @@ output_flat_headers(OutputStream, !IO) :-
"total\t\tthe average number of %s %s this procedure and its\n",
[s(MilliUnits), s(SpentIn)], !IO),
io.format(OutputStream,
"%s \tdescendents per call.\n\n",
"%s \tdescendants per call.\n\n",
[s(MilliUnitsPerCall)], !IO),
io.write_string(OutputStream,