Merge branch 'master' of git.sv.gnu.org:/srv/git/emacs

[gnu-emacs] / lisp / emacs-lisp / radix-tree.el

diff --git a/lisp/emacs-lisp/radix-tree.el b/lisp/emacs-lisp/radix-tree.el
index a6984b8034c8dcd2153ab47f9ff50fae211f8c00..d4b5cd211e42f13c94845a9d6f112c2188e10ccd 100644 (file)
--- a/lisp/emacs-lisp/radix-tree.el
+++ b/lisp/emacs-lisp/radix-tree.el
@@ -38,7 +38,7 @@
 ;; of array, so every level's lookup is O(N) rather than O(1).  We could easily
 ;; solve this by using char-tables instead of alists, but that would make every
 ;; level take up a lot more memory, and it would make the resulting
-;; datastructure harder to read (by a human) when printed out.
+;; data structure harder to read (by a human) when printed out.
 
 ;;; Code: