strategy notation: introduce \allsrcs

diff --git a/article.tex b/article.tex
index 96857aa65b59798b100d7f68bbfe9faedaec7739..475477f1ac8fedadeb1b0ccde61eb77aaeb12bdd 100644 (file)
--- a/article.tex
+++ b/article.tex
@@ -92,6 +92,8 @@
 \newcommand{\base}{{\mathcal B}}
 \newcommand{\depsreq}{{\mathcal G}}
 
 \newcommand{\base}{{\mathcal B}}
 \newcommand{\depsreq}{{\mathcal G}}
 

+\newcommand{\allsrcs}{\set U}
+

 \newcommand{\patchof}[1]{\patch ( #1 ) }
 \newcommand{\baseof}[1]{\base ( #1 ) }
 \newcommand{\depsreqof}[1]{\depsreq ( #1 ) }
 \newcommand{\patchof}[1]{\patch ( #1 ) }
 \newcommand{\baseof}[1]{\base ( #1 ) }
 \newcommand{\depsreqof}[1]{\depsreq ( #1 ) }

diff --git a/strategy.tex b/strategy.tex
index bf136f69c912d185b9531089fafc2dd2922913c6..1e8ee0156f5846bec3d54e4852396c703c432564 100644 (file)
--- a/strategy.tex
+++ b/strategy.tex
@@ -50,6 +50,10 @@ the $\le$-maximal elements of $\bigcup_{J \in \set J} \pendsof{J}{\p}$
 Convenience notation for
 $\bigforall_{E \in \pendsof{\set X}{\p}} E \le T$
 
 Convenience notation for
 $\bigforall_{E \in \pendsof{\set X}{\p}} E \le T$
 

+\item[ $\allsrcs$ ]
+$\bigcup_{\p \in \allpatches} \set H^{\pn} \cup \set H^{\py}$.
+All the input commits to the update algorithm.  (See below.)
+

 %\item[ $\set E_{\pc}$ ]
 %$ \bigcup_i \pendsof{S_{\pc,i}}{\pc} $.
 %All the ends of $\pc$ in the sources.
 %\item[ $\set E_{\pc}$ ]
 %$ \bigcup_i \pendsof{S_{\pc,i}}{\pc} $.
 %All the ends of $\pc$ in the sources.