🐛 Fix wasm boolean paths with opposite winding operand (#11551)

backend/src/app/graph/arrow.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.graph.arrow
   "Bulk Ladybug ingest through in-memory Arrow.

backend/src/app/graph/debug.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.graph.debug
   "In-memory Ladybug sessions for the debug graph console."

backend/src/app/graph/ingest.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.graph.ingest
   "Penpot file -> Ladybug graph projection."

backend/src/app/graph/ladybug.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.graph.ladybug
   "Ladybug access layer for graph-backed Penpot.

backend/src/app/graph/meta.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.graph.meta
   "`GraphMeta`: the graph's own account of who built it and from what.

backend/src/app/graph/projection/document.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.graph.projection.document
   "Project a Penpot file-data map into Ladybug nodes and structural edges.

backend/src/app/graph/projection/transforms.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.graph.projection.transforms
   "Derived graph links: edges a reader could compute from the projected

backend/src/app/graph/report.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.graph.report
   (:require

backend/src/app/graph/schema.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.graph.schema
   "Ladybug DDL facade for the graph-backed Penpot vertical slice.

backend/src/app/graph/schema/contract.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.graph.schema.contract
   "Deliberate choices in Penpot's graph schema, recorded as data.

backend/src/app/graph/schema/nodes.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.graph.schema.nodes
   "Single source of truth for graph node tables.

backend/src/app/graph/schema/projection.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.graph.schema.projection
   "Derive Ladybug node column schemas from Penpot Malli sources.

backend/src/app/graph/schema/types.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.graph.schema.types
   "Map Malli schemas to Ladybug column types.

backend/src/app/graph/schema/values.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.graph.schema.values
   "Shape a Penpot value into the plain data its Ladybug column type wants.

backend/src/app/graph/stats.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.graph.stats
   (:require

backend/src/app/graph/sync.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.graph.sync
   "Incremental Ladybug graph updates from Penpot file-change events."

backend/src/app/rpc/commands/plugins.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.rpc.commands.plugins
   (:require

backend/src/app/storage/pending_gc.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.storage.pending-gc
   "A maintenance task that reclaims storage objects created in 'pending'

backend/src/app/tasks/demo_purge.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.tasks.demo-purge
   "Task handler for delayed demo profile deletion. Submitted at demo

backend/test/backend_tests/demo_test.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns backend-tests.demo-test
   (:require

backend/test/backend_tests/graph_binder_gate_test.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns backend-tests.graph-binder-gate-test
   "Binder gate for the incremental-sync statement templates.

backend/test/backend_tests/graph_sync_parity_test.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns backend-tests.graph-sync-parity-test
   "Cold projection and incremental sync are two implementations of one mapping,

backend/test/backend_tests/passwords_test.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns backend-tests.passwords-test
   (:require

backend/test/backend_tests/rpc_demo_test.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns backend-tests.rpc-demo-test
   (:require

backend/test/backend_tests/rpc_plugins_test.clj

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns backend-tests.rpc-plugins-test
   (:require

common/src/app/common/types/path/fit.cljc

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.common.types.path.fit
   "Curve fitting helpers."

common/src/app/common/types/path/selection.cljc

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.common.types.path.selection
   "Transforms selected path nodes and handlers."

common/src/app/common/types/tokens_status.cljc

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.common.types.tokens-status
   (:require

common/test/common_tests/files_migrations_0026_test.cljc

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns common-tests.files-migrations-0026-test
   (:require

common/test/common_tests/types/tokens_status_test.cljc

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns common-tests.types.tokens-status-test
   (:require

exporter/src/app/auth.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.auth
   "Resolves the caller's session cookie to a real profile id.

exporter/src/app/handlers/export.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.handlers.export
   "Handle export jobs"

exporter/src/app/handlers/jobs.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.handlers.jobs
   "REST surface for export jobs, under `/api/export/jobs`.

exporter/src/app/jobs.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.jobs
   "Export job model and lifecycle.

exporter/src/app/jobs/scheduler.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.jobs.scheduler
   "Admission control for export jobs.

exporter/src/app/jobs/store.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.jobs.store
   "Redis persistence for export jobs.

exporter/src/app/jobs/utils.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.jobs.utils
   "Temp file ownership for export jobs.

exporter/src/app/router.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.router
   "Method + path dispatch.

exporter/src/app/wasm/pool.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.wasm.pool
   "Pool of headless render workers.

exporter/src/app/wasm/render.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.wasm.render
   "Headless render pipeline: renders exports with the render-wasm Skia pipeline,

exporter/src/app/wasm/worker.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.wasm.worker
   "Render worker entry point.

exporter/test/exporter_tests/export_shapes_test.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns exporter-tests.export-shapes-test
   "Chunking of the browser backend."

exporter/test/exporter_tests/jobs_test.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns exporter-tests.jobs-test
   "Job state machine. Runs without redis: a store write with no connection is

exporter/test/exporter_tests/scheduler_test.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns exporter-tests.scheduler-test
   "Admission control. A headless job leases one render worker for its whole run,

exporter/test/exporter_tests/wasm_pool_test.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns exporter-tests.wasm-pool-test
   "Worker leasing, against a stub pool: `with-worker` must give the worker back

frontend/src/app/main/data/workspace/path/clipboard.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.main.data.workspace.path.clipboard
   (:require

frontend/src/app/main/ui/workspace/viewport/path_state.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns app.main.ui.workspace.viewport.path-state
   (:require

frontend/test/frontend_tests/logic/path_actions_test.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns frontend-tests.logic.path-actions-test
   (:require

frontend/test/frontend_tests/logic/path_clipboard_test.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 
 (ns frontend-tests.logic.path-clipboard-test

frontend/test/frontend_tests/logic/path_helpers_test.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 
 (ns frontend-tests.logic.path-helpers-test

frontend/test/frontend_tests/logic/path_lifecycle_test.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 
 (ns frontend-tests.logic.path-lifecycle-test

frontend/test/frontend_tests/logic/path_test_helpers.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 
 (ns frontend-tests.logic.path-test-helpers

frontend/test/frontend_tests/logic/path_tools_test.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 
 (ns frontend-tests.logic.path-tools-test

frontend/test/frontend_tests/logic/wasm_modifiers_nil_id_test.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns frontend-tests.logic.wasm-modifiers-nil-id-test
   "Reproduces the production crash \"Cannot read properties of null

frontend/test/frontend_tests/plugins/flex_test.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns frontend-tests.plugins.flex-test
   (:require

frontend/test/frontend_tests/plugins/user_test.cljs

@@ -2,7 +2,7 @@
 ;; License, v. 2.0. If a copy of the MPL was not distributed with this
 ;; file, You can obtain one at http://mozilla.org/MPL/2.0/.
 ;;
-;; Copyright (c) KALEIDOS INC Sucursal en España SL
+;; Copyright (c) KALEIDOS SUBSIDIARY SL
 
 (ns frontend-tests.plugins.user-test
   (:require

render-wasm/src/globals.rs

@@ -124,14 +124,21 @@ macro_rules! with_current_shape {
 #[cfg(test)]
 pub(crate) struct TestRenderResourcesGuard {
     prev: *mut RenderResources,
+    _lock: std::sync::MutexGuard<'static, ()>,
 }
 
+#[cfg(test)]
+static TEST_RENDER_RESOURCES_LOCK: std::sync::Mutex<()> = std::sync::Mutex::new(());
+
 #[cfg(test)]
 impl TestRenderResourcesGuard {
     pub(crate) fn install(resources: &mut RenderResources) -> Self {
+        let lock = TEST_RENDER_RESOURCES_LOCK
+            .lock()
+            .unwrap_or_else(|poisoned| poisoned.into_inner());
         let prev = unsafe { RENDER_RESOURCES };
         unsafe { RENDER_RESOURCES = resources as *mut _ };
-        Self { prev }
+        Self { prev, _lock: lock }
     }
 }
 

render-wasm/src/math/bools.rs

@@ -268,7 +268,6 @@ fn difference(
             .iter()
             .filter(|s| path_a.contains(to_point(s.evaluate(TValue::Parametric(0.5)))))
             .copied()
-            .map(|s| s.reverse())
             .map(|b| (BezierSource::B, b)),
     );
 
@@ -278,16 +277,53 @@ fn difference(
 fn exclusion(segments_a: Vec<Bezier>, segments_b: Vec<Bezier>) -> Vec<(BezierSource, Bezier)> {
     let mut result = Vec::new();
     result.extend(segments_a.iter().copied().map(|b| (BezierSource::A, b)));
-    result.extend(
-        segments_b
-            .iter()
-            .copied()
-            .map(|s| s.reverse())
-            .map(|b| (BezierSource::B, b)),
-    );
+    result.extend(segments_b.iter().copied().map(|b| (BezierSource::B, b)));
     result
 }
 
+// Mirrors `app.common.types.path.subpath/clockwise?`.
+fn is_clockwise(path: &Path) -> bool {
+    let mut points: Vec<(f32, f32)> = Vec::new();
+
+    for segment in path.segments().iter() {
+        match *segment {
+            Segment::MoveTo(p) => {
+                if !points.is_empty() {
+                    break;
+                }
+                points.push(p);
+            }
+            Segment::LineTo(p) => points.push(p),
+            Segment::CurveTo((_, _, p)) => points.push(p),
+            Segment::Close => break,
+        }
+    }
+
+    if points.len() < 3 {
+        return false;
+    }
+
+    let mut signed_area = 0.0f64;
+    for i in 0..points.len() {
+        let (x1, y1) = points[i];
+        let (x2, y2) = points[(i + 1) % points.len()];
+        signed_area += f64::from(x1) * f64::from(y2) - f64::from(x2) * f64::from(y1);
+    }
+
+    signed_area > 0.0
+}
+
+// The kept pieces of B must point the same way round as the kept pieces of A. Not the
+// `path.bool/content-bool-pair` rule, which reverses intersection on same winding and
+// relies on `subpath/merge-paths` flipping subpaths when it joins them.
+fn should_reverse_b(bool_type: BoolType, a_is_clockwise: bool, path_b: &Path) -> bool {
+    let same_winding = a_is_clockwise == is_clockwise(path_b);
+    match bool_type {
+        BoolType::Union | BoolType::Intersection => !same_winding,
+        BoolType::Difference | BoolType::Exclusion => same_winding,
+    }
+}
+
 #[derive(Debug, Clone, PartialEq, Copy)]
 enum BezierSource {
     A,
@@ -305,17 +341,14 @@ fn pop_first_from_pool(pool: &mut BezierPool) -> Option<(BezierSource, Bezier)>
     pool.iter_mut().find_map(|e| e.take())
 }
 
-// Find and remove the segment whose start point is closest to `end` within the
-// appropriate threshold. Same-source segments use a tight threshold
-// (INTERSECT_THRESHOLD_SAMEd) so we prefer staying on the same original path;
-// cross-source segments use a wider threshold (INTERSECT_THRESHOLD_DIFFERENT)
-// to allow switching paths at intersection points.
+// Same-source candidates get a tighter threshold so we stay on the original path. A
+// candidate that joins by its `end` points the wrong way, so we reverse it.
 fn find_next_in_pool(
     pool: &mut BezierPool,
     end: DVec2,
     source: BezierSource,
 ) -> Option<(BezierSource, Bezier)> {
-    let mut best_idx: Option<usize> = None;
+    let mut best: Option<(usize, bool)> = None;
     let mut best_dist_sq = f64::MAX;
 
     for (i, entry) in pool.iter().enumerate() {
@@ -327,16 +360,21 @@ fn find_next_in_pool(
         } else {
             INTERSECT_THRESHOLD_DIFFERENT as f64
         };
-        let dx = bezier.start.x - end.x;
-        let dy = bezier.start.y - end.y;
-        let dist_sq = dx * dx + dy * dy;
-        if dist_sq <= threshold * threshold && dist_sq < best_dist_sq {
-            best_dist_sq = dist_sq;
-            best_idx = Some(i);
+        for (reversed, point) in [(false, bezier.start), (true, bezier.end)] {
+            let dx = point.x - end.x;
+            let dy = point.y - end.y;
+            let dist_sq = dx * dx + dy * dy;
+            if dist_sq <= threshold * threshold && dist_sq < best_dist_sq {
+                best_dist_sq = dist_sq;
+                best = Some((i, reversed));
+            }
         }
     }
 
-    best_idx.and_then(|i| pool[i].take())
+    let (idx, reversed) = best?;
+    pool[idx]
+        .take()
+        .map(|(src, bezier)| (src, if reversed { bezier.reverse() } else { bezier }))
 }
 
 fn push_bezier(result: &mut Vec<Segment>, bezier: &Bezier) {
@@ -410,32 +448,45 @@ fn beziers_to_segments(beziers: &[(BezierSource, Bezier)]) -> Vec<Segment> {
     result
 }
 
-pub fn bool_from_shapes(bool_type: BoolType, children_ids: &[Uuid], shapes: ShapesPoolRef) -> Path {
-    if children_ids.is_empty() {
-        return Path::default();
+fn bool_beziers(
+    bool_type: BoolType,
+    path_a: &Path,
+    a_is_clockwise: bool,
+    path_b: &Path,
+) -> (Vec<(BezierSource, Bezier)>, bool) {
+    let (segs_a, mut segs_b) = split_segments(path_a, path_b);
+
+    if should_reverse_b(bool_type, a_is_clockwise, path_b) {
+        for segment in segs_b.iter_mut() {
+            *segment = segment.reverse();
+        }
     }
 
-    let Some(child) = shapes.get(&children_ids[children_ids.len() - 1]) else {
+    let beziers = match bool_type {
+        BoolType::Union => union(path_a, segs_a, path_b, segs_b),
+        BoolType::Difference => difference(path_a, segs_a, path_b, segs_b),
+        BoolType::Intersection => intersection(path_a, segs_a, path_b, segs_b),
+        BoolType::Exclusion => exclusion(segs_a, segs_b),
+    };
+
+    (beziers, path_a.is_even_odd() || path_b.is_even_odd())
+}
+
+// Fold `paths` left to right; the first entry is the base operand.
+fn bool_fold(bool_type: BoolType, paths: &[Path]) -> Path {
+    let Some((first, rest)) = paths.split_first() else {
         return Path::default();
     };
 
-    let mut current_path = child.to_path(shapes);
+    let mut current_path = first.clone();
+    // Every fold step chains A's fragments, which keep their direction, so the
+    // accumulated path keeps this winding. Carry it instead of re-reading it from the
+    // emitted segment list, whose subpath order and direction fall out of pool ordering.
+    let is_clockwise_a = is_clockwise(&current_path);
 
-    for idx in (0..children_ids.len() - 1).rev() {
-        let Some(other) = shapes.get(&children_ids[idx]) else {
-            continue;
-        };
-        let other_path = other.to_path(shapes);
-
-        let (segs_a, segs_b) = split_segments(&current_path, &other_path);
-
-        let is_even_odd = current_path.is_even_odd() || other_path.is_even_odd();
-        let beziers = match bool_type {
-            BoolType::Union => union(&current_path, segs_a, &other_path, segs_b),
-            BoolType::Difference => difference(&current_path, segs_a, &other_path, segs_b),
-            BoolType::Intersection => intersection(&current_path, segs_a, &other_path, segs_b),
-            BoolType::Exclusion => exclusion(segs_a, segs_b),
-        };
+    for other_path in rest {
+        let (beziers, is_even_odd) =
+            bool_beziers(bool_type, &current_path, is_clockwise_a, other_path);
 
         current_path = Path::new(beziers_to_segments(&beziers)).with_even_odd(is_even_odd);
     }
@@ -443,6 +494,16 @@ pub fn bool_from_shapes(bool_type: BoolType, children_ids: &[Uuid], shapes: Shap
     current_path
 }
 
+pub fn bool_from_shapes(bool_type: BoolType, children_ids: &[Uuid], shapes: ShapesPoolRef) -> Path {
+    let paths: Vec<Path> = children_ids
+        .iter()
+        .rev()
+        .filter_map(|id| shapes.get(id).map(|child| child.to_path(shapes)))
+        .collect();
+
+    bool_fold(bool_type, &paths)
+}
+
 pub fn update_bool_to_path(shape: &mut Shape, shapes: ShapesPoolRef) {
     let children_ids = shape.children_ids(true);
 
@@ -481,6 +542,7 @@ pub fn debug_render_bool_paths(
     };
 
     let mut current_path = child.to_path(shapes);
+    let is_clockwise_a = is_clockwise(&current_path);
 
     for idx in (0..children_ids.len() - 1).rev() {
         let Some(other) = shapes.get(&children_ids[idx]) else {
@@ -488,15 +550,12 @@ pub fn debug_render_bool_paths(
         };
         let other_path = other.to_path(shapes);
 
-        let (segs_a, segs_b) = split_segments(&current_path, &other_path);
-
-        let is_even_odd = current_path.is_even_odd() || other_path.is_even_odd();
-        let beziers = match bool_data.bool_type {
-            BoolType::Union => union(&current_path, segs_a, &other_path, segs_b),
-            BoolType::Difference => difference(&current_path, segs_a, &other_path, segs_b),
-            BoolType::Intersection => intersection(&current_path, segs_a, &other_path, segs_b),
-            BoolType::Exclusion => exclusion(segs_a, segs_b),
-        };
+        let (beziers, is_even_odd) = bool_beziers(
+            bool_data.bool_type,
+            &current_path,
+            is_clockwise_a,
+            &other_path,
+        );
         current_path = Path::new(beziers_to_segments(&beziers)).with_even_odd(is_even_odd);
 
         if idx == 0 {
@@ -572,3 +631,210 @@ pub fn debug_render_bool_paths(
         }
     }
 }
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    fn linear(from: (f64, f64), to: (f64, f64)) -> Bezier {
+        Bezier::from_linear_coordinates(from.0, from.1, to.0, to.1)
+    }
+
+    fn polygon(points: &[(f32, f32)]) -> Path {
+        let mut segments = vec![Segment::MoveTo(points[0])];
+        segments.extend(points[1..].iter().map(|p| Segment::LineTo(*p)));
+        segments.push(Segment::Close);
+        Path::new(segments)
+    }
+
+    fn count(segments: &[Segment], f: fn(&Segment) -> bool) -> usize {
+        segments.iter().filter(|s| f(s)).count()
+    }
+
+    fn is_move_to(s: &Segment) -> bool {
+        matches!(s, Segment::MoveTo(_))
+    }
+
+    fn is_close(s: &Segment) -> bool {
+        matches!(s, Segment::Close)
+    }
+
+    fn ring_area(ring: &[(f32, f32)]) -> f64 {
+        let mut area = 0.0f64;
+        for i in 0..ring.len() {
+            let (x1, y1) = ring[i];
+            let (x2, y2) = ring[(i + 1) % ring.len()];
+            area += f64::from(x1) * f64::from(y2) - f64::from(x2) * f64::from(y1);
+        }
+        area / 2.0
+    }
+
+    fn signed_area(segments: &[Segment]) -> f64 {
+        let mut total = 0.0f64;
+        let mut ring: Vec<(f32, f32)> = Vec::new();
+
+        for segment in segments {
+            match *segment {
+                Segment::MoveTo(p) => {
+                    total += ring_area(&ring);
+                    ring.clear();
+                    ring.push(p);
+                }
+                Segment::LineTo(p) | Segment::CurveTo((_, _, p)) => ring.push(p),
+                Segment::Close => {
+                    total += ring_area(&ring);
+                    ring.clear();
+                }
+            }
+        }
+
+        total + ring_area(&ring)
+    }
+
+    // Operands and expected results taken from the CLJS bool (`app.common.types.path.bool`)
+    // run on the same shapes: A clockwise, B and C counter-clockwise, all overlapping.
+    const A_CW: [(f32, f32); 4] = [
+        (100.0, 100.0),
+        (300.0, 100.0),
+        (300.0, 300.0),
+        (100.0, 300.0),
+    ];
+    const B_CCW: [(f32, f32); 4] = [
+        (200.0, 200.0),
+        (200.0, 400.0),
+        (400.0, 400.0),
+        (400.0, 200.0),
+    ];
+    const C_CCW: [(f32, f32); 4] = [(60.0, 240.0), (60.0, 360.0), (260.0, 360.0), (260.0, 240.0)];
+
+    #[test]
+    fn test_is_clockwise() {
+        let cw = Path::new(vec![
+            Segment::MoveTo((0.0, 0.0)),
+            Segment::LineTo((10.0, 0.0)),
+            Segment::LineTo((10.0, 10.0)),
+            Segment::LineTo((0.0, 10.0)),
+            Segment::Close,
+        ]);
+        assert!(is_clockwise(&cw));
+
+        let ccw = Path::new(vec![
+            Segment::MoveTo((0.0, 0.0)),
+            Segment::LineTo((0.0, 10.0)),
+            Segment::LineTo((10.0, 10.0)),
+            Segment::LineTo((10.0, 0.0)),
+            Segment::Close,
+        ]);
+        assert!(!is_clockwise(&ccw));
+    }
+
+    #[test]
+    fn test_should_reverse_b_only_depends_on_relative_winding() {
+        let cw = Path::new(vec![
+            Segment::MoveTo((0.0, 0.0)),
+            Segment::LineTo((10.0, 0.0)),
+            Segment::LineTo((10.0, 10.0)),
+            Segment::LineTo((0.0, 10.0)),
+            Segment::Close,
+        ]);
+        let ccw = Path::new(vec![
+            Segment::MoveTo((0.0, 0.0)),
+            Segment::LineTo((0.0, 10.0)),
+            Segment::LineTo((10.0, 10.0)),
+            Segment::LineTo((10.0, 0.0)),
+            Segment::Close,
+        ]);
+
+        assert!(should_reverse_b(BoolType::Difference, true, &cw));
+        assert!(!should_reverse_b(BoolType::Difference, true, &ccw));
+        assert!(!should_reverse_b(BoolType::Union, true, &cw));
+        assert!(should_reverse_b(BoolType::Union, true, &ccw));
+    }
+
+    // Fragments from #11482: two point the wrong way, so joining them start-to-start only
+    // left five open subpaths.
+    #[test]
+    fn test_beziers_to_segments_closes_reversed_fragments() {
+        let beziers = vec![
+            (
+                BezierSource::A,
+                linear((2764.00, -240.00), (2834.74, -110.71)),
+            ),
+            (
+                BezierSource::A,
+                linear((2809.29, -85.26), (2693.26, -201.29)),
+            ),
+            (
+                BezierSource::A,
+                linear((2718.71, -226.74), (2764.00, -240.00)),
+            ),
+            (
+                BezierSource::B,
+                linear((2718.71, -226.74), (2834.74, -110.71)),
+            ),
+            (
+                BezierSource::B,
+                linear((2809.29, -85.26), (2693.26, -201.29)),
+            ),
+        ];
+
+        let segments = beziers_to_segments(&beziers);
+
+        let moves = segments
+            .iter()
+            .filter(|s| matches!(s, Segment::MoveTo(_)))
+            .count();
+        let closes = segments
+            .iter()
+            .filter(|s| matches!(s, Segment::Close))
+            .count();
+
+        assert_eq!(moves, 2);
+        assert_eq!(closes, 2);
+        // 3 fragments in the first subpath, 2 in the second, each dropping its closing LineTo.
+        assert_eq!(segments.len(), 7);
+    }
+
+    // #11482: A clockwise, B counter-clockwise. Reference (CLJS):
+    // M100,100 L300,100 L300,200 L200,200 L200,300 L100,300 Z
+    #[test]
+    fn test_difference_with_opposite_winding_operand() {
+        let result = bool_fold(BoolType::Difference, &[polygon(&A_CW), polygon(&B_CCW)]);
+        let segments = result.segments();
+
+        assert_eq!(count(segments, is_move_to), 1);
+        assert_eq!(count(segments, is_close), 1);
+        assert!((signed_area(segments) - 30000.0).abs() < 1.0);
+        assert!(is_clockwise(&result));
+    }
+
+    // Reference (CLJS):
+    // M100,100 L300,100 L300,200 L400,200 L400,400 L200,400 L200,300 L100,300 Z
+    #[test]
+    fn test_union_with_opposite_winding_operand() {
+        let result = bool_fold(BoolType::Union, &[polygon(&A_CW), polygon(&B_CCW)]);
+        let segments = result.segments();
+
+        assert_eq!(count(segments, is_move_to), 1);
+        assert_eq!(count(segments, is_close), 1);
+        assert!((signed_area(segments) - 70000.0).abs() < 1.0);
+        assert!(is_clockwise(&result));
+    }
+
+    // The second fold step must compare against A's winding, not against the winding of
+    // the intermediate path, whose subpath order and direction fall out of pool ordering.
+    // Reference (CLJS): M100,100 L300,100 L300,200 L200,200 L200,240 L100,240 Z
+    #[test]
+    fn test_difference_folds_three_opposite_winding_operands() {
+        let result = bool_fold(
+            BoolType::Difference,
+            &[polygon(&A_CW), polygon(&B_CCW), polygon(&C_CCW)],
+        );
+        let segments = result.segments();
+
+        assert_eq!(count(segments, is_move_to), 1);
+        assert_eq!(count(segments, is_close), 1);
+        assert!((signed_area(segments) - 24000.0).abs() < 1.0);
+        assert!(is_clockwise(&result));
+    }
+}

scripts/replace-copyright.sh

@@ -173,9 +173,11 @@ main() {
         fi
     done
 
-    # Get tracked files matching our extensions
-    local files
-    files=$(git ls-files | grep -E "\.(${EXTENSIONS})$" || true)
+    # Get tracked files matching our extensions, excluding this script itself
+    # (it mentions the search string in its own usage docs).
+    local files script_name
+    script_name=$(basename "$0")
+    files=$(git ls-files | grep -E "\.(${EXTENSIONS})$" | grep -v -F "$script_name" || true)
 
     if [[ -z "$files" ]]; then
         log_warn "No tracked files found matching extensions: ${EXTENSIONS}"