fix(engine,server): safe area clamp, analytics batch, achievement save order, daily rollover, replay validation, leaderboard opt-in (#56, #60, #61, #62, #66, #68)

- #66: Clamp safe-area insets to 25% of window height with warn!() on excess
- #68: Move fire_flush outside per-event loop in analytics (batch flush once)
- #56: Persist progress before marking reward_granted to prevent XP loss on crash
- #60: Add DateRolloverTimer + check_date_rollover system for midnight seed refresh
- #62: Add validate_header() in replay upload with mode/draw_mode allowlists
- #61: Restore two-query leaderboard opt-in check (SELECT then UPDATE); original
       queries already in .sqlx cache; EXISTS variant would require sqlx prepare

Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com>

solitaire_core/src/deck.rs

@@ -1,13 +1,23 @@
-use rand::{seq::SliceRandom, SeedableRng};
-use rand::rngs::StdRng;
 use crate::card::{Card, Rank, Suit};
 use crate::pile::{Pile, PileType};
+use rand::rngs::StdRng;
+use rand::{SeedableRng, seq::SliceRandom};
 
 const ALL_SUITS: [Suit; 4] = [Suit::Clubs, Suit::Diamonds, Suit::Hearts, Suit::Spades];
 const ALL_RANKS: [Rank; 13] = [
-    Rank::Ace, Rank::Two, Rank::Three, Rank::Four, Rank::Five,
-    Rank::Six, Rank::Seven, Rank::Eight, Rank::Nine, Rank::Ten,
-    Rank::Jack, Rank::Queen, Rank::King,
+    Rank::Ace,
+    Rank::Two,
+    Rank::Three,
+    Rank::Four,
+    Rank::Five,
+    Rank::Six,
+    Rank::Seven,
+    Rank::Eight,
+    Rank::Nine,
+    Rank::Ten,
+    Rank::Jack,
+    Rank::Queen,
+    Rank::King,
 ];
 
 /// A standard 52-card deck.
@@ -23,7 +33,12 @@ impl Deck {
         let mut id = 0u32;
         for &suit in &ALL_SUITS {
             for &rank in &ALL_RANKS {
-                cards.push(Card { id, suit, rank, face_up: false });
+                cards.push(Card {
+                    id,
+                    suit,
+                    rank,
+                    face_up: false,
+                });
                 id += 1;
             }
         }
@@ -50,7 +65,11 @@ impl Default for Deck {
 /// Column `i` contains `i + 1` cards; only the top card is face-up.
 /// Stock receives the remaining 24 cards, all face-down.
 pub fn deal_klondike(deck: Deck) -> ([Pile; 7], Pile) {
-    debug_assert_eq!(deck.cards.len(), 52, "deal_klondike requires a full 52-card deck");
+    debug_assert_eq!(
+        deck.cards.len(),
+        52,
+        "deal_klondike requires a full 52-card deck"
+    );
     let mut tableau: [Pile; 7] = core::array::from_fn(|i| Pile::new(PileType::Tableau(i)));
     // Safety: the debug_assert above documents the 52-card contract; index arithmetic is bounded.
     let mut idx = 0usize;
@@ -102,21 +121,26 @@ mod tests {
 
     #[test]
     fn same_seed_produces_same_order() {
-        let mut d1 = Deck::new(); d1.shuffle(42);
-        let mut d2 = Deck::new(); d2.shuffle(42);
+        let mut d1 = Deck::new();
+        d1.shuffle(42);
+        let mut d2 = Deck::new();
+        d2.shuffle(42);
         assert_eq!(d1.cards, d2.cards);
     }
 
     #[test]
     fn different_seeds_produce_different_orders() {
-        let mut d1 = Deck::new(); d1.shuffle(1);
-        let mut d2 = Deck::new(); d2.shuffle(2);
+        let mut d1 = Deck::new();
+        d1.shuffle(1);
+        let mut d2 = Deck::new();
+        d2.shuffle(2);
         assert_ne!(d1.cards, d2.cards);
     }
 
     #[test]
     fn deal_klondike_correct_tableau_sizes() {
-        let mut deck = Deck::new(); deck.shuffle(0);
+        let mut deck = Deck::new();
+        deck.shuffle(0);
         let (tableau, stock) = deal_klondike(deck);
         for (i, pile) in tableau.iter().enumerate() {
             assert_eq!(pile.cards.len(), i + 1, "col {i} wrong size");
@@ -126,7 +150,8 @@ mod tests {
 
     #[test]
     fn deal_klondike_top_cards_are_face_up() {
-        let mut deck = Deck::new(); deck.shuffle(0);
+        let mut deck = Deck::new();
+        deck.shuffle(0);
         let (tableau, _) = deal_klondike(deck);
         for pile in &tableau {
             assert!(pile.cards.last().unwrap().face_up);
@@ -135,7 +160,8 @@ mod tests {
 
     #[test]
     fn deal_klondike_non_top_cards_are_face_down() {
-        let mut deck = Deck::new(); deck.shuffle(0);
+        let mut deck = Deck::new();
+        deck.shuffle(0);
         let (tableau, _) = deal_klondike(deck);
         for pile in &tableau {
             for card in &pile.cards[..pile.cards.len().saturating_sub(1)] {
@@ -146,17 +172,21 @@ mod tests {
 
     #[test]
     fn deal_klondike_stock_is_face_down() {
-        let mut deck = Deck::new(); deck.shuffle(0);
+        let mut deck = Deck::new();
+        deck.shuffle(0);
         let (_, stock) = deal_klondike(deck);
         assert!(stock.cards.iter().all(|c| !c.face_up));
     }
 
     #[test]
     fn deal_klondike_all_52_cards_present() {
-        let mut deck = Deck::new(); deck.shuffle(99);
+        let mut deck = Deck::new();
+        deck.shuffle(99);
         let (tableau, stock) = deal_klondike(deck);
         let mut ids: Vec<u32> = stock.cards.iter().map(|c| c.id).collect();
-        for pile in &tableau { ids.extend(pile.cards.iter().map(|c| c.id)); }
+        for pile in &tableau {
+            ids.extend(pile.cards.iter().map(|c| c.id));
+        }
         ids.sort_unstable();
         assert_eq!(ids, (0u32..52).collect::<Vec<_>>());
     }