From a4aadea1517b645c9ff217fa63743c44813a5a64 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Stephan=20H=C3=BCgel?= Date: Fri, 1 Nov 2024 00:08:08 +0000 Subject: [PATCH] We're using recursion, probably worth noting --- geo/src/algorithm/bool_ops/mod.rs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/geo/src/algorithm/bool_ops/mod.rs b/geo/src/algorithm/bool_ops/mod.rs index aa36fd6ec..3b061f0b7 100644 --- a/geo/src/algorithm/bool_ops/mod.rs +++ b/geo/src/algorithm/bool_ops/mod.rs @@ -168,7 +168,7 @@ pub trait UnaryUnion { // This function carries out a full post-order traversal of the tree, building up MultiPolygons from inside to outside. // Though the operation is carried out via fold() over the tree iterator, there are two actual nested operations: // "fold" operations on leaf nodes build up output MultiPolygons by adding Polygons to them via union and -// "reduce" operations on parent nodes combine these output MultiPolygons from leaf operations via union +// "reduce" operations on parent nodes combine these output MultiPolygons from leaf operations by recursion fn bottom_up_fold_reduce( tree: &RTree, mut init: I,