Package evaluation of PolygonInbounds on Julia 1.10.9 (96dc2d8c45*) started at 2025-06-06T11:21:11.485


################################################################################
# Set-up
#

Installing PkgEval dependencies (TestEnv)...

Set-up completed after 5.27s


################################################################################
# Installation
#

Installing PolygonInbounds...
   Resolving package versions...
    Updating `~/.julia/environments/v1.10/Project.toml`
  [e4521ec6] + PolygonInbounds v0.2.0
    Updating `~/.julia/environments/v1.10/Manifest.toml`
  [e4521ec6] + PolygonInbounds v0.2.0

Installation completed after 6.4s


################################################################################
# Precompilation
#

Precompiling PkgEval dependencies...

Precompiling package dependencies...

Precompilation completed after 13.42s


################################################################################
# Testing
#

     Testing PolygonInbounds
      Status `/tmp/jl_AIsdxs/Project.toml`
  [e4521ec6] PolygonInbounds v0.2.0
  [8dfed614] Test
      Status `/tmp/jl_AIsdxs/Manifest.toml`
  [e4521ec6] PolygonInbounds v0.2.0
  [2a0f44e3] Base64
  [b77e0a4c] InteractiveUtils
  [56ddb016] Logging
  [d6f4376e] Markdown
  [9a3f8284] Random
  [ea8e919c] SHA v0.7.0
  [9e88b42a] Serialization
  [8dfed614] Test
     Testing Running tests...
  0.028013 seconds (56 allocations: 7.563 MiB)
Test Summary:        | Pass  Total   Time
PolygonInboundsTests |   18     18  12.7s
        INPOLY2 provides fast point-in-polygon queries for ob-
 
        jects in R^2. Like INPOLYGON, it detects points inside

        and on the boundary of polygonal geometries.


  0.076209 seconds (55 allocations: 8.461 MiB, 80.65% gc time)
        INPOLY2 supports multiply-connected geometries, consi-

        sting of arbitrarily nested sets of outer + inner bou-

        ndaries.


  0.024633 seconds (1.14 k allocations: 378.344 KiB, 96.26% compilation time)
INPOLY2 implements a "pre-sorted" variant of the cros-

sing-number test - returning queries in approximately 

O((N+M)*LOG(N)) time for configurations consisting of 

N test points and M edges. This is often considerably 

faster than conventional approaches that typically re-

quire O(N*M) operations.


  0.088313 seconds (63 allocations: 2.925 MiB)
    INPOLY2 provides fast point-in-polygon queries for ob-
 
    jects in R^2. Like INPOLYGON, it detects points inside

    and on the boundary of polygonal geometries.


  0.194801 seconds (56 allocations: 37.803 MiB, 5.38% gc time)
    INPOLY2 provides fast point-in-polygon queries for ob-
 
    jects in R^2. Like INPOLYGON, it detects points inside

    and on the boundary of polygonal geometries.


  1.108528 seconds (294.33 k allocations: 57.267 MiB, 12.58% gc time, 82.41% compilation time)
     Testing PolygonInbounds tests passed 

Testing completed after 31.86s

PkgEval succeeded after 59.93s