From 82885267b9465b14d9d11a1f85f741f94ad8ccb2 Mon Sep 17 00:00:00 2001 From: Kilian Schuettler Date: Tue, 16 May 2023 15:45:38 +0200 Subject: [PATCH] RED-6009: Document Tree Structure * fixed boundary intersect --- .../v1/server/layoutparsing/document/graph/Boundary.java | 2 +- .../redaction/v1/server/document/graph/BoundaryTest.java | 3 +++ 2 files changed, 4 insertions(+), 1 deletion(-) diff --git a/redaction-service-v1/redaction-service-server-v1/src/main/java/com/iqser/red/service/redaction/v1/server/layoutparsing/document/graph/Boundary.java b/redaction-service-v1/redaction-service-server-v1/src/main/java/com/iqser/red/service/redaction/v1/server/layoutparsing/document/graph/Boundary.java index 467bfe9f..488f1f50 100644 --- a/redaction-service-v1/redaction-service-server-v1/src/main/java/com/iqser/red/service/redaction/v1/server/layoutparsing/document/graph/Boundary.java +++ b/redaction-service-v1/redaction-service-server-v1/src/main/java/com/iqser/red/service/redaction/v1/server/layoutparsing/document/graph/Boundary.java @@ -81,7 +81,7 @@ public class Boundary implements Comparable { public boolean intersects(Boundary boundary) { - return contains(boundary.start()) || contains(boundary.end() - 1); + return boundary.start() < this.end && this.start < boundary.end(); } diff --git a/redaction-service-v1/redaction-service-server-v1/src/test/java/com/iqser/red/service/redaction/v1/server/document/graph/BoundaryTest.java b/redaction-service-v1/redaction-service-server-v1/src/test/java/com/iqser/red/service/redaction/v1/server/document/graph/BoundaryTest.java index d58cc7d3..1168efdf 100644 --- a/redaction-service-v1/redaction-service-server-v1/src/test/java/com/iqser/red/service/redaction/v1/server/document/graph/BoundaryTest.java +++ b/redaction-service-v1/redaction-service-server-v1/src/test/java/com/iqser/red/service/redaction/v1/server/document/graph/BoundaryTest.java @@ -52,6 +52,9 @@ class BoundaryTest { assertTrue(startBoundary.intersects(new Boundary(11, 100))); assertFalse(startBoundary.intersects(new Boundary(100, 101))); assertTrue(startBoundary.intersects(new Boundary(99, 101))); + assertTrue(startBoundary.intersects(new Boundary(99, 101))); + assertTrue(startBoundary.intersects(new Boundary(9, 101))); + }