1 \documentclass[a4paper,leqno]{strayman}
2 \let\numberwithin=\notdef
10 \renewcommand{\ge}{\geqslant}
11 \renewcommand{\le}{\leqslant}
13 \newcommand{\has}{\sqsupseteq}
14 \newcommand{\isin}{\sqsubseteq}
16 \newcommand{\nothaspatch}{\mathrel{\,\not\!\not\relax\haspatch}}
17 \newcommand{\notpatchisin}{\mathrel{\,\not\!\not\relax\patchisin}}
18 \newcommand{\haspatch}{\sqSupset}
19 \newcommand{\patchisin}{\sqSubset}
21 \newcommand{\set}[1]{\mathbb #1}
22 \newcommand{\pa}[1]{\varmathbb #1}
23 \newcommand{\pay}[1]{\pa{#1}^+}
24 \newcommand{\pan}[1]{\pa{#1}^-}
26 \newcommand{\p}{\pa{P}}
27 \newcommand{\py}{\pay{P}}
28 \newcommand{\pn}{\pan{P}}
30 %\newcommand{\hasparents}{\underaccent{1}{>}}
31 %\newcommand{\hasparents}{{%
32 % \declareslashed{}{_{_1}}{0}{-0.8}{>}\slashed{>}}}
33 \newcommand{\hasparents}{>_{\mkern-7.0mu _1}}
34 \newcommand{\areparents}{<_{\mkern-14.0mu _1\mkern+5.0mu}}
36 \renewcommand{\implies}{\Rightarrow}
38 \newcommand{\pancs}[2]{{\mathcal A} ( #1 , #2 ) }
39 \newcommand{\pends}[2]{{\mathcal E} ( #1 , #2 ) }
41 \newcommand{\patchof}[1]{{\mathcal P} ( #1 ) }
43 \renewcommand{\land}{\wedge}
51 \desclabelstyle{\nextlinelabel}
53 \item[ $ C \hasparents \set X $ ]
54 The parents of commit $C$ are exactly the set
58 $C$ is a descendant of $D$ in the git commit
59 graph. This is a partial order, namely the transitive closure of
60 $ D \in \set X $ where $ C \hasparents \set X $.
63 Informally, the tree at commit $C$ contains the change
64 made in commit $D$. Does not take account of deliberate reversions by
65 the user or in non-Topbloke-controlled branches; these are considered
66 normal, forward, commits. For merges and Topbloke-generated
67 anticommits, the ``change made'' is only to be thought of as any
68 conflict resolution. This is not a partial order because it is not
71 \item[ $ \p, \py, \pn $ ]
72 A patch $\p$ consists of two sets of commits $\pn$ and $\py$, which
73 are respectively the base and tip git branches. $\p$ may be used
74 where the context requires a set, in which case the statement
75 is to be taken as applying to both $\py$ and $\pn$.
76 All these sets are distinct. Hence:
78 \item[ $ \patchof{ C } $ ]
79 Either $\p$ s.t. $ C \in \p $, or $\bot$.
80 A function from commits to sets $\p$.
82 \item[ $ \pancs{C}{\set P} $ ]
83 $ \{ A \; | \; A \le C \land A \in \set P \} $
84 i.e. all the ancestors of $C$
85 which are in $\set P$.
87 \item[ $ \pends{C}{\set P} $ ]
88 $ \{ E \; | \; E \in \pancs{C}{\set P}
89 \land \mathop{\not\exists}_{A \in \pancs{C}{\set P}}
90 A \neq E \land E \le A \} $
91 i.e. all $\le$-maximal commits in $\pancs{C}{\set P}$.
97 \[ C \has D \implies C \ge D \tag*{\mbox{No replay:}} \]
99 \[ \mathop{\forall}_{C \in \py} \pends{C}{\pn} = \{ B \} \tag*{\mbox{Unique base:}} \]
101 \section{Test more symbols}
105 $ C \nothaspatch \p $
109 $ \p \notpatchisin C $
111 $ \{ B \} \areparents C $