diff options
author | jan.nijtmans <nijtmans@users.sourceforge.net> | 2020-05-11 07:39:02 (GMT) |
---|---|---|
committer | jan.nijtmans <nijtmans@users.sourceforge.net> | 2020-05-11 07:39:02 (GMT) |
commit | 429a4171cb6436a84c7923dcac6ef6fe3460ce20 (patch) | |
tree | 022cb40236b73c52c77cb797eb57db6e550d52a6 /generic/tclCmdIL.c | |
parent | 0733f232745ac3cc9a3bd4913bd5ffb8b58378a5 (diff) | |
download | tcl-429a4171cb6436a84c7923dcac6ef6fe3460ce20.zip tcl-429a4171cb6436a84c7923dcac6ef6fe3460ce20.tar.gz tcl-429a4171cb6436a84c7923dcac6ef6fe3460ce20.tar.bz2 |
occurance -> occurrence.
Diffstat (limited to 'generic/tclCmdIL.c')
-rw-r--r-- | generic/tclCmdIL.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/generic/tclCmdIL.c b/generic/tclCmdIL.c index 3ec1c09..e97d495 100644 --- a/generic/tclCmdIL.c +++ b/generic/tclCmdIL.c @@ -3328,11 +3328,11 @@ Tcl_LsearchObjCmd( /* * Normally, binary search is written to stop when it finds a * match. If there are duplicates of an element in the list, - * our first match might not be the first occurance. + * our first match might not be the first occurrence. * Consider: 0 0 0 1 1 1 2 2 2 * * To maintain consistancy with standard lsearch semantics, we - * must find the leftmost occurance of the pattern in the + * must find the leftmost occurrence of the pattern in the * list. Thus we don't just stop searching here. This * variation means that a search always makes log n * comparisons (normal binary search might "get lucky" with an |