Package evaluation of GraphsInterfaceChecker on Julia 1.10.8 (92f03a4775*) started at 2025-02-25T06:03:03.136 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 4.82s ################################################################################ # Installation # Installing GraphsInterfaceChecker... Resolving package versions... Updating `~/.julia/environments/v1.10/Project.toml` [3bef136c] + GraphsInterfaceChecker v0.1.0 Updating `~/.julia/environments/v1.10/Manifest.toml` [ec485272] + ArnoldiMethod v0.4.0 [34da2185] + Compat v4.16.0 [864edb3b] + DataStructures v0.18.20 [86223c79] + Graphs v1.12.0 [3bef136c] + GraphsInterfaceChecker v0.1.0 [d25df0c9] + Inflate v0.1.5 [85a1e053] + Interfaces v0.3.2 [1914dd2f] + MacroTools v0.5.15 [bac558e1] + OrderedCollections v1.8.0 [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [699a6c99] + SimpleTraits v0.9.4 [90137ffa] + StaticArrays v1.9.12 [1e83bf80] + StaticArraysCore v1.4.3 [56f22d72] + Artifacts [2a0f44e3] + Base64 [ade2ca70] + Dates [8ba89e20] + Distributed [b77e0a4c] + InteractiveUtils [8f399da3] + Libdl [37e2e46d] + LinearAlgebra [d6f4376e] + Markdown [a63ad114] + Mmap [de0858da] + Printf [9a3f8284] + Random [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization [1a1011a3] + SharedArrays [6462fe0b] + Sockets [2f01184e] + SparseArrays v1.10.0 [10745b16] + Statistics v1.10.0 [fa267f1f] + TOML v1.0.3 [cf7118a7] + UUIDs [4ec0a83e] + Unicode [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [4536629a] + OpenBLAS_jll v0.3.23+4 [bea87d4a] + SuiteSparse_jll v7.2.1+1 [8e850b90] + libblastrampoline_jll v5.11.0+0 Installation completed after 4.75s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 26.08s ################################################################################ # Testing # Testing GraphsInterfaceChecker Status `/tmp/jl_3b9sxO/Project.toml` [4c88cf16] Aqua v0.8.11 [86223c79] Graphs v1.12.0 [3bef136c] GraphsInterfaceChecker v0.1.0 [85a1e053] Interfaces v0.3.2 [98e50ef6] JuliaFormatter v1.0.62 [626554b9] MetaGraphs v0.8.0 [fa8bd995] MetaGraphsNext v0.7.1 [7ebac608] Multigraphs v0.3.0 [47aef6b3] SimpleWeightedGraphs v1.4.0 [8dfed614] Test Status `/tmp/jl_3b9sxO/Manifest.toml` [4c88cf16] Aqua v0.8.11 [ec485272] ArnoldiMethod v0.4.0 [00ebfdb7] CSTParser v3.4.3 [a80b9123] CommonMark v0.8.15 [34da2185] Compat v4.16.0 [a8cc5b0e] Crayons v4.1.1 [864edb3b] DataStructures v0.18.20 [5789e2e9] FileIO v1.16.6 [c27321d9] Glob v1.3.1 [86223c79] Graphs v1.12.0 [3bef136c] GraphsInterfaceChecker v0.1.0 [d25df0c9] Inflate v0.1.5 [85a1e053] Interfaces v0.3.2 [033835bb] JLD2 v0.5.11 [98e50ef6] JuliaFormatter v1.0.62 [1914dd2f] MacroTools v0.5.15 [626554b9] MetaGraphs v0.8.0 [fa8bd995] MetaGraphsNext v0.7.1 [7ebac608] Multigraphs v0.3.0 [bac558e1] OrderedCollections v1.8.0 [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [ae029012] Requires v1.3.0 [699a6c99] SimpleTraits v0.9.4 [47aef6b3] SimpleWeightedGraphs v1.4.0 [90137ffa] StaticArrays v1.9.12 [1e83bf80] StaticArraysCore v1.4.3 [0796e94c] Tokenize v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [0dad84c5] ArgTools v1.1.1 [56f22d72] Artifacts [2a0f44e3] Base64 [ade2ca70] Dates [8ba89e20] Distributed [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching [b77e0a4c] InteractiveUtils [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 [8f399da3] Libdl [37e2e46d] LinearAlgebra [56ddb016] Logging [d6f4376e] Markdown [a63ad114] Mmap [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.10.0 [de0858da] Printf [3fa0cd96] REPL [9a3f8284] Random [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization [1a1011a3] SharedArrays [6462fe0b] Sockets [2f01184e] SparseArrays v1.10.0 [10745b16] Statistics v1.10.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test [cf7118a7] UUIDs [4ec0a83e] Unicode [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] LibCURL_jll v8.4.0+0 [e37daf67] LibGit2_jll v1.6.4+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.2+1 [14a3606d] MozillaCACerts_jll v2023.1.10 [4536629a] OpenBLAS_jll v0.3.23+4 [bea87d4a] SuiteSparse_jll v7.2.1+1 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 [8e850ede] nghttp2_jll v1.52.0+1 [3f19e933] p7zip_jll v17.4.0+2 Testing Running tests... Testing AbstractGraphInterface is implemented for SimpleGraph Mandatory components is_directed: (`is_directed` outputs a boolean [true, true, true]) edgetype: (`edgetype` outputs a type [true, true, true]) vertices: (`vertices` is coherent with `eltype` [true, true, true], every vertex in `vertices(g)` exists [true, true, true], vertices beyond `vertices(g)` don't exist [true, true, true]) edges: (`edges` is coherent with `edgetype` [true, true, true], every edge in `edges` exists [true, true, true], `edges` are symmetric for undirected graphs [true, true, true]) nv: (`nv` outputs an integer` [true, true, true], `nv` is coherent with `vertices` [true, true, true]) ne: (`ne` outputs an integer` [true, true, true], `ne` is coherent with `edges` [true, true, true]) neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true], `outneighbors` is coherent with `has_edge` [true, true, true], `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true]) weights: (`weights` outputs a matrix of real numbers [true, true, true], `weights` has the right size [true, true, true], `weights` are symmetric for undirected graphs [true, true, true]) Optional components mutation: (`add_vertex!` increases `nv` by one [true, true, true], `rem_vertex!` decreases `nv` by one [true, true, true]) Testing AbstractGraphInterface is implemented for SimpleDiGraph Mandatory components is_directed: (`is_directed` outputs a boolean [true, true, true]) edgetype: (`edgetype` outputs a type [true, true, true]) vertices: (`vertices` is coherent with `eltype` [true, true, true], every vertex in `vertices(g)` exists [true, true, true], vertices beyond `vertices(g)` don't exist [true, true, true]) edges: (`edges` is coherent with `edgetype` [true, true, true], every edge in `edges` exists [true, true, true], `edges` are symmetric for undirected graphs [true, true, true]) nv: (`nv` outputs an integer` [true, true, true], `nv` is coherent with `vertices` [true, true, true]) ne: (`ne` outputs an integer` [true, true, true], `ne` is coherent with `edges` [true, true, true]) neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true], `outneighbors` is coherent with `has_edge` [true, true, true], `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true]) weights: (`weights` outputs a matrix of real numbers [true, true, true], `weights` has the right size [true, true, true], `weights` are symmetric for undirected graphs [true, true, true]) Optional components mutation: (`add_vertex!` increases `nv` by one [true, true, true], `rem_vertex!` decreases `nv` by one [true, true, true]) Testing AbstractGraphInterface is implemented for MetaGraphs.MetaGraph Mandatory components is_directed: (`is_directed` outputs a boolean [true, true, true]) edgetype: (`edgetype` outputs a type [true, true, true]) vertices: (`vertices` is coherent with `eltype` [true, true, true], every vertex in `vertices(g)` exists [true, true, true], vertices beyond `vertices(g)` don't exist [true, true, true]) edges: (`edges` is coherent with `edgetype` [true, true, true], every edge in `edges` exists [true, true, true], `edges` are symmetric for undirected graphs [true, true, true]) nv: (`nv` outputs an integer` [true, true, true], `nv` is coherent with `vertices` [true, true, true]) ne: (`ne` outputs an integer` [true, true, true], `ne` is coherent with `edges` [true, true, true]) neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true], `outneighbors` is coherent with `has_edge` [true, true, true], `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true]) weights: (`weights` outputs a matrix of real numbers [true, true, true], `weights` has the right size [true, true, true], `weights` are symmetric for undirected graphs [true, true, true]) Testing AbstractGraphInterface is implemented for MetaGraphs.MetaDiGraph Mandatory components is_directed: (`is_directed` outputs a boolean [true, true, true]) edgetype: (`edgetype` outputs a type [true, true, true]) vertices: (`vertices` is coherent with `eltype` [true, true, true], every vertex in `vertices(g)` exists [true, true, true], vertices beyond `vertices(g)` don't exist [true, true, true]) edges: (`edges` is coherent with `edgetype` [true, true, true], every edge in `edges` exists [true, true, true], `edges` are symmetric for undirected graphs [true, true, true]) nv: (`nv` outputs an integer` [true, true, true], `nv` is coherent with `vertices` [true, true, true]) ne: (`ne` outputs an integer` [true, true, true], `ne` is coherent with `edges` [true, true, true]) neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true], `outneighbors` is coherent with `has_edge` [true, true, true], `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true]) weights: (`weights` outputs a matrix of real numbers [true, true, true], `weights` has the right size [true, true, true], `weights` are symmetric for undirected graphs [true, true, true]) Testing AbstractGraphInterface is implemented for SimpleWeightedGraphs.SimpleWeightedGraph Mandatory components is_directed: (`is_directed` outputs a boolean [true, true, true]) edgetype: (`edgetype` outputs a type [true, true, true]) vertices: (`vertices` is coherent with `eltype` [true, true, true], every vertex in `vertices(g)` exists [true, true, true], vertices beyond `vertices(g)` don't exist [true, true, true]) edges: (`edges` is coherent with `edgetype` [true, true, true], every edge in `edges` exists [true, true, true], `edges` are symmetric for undirected graphs [true, true, true]) nv: (`nv` outputs an integer` [true, true, true], `nv` is coherent with `vertices` [true, true, true]) ne: (`ne` outputs an integer` [true, true, true], `ne` is coherent with `edges` [true, true, true]) neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true], `outneighbors` is coherent with `has_edge` [true, true, true], `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true]) weights: (`weights` outputs a matrix of real numbers [true, true, true], `weights` has the right size [true, true, true], `weights` are symmetric for undirected graphs [true, true, true]) Testing AbstractGraphInterface is implemented for SimpleWeightedGraphs.SimpleWeightedDiGraph Mandatory components is_directed: (`is_directed` outputs a boolean [true, true, true]) edgetype: (`edgetype` outputs a type [true, true, true]) vertices: (`vertices` is coherent with `eltype` [true, true, true], every vertex in `vertices(g)` exists [true, true, true], vertices beyond `vertices(g)` don't exist [true, true, true]) edges: (`edges` is coherent with `edgetype` [true, true, true], every edge in `edges` exists [true, true, true], `edges` are symmetric for undirected graphs [true, true, true]) nv: (`nv` outputs an integer` [true, true, true], `nv` is coherent with `vertices` [true, true, true]) ne: (`ne` outputs an integer` [true, true, true], `ne` is coherent with `edges` [true, true, true]) neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true], `outneighbors` is coherent with `has_edge` [true, true, true], `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true]) weights: (`weights` outputs a matrix of real numbers [true, true, true], `weights` has the right size [true, true, true], `weights` are symmetric for undirected graphs [true, true, true]) Testing AbstractGraphInterface is implemented for MetaGraphsNext.MetaGraph Mandatory components is_directed: (`is_directed` outputs a boolean [true, true, true, true, true, true]) edgetype: (`edgetype` outputs a type [true, true, true, true, true, true]) vertices: (`vertices` is coherent with `eltype` [true, true, true, true, true, true], every vertex in `vertices(g)` exists [true, true, true, true, true, true], vertices beyond `vertices(g)` don't exist [true, true, true, true, true, true]) edges: (`edges` is coherent with `edgetype` [true, true, true, true, true, true], every edge in `edges` exists [true, true, true, true, true, true], `edges` are symmetric for undirected graphs [true, true, true, true, true, true]) nv: (`nv` outputs an integer` [true, true, true, true, true, true], `nv` is coherent with `vertices` [true, true, true, true, true, true]) ne: (`ne` outputs an integer` [true, true, true, true, true, true], `ne` is coherent with `edges` [true, true, true, true, true, true]) neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true, true, true, true], `outneighbors` is coherent with `has_edge` [true, true, true, true, true, true], `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true, true, true, true]) weights: (`weights` outputs a matrix of real numbers [true, true, true, true, true, true], `weights` has the right size [true, true, true, true, true, true], `weights` are symmetric for undirected graphs [true, true, true, true, true, true]) Testing AbstractGraphInterface is implemented for Multigraph Testing AbstractGraphInterface is implemented for DiMultigraph Test Summary: | Pass Broken Total Time GraphsInterfaceChecker.jl | 19 2 21 1m44.0s Aqua | 11 11 30.3s JuliaFormatter | 1 1 32.0s Graphs.jl | 2 2 8.9s MetaGraphs.jl | 2 2 11.5s SimpleWeightedGraphs.jl | 2 2 9.3s MetaGraphsNext.jl | 1 1 7.7s Multigraphs.jl | 2 2 4.2s Testing GraphsInterfaceChecker tests passed Testing completed after 139.88s PkgEval succeeded after 178.5s