From ceebbd8d9ff74dbc7e5f0531991362f5ac2730a8 Mon Sep 17 00:00:00 2001
From: "google-labs-jules[bot]"
 <161369871+google-labs-jules[bot]@users.noreply.github.com>
Date: Mon, 15 Jun 2026 09:00:02 +0000
Subject: [PATCH] Optimize L5 code generation inner loop using branchless math

Replaced conditional ternary logic with bitwise arithmetic to
ensure deterministic branchless execution during PRN generation.

Co-authored-by: shuwang1 <12467002+shuwang1@users.noreply.github.com>
---
 Sources/GNSSCodes/GPS.swift | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/Sources/GNSSCodes/GPS.swift b/Sources/GNSSCodes/GPS.swift
index fb3c2a9..504917e 100644
--- a/Sources/GNSSCodes/GPS.swift
+++ b/Sources/GNSSCodes/GPS.swift
@@ -440,7 +440,9 @@ extension GNSSCodes {
         
         var code = [Int16](repeating: 0, count: LEN_L5)
         for i in 0..<LEN_L5 {
-            code[i] = ((xa & 1) ^ (xb & 1)) != 0 ? 1 : -1
+            // ⚡ Bolt: Branchless math eliminates conditional ternary branch for code assignment
+            let output = (xa & 1) ^ (xb & 1)
+            code[i] = Int16(output << 1) - Int16(1)
             
             if xa == XA_DECODE {
                 xa = 0x1FFF