mirror of
https://github.com/ElegantLaTeX/ElegantBook.git
synced 2026-01-26 04:14:35 +08:00
chapter section settings and fix header
This commit is contained in:
@@ -1,4 +1,4 @@
|
||||
\documentclass[cn,10pt]{elegantbook}
|
||||
\documentclass[cn,10pt,twoside]{elegantbook}
|
||||
|
||||
\title{ElegantBook:优美的 \LaTeX{} 书籍模板}
|
||||
\subtitle{Elegant\LaTeX{} 经典之作}
|
||||
@@ -24,18 +24,13 @@
|
||||
\usepackage{array}
|
||||
\newcommand{\ccr}[1]{\makecell{{\color{#1}\rule{1cm}{1cm}}}}
|
||||
|
||||
\usepackage[lined,dotocloa,algochapter]{algorithm2e}
|
||||
\SetKwData{Left}{left}\SetKwData{This}{this}\SetKwData{Up}{up}
|
||||
\SetKwFunction{Union}{Union}\SetKwFunction{FindCompress}{FindCompress}
|
||||
\SetKwInOut{Input}{input}\SetKwInOut{Output}{output}
|
||||
|
||||
|
||||
\begin{document}
|
||||
|
||||
\maketitle
|
||||
\frontmatter
|
||||
|
||||
\chapter*{特别声明}
|
||||
|
||||
\markboth{Introduction}{前言}
|
||||
|
||||
|
||||
@@ -59,9 +54,12 @@ February 10, 2020
|
||||
\end{flushright}
|
||||
|
||||
\tableofcontents
|
||||
%\listofchanges
|
||||
|
||||
|
||||
\mainmatter
|
||||
|
||||
\part{模板介绍}
|
||||
|
||||
\chapter{Elegant\LaTeX{} 系列模板介绍}
|
||||
|
||||
Elegant\LaTeX{} 项目组致力于打造一系列美观、优雅、简便的模板方便用户使用。目前由 \href{https://github.com/ElegantLaTeX/ElegantNote}{ElegantNote},\href{https://github.com/ElegantLaTeX/ElegantBook}{ElegantBook},\href{https://github.com/ElegantLaTeX/ElegantPaper}{ElegantPaper} 组成,分别用于排版笔记,书籍和工作论文。强烈推荐使用最新正式版本!本文将介绍本模板的一些设置内容以及基本使用方法。如果您有其他问题,建议或者意见,欢迎在 GitHub 上给我们提交 \href{https://github.com/ElegantLaTeX/ElegantBook/issues}{issues} 或者邮件联系我们。 \ref{sec:update}
|
||||
@@ -409,34 +407,34 @@ The content of theorem.
|
||||
\label{tab:theorem-class}%
|
||||
\end{table}%
|
||||
|
||||
\subsection{算法环境}
|
||||
% \subsection{算法环境}
|
||||
|
||||
|
||||
\begin{algorithm}\label{alg:test}
|
||||
\Input{A bitmap $I$ of size $w \times l$}
|
||||
\Output{A partition of the bitmap}
|
||||
\BlankLine
|
||||
\emph{special treatment of the first line}\;
|
||||
\For{$i \leftarrow 2$ \KwTo $l$}{
|
||||
\emph{special treatment of the first element of line $i$}\;
|
||||
\For{$j \leftarrow 2$ \KwTo $w$}{\label{forins}
|
||||
$\Left \leftarrow \FindCompress{$I[i,j-1]$}$\;
|
||||
$\Up \leftarrow \FindCompress{$I[i-1,]$}$\;
|
||||
$\This \leftarrow \FindCompress{$I[i,j]$}$\;
|
||||
\If(\tcp*[h]{O(\Left,\This)==1}){\Left compatible with \This}{\label{lt}
|
||||
\lIf{$\Left < \This$}{$\Union{\Left,\This}$}
|
||||
\lElse{$\Union{\This,\Left}$}
|
||||
}
|
||||
\If(\tcp*[f]{O(\Up,\This)==1}){\Up compatible with \This}{\label{ut}
|
||||
\lIf{$\Up < \This$}{$\Union{\Up,\This}$}
|
||||
\tcp{\This is put under \Up to keep tree as flat as possible}\label{cmt}
|
||||
\lElse{$\Union{\This,\Up}$}\tcp*[r]{\This{} linked to \Up}\label{lelse}
|
||||
}
|
||||
}
|
||||
\lForEach{element $e$ of the line $i$}{\FindCompress{p}}
|
||||
}
|
||||
\caption{disjoint decomposition}\label{algo_disjdecomp}
|
||||
\end{algorithm}
|
||||
% \begin{algorithm}\label{alg:test}
|
||||
% \Input{A bitmap $I$ of size $w \times l$}
|
||||
% \Output{A partition of the bitmap}
|
||||
% \BlankLine
|
||||
% \emph{special treatment of the first line}\;
|
||||
% \For{$i \leftarrow 2$ \KwTo $l$}{
|
||||
% \emph{special treatment of the first element of line $i$}\;
|
||||
% \For{$j \leftarrow 2$ \KwTo $w$}{\label{forins}
|
||||
% $\Left \leftarrow \FindCompress{$I[i,j-1]$}$\;
|
||||
% $\Up \leftarrow \FindCompress{$I[i-1,]$}$\;
|
||||
% $\This \leftarrow \FindCompress{$I[i,j]$}$\;
|
||||
% \If(\tcp*[h]{O(\Left,\This)==1}){\Left compatible with \This}{\label{lt}
|
||||
% \lIf{$\Left < \This$}{$\Union{\Left,\This}$}
|
||||
% \lElse{$\Union{\This,\Left}$}
|
||||
% }
|
||||
% \If(\tcp*[f]{O(\Up,\This)==1}){\Up compatible with \This}{\label{ut}
|
||||
% \lIf{$\Up < \This$}{$\Union{\Up,\This}$}
|
||||
% \tcp{\This is put under \Up to keep tree as flat as possible}\label{cmt}
|
||||
% \lElse{$\Union{\This,\Up}$}\tcp*[r]{\This{} linked to \Up}\label{lelse}
|
||||
% }
|
||||
% }
|
||||
% \lForEach{element $e$ of the line $i$}{\FindCompress{p}}
|
||||
% }
|
||||
% \caption{disjoint decomposition}\label{algo_disjdecomp}
|
||||
% \end{algorithm}
|
||||
|
||||
\subsection{其他环境的使用}
|
||||
|
||||
@@ -898,7 +896,7 @@ Lebesgue 积分有几种不同的定义方式。我们将采用逐步定义非
|
||||
\datechange{2019/08/18}{版本 3.09 正式发布}
|
||||
|
||||
\begin{change}
|
||||
\item 由于 \lstinline{\elegantpar} 存在一些问题,暂时性删除 \lstinline{\elegantpar} 命令,并提示用户改用 \lstinline{\marginnote} 和 \lstinline{\marginpar} 旁注/边注命令。
|
||||
\item \lstinline{\elegantpar} 存在 bug,删除 \lstinline{\elegantpar} 命令,建议用户改用 \lstinline{\marginnote} 和 \lstinline{\marginpar} 旁注命令。
|
||||
\item 积分操作符统一更改为 \lstinline{esint} 宏包设置;
|
||||
\item 新增目录选项 \lstinline{toc},可选项为单栏 \lstinline{onecol} 和双栏 \lstinline{twocol};
|
||||
\item 手动增加参考文献选项 \lstinline{cite},可选项为上标形式 \lstinline{super};
|
||||
|
||||
Reference in New Issue
Block a user