1.6.0-DEV-7d3dac44dc.log

Julia Version 1.6.0-DEV.1148
Commit 7d3dac44dc (2020-10-06 21:26 UTC)
Platform Info:
  OS: Linux (x86_64-pc-linux-gnu)
  CPU: AMD EPYC 7502 32-Core Processor
  WORD_SIZE: 64
  LIBM: libopenlibm
  LLVM: libLLVM-10.0.1 (ORCJIT, znver2)
Environment:
  JULIA_DEPOT_PATH = ::/usr/local/share/julia
  JULIA_NUM_THREADS = 2

  Resolving package versions...
  Installed PolygonInbounds ─ v0.2.0
Updating `~/.julia/environments/v1.6/Project.toml`
  [e4521ec6] + PolygonInbounds v0.2.0
Updating `~/.julia/environments/v1.6/Manifest.toml`
  [e4521ec6] + PolygonInbounds v0.2.0
    Testing PolygonInbounds
Status `/tmp/jl_FASa60/Project.toml`
  [e4521ec6] PolygonInbounds v0.2.0
  [8dfed614] Test
Status `/tmp/jl_FASa60/Manifest.toml`
  [e4521ec6] PolygonInbounds v0.2.0
  [2a0f44e3] Base64
  [b77e0a4c] InteractiveUtils
  [56ddb016] Logging
  [d6f4376e] Markdown
  [9a3f8284] Random
  [9e88b42a] Serialization
  [8dfed614] Test
    Testing Running tests...
  0.040805 seconds (53 allocations: 6.893 MiB)
Test Summary:        | Pass  Total
PolygonInboundsTests |   18     18
        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.022650 seconds (55 allocations: 8.461 MiB)
        INPOLY2 supports multiply-connected geometries, consi-

        sting of arbitrarily nested sets of outer + inner bou-

        ndaries.


  0.026959 seconds (4.69 k allocations: 598.250 KiB, 95.95% 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.097508 seconds (62 allocations: 2.739 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.284195 seconds (53 allocations: 34.454 MiB, 3.82% 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.045154 seconds (659.52 k allocations: 71.361 MiB, 13.72% gc time, 69.98% compilation time)
    Testing PolygonInbounds tests passed