-\section{Traversal phase --- algorithm}
+\section{Traversal phase}
-(In general, unless stated otherwise below, when we generate a new
+In general, unless stated otherwise below, when we generate a new
commit $C$ using one of the commit kind recipies, we update
$W \assign C$. In any such case where we say we're going to Merge
with $L = W$, if $R \ge W$ we do not Merge but instead simply set
$W \assign R$.
For each commit generation operation called for by the traversal
-algorithms, we prove that the commit generation preconditions are met.)
+algorithms, we prove that the commit generation preconditions are met.
+
+\subsection{Algorithm}
For each patch $\pc \in \allpatches$ in topological order by $\hasdep$,
lowest first:
\end{enumerate}
+\subsection{Results}
+
After processing each $\pc$ we will have created $\tipcn$ and $\tipcy$
such that:
-
\statement{Correct Base}{
\baseof{\tipcy} = \tipcn
}