BFlat
cc3052de5e
M8: cap the input of boolean operations ( #1104 ) ( #1581 )
...
Each sweep takes at most 250 000 segments and 2 million possible crossings (pairs of segments whose bounds overlap, counted in O(n log n)), and a fold at most 4 million segments swept over its steps; past them the operation is refused with PathOpsError::TooComplex before it runs. A boolean group past the caps draws without its result, with a warning once, and the refusal is cached; vector.flatten refuses it instead of dropping it.
2026-10-30 06:03:35 +07:00
..
2026-10-14 18:45:15 +03:00
2026-10-12 01:32:04 +07:00
2026-10-28 16:00:36 +00:00
2026-10-10 17:20:07 +07:00
2026-10-10 17:20:07 +07:00
2026-10-30 06:03:35 +07:00
2026-10-30 06:03:35 +07:00
2026-10-30 06:03:35 +07:00
2026-10-16 13:20:53 +03:00
2026-10-29 14:44:18 +00:00
2026-10-29 14:44:18 +00:00
2026-10-30 06:03:35 +07:00
2026-10-10 17:20:07 +07:00
2026-10-15 11:12:25 +00:00
2026-10-14 05:23:28 +07:00
2026-10-27 17:43:23 +01:00
2026-10-11 11:51:37 +07:00
2026-10-16 06:01:49 +07:00
2026-10-16 06:01:49 +07:00
2026-10-28 16:00:36 +00:00
2026-10-10 11:59:59 +07:00
2026-10-12 01:32:04 +07:00
2026-10-13 13:36:54 +07:00
2026-10-29 18:14:18 +07:00
2026-10-12 00:11:43 +07:00
2026-10-12 00:11:43 +07:00
2026-10-29 15:43:08 +07:00
2026-10-29 18:14:18 +07:00
2026-10-29 17:42:53 +07:00
2026-10-29 18:14:18 +07:00
2026-10-29 21:33:46 +07:00
2026-10-30 06:03:35 +07:00
2026-10-29 18:14:18 +07:00
2026-10-29 18:14:18 +07:00
2026-10-26 03:23:56 -04:00
2026-10-29 21:33:46 +07:00
2026-10-15 19:36:39 -05:00
2026-10-29 18:14:18 +07:00
2026-10-29 18:14:18 +07:00
2026-10-10 17:20:07 +07:00
2026-10-10 18:40:26 +07:00
2026-10-29 23:08:12 +09:00
2026-10-29 22:37:35 +09:00
2026-10-10 21:58:01 +07:00
2026-10-29 15:43:08 +07:00
2026-10-10 23:29:17 +07:00
2026-10-10 11:59:59 +07:00
2026-10-26 21:33:56 +01:00
2026-10-10 10:12:21 +07:00