Package evaluation of SimSearchManifoldLearning on Julia 1.13.0-DEV.140 (fac1ce7906*) started at 2025-03-02T14:41:11.038 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 7.66s ################################################################################ # Installation # Installing SimSearchManifoldLearning... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [ca7ab67e] + SimSearchManifoldLearning v0.2.10 Updating `~/.julia/environments/v1.13/Manifest.toml` [79e6a3ab] + Adapt v4.2.0 [66dad0bd] + AliasTables v1.1.3 [ec485272] + ArnoldiMethod v0.4.0 [7d9fca2a] + Arpack v0.5.4 [4fba245c] + ArrayInterface v7.18.0 [62783981] + BitTwiddlingConvenienceFunctions v0.1.6 [2a0fbf3d] + CPUSummary v0.2.6 [fb6a15b2] + CloseOpenIntervals v0.1.13 [861a8166] + Combinatorics v1.0.2 [bbf7d656] + CommonSubexpressions v0.3.1 [f70d9fcc] + CommonWorldInvalidations v1.0.0 [34da2185] + Compat v4.16.0 [187b0558] + ConstructionBase v1.5.8 [adafc99b] + CpuId v0.3.1 [9a962f9c] + DataAPI v1.16.0 [864edb3b] + DataStructures v0.18.20 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [b4f34e82] + Distances v0.10.12 [31c24e10] + Distributions v0.25.117 [ffbed154] + DocStringExtensions v0.9.3 [5789e2e9] + FileIO v1.17.0 [1a297f60] + FillArrays v1.13.0 [6a86dc24] + FiniteDiff v2.27.0 [f6369f11] + ForwardDiff v0.10.38 [86223c79] + Graphs v1.12.0 [3e5b6fbb] + HostCPUFeatures v0.1.17 [34004b35] + HypergeometricFunctions v0.3.27 [615f187c] + IfElse v0.1.1 [d25df0c9] + Inflate v0.1.5 [92d709cd] + IrrationalConstants v0.2.4 ⌅ [033835bb] + JLD2 v0.4.54 [692b3bcd] + JLLWrappers v1.7.0 [10f19ff3] + LayoutPointers v0.1.17 [2ab3a3ac] + LogExpFunctions v0.3.29 [bdcacae8] + LoopVectorization v0.12.171 ⌅ [2fda8390] + LsqFit v0.12.1 [1914dd2f] + MacroTools v0.5.15 [06eb3307] + ManifoldLearning v0.9.0 [d125e4d3] + ManualMemory v0.1.8 [e1d29d7a] + Missings v1.2.0 ⌅ [6f286f6a] + MultivariateStats v0.9.0 [d41bc354] + NLSolversBase v7.8.3 [77ba4419] + NaNMath v1.1.2 [6fe1bfb0] + OffsetArrays v1.15.0 [87e2bd06] + OptimBase v2.0.2 [bac558e1] + OrderedCollections v1.8.0 [90014a1f] + PDMats v0.11.32 [d96e819e] + Parameters v0.12.3 [f517fe37] + Polyester v0.7.16 [1d0040c9] + PolyesterWeave v0.2.2 [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [43287f4e] + PtrArrays v1.3.0 [1fd47b50] + QuadGK v2.11.2 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [79098fc4] + Rmath v0.8.0 [94e857df] + SIMDTypes v0.1.0 [476501e8] + SLEEFPirates v0.6.43 ⌅ [0e966ebe] + SearchModels v0.3.3 [efcf1570] + Setfield v1.1.2 [ca7ab67e] + SimSearchManifoldLearning v0.2.10 [053f045d] + SimilaritySearch v0.11.10 [699a6c99] + SimpleTraits v0.9.4 [a2af1166] + SortingAlgorithms v1.2.1 [276daf66] + SpecialFunctions v2.5.0 [aedffcd0] + Static v1.1.1 [0d7ed370] + StaticArrayInterface v1.8.0 [90137ffa] + StaticArrays v1.9.13 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.7.0 ⌅ [2913bbd2] + StatsBase v0.33.21 [4c63d2b9] + StatsFuns v1.3.2 [7792a7ef] + StrideArraysCore v0.5.7 [8290d209] + ThreadingUtilities v0.5.2 [3bb67fe8] + TranscodingStreams v0.11.3 [3a884ed6] + UnPack v1.0.2 [3d5dd08c] + VectorizationBase v0.21.71 ⌅ [68821587] + Arpack_jll v3.5.1+1 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [f50d1b31] + Rmath_jll v0.5.1+0 [0dad84c5] + ArgTools v1.1.2 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.12.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.12.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [1a1011a3] + SharedArrays v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.12.0 [f489334b] + StyledStrings v1.11.0 [4607b0f0] + SuiteSparse [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] + LibCURL_jll v8.11.1+1 [e37daf67] + LibGit2_jll v1.9.0+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2024.12.31 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.5+0 [458c3c95] + OpenSSL_jll v3.0.16+0 [bea87d4a] + SuiteSparse_jll v7.8.3+2 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.12.0+0 [8e850ede] + nghttp2_jll v1.64.0+1 [3f19e933] + p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 3.67s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 203.66s ################################################################################ # Testing # Testing SimSearchManifoldLearning Status `/tmp/jl_RXGKGN/Project.toml` [7d9fca2a] Arpack v0.5.4 [b4f34e82] Distances v0.10.12 ⌅ [2fda8390] LsqFit v0.12.1 [06eb3307] ManifoldLearning v0.9.0 [f517fe37] Polyester v0.7.16 [ca7ab67e] SimSearchManifoldLearning v0.2.10 [053f045d] SimilaritySearch v0.11.10 [82ae8749] StatsAPI v1.7.0 [37e2e46d] LinearAlgebra v1.12.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.12.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_RXGKGN/Manifest.toml` [79e6a3ab] Adapt v4.2.0 [66dad0bd] AliasTables v1.1.3 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [4fba245c] ArrayInterface v7.18.0 [62783981] BitTwiddlingConvenienceFunctions v0.1.6 [2a0fbf3d] CPUSummary v0.2.6 [fb6a15b2] CloseOpenIntervals v0.1.13 [861a8166] Combinatorics v1.0.2 [bbf7d656] CommonSubexpressions v0.3.1 [f70d9fcc] CommonWorldInvalidations v1.0.0 [34da2185] Compat v4.16.0 [187b0558] ConstructionBase v1.5.8 [adafc99b] CpuId v0.3.1 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.18.20 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [b4f34e82] Distances v0.10.12 [31c24e10] Distributions v0.25.117 [ffbed154] DocStringExtensions v0.9.3 [5789e2e9] FileIO v1.17.0 [1a297f60] FillArrays v1.13.0 [6a86dc24] FiniteDiff v2.27.0 [f6369f11] ForwardDiff v0.10.38 [86223c79] Graphs v1.12.0 [3e5b6fbb] HostCPUFeatures v0.1.17 [34004b35] HypergeometricFunctions v0.3.27 [615f187c] IfElse v0.1.1 [d25df0c9] Inflate v0.1.5 [92d709cd] IrrationalConstants v0.2.4 ⌅ [033835bb] JLD2 v0.4.54 [692b3bcd] JLLWrappers v1.7.0 [10f19ff3] LayoutPointers v0.1.17 [2ab3a3ac] LogExpFunctions v0.3.29 [bdcacae8] LoopVectorization v0.12.171 ⌅ [2fda8390] LsqFit v0.12.1 [1914dd2f] MacroTools v0.5.15 [06eb3307] ManifoldLearning v0.9.0 [d125e4d3] ManualMemory v0.1.8 [e1d29d7a] Missings v1.2.0 ⌅ [6f286f6a] MultivariateStats v0.9.0 [d41bc354] NLSolversBase v7.8.3 [77ba4419] NaNMath v1.1.2 [6fe1bfb0] OffsetArrays v1.15.0 [87e2bd06] OptimBase v2.0.2 [bac558e1] OrderedCollections v1.8.0 [90014a1f] PDMats v0.11.32 [d96e819e] Parameters v0.12.3 [f517fe37] Polyester v0.7.16 [1d0040c9] PolyesterWeave v0.2.2 [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [79098fc4] Rmath v0.8.0 [94e857df] SIMDTypes v0.1.0 [476501e8] SLEEFPirates v0.6.43 ⌅ [0e966ebe] SearchModels v0.3.3 [efcf1570] Setfield v1.1.2 [ca7ab67e] SimSearchManifoldLearning v0.2.10 [053f045d] SimilaritySearch v0.11.10 [699a6c99] SimpleTraits v0.9.4 [a2af1166] SortingAlgorithms v1.2.1 [276daf66] SpecialFunctions v2.5.0 [aedffcd0] Static v1.1.1 [0d7ed370] StaticArrayInterface v1.8.0 [90137ffa] StaticArrays v1.9.13 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.0 ⌅ [2913bbd2] StatsBase v0.33.21 [4c63d2b9] StatsFuns v1.3.2 [7792a7ef] StrideArraysCore v0.5.7 [8290d209] ThreadingUtilities v0.5.2 [3bb67fe8] TranscodingStreams v0.11.3 [3a884ed6] UnPack v1.0.2 [3d5dd08c] VectorizationBase v0.21.71 ⌅ [68821587] Arpack_jll v3.5.1+1 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [f50d1b31] Rmath_jll v0.5.1+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.12.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [1a1011a3] SharedArrays v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.12.0 [f489334b] StyledStrings v1.11.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] LibCURL_jll v8.11.1+1 [e37daf67] LibGit2_jll v1.9.0+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2024.12.31 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.0.16+0 [bea87d4a] SuiteSparse_jll v7.8.3+2 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.12.0+0 [8e850ede] nghttp2_jll v1.64.0+1 [3f19e933] p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... WARNING: llvmcall with integer pointers is deprecated. Use actual pointers instead, replacing i32 or i64 with i8* or ptr in initialize_task(Any) at /home/pkgeval/.julia/packages/ThreadingUtilities/3z3g0/src/ThreadingUtilities.jl WARNING: llvmcall with integer pointers is deprecated. Use actual pointers instead, replacing i32 or i64 with i8* or ptr in searchbatch(SimilaritySearch.AbstractSearchIndex, SimilaritySearch.AbstractContext, SimilaritySearch.AbstractDatabase, AbstractArray{SimilaritySearch.KnnResult, 1}) at /home/pkgeval/.julia/packages/SimilaritySearch/fkUaT/src/SimilaritySearch.jl WARNING: llvmcall with integer pointers is deprecated. Use actual pointers instead, replacing i32 or i64 with i8* or ptr in checktask(Any) at /home/pkgeval/.julia/packages/ThreadingUtilities/3z3g0/src/threadtasks.jl 1.878023 seconds (703.08 k allocations: 36.818 MiB, 95.33% compilation time) WARNING: llvmcall with integer pointers is deprecated. Use actual pointers instead, replacing i32 or i64 with i8* or ptr in _parallel_append_items_loop!(SimilaritySearch.SearchGraph{DistType, DataType, AdjType, SType} where SType<:SimilaritySearch.LocalSearchAlgorithm where AdjType<:(SimilaritySearch.AdjacencyLists.AbstractAdjacencyList{EndPointType} where EndPointType) where DataType<:SimilaritySearch.AbstractDatabase where DistType<:Distances.SemiMetric, SimilaritySearch.SearchGraphContext, Any, Any) at /home/pkgeval/.julia/packages/SimilaritySearch/fkUaT/src/searchgraph/insertions.jl WARNING: llvmcall with integer pointers is deprecated. Use actual pointers instead, replacing i32 or i64 with i8* or ptr in connect_reverse_links(SimilaritySearch.AdjacencyLists.AbstractAdjacencyList{EndPointType} where EndPointType, Integer, Integer) at /home/pkgeval/.julia/packages/SimilaritySearch/fkUaT/src/searchgraph/neighborhood.jl WARNING: llvmcall with integer pointers is deprecated. Use actual pointers instead, replacing i32 or i64 with i8* or ptr in var"#fft#138"(Any, SimilaritySearch.var"#fft", Distances.SemiMetric, SimilaritySearch.AbstractDatabase, Integer) at /home/pkgeval/.julia/packages/SimilaritySearch/fkUaT/src/fft.jl computing farthest point 1, dmax: Inf, imax: 3, n: 4 computing farthest point 2, dmax: 3.4670258, imax: 2, n: 4 computing farthest point 3, dmax: 1.9090276, imax: 4, n: 4 (n, m, k, length(A.centers)) = (14, 4, 3, 3) WARNING: llvmcall with integer pointers is deprecated. Use actual pointers instead, replacing i32 or i64 with i8* or ptr in (::SimilaritySearch.var"#lossfun#create_error_function##2"{index, context, gold, knnlist, queries, ksearch, verbose, R, cov, vacc, vmax, vmin, m})(Any) at /home/pkgeval/.julia/packages/SimilaritySearch/fkUaT/src/opt.jl computing farthest point 1, dmax: Inf, imax: 2, n: 3 computing farthest point 2, dmax: 1.9090276, imax: 3, n: 3 computing farthest point 3, dmax: 0.82106084, imax: 1, n: 3 computing farthest point 4, dmax: 0.0, imax: 1, n: 3 (n, m, k, length(A.centers)) = (19, 5, 4, 4) computing farthest point 1, dmax: Inf, imax: 5, n: 5 computing farthest point 2, dmax: 2.0885916, imax: 4, n: 5 computing farthest point 3, dmax: 1.8441255, imax: 1, n: 5 computing farthest point 4, dmax: 1.7416095, imax: 2, n: 5 computing farthest point 5, dmax: 0.73477405, imax: 3, n: 5 (n, m, k, length(A.centers)) = (29, 6, 5, 5) computing farthest point 1, dmax: Inf, imax: 1, n: 6 computing farthest point 2, dmax: 3.745366, imax: 3, n: 6 computing farthest point 3, dmax: 2.0835993, imax: 5, n: 6 computing farthest point 4, dmax: 1.4140711, imax: 2, n: 6 computing farthest point 5, dmax: 1.2248038, imax: 4, n: 6 computing farthest point 6, dmax: 0.6564724, imax: 6, n: 6 (n, m, k, length(A.centers)) = (39, 7, 6, 6) computing farthest point 1, dmax: Inf, imax: 2, n: 8 computing farthest point 2, dmax: 1.7387831, imax: 3, n: 8 computing farthest point 3, dmax: 1.6028248, imax: 8, n: 8 computing farthest point 4, dmax: 1.5370642, imax: 7, n: 8 computing farthest point 5, dmax: 1.2013103, imax: 1, n: 8 computing farthest point 6, dmax: 0.83666176, imax: 6, n: 8 computing farthest point 7, dmax: 0.7767357, imax: 4, n: 8 (n, m, k, length(A.centers)) = (59, 8, 7, 7) computing farthest point 1, dmax: Inf, imax: 3, n: 10 computing farthest point 2, dmax: 3.7833607, imax: 1, n: 10 computing farthest point 3, dmax: 2.1795561, imax: 2, n: 10 computing farthest point 4, dmax: 1.762518, imax: 10, n: 10 computing farthest point 5, dmax: 1.365363, imax: 6, n: 10 computing farthest point 6, dmax: 1.2173357, imax: 8, n: 10 computing farthest point 7, dmax: 1.1731024, imax: 5, n: 10 computing farthest point 8, dmax: 0.9017066, imax: 7, n: 10 computing farthest point 9, dmax: 0.5715652, imax: 4, n: 10 (n, m, k, length(A.centers)) = (89, 10, 9, 9) computing farthest point 1, dmax: Inf, imax: 2, n: 18 computing farthest point 2, dmax: 3.8028436, imax: 9, n: 18 computing farthest point 3, dmax: 2.2372026, imax: 12, n: 18 computing farthest point 4, dmax: 2.0370603, imax: 6, n: 18 computing farthest point 5, dmax: 1.7655363, imax: 7, n: 18 computing farthest point 6, dmax: 1.3353086, imax: 1, n: 18 computing farthest point 7, dmax: 1.2526747, imax: 16, n: 18 computing farthest point 8, dmax: 1.1937199, imax: 11, n: 18 computing farthest point 9, dmax: 1.051638, imax: 18, n: 18 computing farthest point 10, dmax: 0.9236135, imax: 10, n: 18 computing farthest point 11, dmax: 0.73134077, imax: 14, n: 18 computing farthest point 12, dmax: 0.71321887, imax: 13, n: 18 computing farthest point 13, dmax: 0.63011575, imax: 17, n: 18 computing farthest point 14, dmax: 0.62887937, imax: 3, n: 18 computing farthest point 15, dmax: 0.5812992, imax: 5, n: 18 computing farthest point 16, dmax: 0.45686293, imax: 4, n: 18 computing farthest point 17, dmax: 0.42116356, imax: 8, n: 18 (n, m, k, length(A.centers)) = (294, 18, 17, 17) computing farthest point 1, dmax: Inf, imax: 16, n: 21 computing farthest point 2, dmax: 3.822094, imax: 1, n: 21 computing farthest point 3, dmax: 1.8069937, imax: 15, n: 21 computing farthest point 4, dmax: 1.7609825, imax: 6, n: 21 computing farthest point 5, dmax: 1.7418205, imax: 19, n: 21 computing farthest point 6, dmax: 1.7148058, imax: 5, n: 21 computing farthest point 7, dmax: 1.441965, imax: 13, n: 21 computing farthest point 8, dmax: 1.3863883, imax: 18, n: 21 computing farthest point 9, dmax: 0.9182369, imax: 7, n: 21 computing farthest point 10, dmax: 0.9107343, imax: 3, n: 21 computing farthest point 11, dmax: 0.9032903, imax: 17, n: 21 computing farthest point 12, dmax: 0.8581524, imax: 12, n: 21 computing farthest point 13, dmax: 0.6472676, imax: 20, n: 21 computing farthest point 14, dmax: 0.5715339, imax: 8, n: 21 computing farthest point 15, dmax: 0.5692472, imax: 11, n: 21 computing farthest point 16, dmax: 0.52550536, imax: 2, n: 21 computing farthest point 17, dmax: 0.49977338, imax: 21, n: 21 computing farthest point 18, dmax: 0.4809974, imax: 9, n: 21 computing farthest point 19, dmax: 0.45021668, imax: 14, n: 21 computing farthest point 20, dmax: 0.4126049, imax: 4, n: 21 (n, m, k, length(A.centers)) = (439, 21, 20, 20) computing farthest point 1, dmax: Inf, imax: 9, n: 26 computing farthest point 2, dmax: 2.6924167, imax: 18, n: 26 computing farthest point 3, dmax: 2.6600852, imax: 11, n: 26 computing farthest point 4, dmax: 1.9822891, imax: 24, n: 26 computing farthest point 5, dmax: 1.8521574, imax: 12, n: 26 computing farthest point 6, dmax: 1.8425385, imax: 21, n: 26 computing farthest point 7, dmax: 1.6735435, imax: 15, n: 26 computing farthest point 8, dmax: 1.4120625, imax: 23, n: 26 computing farthest point 9, dmax: 1.2751142, imax: 25, n: 26 computing farthest point 10, dmax: 1.2505099, imax: 13, n: 26 computing farthest point 11, dmax: 1.0755796, imax: 2, n: 26 computing farthest point 12, dmax: 1.0630457, imax: 10, n: 26 computing farthest point 13, dmax: 1.0279406, imax: 14, n: 26 computing farthest point 14, dmax: 1.0014347, imax: 22, n: 26 computing farthest point 15, dmax: 0.95341974, imax: 26, n: 26 computing farthest point 16, dmax: 0.9522109, imax: 6, n: 26 computing farthest point 17, dmax: 0.6168165, imax: 7, n: 26 computing farthest point 18, dmax: 0.4834013, imax: 8, n: 26 computing farthest point 19, dmax: 0.4518129, imax: 20, n: 26 computing farthest point 20, dmax: 0.44016594, imax: 3, n: 26 computing farthest point 21, dmax: 0.41223258, imax: 5, n: 26 computing farthest point 22, dmax: 0.3420559, imax: 4, n: 26 computing farthest point 23, dmax: 0.27914137, imax: 19, n: 26 computing farthest point 24, dmax: 0.1998231, imax: 16, n: 26 computing farthest point 25, dmax: 0.14959355, imax: 1, n: 26 (n, m, k, length(A.centers)) = (659, 26, 25, 25) append_items! sp=900, ep=904, n=904, BeamSearch bsize: Int32 2 Δ: Float32 0.8734387f0 maxvisits: Int64 134 , 2025-03-02T14:46:22.684 computing farthest point 1, dmax: Inf, imax: 29, n: 32 computing farthest point 2, dmax: 4.0213413, imax: 30, n: 32 computing farthest point 3, dmax: 2.255052, imax: 20, n: 32 computing farthest point 4, dmax: 2.2508783, imax: 19, n: 32 computing farthest point 5, dmax: 1.951635, imax: 14, n: 32 computing farthest point 6, dmax: 1.7826082, imax: 16, n: 32 computing farthest point 7, dmax: 1.3827218, imax: 18, n: 32 computing farthest point 8, dmax: 1.3609272, imax: 10, n: 32 computing farthest point 9, dmax: 1.285881, imax: 12, n: 32 computing farthest point 10, dmax: 1.2321768, imax: 22, n: 32 computing farthest point 11, dmax: 1.1997902, imax: 27, n: 32 computing farthest point 12, dmax: 1.0125741, imax: 7, n: 32 computing farthest point 13, dmax: 0.9595716, imax: 9, n: 32 computing farthest point 14, dmax: 0.8771393, imax: 28, n: 32 computing farthest point 15, dmax: 0.74535775, imax: 17, n: 32 computing farthest point 16, dmax: 0.6990867, imax: 6, n: 32 computing farthest point 17, dmax: 0.6932905, imax: 25, n: 32 computing farthest point 18, dmax: 0.6382673, imax: 13, n: 32 computing farthest point 19, dmax: 0.5985819, imax: 1, n: 32 computing farthest point 20, dmax: 0.56473887, imax: 3, n: 32 computing farthest point 21, dmax: 0.5638723, imax: 8, n: 32 computing farthest point 22, dmax: 0.5379843, imax: 24, n: 32 computing farthest point 23, dmax: 0.47456393, imax: 32, n: 32 computing farthest point 24, dmax: 0.45357764, imax: 11, n: 32 computing farthest point 25, dmax: 0.38368493, imax: 26, n: 32 computing farthest point 26, dmax: 0.3796939, imax: 21, n: 32 computing farthest point 27, dmax: 0.3644524, imax: 4, n: 32 computing farthest point 28, dmax: 0.30688375, imax: 5, n: 32 computing farthest point 29, dmax: 0.30524933, imax: 15, n: 32 computing farthest point 30, dmax: 0.30307245, imax: 31, n: 32 computing farthest point 31, dmax: 0.09754023, imax: 2, n: 32 (n, m, k, length(A.centers)) = (989, 32, 31, 31) 0.370165 seconds (255.63 k allocations: 13.221 MiB, 97.17% compilation time) 0.615375 seconds (340.67 k allocations: 17.733 MiB, 95.08% compilation time) computing farthest point 1, dmax: Inf, imax: 3, n: 4 computing farthest point 2, dmax: 1.8585874, imax: 4, n: 4 computing farthest point 3, dmax: 0.9233776, imax: 2, n: 4 (n, m, k, length(A.centers)) = (14, 4, 3, 3) computing farthest point 1, dmax: Inf, imax: 3, n: 5 computing farthest point 2, dmax: 1.4657488, imax: 4, n: 5 computing farthest point 3, dmax: 1.2420901, imax: 1, n: 5 computing farthest point 4, dmax: 0.5930043, imax: 2, n: 5 (n, m, k, length(A.centers)) = (19, 5, 4, 4) computing farthest point 1, dmax: Inf, imax: 1, n: 5 computing farthest point 2, dmax: 1.8259453, imax: 2, n: 5 computing farthest point 3, dmax: 1.388691, imax: 3, n: 5 computing farthest point 4, dmax: 1.2844069, imax: 5, n: 5 computing farthest point 5, dmax: 1.2494541, imax: 4, n: 5 (n, m, k, length(A.centers)) = (29, 6, 5, 5) computing farthest point 1, dmax: Inf, imax: 7, n: 7 computing farthest point 2, dmax: 1.7345582, imax: 4, n: 7 computing farthest point 3, dmax: 1.5549328, imax: 2, n: 7 computing farthest point 4, dmax: 1.4334884, imax: 3, n: 7 computing farthest point 5, dmax: 0.72665274, imax: 5, n: 7 computing farthest point 6, dmax: 0.5681583, imax: 1, n: 7 (n, m, k, length(A.centers)) = (39, 7, 6, 6) computing farthest point 1, dmax: Inf, imax: 3, n: 8 computing farthest point 2, dmax: 4.014494, imax: 8, n: 8 computing farthest point 3, dmax: 1.9170473, imax: 2, n: 8 computing farthest point 4, dmax: 1.4240991, imax: 7, n: 8 computing farthest point 5, dmax: 1.4179587, imax: 4, n: 8 computing farthest point 6, dmax: 1.2494541, imax: 5, n: 8 computing farthest point 7, dmax: 0.70989615, imax: 1, n: 8 (n, m, k, length(A.centers)) = (59, 8, 7, 7) computing farthest point 1, dmax: Inf, imax: 5, n: 9 computing farthest point 2, dmax: 3.203859, imax: 3, n: 9 computing farthest point 3, dmax: 1.8561025, imax: 6, n: 9 computing farthest point 4, dmax: 1.5054057, imax: 2, n: 9 computing farthest point 5, dmax: 1.339288, imax: 9, n: 9 computing farthest point 6, dmax: 1.2633318, imax: 8, n: 9 computing farthest point 7, dmax: 0.9180868, imax: 4, n: 9 computing farthest point 8, dmax: 0.8103744, imax: 1, n: 9 computing farthest point 9, dmax: 0.64042515, imax: 7, n: 9 (n, m, k, length(A.centers)) = (89, 10, 9, 9) computing farthest point 1, dmax: Inf, imax: 12, n: 18 computing farthest point 2, dmax: 2.2050889, imax: 18, n: 18 computing farthest point 3, dmax: 1.8480046, imax: 4, n: 18 computing farthest point 4, dmax: 1.6703883, imax: 14, n: 18 computing farthest point 5, dmax: 1.4568574, imax: 3, n: 18 computing farthest point 6, dmax: 1.223286, imax: 17, n: 18 computing farthest point 7, dmax: 1.0502198, imax: 2, n: 18 computing farthest point 8, dmax: 1.0021192, imax: 8, n: 18 computing farthest point 9, dmax: 0.95091647, imax: 13, n: 18 computing farthest point 10, dmax: 0.79084903, imax: 7, n: 18 computing farthest point 11, dmax: 0.6655509, imax: 10, n: 18 computing farthest point 12, dmax: 0.5631719, imax: 15, n: 18 computing farthest point 13, dmax: 0.44213945, imax: 16, n: 18 computing farthest point 14, dmax: 0.42195073, imax: 5, n: 18 computing farthest point 15, dmax: 0.32230377, imax: 6, n: 18 computing farthest point 16, dmax: 0.31438598, imax: 1, n: 18 computing farthest point 17, dmax: 0.17876, imax: 9, n: 18 (n, m, k, length(A.centers)) = (294, 18, 17, 17) append_items! sp=385, ep=389, n=389, BeamSearch bsize: Int32 2 Δ: Float32 0.74766356f0 maxvisits: Int64 94 , 2025-03-02T14:46:38.253 computing farthest point 1, dmax: Inf, imax: 8, n: 20 computing farthest point 2, dmax: 2.6362975, imax: 19, n: 20 computing farthest point 3, dmax: 2.0479536, imax: 4, n: 20 computing farthest point 4, dmax: 1.5145675, imax: 12, n: 20 computing farthest point 5, dmax: 1.4695044, imax: 15, n: 20 computing farthest point 6, dmax: 1.1716396, imax: 14, n: 20 computing farthest point 7, dmax: 1.0323058, imax: 10, n: 20 computing farthest point 8, dmax: 0.93003595, imax: 11, n: 20 computing farthest point 9, dmax: 0.88945013, imax: 16, n: 20 computing farthest point 10, dmax: 0.83475614, imax: 13, n: 20 computing farthest point 11, dmax: 0.58201265, imax: 7, n: 20 computing farthest point 12, dmax: 0.5676983, imax: 20, n: 20 computing farthest point 13, dmax: 0.5128516, imax: 2, n: 20 computing farthest point 14, dmax: 0.502909, imax: 6, n: 20 computing farthest point 15, dmax: 0.41149467, imax: 3, n: 20 computing farthest point 16, dmax: 0.40490273, imax: 18, n: 20 computing farthest point 17, dmax: 0.40381894, imax: 9, n: 20 computing farthest point 18, dmax: 0.3497397, imax: 5, n: 20 computing farthest point 19, dmax: 0.32897556, imax: 17, n: 20 computing farthest point 20, dmax: 0.18329144, imax: 1, n: 20 (n, m, k, length(A.centers)) = (439, 21, 20, 20) computing farthest point 1, dmax: Inf, imax: 7, n: 25 computing farthest point 2, dmax: 3.344474, imax: 13, n: 25 computing farthest point 3, dmax: 1.4755867, imax: 11, n: 25 computing farthest point 4, dmax: 1.3894485, imax: 9, n: 25 computing farthest point 5, dmax: 1.3394343, imax: 3, n: 25 computing farthest point 6, dmax: 1.3040673, imax: 21, n: 25 computing farthest point 7, dmax: 1.2837315, imax: 24, n: 25 computing farthest point 8, dmax: 0.95456076, imax: 10, n: 25 computing farthest point 9, dmax: 0.8812419, imax: 4, n: 25 computing farthest point 10, dmax: 0.78440315, imax: 16, n: 25 computing farthest point 11, dmax: 0.77329713, imax: 2, n: 25 computing farthest point 12, dmax: 0.7612115, imax: 12, n: 25 computing farthest point 13, dmax: 0.75575256, imax: 17, n: 25 computing farthest point 14, dmax: 0.739599, imax: 19, n: 25 computing farthest point 15, dmax: 0.6329446, imax: 22, n: 25 computing farthest point 16, dmax: 0.58289784, imax: 1, n: 25 computing farthest point 17, dmax: 0.4489621, imax: 23, n: 25 computing farthest point 18, dmax: 0.41790923, imax: 14, n: 25 computing farthest point 19, dmax: 0.36404437, imax: 6, n: 25 computing farthest point 20, dmax: 0.33698875, imax: 20, n: 25 computing farthest point 21, dmax: 0.27016634, imax: 5, n: 25 computing farthest point 22, dmax: 0.2670062, imax: 25, n: 25 computing farthest point 23, dmax: 0.1938846, imax: 8, n: 25 computing farthest point 24, dmax: 0.16779223, imax: 18, n: 25 computing farthest point 25, dmax: 0.13455477, imax: 15, n: 25 (n, m, k, length(A.centers)) = (659, 26, 25, 25) append_items! sp=740, ep=744, n=744, BeamSearch bsize: Int32 2 Δ: Float32 0.99441004f0 maxvisits: Int64 142 , 2025-03-02T14:46:38.327 computing farthest point 1, dmax: Inf, imax: 8, n: 32 computing farthest point 2, dmax: 3.6515052, imax: 16, n: 32 computing farthest point 3, dmax: 1.7135148, imax: 30, n: 32 computing farthest point 4, dmax: 1.3901516, imax: 10, n: 32 computing farthest point 5, dmax: 1.2207267, imax: 29, n: 32 computing farthest point 6, dmax: 1.0851018, imax: 32, n: 32 computing farthest point 7, dmax: 1.0467398, imax: 20, n: 32 computing farthest point 8, dmax: 0.9831575, imax: 19, n: 32 computing farthest point 9, dmax: 0.9817663, imax: 24, n: 32 computing farthest point 10, dmax: 0.9561686, imax: 31, n: 32 computing farthest point 11, dmax: 0.9151072, imax: 4, n: 32 computing farthest point 12, dmax: 0.8883529, imax: 9, n: 32 computing farthest point 13, dmax: 0.776141, imax: 13, n: 32 computing farthest point 14, dmax: 0.674146, imax: 14, n: 32 computing farthest point 15, dmax: 0.6157754, imax: 22, n: 32 computing farthest point 16, dmax: 0.5762611, imax: 15, n: 32 computing farthest point 17, dmax: 0.5707886, imax: 3, n: 32 computing farthest point 18, dmax: 0.49875924, imax: 2, n: 32 computing farthest point 19, dmax: 0.46924514, imax: 25, n: 32 computing farthest point 20, dmax: 0.41049412, imax: 28, n: 32 computing farthest point 21, dmax: 0.4005445, imax: 7, n: 32 computing farthest point 22, dmax: 0.36191326, imax: 11, n: 32 computing farthest point 23, dmax: 0.35770118, imax: 6, n: 32 computing farthest point 24, dmax: 0.33548993, imax: 23, n: 32 computing farthest point 25, dmax: 0.25498012, imax: 18, n: 32 computing farthest point 26, dmax: 0.22398245, imax: 27, n: 32 computing farthest point 27, dmax: 0.21469617, imax: 21, n: 32 computing farthest point 28, dmax: 0.15023431, imax: 26, n: 32 computing farthest point 29, dmax: 0.14283852, imax: 1, n: 32 computing farthest point 30, dmax: 0.096940786, imax: 12, n: 32 computing farthest point 31, dmax: 0.07814283, imax: 5, n: 32 (n, m, k, length(A.centers)) = (989, 32, 31, 31) 0.360035 seconds (255.62 k allocations: 13.214 MiB, 97.70% compilation time) Test Summary: | Pass Total Time SimilaritySearch for ManifoldLearning api | 4 4 1m11.5s Test Summary: | Pass Total Time utils tests | 3 3 5.8s WARNING: llvmcall with integer pointers is deprecated. Use actual pointers instead, replacing i32 or i64 with i8* or ptr in var"#optimize_embedding#3"(Real, Float32, Any, SimSearchManifoldLearning.var"#optimize_embedding", Any, AbstractArray{T, 2} where T, AbstractArray{T, 2} where T, Int64, Float32, Float32, Int64, Float32, Float32) at /home/pkgeval/.julia/packages/SimSearchManifoldLearning/PdXsX/src/embeddings.jl WARNING: llvmcall with integer pointers is deprecated. Use actual pointers instead, replacing i32 or i64 with i8* or ptr in var"#compute_membership_strengths#15"(Any, SimSearchManifoldLearning.var"#compute_membership_strengths", AbstractArray{T, 2} where T, AbstractArray{T, 2} where T, Integer, Bool) at /home/pkgeval/.julia/packages/SimSearchManifoldLearning/PdXsX/src/umap_.jl WARNING: llvmcall with integer pointers is deprecated. Use actual pointers instead, replacing i32 or i64 with i8* or ptr in allknn(SimilaritySearch.AbstractSearchIndex, SimilaritySearch.AbstractContext, AbstractArray{Int32, 2}, AbstractArray{Float32, 2}) at /home/pkgeval/.julia/packages/SimilaritySearch/fkUaT/src/allknn.jl 1.282750 seconds (380.58 k allocations: 20.256 MiB, 100.00% compilation time) 0.000012 seconds (6 allocations: 208 bytes) 0.001506 seconds (8 allocations: 11.969 KiB) *** computing graph *** layout embedding RandomLayout *** fit ab / embedding *** opt embedding UMAP construction time cost report: - fuzzy graph: 0.981513885 - embedding init: 3.88e-6 - embedding opt: 0.067154838 1.136115 seconds (352.42 k allocations: 18.882 MiB, 99.89% compilation time) *** computing graph *** layout embedding RandomLayout *** fit ab / embedding *** opt embedding UMAP construction time cost report: - fuzzy graph: 0.000827932 - embedding init: 3.63e-6 - embedding opt: 0.066494294 0.001445 seconds (8 allocations: 11.969 KiB) *** computing graph *** layout embedding RandomLayout *** fit ab / embedding *** opt embedding UMAP construction time cost report: - fuzzy graph: 0.000845312 - embedding init: 4.59e-6 - embedding opt: 0.06694025 0.001531 seconds (8 allocations: 12.000 KiB) *** computing graph *** layout embedding SpectralLayout *** fit ab / embedding *** opt embedding UMAP construction time cost report: - fuzzy graph: 0.000894691 - embedding init: 7.054253443 - embedding opt: 0.068514975 0.001422 seconds (8 allocations: 12.000 KiB) *** computing graph *** layout embedding PrecomputedLayout *** fit ab / embedding *** opt embedding UMAP construction time cost report: - fuzzy graph: 0.000858552 - embedding init: 3.2e-7 - embedding opt: 0.07103606 0.001419 seconds (8 allocations: 12.000 KiB) *** computing graph *** layout embedding KnnGraphLayout *** fit ab / embedding *** opt embedding UMAP construction time cost report: - fuzzy graph: 0.00094874 - embedding init: 4.4399e-5 - embedding opt: 0.067945271 0.001412 seconds (8 allocations: 11.969 KiB) *** computing graph *** layout embedding RandomLayout *** fit ab / embedding *** opt embedding UMAP construction time cost report: - fuzzy graph: 0.000843662 - embedding init: 2.46e-6 - embedding opt: 0.064402216 0.001460 seconds (8 allocations: 11.969 KiB) *** computing graph *** layout embedding RandomLayout *** fit ab / embedding *** opt embedding UMAP construction time cost report: - fuzzy graph: 0.000880621 - embedding init: 3.66e-6 - embedding opt: 0.066933881 0.001465 seconds (8 allocations: 11.969 KiB) *** computing graph *** layout embedding RandomLayout *** fit ab / embedding *** opt embedding UMAP construction time cost report: - fuzzy graph: 0.000860002 - embedding init: 4.15e-6 - embedding opt: 0.070873072 0.001496 seconds (8 allocations: 11.969 KiB) *** computing graph *** layout embedding RandomLayout *** fit ab / embedding *** opt embedding UMAP construction time cost report: - fuzzy graph: 0.000864381 - embedding init: 3.44e-6 - embedding opt: 0.067803651 (rhos, sigmas) = (Float32[1.0, 2.0, 3.0], Float32[1.9829102, 2.5358887, 2.6249695]) ┌ Info: [2.321931655873457, 2.321930914055594, 2.3219283113392373] │ diffs = │ 3-element Vector{Float64}: │ 3.560986094885976e-6 │ 2.819168231749103e-6 └ 2.164518750902289e-7 (:last => rhos, sigmas) = (:last => Float32[0.0, 1.0, 2.0], Float32[5.421011f-20, 5.421011f-20, 5.421011f-20]) (rows, cols, vals) = (Int32[1, 2, 2, 1, 3, 2], Int32[1, 1, 2, 2, 3, 3], Float32[0.0, 1.0, 0.0, 1.0, 0.0, 1.0]) [ Info: spectral_layout! [ Info: initialize_embedding [ Info: Matrix{Float32} => Matrix{Float32} [ Info: ===== umap predict ===== 0.000091 seconds (6 allocations: 944 bytes) *** computing graph *** layout embedding SpectralLayout ┌ Info: Arpack.XYAUPD_Exception(1) └ Error encountered in spectral_layout; defaulting to random layout *** fit ab / embedding *** opt embedding UMAP construction time cost report: - fuzzy graph: 8.3769e-5 - embedding init: 0.060407025 - embedding opt: 5.4519e-5 WARNING: llvmcall with integer pointers is deprecated. Use actual pointers instead, replacing i32 or i64 with i8* or ptr in searchbatch(SimilaritySearch.AbstractSearchIndex, SimilaritySearch.AbstractContext, SimilaritySearch.AbstractDatabase, AbstractArray{Int32, 2}, AbstractArray{Float32, 2}) at /home/pkgeval/.julia/packages/SimilaritySearch/fkUaT/src/SimilaritySearch.jl 0.000080 seconds (6 allocations: 944 bytes) *** computing graph *** layout embedding SpectralLayout ┌ Info: Arpack.XYAUPD_Exception(1) └ Error encountered in spectral_layout; defaulting to random layout *** fit ab / embedding *** opt embedding UMAP construction time cost report: - fuzzy graph: 5.0549e-5 - embedding init: 0.002507835 - embedding opt: 5.094e-5 0.000075 seconds (6 allocations: 944 bytes) *** computing graph *** layout embedding SpectralLayout ┌ Info: Arpack.XYAUPD_Exception(1) └ Error encountered in spectral_layout; defaulting to random layout *** fit ab / embedding *** opt embedding UMAP construction time cost report: - fuzzy graph: 4.9729e-5 - embedding init: 0.002578775 - embedding opt: 5.479e-5 Test Summary: | Pass Total Time umap tests | 44 44 1m28.6s Testing SimSearchManifoldLearning tests passed Testing completed after 211.39s PkgEval succeeded after 443.51s