summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/source/latex/computational-complexity
diff options
context:
space:
mode:
authorKarl Berry <karl@freefriends.org>2015-11-11 23:14:24 +0000
committerKarl Berry <karl@freefriends.org>2015-11-11 23:14:24 +0000
commit52bfd911dee324971d1d3f36c3b6f1fa2be1cd9e (patch)
treed8a50d5594a34031cc16b1a6aa5c61b00ba79d9f /Master/texmf-dist/source/latex/computational-complexity
parent4b253de4e3a6e181da022e0ccd93d348dcfe894b (diff)
computational-complexity (11nov15)
git-svn-id: svn://tug.org/texlive/trunk@38824 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Master/texmf-dist/source/latex/computational-complexity')
-rw-r--r--Master/texmf-dist/source/latex/computational-complexity/cc.dtx103
1 files changed, 69 insertions, 34 deletions
diff --git a/Master/texmf-dist/source/latex/computational-complexity/cc.dtx b/Master/texmf-dist/source/latex/computational-complexity/cc.dtx
index f8c87511e31..e94c855934b 100644
--- a/Master/texmf-dist/source/latex/computational-complexity/cc.dtx
+++ b/Master/texmf-dist/source/latex/computational-complexity/cc.dtx
@@ -1,6 +1,6 @@
% \iffalse meta-comment
%
-% Copyright 2000-2011 computational complexity,
+% Copyright 2000-2015 computational complexity,
% Michael Nüsken, <nuesken@bit.uni-bonn.de>.
%
% Current maintainer: Michael Nüsken, <nuesken@bit.uni-bonn.de>.
@@ -391,9 +391,9 @@ Kompaktf{\"{u}}hrer/Nachschlagewerke f{\"{u}}r \LaTeX{}
note = {Part of the standard \LaTeXe{} distribution.
Usually \url{texmf/doc/latex/amslatex/amsldoc.dvi}.
Also available at CTAN:
- \url{ftp://ftp.dante.de/tex-archive/macros/latex}\relax
+ \url{http://mirror.ctan.org/macros/latex}\relax
\url{/required/amslatex/math/amsldoc.tex}.},
- xurl = {ftp://ftp.dante.de/tex-archive/macros/latex/required/amslatex/math/amsldoc.tex}
+ xurl = {http://mirror.ctan.org/macros/latex/required/amslatex/math/amsldoc.tex}
}
@Preamble{"\providecommand{\BibTeX}{\textsc{Bib}\TeX{}}"}
@@ -403,7 +403,7 @@ Kompaktf{\"{u}}hrer/Nachschlagewerke f{\"{u}}r \LaTeX{}
year = 1988,
note = {Usually \url{texmf/doc/bibtex/base/btxdoc.dvi}
Also available at CTAN:
- \url{ftp://ftp.dante.de/tex-archive/biblio/bibtex}\relax
+ \url{http://mirror.ctan.org/biblio/bibtex}\relax
\url{/distribs/doc/btxdoc.*}.},
}
@@ -416,9 +416,9 @@ Kompaktf{\"{u}}hrer/Nachschlagewerke f{\"{u}}r \LaTeX{}
Part of the standard \LaTeXe{} distribution.
Usually \url{texmf/doc/latex/natbib/natbib.dvi}.
Available from CTAN:
- \url{ftp://ftp.dante.de/tex-archive/macros/latex}\relax
+ \url{http://mirror.ctan.org/macros/latex}\relax
\url{/contrib/supported/natbib/natbib.*}.},
- xurl = {ftp://ftp.dante.de/tex-archive/macros/latex/contrib/supported/natbib/natbib.*}
+ xurl = {http://mirror.ctan.org/macros/latex/contrib/supported/natbib/natbib.*}
}
@@ -919,6 +919,7 @@ D: \short\ref{rs-D},
\newcommand{\emailmaintenance}{\email{ccmaintainer@computational-complexity.org}}
\renewcommand{\emailmaintenance}{\email{nuesken@bit.uni-bonn.de}}
+\newcommand{\emaileic}{\email{editorinchief@computational-complexity.org}}
\newcommand{\emailsubmit}{\email{submit@computational-complexity.org}}
\newcommand{\emailtest}{\email{cctest@computational-complexity.org}}
@@ -1275,12 +1276,14 @@ contact author's name and address, either to the Editor-in-Chief or to
one of the Editors. Submissions can also be sent by ordinary mail to
the Editor-in-Chief.
\begin{quotation}\obeylines%
- Joachim von zur Gathen
- b-it
- Dahlmannstr. 2
- D-53113 Bonn
+ Peter B\"urgisser
+ Technische Universit\"at Berlin
+ Institut für Mathematik
+ Sekretariat MA 3-2
+ Stra\ss{}e des 17. Juni 136
+ 10623 Berlin
\textsc{Germany}
- Email: \email{gathen@bit.uni-bonn.de}
+ Email: \email{editor-in-chief@computational-complexity.org}
\end{quotation}
Information about \cc{} can be found at the journal's homepage
\cchomepage{}. There you also find a pointer to the publisher's page
@@ -1363,7 +1366,7 @@ year = {about 300 BC},
\begin{document}
\includegraphics{picture.ps}
\input{section1}
-\bibliography{journals,myrefs}
+\bibliography{cc-journals,myrefs}
\end{document}
\end{verbatim}
\end{texexamplesize}
@@ -1723,7 +1726,7 @@ environment (see above).
The \BibTeX{} file \file{journals.bib}, available on \cc{}'s homepage
\cchomepage{}, contains macros for a number of journals and conference
proceedings. If in your document you have
-|\bibliography{journals,myrefs}|, then an entry |journal = FOCS99,| in
+|\bibliography{cc-journals,myrefs}|, then an entry |journal = FOCS99,| in
your file \texttt{myrefs.bib} will produce: `Proceedings of the 40th
Annual IEEE Symposium on Foundations of Computer Science, {\rm New
York City~NY}' when \BibTeX{} is run. (Note that \texttt{journals}
@@ -2218,6 +2221,10 @@ support.
latin1 (this is standard with \LaTeX).
\item \Lclo{latin1}: use the input encoding scheme latin1 (so Umlaute,
{\"{a}}{\"{o}}{\"{u}}, and so on can be typed in literally).
+\item \Lclo{utf8} (default): use the input encoding scheme utf-8.
+\item \Lclo{noutf8}: do not use the input encoding scheme utf-8.
+\item \Lclo{noinputenc}: do not use any input encoding scheme, so that
+ loading the package inputenc can be done afterwards.
\item \Lclo{nobabel} (default): do not use \Lpackage{babel} for
multilingual support.
\item \Lclo{babel} (default): load \Lpackage{babel} for multilingual
@@ -2529,7 +2536,7 @@ The commands and environments related to algorithms can also be used
independently, try |\usepackage{ccalgo}| to activate them. For a
longer example, see \ref{tab:algo}.
\begin{table}[t!]
- \input{tab-algo.tex}
+ \input{tab-algo}
\caption{An example algorithm}
\label{tab:algo}
\end{table}
@@ -2847,7 +2854,9 @@ multilingual,english]{cc}
\ifclass\expandafter\ProvidesClass\else\expandafter\ProvidesPackage\fi
{\ifclass cc\else cc-cls\fi}
[% CC MAIN DATE AND VERSION ON NEXT LINE
-2013/06/26 v2.25c
+2015/11/11 v2.25e
+%2015/02/23 v2.25e
+%2014/07/08 v2.25d
computational complexity
\ifclass document class\else package\fi]
% \end{macrocode}
@@ -2905,13 +2914,18 @@ computational complexity
% else, this can be disabled.
% \changes{v2.00}{2000/04/11}{Added options latin1/nolatin1. Michael
% N{\"{u}}sken, Paderborn}
+% \changes{v2.25d}{2014/07/08}{Added options utf8/noutf8, noinputenc.
+% Michael N{\"{u}}sken, Paderborn}
% \begin{macrocode}
\DeclareOption{multilingual}{\ExecuteOptions{T1,latin1,babel}}
\DeclareOption{nomultilingual}{\ExecuteOptions{OT1,nolatin1,nobabel}}
\DeclareOption{T1}{\@Tonetrue}
\DeclareOption{OT1}{\@Tonefalse}
-\DeclareOption{latin1}{\@latintrue}
+\DeclareOption{latin1}{\@latintrue\@utfviiifalse}
\DeclareOption{nolatin1}{\@latinfalse}
+\DeclareOption{utf8}{\@utfviiitrue\@latinfalse}
+\DeclareOption{noutf8}{\@utfviiifalse}
+\DeclareOption{noinputenc}{\@latinfalse\@utfviiifalse}
\DeclareOption{babel}{\@babeltrue}
\DeclareOption{nobabel}{\@babelfalse}
% \end{macrocode}
@@ -3088,9 +3102,11 @@ computational complexity
ccalgorithms}
\fi
% \end{macrocode}
-% Then we process the class options.
+% Then we process the class options in calling order.
+% \changes{v2.25d}{2014/07/08}{Process options in calling order
+% rather than definition order. Michael N{\"{u}}sken, Bonn}
% \begin{macrocode}
-\ProcessOptions\relax
+\ProcessOptions*
% \end{macrocode}
% Finally, the pointsize is passed to the \Lclass{article} class and
% the sorting mode to the \Lpackage{natbib} package.
@@ -3147,6 +3163,8 @@ computational complexity
% \changes{v2.01}{2000/09/15}{Forbid loading of german by pretending
% that this has been done already.
% Michael N{\"{u}}sken, Paderborn}
+% \changes{v2.25d}{2014/07/08}{Added support for utf8/noutf8. Michael
+% N{\"{u}}sken, Paderborn}
% \begin{macrocode}
\if@Tone
\RequirePackage[T1]{fontenc}
@@ -3157,10 +3175,11 @@ computational complexity
\if@babel
\RequirePackage{babel}[2008/07/06 v3.8l]
\fi
-\if@latin
-% make this optional? yes.
+\if@utfviii
+\RequirePackage[utf8]{inputenc}[2008/03/30 v1.1d]
+\else\if@latin
\RequirePackage[latin1]{inputenc}[2008/03/30 v1.1d]
-\fi
+\fi\fi
% \end{macrocode}
% Next, we load the \AMS{} packages if required. If not we define
% some commands that we need and that would have been provided by
@@ -3609,6 +3628,7 @@ computational complexity
\newif\if@cclayout \@cclayouttrue
\newif\if@Tone \@Tonetrue
\newif\if@latin \@latintrue
+\newif\if@utfviii \@utfviiifalse
\newif\if@babel \@babelfalse
\newif\if@ams \@amstrue
\newif\if@autotitle \@autotitletrue
@@ -4420,7 +4440,10 @@ computational complexity
\fi
% With the option xlink the final pdf shall have bookmarks and
% blue links. Otherwise there are no bookmarks and black links.
- \RequirePackage[dvips,
+% \changes{v2.25e}{2015/02/23}{Dropped option dvips from call of
+% hyperref. I hope that hyperref finds out itsself whether dvips
+% may be used. Michael N{\"{u}}sken, Bonn}
+ \RequirePackage[%dvips,
bookmarks=\ifKV@ccsps@xlink true\else false\fi,
breaklinks=true,
colorlinks=\ifKV@ccsps@xlink true\else false\fi,
@@ -5451,12 +5474,14 @@ computational complexity
% \fi
% \begin{macrocode}
\NeedsTeXFormat{LaTeX2e}
-\ProvidesPackage{relabel}[1998/09/07 v1.01 Relabel. MNuesken]
+\ProvidesPackage{relabel}[2014/07/08 v1.02 Relabel. MNuesken]
% \end{macrocode}
%
% We declare some options. \Lclo{prefixes} and \Lclo{noprefixes} turn
% the effects of this packages on or off. \Lclo{bare} and
% \Lclo{nobare} turn the additional |\bare\ref|erences on or off.
+% \changes{v1.02}{2014/07/08}{Process options in calling order
+% rather than definition order. Michael N{\"{u}}sken, Bonn}
% \begin{macrocode}
\newif\if@prefixes
\DeclareOption{prefixes}{\@prefixestrue}
@@ -5465,7 +5490,7 @@ computational complexity
\DeclareOption{bare}{\@baretrue}
\DeclareOption{nobare}{\@barefalse}
\ExecuteOptions{prefixes,nobare}
-\ProcessOptions\relax
+\ProcessOptions*
% \end{macrocode}
%
% \subsection{Modifyable labelling and counting}
@@ -5866,7 +5891,7 @@ computational complexity
% revised \filedate.
% \begin{macrocode}
%<*ccthm>
-\ProvidesPackage{ccthm}[2012/06/22 v2.25
+\ProvidesPackage{ccthm}[2014/07/08 v2.25d
theorem environments for cc. Michael Nuesken, Bonn.]
% \end{macrocode}
%
@@ -5875,12 +5900,14 @@ computational complexity
% Referring to numerated items in theorem usually means that you
% also need to mention the theorem number. With
% \Lclo{theoremitemprefixes} this is automatically done.
+% \changes{v2.25d}{2014/07/08}{Process options in calling order
+% rather than definition order. Michael N{\"{u}}sken, Bonn}
% \begin{macrocode}
\newif\if@theoremitemprefixes
\DeclareOption{theoremitemprefixes}{\@theoremitemprefixestrue}
\DeclareOption{notheoremitemprefixes}{\@theoremitemprefixesfalse}
\ExecuteOptions{theoremitemprefixes}
-\ProcessOptions\relax
+\ProcessOptions*
% \end{macrocode}
%
% Then, we load the packages for theorems and proofs.
@@ -5956,7 +5983,7 @@ computational complexity
\protect\protect\protect\@@conduselabel
{{\protect\csname the#1\endcsname}}%
{\@thm@bare@currentlabel}{\@thm@currentlabel}%
- (\theenumi.\theenumii.\theenumiii##1)}
+ (\theenumi.\theenumii.\theenumiii##1)}%
}
\else
\def\EnumerationInTheorems#1{%
@@ -5971,7 +5998,7 @@ computational complexity
\defprefix{enumiii}##1{(\theenumi.\theenumii.##1)}%
% \def\theenumiv{\@Alph\c@enumiv}%
% \def\labelenumiv{\theenumiv.}%
- \defprefix{enumiv}##1{(\theenumi.\theenumii.\theenumiii##1)}
+ \defprefix{enumiv}##1{(\theenumi.\theenumii.\theenumiii##1)}%
}
\fi
% \end{macrocode}
@@ -6920,10 +6947,12 @@ computational complexity
% This is just a counter for internal use. |\nextblock| stores
% locally a new value in |\currentblock|. See the sophisticated
% things below on how to use this.
+% \changes{v2.25d}{2014/06/30}{Changed definition of
+% \cs{currentblock} to be more robust, Michael N{\"{u}}sken, Bonn}
% \begin{macrocode}
\newcounter{block@cnt}
\newcommand{\nextblock}{%
- \stepcounter{block@cnt}\edef\currentblock{\arabic{block@cnt}}%
+ \stepcounter{block@cnt}\edef\currentblock{\the\c@block@cnt}%
}
% \end{macrocode}
% \end{macro}
@@ -6969,13 +6998,15 @@ computational complexity
% Note: the following environments are defined with a prefix |algo@|
% in their names since they should not be available outside the
% \Lenv{algonumerate} environment.
+% \changes{v2.25d}{2014/06/30}{Changed definition of
+% \cs{algo@range} to be more robust, Michael N{\"{u}}sken, Bonn}
% \begin{environment}{range}
% A |\label| (or an |\algolabel|) after the |\begin{range}| will
% refer to the \emph{range} of items inside the environment.
% \begin{macrocode}
\newenvironment{algo@range}{%
\par
- \stepcounter{block@cnt}\edef\block@{\arabic{block@cnt}}%
+ \stepcounter{block@cnt}\edef\block@{\the\c@block@cnt}%
\refsetrange{bob\block@}{eob\block@}%
\AtNextNumberedItem{\algolabel{bob\block@}}%
}{%
@@ -7305,6 +7336,8 @@ computational complexity
% \begin{macrocode}
% \changes{v2.01}{2001/01/24}{Added \cs{algoprettify}. Michael
% N{\"{u}}sken, Paderborn}
+% \changes{v2.25f}{2015/11/11}{Allow \cs{raggedright} in argument 2. Michael
+% N{\"{u}}sken, Bonn}
\newcommand{\algoprettify}[3]{%
\setbox2\hbox{#1}%
\setbox4\hbox{#2}%
@@ -7314,7 +7347,7 @@ computational complexity
\unhbox0
\else
\dimen0=\linewidth \advance\dimen0 by -\wd2
- \unhbox2\parbox[t]{\dimen0}{\unhbox4\strut}\par\unhbox6
+ \unhbox2\parbox[t]{\dimen0}{#2\strut}\par\unhbox6
\fi
}
% \end{macrocode}
@@ -7523,7 +7556,7 @@ computational complexity
% revised \filedate.
% \begin{macrocode}
%<*ccqed>
-\ProvidesPackage{ccqed}[2000/02/29 v2.05
+\ProvidesPackage{ccqed}[2014/07/08 v2.25d
right-justified end-of-proof mark,
based on Paul Taylor's QED.sty of 24 June 1995]
% \end{macrocode}
@@ -8095,12 +8128,14 @@ computational complexity
\fi
% \end{macrocode}
%
+% \changes{v2.25d}{2014/07/08}{Process options in calling order
+% rather than definition order. Michael N{\"{u}}sken, Bonn}
% \begin{macrocode}
\DeclareOption{auto-QED}{\AutoQEDtrue}%
\DeclareOption{explicit-QED}{\AutoQEDfalse}%
\DeclareOption{black-square}{\def\qedsymbol{\blacksquare}}%
\DeclareOption{open-square}{\def\qedsymbol{\square}}%
-\ProcessOptions\relax
+\ProcessOptions*
% \end{macrocode}
%
% \subsection{Bugs}
@@ -8639,7 +8674,7 @@ computational complexity
%% \noacknowledge% This command must be here if there are no
% acknowledgements.
-\bibliography{journals,\jobname}% Put your bibliography into the above
+\bibliography{cc-journals,\jobname}% Put your bibliography into the above
% filecontents environment!
\end{document}