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/pile.rs

@@ -1,5 +1,5 @@
-use serde::{Deserialize, Serialize};
 use crate::card::{Card, Suit};
+use serde::{Deserialize, Serialize};
 
 /// Identifies which pile on the board a set of cards belongs to.
 #[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Serialize, Deserialize)]
@@ -28,7 +28,10 @@ pub struct Pile {
 impl Pile {
     /// Creates a new empty pile of the given type.
     pub fn new(pile_type: PileType) -> Self {
-        Self { pile_type, cards: Vec::new() }
+        Self {
+            pile_type,
+            cards: Vec::new(),
+        }
     }
 
     /// Returns a reference to the top (last) card, or `None` if empty.
@@ -61,8 +64,18 @@ mod tests {
     #[test]
     fn pile_top_returns_last_card() {
         let mut pile = Pile::new(PileType::Waste);
-        pile.cards.push(Card { id: 0, suit: Suit::Hearts, rank: Rank::Ace, face_up: true });
-        pile.cards.push(Card { id: 1, suit: Suit::Clubs, rank: Rank::Two, face_up: true });
+        pile.cards.push(Card {
+            id: 0,
+            suit: Suit::Hearts,
+            rank: Rank::Ace,
+            face_up: true,
+        });
+        pile.cards.push(Card {
+            id: 1,
+            suit: Suit::Clubs,
+            rank: Rank::Two,
+            face_up: true,
+        });
         assert_eq!(pile.top().unwrap().id, 1);
     }
 
@@ -91,15 +104,30 @@ mod tests {
     #[test]
     fn claimed_suit_is_none_for_non_foundation() {
         let mut pile = Pile::new(PileType::Tableau(0));
-        pile.cards.push(Card { id: 0, suit: Suit::Hearts, rank: Rank::Ace, face_up: true });
+        pile.cards.push(Card {
+            id: 0,
+            suit: Suit::Hearts,
+            rank: Rank::Ace,
+            face_up: true,
+        });
         assert!(pile.claimed_suit().is_none());
     }
 
     #[test]
     fn claimed_suit_returns_bottom_card_suit() {
         let mut pile = Pile::new(PileType::Foundation(2));
-        pile.cards.push(Card { id: 0, suit: Suit::Hearts, rank: Rank::Ace, face_up: true });
-        pile.cards.push(Card { id: 1, suit: Suit::Hearts, rank: Rank::Two, face_up: true });
+        pile.cards.push(Card {
+            id: 0,
+            suit: Suit::Hearts,
+            rank: Rank::Ace,
+            face_up: true,
+        });
+        pile.cards.push(Card {
+            id: 1,
+            suit: Suit::Hearts,
+            rank: Rank::Two,
+            face_up: true,
+        });
         assert_eq!(pile.claimed_suit(), Some(Suit::Hearts));
     }
 }