Package evaluation of FinitePosets on Julia 1.11.4 (a71dd056e0*) started at 2025-04-08T07:35:56.843 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.76s ################################################################################ # Installation # Installing FinitePosets... Resolving package versions... Updating `~/.julia/environments/v1.11/Project.toml` [580d1d9c] + FinitePosets v0.1.5 Updating `~/.julia/environments/v1.11/Manifest.toml` [a6b051d1] + Combinat v0.1.3 [580d1d9c] + FinitePosets v0.1.5 [18e54dd8] + IntegerMathUtils v0.1.2 [27ebfcd6] + Primes v0.5.7 Installation completed after 1.28s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 12.82s ################################################################################ # Testing # Testing FinitePosets Status `/tmp/jl_Mtghh8/Project.toml` [a6b051d1] Combinat v0.1.3 [580d1d9c] FinitePosets v0.1.5 [8dfed614] Test v1.11.0 Status `/tmp/jl_Mtghh8/Manifest.toml` [a6b051d1] Combinat v0.1.3 [580d1d9c] FinitePosets v0.1.5 [18e54dd8] IntegerMathUtils v0.1.2 [27ebfcd6] Primes v0.5.7 [2a0f44e3] Base64 v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [8dfed614] Test v1.11.0 Testing Running tests... FinitePosets.jl p=CPoset([[2,3],[4],[4],Int[]]) FinitePosets.jl length(p) FinitePosets.jl incidence(p) FinitePosets.jl linear_extension(p) FinitePosets.jl P=Poset(p,[:a,:b,:c,:d]) FinitePosets.jl P.C FinitePosets.jl l=vec(collect(Iterators.product(1:2,1:2))) FinitePosets.jl P=Poset((x,y)->all(map(<=,x,y)),l) FinitePosets.jl eltype(P) FinitePosets.jl summary(P) FinitePosets.jl P=Poset(CPoset([all(map(<=,x,y)) for x in l, y in l]),l) FinitePosets.jl P.show_element=(io,p,n)->join(io,p.elements[n],"."); FinitePosets.jl P FinitePosets.jl delete!(P,:show_element); FinitePosets.jl Poset([(:a,:b),(:c,:d)]) FinitePosets.jl CPoset([(1,3),(2,5)]) FinitePosets.jl ≤(P,(1,1),(2,1)) FinitePosets.jl ≤(P.C,1,2) FinitePosets.jl interval(P,≤,(1,2)) FinitePosets.jl interval(P,≥,(1,2)) FinitePosets.jl interval(P,<,(1,2)) FinitePosets.jl interval(P,≥,(2,1),≤,(2,2)) FinitePosets.jl interval(P,>,(1,1),<,(2,2)) FinitePosets.jl interval(P.C,>,1,<,4) FinitePosets.jl maximal_chains(P) FinitePosets.jl height(P) FinitePosets.jl moebius_matrix(P) FinitePosets.jl minima(P) FinitePosets.jl maxima(P) FinitePosets.jl Q=CPoset(:chain,3) FinitePosets.jl P1=Poset(Q) FinitePosets.jl P⊕ P1 FinitePosets.jl P1*P1 FinitePosets.jl P1⊗ P1 FinitePosets.jl m=[j-i in [0,1] for i in 1:5, j in 1:5] FinitePosets.jl transitive_closure(m) FinitePosets.jl m=incidence(CPoset(:diamond,5)) FinitePosets.jl hasse(m) FinitePosets.jl Poset(CPoset([[2,3],[4],[4],Int[]]),[:a,:b,:c,:d]) FinitePosets.jl CPoset(Bool[1 1 1 1 1;0 1 0 1 1;0 0 1 1 1;0 0 0 1 0;0 0 0 0 1]) FinitePosets.jl CPoset([[2,3],[4,5],[4,5],Int[],Int[]]) FinitePosets.jl Poset((x,y)->all(x.≤y),vec(collect(Iterators.product(1:2,1:3)))) FinitePosets.jl CPoset((x,y)->y%x==0,8) FinitePosets.jl CPoset([(6,2),(5,1)]) FinitePosets.jl Poset([(:a,:b),(:d,:c)]) FinitePosets.jl p=Poset(:powerset,3);p.show_element=(io,p,n)->join(io,p.elements[n]); FinitePosets.jl p FinitePosets.jl Poset(:partitionsdominance,5) FinitePosets.jl p=CPoset((i,j)->j%i==0,6) FinitePosets.jl linear_extension(p) FinitePosets.jl nlinear_extensions(CPoset(:antichain,10)) FinitePosets.jl p=CPoset((i,j)->j%i==0,4) FinitePosets.jl linear_extensions(p) FinitePosets.jl p=CPoset((i,j)->j%i==0,5) FinitePosets.jl hasse(p) FinitePosets.jl p=CPoset([i==6 ? Int[] : [i+1] for i in 1:6]) FinitePosets.jl incidence(p) FinitePosets.jl CPoset(:chain,2)+CPoset(:chain,3) FinitePosets.jl Poset(:chain,[1,2])+Poset(:chain,[:a,:b,:c]) FinitePosets.jl CPoset(:chain,2)⊕ CPoset(:chain,3) FinitePosets.jl Poset(:chain,[1,2])⊕ Poset(:chain,[:a,:b,:c]) FinitePosets.jl CPoset(:chain,2)*CPoset(:chain,3) FinitePosets.jl Poset(:chain,[1,2])*Poset(:chain,[:a,:b,:c]) FinitePosets.jl CPoset(:chain,2)⊗ CPoset(:chain,3) FinitePosets.jl Poset(:chain,[1,2])⊗ Poset(:chain,[:a,:b,:c]) FinitePosets.jl coxeter_matrix(CPoset(:diamond,5)) FinitePosets.jl p=CPoset((i,j)->i%4i%4j%i==0,8) FinitePosets.jl is_join_semilattice(p) # 4 && 3 have bounds Int64[] FinitePosets.jl p=CPoset((i,j)->j%i==0,8) FinitePosets.jl is_meet_semilattice(p) FinitePosets.jl p=CPoset((i,j)->i%j==0,8) FinitePosets.jl moebius(p) FinitePosets.jl moebius_matrix(CPoset(:diamond,5)) FinitePosets.jl p=CPoset([[3],[3],[4,5],Int[],Int[]]) FinitePosets.jl minima(p) FinitePosets.jl minima(p,3:5) FinitePosets.jl p=CPoset([[3],[3],[4,5],Int[],Int[]]) FinitePosets.jl maxima(p) FinitePosets.jl maxima(p,1:3) FinitePosets.jl l=vec(collect(Iterators.product(1:2,1:2))) FinitePosets.jl P=Poset((x,y)->all(map(<=,x,y)),l) FinitePosets.jl interval(P,≤,(1,2)) FinitePosets.jl interval(P,≥,(1,2)) FinitePosets.jl interval(P,<,(1,2)) FinitePosets.jl interval(P,≥,(2,1),≤,(2,2)) FinitePosets.jl interval(P,>,(1,1),<,(2,2)) FinitePosets.jl interval(P.C,>,1,<,4) FinitePosets.jl p=Poset([(:a,:b),(:a,:c),(:b,:d),(:c,:d)]) FinitePosets.jl maximal_chains(p) FinitePosets.jl maximal_chains(p.C) FinitePosets.jl chains(CPoset(:chain,3)) FinitePosets.jl chainpoly(Poset(:powerset,3)) FinitePosets.jl ranking(Poset(:partitionsdominance,6)) FinitePosets.jl ranking(Poset(:partitionsdominance,7)) FinitePosets.jl p=CPoset((i,j)->j%i==0,4) FinitePosets.jl FinitePosets.antichains(p) Test Summary: | Pass Total Time FinitePosets.jl | 103 103 58.6s Testing FinitePosets tests passed Testing completed after 63.06s PkgEval succeeded after 92.13s