perf: batch ZIP size lookup in buildBookBin (O(n*m) → O(n log n))

Add ZipFile::fillUncompressedSizes() for single-pass ZIP central directory
scan with hash-based target matching.

Also apply clang-format fixes for CI.

Shadow Slave results:
- buildBookBin: 506s → 35s
- Total indexing: 8.7min → 50s

lib/Epub/Epub/parsers/ContentOpfParser.cpp

@@ -133,13 +133,12 @@ void XMLCALL ContentOpfParser::startElement(void* userData, const XML_Char* name
           "[%lu] [COF] Couldn't open temp items file for reading. This is probably going to be a fatal error.\n",
           millis());
     }
-    
+
     // Sort item index for binary search if we have enough items
     if (self->itemIndex.size() >= LARGE_SPINE_THRESHOLD) {
-      std::sort(self->itemIndex.begin(), self->itemIndex.end(),
-        [](const ItemIndexEntry& a, const ItemIndexEntry& b) {
-          return a.idHash < b.idHash || (a.idHash == b.idHash && a.idLen < b.idLen);
-        });
+      std::sort(self->itemIndex.begin(), self->itemIndex.end(), [](const ItemIndexEntry& a, const ItemIndexEntry& b) {
+        return a.idHash < b.idHash || (a.idHash == b.idHash && a.idLen < b.idLen);
+      });
       self->useItemIndex = true;
       Serial.printf("[%lu] [COF] Using fast index for %zu manifest items\n", millis(), self->itemIndex.size());
     }
@@ -252,10 +251,10 @@ void XMLCALL ContentOpfParser::startElement(void* userData, const XML_Char* name
             uint16_t targetLen = static_cast<uint16_t>(idref.size());
 
             auto it = std::lower_bound(self->itemIndex.begin(), self->itemIndex.end(),
-              ItemIndexEntry{targetHash, targetLen, 0},
-              [](const ItemIndexEntry& a, const ItemIndexEntry& b) {
-                return a.idHash < b.idHash || (a.idHash == b.idHash && a.idLen < b.idLen);
-              });
+                                       ItemIndexEntry{targetHash, targetLen, 0},
+                                       [](const ItemIndexEntry& a, const ItemIndexEntry& b) {
+                                         return a.idHash < b.idHash || (a.idHash == b.idHash && a.idLen < b.idLen);
+                                       });
 
             // Check for match (may need to check a few due to hash collisions)
             while (it != self->itemIndex.end() && it->idHash == targetHash) {

lib/Epub/Epub/parsers/ContentOpfParser.h

@@ -1,8 +1,8 @@
 #pragma once
 #include <Print.h>
 
-#include <vector>
 #include <algorithm>
+#include <vector>
 
 #include "Epub.h"
 #include "expat.h"