Better printing of out of range --dynamic-space-size arguments.

[sbcl.git] / doc / internals / discriminating-functions.texinfo

diff --git a/doc/internals/discriminating-functions.texinfo b/doc/internals/discriminating-functions.texinfo
index d4bc004..63f61a8 100644 (file)
--- a/doc/internals/discriminating-functions.texinfo
+++ b/doc/internals/discriminating-functions.texinfo
@@ -61,9 +61,10 @@ function optimized for the methods on the generic function
 @code{SB-PCL::CONSTANT-VALUE}), for slot access
 (@code{SB-PCL::ONE-CLASS}, @code{SB-PCL::TWO-CLASS},
 @code{SB-PCL::ONE-INDEX}, @code{SB-PCL::N-N}@footnote{Would be better
-named as @code{M-N}.}), or for dispatch based on its arguments
-(@code{SB-PCL::CACHING}, @code{SB-PCL::DISPATCH}).  Those in the second
-category can transition into the third, or into a
+named as @code{M-N}, as there is no requirement for the number of
+classes and number of indices to be the same.}), or for dispatch based
+on its arguments (@code{SB-PCL::CACHING}, @code{SB-PCL::DISPATCH}).
+Those in the second category can transition into the third, or into a
 @code{SB-PCL::CHECKING} state where the choice between
 @code{SB-PCL::CACHING} and @code{SB-PCL::DISPATCH} has not yet been
 made.
@@ -126,7 +127,7 @@ Accessor Discriminating Functions are used when the effective method of
 all calls is an access to a slot, either reading, writing or checking
 boundness@footnote{Although there is ordinarily no way for a user to
 define a boundp method, some automatically generated generic functions
-have them}; for this path to apply, there must be no non-standard
+have them.}; for this path to apply, there must be no non-standard
 methods on @code{SB-MOP:SLOT-VALUE-USING-CLASS} and its siblings.  The
 first state is @code{SB-PCL::ONE-CLASS}, entered when one class of
 instance has been accessed; the discriminating function here closes over
@@ -176,7 +177,7 @@ this pseudovector of random hash values.  To look a value up from a
 cache from a single class, the hash corresponding to the cache's index
 is looked up and reduced to the size of the cache (by bitmasking, for
 cache sizes of a power of two); then the entry at that index is looked
-up and compared for indentity with the wrapper in question.  If it
+up and compared for identity with the wrapper in question.  If it
 matches, this is a hit; otherwise the cache is walked sequentially from
 this index, skipping the 0th entry.  If the original index is reached,
 the cache does not contain the value sought@footnote{Actually, there's