From 33cd18d64ea3a67b90aa87b225b0d18447f01138 Mon Sep 17 00:00:00 2001 From: Eduard Braun Date: Tue, 2 Oct 2018 01:21:40 +0200 Subject: 2geom: update to c709d6b6780098d3e53363d925f7aee3c2640478 Update README and remove obsolete files --- src/2geom/intersection-graph.cpp | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) (limited to 'src/2geom/intersection-graph.cpp') diff --git a/src/2geom/intersection-graph.cpp b/src/2geom/intersection-graph.cpp index cac010942..4ee4f65fa 100644 --- a/src/2geom/intersection-graph.cpp +++ b/src/2geom/intersection-graph.cpp @@ -174,7 +174,7 @@ void PathIntersectionGraph::_assignEdgeWindingParities(Coord precision) void PathIntersectionGraph::_assignComponentStatusFromDegenerateIntersections() { // If a path has only degenerate intersections, assign its status now. - // This protects against later accidentaly picking a point for winding + // This protects against later accidentally picking a point for winding // determination that is exactly at a removed intersection. for (unsigned w = 0; w < 2; ++w) { for (unsigned li = 0; li < _components[w].size(); ++li) { @@ -410,10 +410,10 @@ PathVector PathIntersectionGraph::_getResult(bool enter_a, bool enter_b) assert(!result.back().empty()); } - if (n_processed != size() * 2) { + /*if (n_processed != size() * 2) { std::cerr << "Processed " << n_processed << " intersections, expected " << (size() * 2) << std::endl; - } - //assert(n_processed == size() * 2); + }*/ + assert(n_processed == size() * 2); return result; } -- cgit v1.2.3