1 \documentclass[a4paper]{strayman}
2 \let\numberwithin=\notdef
10 \renewcommand{\ge}{\geqslant}
11 \renewcommand{\le}{\leqslant}
13 \newcommand{\has}{\sqsupseteq}
14 \newcommand{\isin}{\sqsubseteq}
16 \newcommand{\nothaspatch}{{%
17 \declareslashed{}{\sslash}{-0.04}{0}{\Sqsupset}\slashed{\Sqsupset}}}
18 \newcommand{\notpatchisin}{{%
19 \declareslashed{}{\sslash}{-0.04}{0}{\Sqsubset}\slashed{\Sqsubset}}}
20 \newcommand{\haspatch}{\Sqsupset}
21 \newcommand{\patchisin}{\Sqsubset}
23 \newcommand{\set}[1]{\mathbb #1}
24 \newcommand{\pa}[1]{\varmathbb #1}
25 \newcommand{\pay}[1]{\pa{#1}^+}
26 \newcommand{\pan}[1]{\pa{#1}^-}
28 \newcommand{\p}{\pa{P}}
29 \newcommand{\py}{\pay{P}}
30 \newcommand{\pn}{\pan{P}}
32 %\newcommand{\hasparents}{\underaccent{1}{>}}
33 %\newcommand{\hasparents}{{%
34 % \declareslashed{}{_{_1}}{0}{-0.8}{>}\slashed{>}}}
35 \newcommand{\hasparents}{>_{\mkern-7.0mu _1}}
36 \newcommand{\areparents}{<_{\mkern-14.0mu _1\mkern+5.0mu}}
38 \renewcommand{\implies}{\Rightarrow}
44 $ C \hasparents \set X $ The parents of commit $C$ are exactly the set
47 $ C \ge D $ $C$ is a descendant of $D$ in the git commit
48 graph. This is a partial order, namely the transitive closure of
49 $ D \in \set X $ where $ C \hasparents \set X $.
51 $ C \has D $ Informally, the tree at commit $C$ contains the change
52 made in commit $D$. Does not take account of deliberate reversions by
53 the user or in non-Topbloke-controlled branches; these are considered
54 normal, forward, commits. For merges and Topbloke-generated
55 anticommits, the ``change made'' is only to be thought of as any
56 conflict resolution. This is not a partial order because it is not
61 No rewind/replay: $ C \has D \implies C \ge D $