From 70fddcd6d4150a9ad1b7f76c4e33f2d0654c12c8 Mon Sep 17 00:00:00 2001
From: Andrew <andrew@digerati.co.nz>
Date: Thu, 4 Jun 2026 08:18:28 +1200
Subject: [PATCH] Faster matrix construction Also fix checks

---
 src/reduction/palette.rs | 15 +++++++++++----
 1 file changed, 11 insertions(+), 4 deletions(-)

diff --git a/src/reduction/palette.rs b/src/reduction/palette.rs
index 7d4864ad..b5f10f2f 100644
--- a/src/reduction/palette.rs
+++ b/src/reduction/palette.rs
@@ -267,24 +267,31 @@ fn co_occurrence_matrix(num_colors: usize, png: &PngImage) -> Vec<Vec<u32>> {
     for line in png.scan_lines(false) {
         for i in 0..line.data.len() {
             let val = line.data[i] as usize;
-            if val > num_colors {
+            if val >= num_colors {
                 continue;
             }
             if let Some(prev_val) = prev_val.replace(val) {
                 matrix[prev_val][val] += 1;
-                matrix[val][prev_val] += 1;
             }
             if let Some(prev) = &prev {
                 let prev_val = prev.data[i] as usize;
-                if prev_val > num_colors {
+                if prev_val >= num_colors {
                     continue;
                 }
                 matrix[prev_val][val] += 1;
-                matrix[val][prev_val] += 1;
             }
         }
         prev = Some(line);
     }
+
+    // Make the matrix symmetrical - this is faster to do afterward than maintaining symmetry during counting
+    #[allow(clippy::needless_range_loop)]
+    for i in 0..num_colors {
+        for j in 0..num_colors {
+            matrix[j][i] += matrix[i][j];
+            matrix[i][j] = matrix[j][i];
+        }
+    }
     matrix
 }