From cc6f8a852918817eecd961f9d2ce85b7ba13eb6f Mon Sep 17 00:00:00 2001
From: Ian Jackson <ijackson@chiark.greenend.org.uk>
Date: Sat, 12 May 2012 00:29:26 +0100
Subject: [PATCH] strategy: new, wip

---
 strategy.tex | 20 ++++++++++++++++----
 1 file changed, 16 insertions(+), 4 deletions(-)

diff --git a/strategy.tex b/strategy.tex
index 6f5de70..7b977e5 100644
--- a/strategy.tex
+++ b/strategy.tex
@@ -86,13 +86,25 @@ 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 \{ \baseof{E} \; | \; \pendsof{ \left[
+         \bigcup_{\p \in \allpatches} h(\pn) \cup h(\py)
+         \right]
+       }{ \pcy } \} $
 \end{enumerate}
 
 \section{Planning phase}
-- 
2.30.2