diff options
| author | Paul Eggert <eggert@cs.ucla.edu> | 2016-05-30 23:19:54 -0700 |
|---|---|---|
| committer | Paul Eggert <eggert@cs.ucla.edu> | 2016-05-30 23:20:20 -0700 |
| commit | 01030eed9395f5004e7d0721394697d1ca90cc2f (patch) | |
| tree | 3a13848e94b95796a5070adf8b2ec2e3dd4761f7 /lisp/emacs-lisp/radix-tree.el | |
| parent | 0c26f14b7e200b39134ec70c77fab8c467cf3290 (diff) | |
| download | emacs-01030eed9395f5004e7d0721394697d1ca90cc2f.tar.gz emacs-01030eed9395f5004e7d0721394697d1ca90cc2f.tar.bz2 emacs-01030eed9395f5004e7d0721394697d1ca90cc2f.zip | |
; Spelling fixes
Diffstat (limited to 'lisp/emacs-lisp/radix-tree.el')
| -rw-r--r-- | lisp/emacs-lisp/radix-tree.el | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lisp/emacs-lisp/radix-tree.el b/lisp/emacs-lisp/radix-tree.el index a6984b8034c..d4b5cd211e4 100644 --- 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: |