Dan Baston

@jericks , any objection to me merging in the commits from your `codecov` branch?

Still seems a worthy goal, IMO.

What gcc 4.9 does not deal with is returning a value of type `std::unique_ptr` from a function with return type `std::unique_ptr`. Dropping support for an 8-year old compiler seems reasonable,...

Are all of the results NaN, or just some of them? If a polygon doesn't intersect any defined cell in your raster, the mean will be 0/0 = NaN.

Thanks for documenting this. Is my hunch right that any of the following modifications (applied by itself) would "fix" this? - `r

`r*1` is just a trick to force `terra` to load everything into memory. It appears that either there is a problem with the way I'm requesting cell values from an...

If I'm understanding correctly, we have `N` unique polygons and we need stats calculated from `N` unique raters. If that's the case, I don't see any computational efficiency gain from...

I noticed that `TopologyPreservingSimplifier` is iterating over `linestringMap` that uses `Geometry*` as a key type. https://github.com/libgeos/geos/blob/c68119c728487ce63ca125cc452e6f9217eee195/src/simplify/TopologyPreservingSimplifier.cpp#L51 https://github.com/libgeos/geos/blob/c68119c728487ce63ca125cc452e6f9217eee195/src/simplify/TopologyPreservingSimplifier.cpp#L294 https://github.com/libgeos/geos/blob/c68119c728487ce63ca125cc452e6f9217eee195/src/simplify/TopologyPreservingSimplifier.cpp#L308-L310 I'm not familiar with the TPS algorithm but I would expect that...

Tree building time is dominated by sorting the items, so we could speed it up by creating a tree from a list of pre-sorted items. The existing C API gets...

>In that case the serialised form of a tree could be a vector of envelope corner coordinates ( (x1, y1, x2, y2) * n). That would be a factor 2-3...