Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659An instance of each extension. Each run prints the whole globalreduction (reduceReal and reduceDeps), or for visibility and theplacements, whose reductions reach little of themselves from the root,a line giving its size and then the core walked from the root throughthe calculus's lookup theorems; checks that walk against the reductionrestricted to the root's reach, and solves with PubGrub, decoding theanswer through the soundness decoder. A reduced name is written <...>,and a package (n,v) inside a name as (n,v).
Conflict classes: A 1 depends on B 1 or 2 and on C 1, and B 1, C 1 andD 1 are in the class k. The class is the name <k>, its versions thenames B, C and D. The reduction has 5 edges, among them D 1's edge to(<k>,{D}), though D 1 is unreachable from A 1. The answer takes B 2beside C 1.
$ ./extensions/extensions.exe conflict-class core: 8 packages, 5 edges <k> B <k> C <k> D A 1 -> B {1, 2} -> C {1} B 1 -> <k> {B} B 2 C 1 -> <k> {C} D 1 -> <k> {D} lookups agree with the global reduction from the root packages (3): A 1 B 2 C 1
Conflicts: A 1 conflicts with B 2, over A 1, B 1 and B 2. The reductionhas one edge.
$ ./extensions/extensions.exe conflict core: 5 packages, 1 edges A 1 -> B {1, ⊥} A ⊥ B 1 B 2 B ⊥ lookups agree with the global reduction from the root packages (1): A 1
Concurrent versions, g(x.y.z) = x: A 1.0.0 depends on B 1.0.0 andC 1.0.0, B on D 1.0.0, 2.0.0 or 2.0.1, and C on D 2.0.0, 2.0.1 or 3.0.0.The reduction has 8 edges.
$ ./extensions/extensions.exe concurrent core: 11 packages, 8 edges <A,1> 1.0.0 -> <B,1> {1.0.0} -> <C,1> {1.0.0} <B,1.0.0,D> 1 -> <D,1> {1.0.0} <B,1.0.0,D> 2 -> <D,2> {2.0.0, 2.0.1} <B,1> 1.0.0 -> <B,1.0.0,D> {1, 2} <C,1.0.0,D> 2 -> <D,2> {2.0.0, 2.0.1} <C,1.0.0,D> 3 -> <D,3> {3.0.0} <C,1> 1.0.0 -> <C,1.0.0,D> {2, 3} <D,1> 1.0.0 <D,2> 2.0.0 <D,2> 2.0.1 <D,3> 3.0.0 lookups agree with the global reduction from the root packages (5): A 1.0.0 B 1.0.0 C 1.0.0 D 2.0.1 D 3.0.0 parents (4): B 1.0.0 <- A 1.0.0 C 1.0.0 <- A 1.0.0 D 2.0.1 <- B 1.0.0 D 3.0.0 <- C 1.0.0
Peer dependencies, g(v) = v: A 1 depends on B 1 and on C 2 or 3, and B 1peers on C 1 or 2. The reduction has 6 edges, and <C,1> 1, which no edgereaches, since (<A,1,C>,1) has no dependency.
$ ./extensions/extensions.exe peer core: 9 packages, 6 edges <A,1,B> 1 -> <A,1,C> {1, 2} -> <B,1> {1} <A,1,C> 1 <A,1,C> 2 -> <C,2> {2} <A,1,C> 3 -> <C,3> {3} <A,1> 1 -> <A,1,B> {1} -> <A,1,C> {2, 3} <B,1> 1 <C,1> 1 <C,2> 2 <C,3> 3 lookups agree with the global reduction from the root packages (3): A 1 B 1 C 2 parents (2): B 1 <- A 1 C 2 <- A 1
Visibility: A 1 depends on B 1, on C 1 or 2 and on D 1, B 1 on C 1, andD 1 on C 2 and E 1; every dependency is public but D 1's on C. <n,(A,1)>is n's occurrence under the origin A 1, and <n,(D,1)> under D 1. Thereduction has 38 edges, 24 of them reached from <A,(A,1)> 1. <A,(D,1)> 1and <B,(D,1)> 1, with their intermediates and 14 edges, and<D,1,C,(A,1)> 2, which has none, are unreachable from it. <C,(D,1)> 1 isreached: an occurrence has every version of its name, though no edgeadmits this one. The run prints the 25 packages and 24 edges reached.
$ ./extensions/extensions.exe visibility global: 33 packages, 38 edges core: 25 packages, 24 edges <A,(A,1)> 1 -> <A,1,B,(A,1)> {1} -> <A,1,C,(A,1)> {1, 2} -> <A,1,D,(A,1)> {1} <A,1,B,(A,1)> 1 -> <A,1,B> {1} -> <B,(A,1)> {1} <A,1,B> 1 <A,1,C,(A,1)> 1 -> <A,1,C> {1} -> <C,(A,1)> {1} <A,1,C,(A,1)> 2 -> <A,1,C> {2} -> <C,(A,1)> {2} <A,1,C> 1 <A,1,C> 2 <A,1,D,(A,1)> 1 -> <A,1,D> {1} -> <D,(A,1)> {1} <A,1,D> 1 <B,(A,1)> 1 -> <B,1,C,(A,1)> {1} <B,1,C,(A,1)> 1 -> <B,1,C> {1} -> <C,(A,1)> {1} <B,1,C> 1 <C,(A,1)> 1 <C,(A,1)> 2 <C,(D,1)> 1 <C,(D,1)> 2 <D,(A,1)> 1 -> <D,(D,1)> {1} -> <D,1,E,(A,1)> {1} <D,(D,1)> 1 -> <D,1,C,(D,1)> {2} -> <D,1,E,(D,1)> {1} <D,1,C,(D,1)> 2 -> <C,(D,1)> {2} -> <D,1,C> {2} <D,1,C> 2 <D,1,E,(A,1)> 1 -> <D,1,E> {1} -> <E,(A,1)> {1} <D,1,E,(D,1)> 1 -> <D,1,E> {1} -> <E,(D,1)> {1} <D,1,E> 1 <E,(A,1)> 1 <E,(D,1)> 1 lookups agree with the global reduction from the root packages (6): A 1 B 1 C 1 C 2 D 1 E 1 parents (6): B 1 <- A 1 C 1 <- A 1 C 1 <- B 1 C 2 <- D 1 D 1 <- A 1 E 1 <- D 1
Features: A 1 depends on B 1 and C 1, B 1 on D 1 with features α and β,and C 1 on D 1 with β; D 1's α adds a dependency on E 1 and its β one onF 1. The reduction has 9 edges.
$ ./extensions/extensions.exe features core: 8 packages, 9 edges <D,α> 1 -> D {1} -> E {1} <D,β> 1 -> D {1} -> F {1} A 1 -> B {1} -> C {1} B 1 -> <D,α> {1} -> <D,β> {1} C 1 -> <D,β> {1} D 1 E 1 F 1 lookups agree with the global reduction from the root packages (6): A 1 {} B 1 {} C 1 {} D 1 {α, β} E 1 {} F 1 {}
Package formulas: A 1 depends on (B 2 ∧ C 1) ∨ (B 1 ∧ ¬C 1). Thereduction has 5 edges and one disjunct.
$ ./extensions/extensions.exe package-formula core: 9 packages, 5 edges <((B,{2}) ∧ (C,{1})) ∨ ((B,{1}) ∧ ¬(C,{1}))> 0 -> B {2} -> C {1} <((B,{2}) ∧ (C,{1})) ∨ ((B,{1}) ∧ ¬(C,{1}))> 1 -> B {1} -> C {⊥} A 1 -> <((B,{2}) ∧ (C,{1})) ∨ ((B,{1}) ∧ ¬(C,{1}))> {0, 1} A ⊥ B 1 B 2 B ⊥ C 1 C ⊥ lookups agree with the global reduction from the root packages (2): A 1 B 1
Variable formulas, Y_os = {linux, macos}: A 1 depends on¬(os = linux) ∨ B 1. The variable is the name <os>, and the disjunct<¬(<os>,{linux}) ∨ (B,{1})> holds the comparison as the atom it lifts to.The reduction has 3 edges, and A ⊥ and B ⊥, which no edge admits. Theanswer takes alternative 1, so no version of <os> is selected and theassignment is the decoder's default.
$ ./extensions/extensions.exe variable-formula core: 8 packages, 3 edges <os> linux <os> macos <¬(<os>,{linux}) ∨ (B,{1})> 0 -> <os> {macos} <¬(<os>,{linux}) ∨ (B,{1})> 1 -> B {1} A 1 -> <¬(<os>,{linux}) ∨ (B,{1})> {0, 1} A ⊥ B 1 B ⊥ lookups agree with the global reduction from the root packages (2): A 1 B 1 assignment: os = linux
Virtual packages: A 1 depends on D 1 and E 1; B 1 and C 1 provide D 1,and F 1 provides E 1. The reduction has 6 edges.
$ ./extensions/extensions.exe virtual core: 9 packages, 6 edges <(A,1),D> <B,1> -> B {1} <(A,1),D> <C,1> -> C {1} <(A,1),E> <E,1> -> E {1} <(A,1),E> <F,1> -> F {1} A 1 -> <(A,1),D> {<B,1>, <C,1>} -> <(A,1),E> {<E,1>, <F,1>} B 1 C 1 E 1 F 1 lookups agree with the global reduction from the root packages (3): A 1 C 1 F 1 providers (2): C 1 for D <- A 1 F 1 for E <- A 1
Concurrent versions with features, g(v) = v: A 1 depends on B 1 andC 1, B 1 on D 1 or 2 with α, and C 1 on D 2 or 3 with β; D 1's α adds adependency on F 1 with γ, and its β one on F 1 with δ. <<D,α>,1> is D'sfeature α at granularity 1. The reduction has 36 edges. The walk fromA 1 does not reach <<D,β>,1>, <D,1,β,F,δ> or <<F,δ>,1>, C 1 admitting Donly at 2 and 3.
$ ./extensions/extensions.exe concurrent-features core: 27 packages, 36 edges <<D,α>,1> 1 -> <D,1,F> {1} -> <D,1,α,F,γ> {1} -> <D,1> {1} <<D,α>,2> 2 -> <D,2> {2} <<D,β>,1> 1 -> <D,1,F> {1} -> <D,1,β,F,δ> {1} -> <D,1> {1} <<D,β>,2> 2 -> <D,2> {2} <<D,β>,3> 3 -> <D,3> {3} <<F,γ>,1> 1 -> <F,1> {1} <<F,δ>,1> 1 -> <F,1> {1} <A,1,B> 1 -> <B,1> {1} <A,1,C> 1 -> <C,1> {1} <A,1> 1 -> <A,1,B> {1} -> <A,1,C> {1} <B,1,D,α> 1 -> <<D,α>,1> {1} -> <B,1,D> {1} <B,1,D,α> 2 -> <<D,α>,2> {2} -> <B,1,D> {2} <B,1,D> 1 -> <D,1> {1} <B,1,D> 2 -> <D,2> {2} <B,1> 1 -> <B,1,D,α> {1, 2} -> <B,1,D> {1, 2} <C,1,D,β> 2 -> <<D,β>,2> {2} -> <C,1,D> {2} <C,1,D,β> 3 -> <<D,β>,3> {3} -> <C,1,D> {3} <C,1,D> 2 -> <D,2> {2} <C,1,D> 3 -> <D,3> {3} <C,1> 1 -> <C,1,D,β> {2, 3} -> <C,1,D> {2, 3} <D,1,F> 1 -> <F,1> {1} <D,1,α,F,γ> 1 -> <<F,γ>,1> {1} -> <D,1,F> {1} <D,1,β,F,δ> 1 -> <<F,δ>,1> {1} -> <D,1,F> {1} <D,1> 1 <D,2> 2 <D,3> 3 <F,1> 1 lookups agree with the global reduction from the root packages (5): A 1 {} B 1 {} C 1 {} D 2 {α} D 3 {β} parents (4): B 1 <- A 1 C 1 <- A 1 D 2 <- B 1 D 3 <- C 1
Placement, with depth bound 2: R 1 depends on A 1 and B 1, A 1 on C 1,B 1 on A 1 and C 2, and C 2 peers on A 1, which it resolves by walking upfrom its own location as a dependency would, except that the walk may notland in C 2's own directory. A location <ℓ,a> holds a version of a or ⊥,and only ⊥ at depth 2; a walk <ℓ⇑a> holds where the first-match walk upfrom ℓ for a lands, (ℓ',v), or ⊥. The reduction over the names A, B andC has 195 packages and 277 edges, of which the run prints the 84 packagesand 106 edges reached from the root. The answer hoists A 1, which serves Rand B, and C 1, which serves A, and nests C 2 under B, where it shadowsC 1 for B; C 2's peer walks from B/C through the absent B/C/A and B/A tothe hoisted A 1.
$ ./extensions/extensions.exe placement global: 195 packages, 277 edges core: 84 packages, 106 edges <A,A> 1 -> <A/A⇑C> {(A,1), (A/A,1), (ε,1)} <A,A> ⊥ <A,C> 1 <A,C> 2 -> <A/C⇑A> {(A,1), (ε,1)} <A,C> ⊥ <A/A,C> ⊥ <A/A⇑C> (A,1) -> <A/A,C> {⊥} -> <A⇑C> {(A,1)} <A/A⇑C> (A,2) -> <A/A,C> {⊥} -> <A⇑C> {(A,2)} <A/A⇑C> (ε,1) -> <A/A,C> {⊥} -> <A⇑C> {(ε,1)} <A/A⇑C> (ε,2) -> <A/A,C> {⊥} -> <A⇑C> {(ε,2)} <A/A⇑C> ⊥ -> <A/A,C> {⊥} -> <A⇑C> {⊥} <A/C,A> ⊥ <A/C⇑A> (A,1) -> <A/C,A> {⊥} -> <A⇑A> {(A,1)} <A/C⇑A> (ε,1) -> <A/C,A> {⊥} -> <A⇑A> {(ε,1)} <A/C⇑A> ⊥ -> <A/C,A> {⊥} -> <A⇑A> {⊥} <A⇑A> (A,1) -> <A,A> {1} <A⇑A> (ε,1) -> <A,A> {⊥} -> <ε⇑A> {(ε,1)} <A⇑A> ⊥ -> <A,A> {⊥} -> <ε⇑A> {⊥} <A⇑C> (A,1) -> <A,C> {1} <A⇑C> (A,2) -> <A,C> {2} <A⇑C> (ε,1) -> <A,C> {⊥} -> <ε⇑C> {(ε,1)} <A⇑C> (ε,2) -> <A,C> {⊥} -> <ε⇑C> {(ε,2)} <A⇑C> ⊥ -> <A,C> {⊥} -> <ε⇑C> {⊥} <B,A> 1 -> <B/A⇑C> {(B,1), (B/A,1), (ε,1)} <B,A> ⊥ <B,C> 1 <B,C> 2 -> <B/C⇑A> {(B,1), (ε,1)} <B,C> ⊥ <B/A,C> ⊥ <B/A⇑C> (B,1) -> <B/A,C> {⊥} -> <B⇑C> {(B,1)} <B/A⇑C> (B,2) -> <B/A,C> {⊥} -> <B⇑C> {(B,2)} <B/A⇑C> (ε,1) -> <B/A,C> {⊥} -> <B⇑C> {(ε,1)} <B/A⇑C> (ε,2) -> <B/A,C> {⊥} -> <B⇑C> {(ε,2)} <B/A⇑C> ⊥ -> <B/A,C> {⊥} -> <B⇑C> {⊥} <B/C,A> ⊥ <B/C⇑A> (B,1) -> <B/C,A> {⊥} -> <B⇑A> {(B,1)} <B/C⇑A> (ε,1) -> <B/C,A> {⊥} -> <B⇑A> {(ε,1)} <B/C⇑A> ⊥ -> <B/C,A> {⊥} -> <B⇑A> {⊥} <B⇑A> (B,1) -> <B,A> {1} <B⇑A> (ε,1) -> <B,A> {⊥} -> <ε⇑A> {(ε,1)} <B⇑A> ⊥ -> <B,A> {⊥} -> <ε⇑A> {⊥} <B⇑C> (B,1) -> <B,C> {1} <B⇑C> (B,2) -> <B,C> {2} <B⇑C> (ε,1) -> <B,C> {⊥} -> <ε⇑C> {(ε,1)} <B⇑C> (ε,2) -> <B,C> {⊥} -> <ε⇑C> {(ε,2)} <B⇑C> ⊥ -> <B,C> {⊥} -> <ε⇑C> {⊥} <C,A> 1 -> <C/A⇑C> {(C,1), (C/A,1), (ε,1)} <C,A> ⊥ <C,C> 1 <C,C> 2 -> <C/C⇑A> {(C,1), (ε,1)} <C,C> ⊥ <C/A,C> ⊥ <C/A⇑C> (C,1) -> <C/A,C> {⊥} -> <C⇑C> {(C,1)} <C/A⇑C> (C,2) -> <C/A,C> {⊥} -> <C⇑C> {(C,2)} <C/A⇑C> (ε,1) -> <C/A,C> {⊥} -> <C⇑C> {(ε,1)} <C/A⇑C> (ε,2) -> <C/A,C> {⊥} -> <C⇑C> {(ε,2)} <C/A⇑C> ⊥ -> <C/A,C> {⊥} -> <C⇑C> {⊥} <C/C,A> ⊥ <C/C⇑A> (C,1) -> <C/C,A> {⊥} -> <C⇑A> {(C,1)} <C/C⇑A> (ε,1) -> <C/C,A> {⊥} -> <C⇑A> {(ε,1)} <C/C⇑A> ⊥ -> <C/C,A> {⊥} -> <C⇑A> {⊥} <C⇑A> (C,1) -> <C,A> {1} <C⇑A> (ε,1) -> <C,A> {⊥} -> <ε⇑A> {(ε,1)} <C⇑A> ⊥ -> <C,A> {⊥} -> <ε⇑A> {⊥} <C⇑C> (C,1) -> <C,C> {1} <C⇑C> (C,2) -> <C,C> {2} <C⇑C> (ε,1) -> <C,C> {⊥} -> <ε⇑C> {(ε,1)} <C⇑C> (ε,2) -> <C,C> {⊥} -> <ε⇑C> {(ε,2)} <C⇑C> ⊥ -> <C,C> {⊥} -> <ε⇑C> {⊥} <ε,A> 1 -> <A⇑C> {(A,1), (ε,1)} <ε,A> ⊥ <ε,B> 1 -> <B⇑A> {(B,1), (ε,1)} -> <B⇑C> {(B,2), (ε,2)} <ε,B> ⊥ <ε,C> 1 <ε,C> 2 -> <C⇑A> {(ε,1)} <ε,C> ⊥ <ε> 1 -> <ε⇑A> {(ε,1)} -> <ε⇑B> {(ε,1)} <ε⇑A> (ε,1) -> <ε,A> {1} <ε⇑A> ⊥ -> <ε,A> {⊥} <ε⇑B> (ε,1) -> <ε,B> {1} <ε⇑B> ⊥ -> <ε,B> {⊥} <ε⇑C> (ε,1) -> <ε,C> {1} <ε⇑C> (ε,2) -> <ε,C> {2} <ε⇑C> ⊥ -> <ε,C> {⊥} lookups agree with the global reduction from the root layout (4): A 1 B 1 B/C 2 C 1
The npm reading's placement instance, with depth bound 1: the projectdepends on x, an npm: alias of b 1, and on a 1, which depends on b 2. Thelookups read an occupant's edges off its manifest alone, each edge'saccepted set off the package it names, and each key's versions off thepackages aliased to it. Key x holds b 1 and key b holds b 2. Thereduction has 50 packages and 59 edges, of which the run prints the 21packages and 17 edges reached from the root.
$ ./extensions/extensions.exe npm-placement global: 50 packages, 59 edges core: 21 packages, 17 edges <a,b> ⊥ <a⇑b> (ε,b@1) -> <a,b> {⊥} -> <ε⇑b> {(ε,b@1)} <a⇑b> (ε,b@2) -> <a,b> {⊥} -> <ε⇑b> {(ε,b@2)} <a⇑b> ⊥ -> <a,b> {⊥} -> <ε⇑b> {⊥} <ε,a> a@1 -> <a⇑b> {(a,b@2), (ε,b@2)} <ε,a> ⊥ <ε,b> b@1 <ε,b> b@2 <ε,b> ⊥ <ε,x> b@1 <ε,x> b@2 <ε,x> ⊥ <ε> R -> <ε⇑a> {(ε,a@1)} -> <ε⇑x> {(ε,b@1)} <ε⇑a> (ε,a@1) -> <ε,a> {a@1} <ε⇑a> ⊥ -> <ε,a> {⊥} <ε⇑b> (ε,b@1) -> <ε,b> {b@1} <ε⇑b> (ε,b@2) -> <ε,b> {b@2} <ε⇑b> ⊥ -> <ε,b> {⊥} <ε⇑x> (ε,b@1) -> <ε,x> {b@1} <ε⇑x> (ε,b@2) -> <ε,x> {b@2} <ε⇑x> ⊥ -> <ε,x> {⊥} lookups agree with the global reduction from the root layout (3): a a@1 b b@2 x b@1