more AI optimizations, reworked logger

src/backend/thread_neweditions.py

@@ -1,37 +1,24 @@
 import os
 import re
-import sys
 from concurrent.futures import ThreadPoolExecutor
-from datetime import datetime
 from math import ceil
 from queue import Empty, Queue
 from time import monotonic  # <-- NEW
 from typing import List, Optional
 
-import loguru
 from PySide6.QtCore import QThread, Signal
 
-from src import LOG_DIR
-
 # from src.logic.webrequest import BibTextTransformer, WebRequest
 from src.backend.catalogue import Catalogue
 from src.logic import BookData
 from src.logic.SRU import SWB
+from src.shared.logging import log
 
 # use all available cores - 2, but at least 1
 THREAD_COUNT = max(os.cpu_count() - 2, 1)
 THREAD_MIN_ITEMS = 5
 
-log = loguru.logger
-log.remove()
-log.add(sys.stdout, level="INFO")
-log.add(f"{LOG_DIR}/application.log", rotation="1 MB", retention="10 days")
-
-log.add(
-    f"{LOG_DIR}/{datetime.now().strftime('%Y-%m-%d')}.log",
-    rotation="1 day",
-    retention="7 days",
-)
+# Logger configured centrally in main; use shared `log`
 
 swb = SWB()
 dnb = SWB()
@@ -146,7 +133,7 @@ def find_newer_edition(
     if not deduped:
         return None
 
-    # 3) Final pick (single best)
+    # 3) Preserve all qualifying newer editions, but order by preference
     def sort_key(b: BookData):
         year = b.year if b.year is not None else -1
         ed = b.edition_number if b.edition_number is not None else -1
@@ -158,8 +145,8 @@ def find_newer_edition(
             ed,
         )
 
-    best = max(deduped, key=sort_key)
-    return [best] if best else None
+    deduped.sort(key=sort_key, reverse=True)
+    return deduped
 
 
 class NewEditionCheckerThread(QThread):