-When we are trying to do a merge of some kind, in general,
-we want to merge some source commits $S_0 \ldots S_n$.
-We'll write $S_0 = L$. We require that $L$ is the current git ref
-for $\patchof{L}$.
+When we are trying to do an update of some kind, in general,
+for each patch $\pc$
+we want to merge some source commits $S \in \set S_{\pc}$.
+We require $\patchof{S} = \pc$,
+and $\tipcc \in \set S_{\pc}$.
\stdsection{Notation}
Acyclic; the completion of $\hasdirdep$ into a
partial order.
-\item[ $\set E_{\pc}$ ]
-$ \bigcup_i \pendsof{S_i}{\pc} $.
-All the ends of $\pc$ in the sources.
+%\item[ $\set E_{\pc}$ ]
+%$ \bigcup_i \pendsof{S_{\pc,i}}{\pc} $.
+%All the ends of $\pc$ in the sources.
\item[ $ \tipzc, \tipcc, \tipuc, \tipfc $ ]
The git ref for the Topbloke commit set $\pc$: respectively,
\section{Planning phase}
-The planning phase computes:
+The results of the planning phase consist of:
\begin{itemize*}
\item{ The relation $\hasdirdep$ and hence the partial order $\hasdep$. }
-\item{ For each commit set $\pc$, the order in which to merge
+\item{ For each commit set $\pc$, a confirmed set of sources $\set S_{\pc}$. }
+\item{ For each commit set $\pc$, the order in which to merge the sources
$E_{\pc,j} \in \set E_{\pc}$. }
\item{ For each $E_{\pc,j}$ an intended merge base $M_{\pc,j}$. }
\end{itemize*}