summaryrefslogtreecommitdiff
path: root/macros/latex-dev/base/ltfntcmd.dtx
diff options
context:
space:
mode:
authorNorbert Preining <norbert@preining.info>2021-01-10 03:01:42 +0000
committerNorbert Preining <norbert@preining.info>2021-01-10 03:01:42 +0000
commitef57fc77f3c939d55d51322d428e40a5a3c9ed8e (patch)
treec296d1bf47b8ffa67bb75b1843c2e0786fb0634c /macros/latex-dev/base/ltfntcmd.dtx
parent0b5fb424a9fab0df06b2d7b9f8edc803cb89a760 (diff)
CTAN sync 202101100301
Diffstat (limited to 'macros/latex-dev/base/ltfntcmd.dtx')
-rw-r--r--macros/latex-dev/base/ltfntcmd.dtx10
1 files changed, 5 insertions, 5 deletions
diff --git a/macros/latex-dev/base/ltfntcmd.dtx b/macros/latex-dev/base/ltfntcmd.dtx
index 0a44d5acf1..8d587a848a 100644
--- a/macros/latex-dev/base/ltfntcmd.dtx
+++ b/macros/latex-dev/base/ltfntcmd.dtx
@@ -1,6 +1,6 @@
% \iffalse meta-comment
%
-% Copyright (C) 1993-2020
+% Copyright (C) 1993-2021
% The LaTeX3 Project and any individual authors listed elsewhere
% in this file.
%
@@ -32,7 +32,7 @@
%<*driver>
% \fi
\ProvidesFile{ltfntcmd.dtx}
- [2019/12/17 v3.4c LaTeX Kernel (Font commands)]
+ [2020/12/05 v3.4c LaTeX Kernel (Font commands)]
% \iffalse
\documentclass{ltxdoc}
\GetFileInfo{ltfntcmd.dtx}
@@ -303,7 +303,7 @@
% character in an unsloped font; we believe (in early 2003) that
% this is perhaps inefficient but not dangerous.
%
-% It also now checks for empty contents of the text command and optimises
+% It also now checks for empty contents of the text command and optimizes
% this case. Some care is also taken to check that doing dangerous
% things in vertical mode is avoided.
%
@@ -539,7 +539,7 @@
%
% \begin{macro}{\ifmaybe@ic}
% \changes{v3.4a}{2009/12/14}{Macro added}
-% Switch used soley within |\maybe@ic| not interfering with other
+% Switch used solely within |\maybe@ic| not interfering with other
% switches.
% \begin{macrocode}
\newif\ifmaybe@ic
@@ -585,7 +585,7 @@
% \begin{macrocode}
\do \t@st@ic
% \end{macrocode}
-% Frank thinks that the next bit it is inefficient if done after
+% Frank thinks that the next bit is inefficient if done after
% the second change. Chris thinks that most all of this is
% inefficient for the commonest cases: but that is the price of a
% cleverer algorithm. It is certainly needed to deal with the use