test match_pts_to_graph with dist return for #103

DESCRIPTION

@@ -1,6 +1,6 @@
 Package: dodgr
 Title: Distances on Directed Graphs
-Version: 0.2.15.012
+Version: 0.2.15.013
 Authors@R: c(
     person("Mark", "Padgham", , "[email protected]", role = c("aut", "cre")),
     person("Andreas", "Petutschnig", role = "aut"),

codemeta.json

@@ -7,7 +7,7 @@
   "codeRepository": "https://github.com/ATFutures/dodgr",
   "issueTracker": "https://github.com/ATFutures/dodgr/issues",
   "license": "https://spdx.org/licenses/GPL-3.0",
-  "version": "0.2.15.012",
+  "version": "0.2.15.013",
   "programmingLanguage": {
     "@type": "ComputerLanguage",
     "name": "R",

tests/testthat/test-match-pts-fns.R

@@ -132,3 +132,25 @@ test_that ("add nodes to graph", {
     expect_true ((nrow (graph1) - nrow (graph0)) > npts)
     # actually equals 2 * npts when all edges are bi-directional.
 })
+
+test_that ("match with distances", {
+
+    graph0 <- weight_streetnet (hampi, wt_profile = "foot")
+    verts <- dodgr_vertices (graph0)
+    set.seed (1)
+    npts <- 10
+    xy <- data.frame (
+        x = min (verts$x) + runif (npts) * diff (range (verts$x)),
+        y = min (verts$y) + runif (npts) * diff (range (verts$y))
+    )
+
+    expect_silent (
+        res <- match_pts_to_graph (graph0, xy, distances = TRUE)
+    )
+    expect_s3_class (res, "data.frame")
+    expect_equal (ncol (res), 2L)
+    expect_identical (names (res), c ("index", "d_signed"))
+    expect_true (length (which (res$d_signed < 0)) > 0L)
+    expect_true (length (which (res$d_signed > 0)) > 0L)
+    expect_true (length (which (res$d_signed == 0)) > 0L)
+})