chiark
/
gitweb
/
~ian
/
topbloke-formulae.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
strategy: new, wip
[topbloke-formulae.git]
/
strategy.tex
diff --git
a/strategy.tex
b/strategy.tex
index c8a0bfe41846f830e22019a152b950ac53648286..6fb4b4f9d2b72837ccfc8b602c7696cb93c74fd6 100644
(file)
--- a/
strategy.tex
+++ b/
strategy.tex
@@
-86,13
+86,13
@@
dependencies to use. This allows the specification of any desired
\section{Ranking phase}
\section{Ranking phase}
-
{\bf Ranking} is
:
+
We run the following algorithm
:
\begin{enumerate}
\item Set $\allpatches = \{ \}$.
\item Repeatedly:
\begin{enumerate}
\item Clear out the graph $\hasdirdep$ so it has neither nodes nor edges.
\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 Execute {\bf Rank-Recurse}($\pc_0$)
\item Until $\allpatches$ remains unchanged.
\end{enumerate}
\end{enumerate}
\item Until $\allpatches$ remains unchanged.
\end{enumerate}
\end{enumerate}
@@
-104,9
+104,14
@@
dependencies to use. This allows the specification of any desired
\cup
\bigcup_{\p \in \allpatches}
\bigcup_{H \in h(\pn) \lor H \in h(\py)}
\cup
\bigcup_{\p \in \allpatches}
\bigcup_{H \in h(\pn) \lor H \in h(\py)}
- \{ \baseof{E} \; | \; E \in \pendsof{H}{\pcy} \} $
.
+ \{ \baseof{E} \; | \; E \in \pendsof{H}{\pcy} \} $
-(We write $\set S = \set S_{\pcn}$ when it's not ambiguous.)
+and $W = w(h(\pcn))$
+
+We write $\set S = \set S_{\pcn}$ where unambiguous.
+\item While $\exists_{S \in \set S} S \ge W$:
+
+Update $W \assign S$ and $\set S \assign \set S \, \backslash \{ S \}$
\end{enumerate}
\section{Planning phase}
\end{enumerate}
\section{Planning phase}