Proof-read

luukvdmeer · Jan 31, 2021 · eba28b7 · eba28b7
1 parent 9d87a86
commit eba28b7
Show file tree

Hide file tree

Showing 4 changed files with 5 additions and 5 deletions.
diff --git a/R/morphers.R b/R/morphers.R
@@ -623,7 +623,7 @@ to_spatial_smooth = function(x, store_original_data = FALSE) {
         # --> There are two pseudo nodes that form the boundary of the set.
         # --> These are the ones connected to only one other pseudo node.
         N_b = N[degree(G) == 1]
-        # If these boundaries do not exists:
+        # If these boundaries do not exist:
         # --> We are dealing with a loop of connected pseudo nodes.
         # --> The loop is by definition not connected to the rest of the network.
         # --> Hence, there is no need to create a new edge.

diff --git a/man/st_network_cost.Rd b/man/st_network_cost.Rd
diff --git a/vignettes/join_filter.Rmd b/vignettes/join_filter.Rmd
@@ -193,7 +193,7 @@ plot(st_geometry(joined, "edges"))
 plot(st_as_sf(joined, "nodes"), pch = 20, add = TRUE)
 ```
 
-In the example above, the polygons are spatially distinct. Hence, each node can only intersect with a single polygon. But what would happen if we do a join with polygons that overlap? The attributes from which polygon will then be attached to a node that intersects with multiple polygons at once? In `sf` this issue is solved by duplicating such a point as much times as the number of polygons it intersects with, and attaching attributes of each intersecting polygon to one of these duplicates. This approach does not fit the network case, however. An edge can only have a single node at each of its endpoints, and thus, the duplicated nodes will be isolated an be redundant in the network structure. Therefore, `sfnetworks` will only join the information from the first match whenever there are multiple matches for a single node. A warning is given in that case such that you are aware of the fact that not all information was joined into the network.
+In the example above, the polygons are spatially distinct. Hence, each node can only intersect with a single polygon. But what would happen if we do a join with polygons that overlap? The attributes from which polygon will then be attached to a node that intersects with multiple polygons at once? In `sf` this issue is solved by duplicating such a point as much times as the number of polygons it intersects with, and attaching attributes of each intersecting polygon to one of these duplicates. This approach does not fit the network case, however. An edge can only have a single node at each of its endpoints, and thus, the duplicated nodes will be isolated and will be redundant in the network structure. Therefore, `sfnetworks` will only join the information from the first match whenever there are multiple matches for a single node. A warning is given in that case such that you are aware of the fact that not all information was joined into the network.
 
 Note that in the case of joining on the edges, multiple matches per edge are not a problem for the network structure. It will simply duplicate the edge (i.e. creating a set of parallel edges) whenever this occurs.
 

diff --git a/vignettes/preprocess_and_clean.Rmd b/vignettes/preprocess_and_clean.Rmd
@@ -364,7 +364,7 @@ clustered %>%
 # For the others, which were used as grouping variables:
 # --> Drop these attributes.
 combinations = list(
-  is_priority = any,
+  is_priority = function(x) any(x),
   "ignore"
 )