define patch

[topbloke-formulae.git] / article.tex

diff --git a/article.tex b/article.tex
index ef8a9853d036ed6813d572af59f57714170ed976..0a411723ffb858cfa09eb869d6f01831628f1db7 100644 (file)
--- a/article.tex
+++ b/article.tex
@@ -5,6 +5,7 @@
 \usepackage{slashed}
 \usepackage{txfonts}
 \usepackage{amsfonts}
+\usepackage{mdwlist}
 %\usepackage{accents}
 
 \renewcommand{\ge}{\geqslant}
@@ -37,18 +38,28 @@
 
 \renewcommand{\implies}{\Rightarrow}
 
+\newcommand{\pancs}[2]{{\mathcal A} ( #1 , #2 ) }
+\newcommand{\pends}[2]{{\mathcal E} ( #1 , #2 ) }
+
 \begin{document}
 
 \section{Notation}
 
-$ C \hasparents \set X $ The parents of commit $C$ are exactly the set
+\begin{basedescript}{
+\desclabelwidth{5em}
+\desclabelstyle{\nextlinelabel}
+}
+\item[ $ C \hasparents \set X $ ]
+The parents of commit $C$ are exactly the set
 $\set X$.
 
-$ C \ge D $ $C$ is a descendant of $D$ in the git commit
+\item[ $ C \ge D $ ]
+$C$ is a descendant of $D$ in the git commit
 graph.  This is a partial order, namely the transitive closure of 
 $ D \in \set X $ where $ C \hasparents \set X $.
 
-$ C \has D $ Informally, the tree at commit $C$ contains the change
+\item[ $ C \has D $ ]
+Informally, the tree at commit $C$ contains the change
 made in commit $D$.  Does not take account of deliberate reversions by
 the user or in non-Topbloke-controlled branches; these are considered
 normal, forward, commits.  For merges and Topbloke-generated
@@ -56,8 +67,27 @@ anticommits, the ``change made'' is only to be thought of as any
 conflict resolution.  This is not a partial order because it is not
 transitive.
 
+\item[ $ \p, \py, \pn $ ]
+A patch $\p$ consists of two sets of commits $\pn$ and $\py$, which
+are respectively the base and tip git branches.  $\p$ may be used
+where the context requires a set, in which case the statement
+is to be taken as applying to both $\py$ and $\pn$
+All these sets are distinct.
+
+\end{basedescript}
+
 \section{Invariants}
 
-No rewind/replay: $ C \has D \implies C \ge D $
+No replay: \[ C \has D \implies C \ge D \]
+
+Unique base: \[ \mathop{\forall}_{C \in \py} \pends{C}{\pn} = \{ B \} \]
+
+\section{Test more symbols}
+
+$ C \haspatch \p $
+
+$ C \nothaspatch \p $
+
+$ \{ B \} \areparents C $
 
 \end{document}