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