On 31/05/18 16:59, Dirk Eddelbuettel wrote: > > On 31 May 2018 at 16:17, Emilio Pozuelo Monfort wrote: > | > (Out of nerdy curiousity because we sometimes drive rebuilds of [generally > | > much smaller] subsets, where is the code that "walks" the dependency > graph? > | > Is that in libapt by chance [as I happen to have a package getting from R > to > | > libapt via Rcpp] or is it another tool I could milk for this? [ We also > have > | > something a decade old in the cran2deb repo but that is another story ... > ] > | > | Do you mean the one that generates > | https://release.debian.org/transitions/html/r-base-3.5.html ? If so, that'd > be > | ben (which is packaged). > > Not the page in the "how do I create a table in html" sense, but the "logic" > in finding out first, second, third, .. "wave". Which is probably what you > meant. But when I 'apt-cache show ben' I am no longer sure. > > So to rephrase: given a package (or set of packages), what computes the > ordered set (or "graph" in the dependency sense) of their depends (or > build-depends) ?
It's ben indeed. It also creates the html page, but before doing that it calculates all the affected packages based on the .ben file (i.e. this one https://release.debian.org/transitions/config/ongoing/r-base-3.5.ben) and whether they are good, bad, both (partial) or none (unknown), and the dependency levels (the ordered set). Cheers, Emilio
