strategy: new, wip

[topbloke-formulae.git] / strategy.tex

diff --git a/strategy.tex b/strategy.tex
index 6f5de7038e64135ad22fb27456dd552e6df10eed..c8a0bfe41846f830e22019a152b950ac53648286 100644 (file)
--- a/strategy.tex
+++ b/strategy.tex
@@ -86,13 +86,27 @@ dependencies to use.  This allows the specification of any desired
 
 \section{Ranking phase}
 
-We start with $\allpatches = \{ \}$.  We repeat
-{\bf Rank-Recurse}($\pc_0$) until $\allpatches$ is unchanged.
+{\bf Ranking} is:
+\begin{enumerate}
+\item Set $\allpatches = \{ \}$.
+\item Repeatedly:
+\begin{enumerate}
+\item Clear out the graph $\hasdirdep$ so it has neither nodes nor edges.
+\item Execute {\bf Rank-Recurse}($\pc_0$) .
+\item Until $\allpatches$ remains unchanged.
+\end{enumerate}
+\end{enumerate}
 
 {\bf Rank-Recurse}($\pc$) is:
 \begin{enumerate}
-\item foo
-\item bar
+\item Add $\pc$ to $\allpatches$ if it is not there already.
+\item Let $\set S_{\pcn} = h(\pcn)
+     \cup 
+        \bigcup_{\p \in \allpatches}
+        \bigcup_{H \in h(\pn) \lor H \in h(\py)}
+         \{ \baseof{E} \; | \; E \in \pendsof{H}{\pcy} \} $.
+
+(We write $\set S = \set S_{\pcn}$ when it's not ambiguous.)
 \end{enumerate}
 
 \section{Planning phase}