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