From 0853ae723fa4d36f9033ddef7ca3871f8cec6d83 Mon Sep 17 00:00:00 2001 From: Ian Jackson Date: Fri, 27 Apr 2012 13:56:04 +0100 Subject: [PATCH] strategy: wip --- strategy.tex | 15 ++++++++++++--- 1 file changed, 12 insertions(+), 3 deletions(-) diff --git a/strategy.tex b/strategy.tex index d170919..0fa1ff1 100644 --- a/strategy.tex +++ b/strategy.tex @@ -105,9 +105,12 @@ as its maximum, so this operation will finish by updating $\greffa{\patchof{L}}$. After we are done, the result has the following properties: -\[ \eqn{Best Tip}{ +\[ \eqn{Tip Inputs}{ \bigforall_{E_i \in \set E_{\pc}} \greffc \ge E_i }\] +\[ \eqn{Tip Dependencies}{ + \bigforall_{\pc \hasdep \p} \greffc \ge \greffa \p +}\] \[ \eqn{Perfect Contents}{ \greffc \haspatch \p \equiv \pc \hasdep \py }\] @@ -140,8 +143,14 @@ worry about $X = R, Y = L$; ie $L \haspatch \p$, $M = \baseof{L} \haspatch \p$. By Tip Contents for $L$, $D \le L \equiv D \le M$. $\qed$ -OK -UP TO HERE +WIP UP TO HERE + +Addition Merge Ends: If $\py \isdep \pcn$, we have already +done the execution phase for $\pcn$ and $\py$. By +Perfect Contents for $\pcn$, $\greffa \pcn \haspatch \p$. + +computed $\greffa \py$, and by Perfect Contents for $\py$ + with $M=M_j, L=T_{\pc,j-1}, R=E_j$, and calculate what the resulting desired direct dependencies file -- 2.30.2