procyberian/emacs
2
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Fix typos in the manual and in a comment

Browse source 
* lisp/minibuffer.el (completion-pcm--hilit-commonality):
* doc/lispintro/emacs-lisp-intro.texi (Mode Line): Fix typos
(bug#51434).

Copyright-paperwork-exempt: yes
This commit is contained in:
Jan Synacek 2021-10-28 23:32:59 +02:00 • committed by Lars Ingebrigtsen
parent bea843dee1
commit d72fefdeab
2 changed files with 8 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

2
doc/lispintro/emacs-lisp-intro.texi
View file

@ -17843,7 +17843,7 @@ xmodmap -e "keysym Alt_L = Meta_L Alt_L"
Finally, a feature I really like: a modified mode line. Finally, a feature I really like: a modified mode line.
When I work over a network, I forget which machine I am using. Also, When I work over a network, I forget which machine I am using. Also,
I tend to I lose track of where I am, and which line point is on. I tend to lose track of where I am, and which line point is on.
So I reset my mode line to look like this: So I reset my mode line to look like this:

13
lisp/minibuffer.el
View file

@ -3579,12 +3579,13 @@ between 0 and 1, and with faces `completions-common-part',
;; "hole" in the middle of the string is indicated by ;; "hole" in the middle of the string is indicated by
;; "-". Note that there are no "holes" near the edges ;; "-". Note that there are no "holes" near the edges
;; of the string. The completion score is a number ;; of the string. The completion score is a number
;; bound by ]0..1]: the higher the better and only a ;; bound by (0..1] (i.e., larger than (but not equal
;; perfect match (pattern equals string) will have ;; to) zero, and smaller or equal to one): the higher
;; score 1. The formula takes the form of a quotient. ;; the better and only a perfect match (pattern equals
;; For the numerator, we use the number of +, i.e. the ;; string) will have score 1. The formula takes the
;; length of the pattern. For the denominator, it ;; form of a quotient. For the numerator, we use the
;; first computes ;; number of +, i.e. the length of the pattern. For
;; the denominator, it first computes
;; ;;
;; hole_i_contrib = 1 + (Li-1)^(1/tightness) ;; hole_i_contrib = 1 + (Li-1)^(1/tightness)
;; ;;