X-Git-Url: http://www.chiark.greenend.org.uk/ucgi/~ian/git?p=topbloke-formulae.git;a=blobdiff_plain;f=strategy.tex;h=2f676bb7808acc38e7e6033cf437d260fd6a178f;hp=1e8ee0156f5846bec3d54e4852396c703c432564;hb=f8b525275e017d1a5e77cb31b033d54a52e19e2c;hpb=eb02216495da42d7de57d8ecf16b62dd50d2baf2 diff --git a/strategy.tex b/strategy.tex index 1e8ee01..2f676bb 100644 --- a/strategy.tex +++ b/strategy.tex @@ -54,6 +54,13 @@ $\bigforall_{E \in \pendsof{\set X}{\p}} E \le T$ $\bigcup_{\p \in \allpatches} \set H^{\pn} \cup \set H^{\py}$. All the input commits to the update algorithm. (See below.) +\item[ $\set H^{\pc^{_=/-}}$ ] + +The existing head commit(s) $\set H$ of the branch $\pc^{+/-}$. +These are the heads which will be merged and used in this update. +This will include the current local and remote git refs, as desired. +Obtained from the function $h$ (see below). + %\item[ $\set E_{\pc}$ ] %$ \bigcup_i \pendsof{S_{\pc,i}}{\pc} $. %All the ends of $\pc$ in the sources. @@ -74,10 +81,14 @@ All the input commits to the update algorithm. (See below.) The topmost patch which we are trying to update. This and all of its dependencies will be updated. -\item[ $h : \pc^{+/-} \mapsto \set H_{\pc^{+/-}}$ ] +\item[ $h : \pc^{+/-} \mapsto \set H^{\pc^{+/-}}$ ] Function for getting the existing heads $\set H$ of the branch $\pc^{+/-}$. -These are the heads which will be merged and used in this update. -This will include the current local and remote git refs, as desired. + +\item[ $w : \pc^{+/-} \mapsto \set W_0^{\pc^{+/-}}$ ] + +Function for getting the existing local head of the branch +$\pc^{+/-}$. I.e., the current value of the branch ref for $\pc^{+/-}$. +$W_0^{\pc^{+/-}} \in \set H$. \item[ $g : \pc, \Gamma \mapsto \Gamma'$ ] Function to allow explicit adjustment of the direct dependencies @@ -104,8 +115,23 @@ during the update algorithm). \item[ $\tipcn, \tipcy$ ] The new tips of the git branches $\pcn$ and $\pcy$, containing -all the correct commits (and the correct other patches), as -generated by the Traversal phase of the update algorithm. +all the appropriate commits (and the appropriate other patches), +as generated by the Traversal phase of the update algorithm. -\end{basedescript} +\item[ $\allreach$ ] +The set of all reachable commits. + +A reachable commit is one we might refer to explicitly in any of these +algorithms, and any ancestor of such a commit. We explicitly +enumerate all of the input commits ($\allsrcs$), so the reachable +commits are originally the input commits and their ancestors. +$\allreach$ varies over time as we generate more commits. Each +commit we generate will have only reachable commits as ancestors, so +generating a new commit (only) adds that new commit to $\allreach$. + +\item[ $\allreachof{\py}$ ] +The set of reachable commits at the point where we have just generated +$\tippy$, i.e. just after $\alg{Merge-Tip}(\p)$. + +\end{basedescript}