summaryrefslogtreecommitdiff
path: root/src/itree.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/itree.c')
-rw-r--r--src/itree.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/itree.c b/src/itree.c
index 688d5c82476..5079e2389f8 100644
--- a/src/itree.c
+++ b/src/itree.c
@@ -85,7 +85,7 @@ along with GNU Emacs. If not, see <https://www.gnu.org/licenses/>. */
this narrowing is O(K*log(N)) where K is the size of the result
set. If we are interested in finding the node in a range with the
smallest END, we might have to examine all K nodes in that range.
- In the case of the *-overlay-channge functions, K may well be equal
+ In the case of the *-overlay-change functions, K may well be equal
to N.
Ideally, a tree based data structure for overlays would have