1 \documentclass[a4paper,leqno]{strayman}
2 \let\numberwithin=\notdef
11 \renewcommand{\ge}{\geqslant}
12 \renewcommand{\le}{\leqslant}
14 \newcommand{\has}{\sqsupseteq}
15 \newcommand{\isin}{\sqsubseteq}
17 \newcommand{\nothaspatch}{{%
18 \declareslashed{}{\sslash}{-0.04}{0}{\sqSupset}\slashed{\sqSupset}}}
19 \newcommand{\notpatchisin}{{%
20 \declareslashed{}{\sslash}{-0.04}{0}{\sqSubset}\slashed{\sqSubset}}}
21 \newcommand{\haspatch}{\sqSupset}
22 \newcommand{\patchisin}{\sqSubset}
24 \newcommand{\set}[1]{\mathbb #1}
25 \newcommand{\pa}[1]{\varmathbb #1}
26 \newcommand{\pay}[1]{\pa{#1}^+}
27 \newcommand{\pan}[1]{\pa{#1}^-}
29 \newcommand{\p}{\pa{P}}
30 \newcommand{\py}{\pay{P}}
31 \newcommand{\pn}{\pan{P}}
33 %\newcommand{\hasparents}{\underaccent{1}{>}}
34 %\newcommand{\hasparents}{{%
35 % \declareslashed{}{_{_1}}{0}{-0.8}{>}\slashed{>}}}
36 \newcommand{\hasparents}{>_{\mkern-7.0mu _1}}
37 \newcommand{\areparents}{<_{\mkern-14.0mu _1\mkern+5.0mu}}
39 \newcommand{\implies}{\Rightarrow}
41 \newcommand{\pancs}[2]{{\mathcal A} ( #1 , #2 ) }
42 \newcommand{\pends}[2]{{\mathcal E} ( #1 , #2 ) }
50 \desclabelstyle{\nextlinelabel}
52 \item[ $ C \hasparents \set X $ ]
53 The parents of commit $C$ are exactly the set
57 $C$ is a descendant of $D$ in the git commit
58 graph. This is a partial order, namely the transitive closure of
59 $ D \in \set X $ where $ C \hasparents \set X $.
62 Informally, the tree at commit $C$ contains the change
63 made in commit $D$. Does not take account of deliberate reversions by
64 the user or in non-Topbloke-controlled branches; these are considered
65 normal, forward, commits. For merges and Topbloke-generated
66 anticommits, the ``change made'' is only to be thought of as any
67 conflict resolution. This is not a partial order because it is not
70 \item[ $ \p, \py, \pn $ ]
71 A patch $\p$ consists of two sets of commits $\pn$ and $\py$, which
72 are respectively the base and tip git branches. $\p$ may be used
73 where the context requires a set, in which case the statement
74 is to be taken as applying to both $\py$ and $\pn$.
75 All these sets are distinct.
81 $$ C \has D \implies C \ge D \eqno{No replay} $$
83 Unique base: \[ \mathop{\forall}_{C \in \py} \pends{C}{\pn} = \{ B \} \]
85 \section{Test more symbols}
91 $ \{ B \} \areparents C $