kevy-elect 1.28.0

use std::time::{Duration, Instant};

use crate::elector::{ElectConfig, ElectJitter, Elector};
use crate::message::{Message, Role};

#[cfg(test)]
mod tests {
    use super::*;

    fn now() -> Instant {
        Instant::now()
    }

    fn cfg_fast() -> ElectConfig {
        ElectConfig {
            hb_interval: Duration::from_millis(10),
            down_after: Duration::from_millis(100),
            election_timeout: Duration::from_millis(80),
            election_backoff: Duration::from_millis(20),
            election_backoff_jitter: Duration::from_millis(0),
        }
    }

    fn mk(node: &str, peers: &[&str], role: Role) -> Elector {
        Elector::new(
            node,
            peers.iter().map(|s| s.to_string()).collect(),
            format!("10.0.0.{}:6004", node.bytes().last().unwrap_or(b'1') as u32 - 48),
            role,
            cfg_fast(),
            ElectJitter::Fixed(Duration::from_millis(0)),
        )
    }

    #[test]
    fn quorum_3_is_2() {
        let e = mk("a", &["a", "b", "c"], Role::Replica);
        assert_eq!(e.quorum_size(), 2);
    }

    #[test]
    fn quorum_5_is_3() {
        let e = mk("a", &["a", "b", "c", "d", "e"], Role::Replica);
        assert_eq!(e.quorum_size(), 3);
    }

    #[test]
    fn quorum_2_is_2_degenerate() {
        let e = mk("a", &["a", "b"], Role::Replica);
        assert_eq!(e.quorum_size(), 2);
    }

    #[test]
    fn tick_emits_one_hb_per_peer_per_interval() {
        let mut e = mk("a", &["a", "b", "c"], Role::Replica);
        let t0 = now();
        let out = e.tick(t0);
        // 2 peers (b, c), self skipped → 2 HBs.
        assert_eq!(out.len(), 2);
        assert!(out.iter().all(|o| matches!(o.msg, Message::Hb { .. })));
        // A second tick within `hb_interval` emits nothing.
        let out2 = e.tick(t0 + Duration::from_millis(1));
        assert!(out2.is_empty());
        // After hb_interval elapses, another batch.
        let out3 = e.tick(t0 + Duration::from_millis(11));
        assert_eq!(out3.len(), 2);
    }

    #[test]
    fn replica_with_alive_primary_does_not_elect() {
        let mut e = mk("a", &["a", "b", "c"], Role::Replica);
        e.force_known_primary("c"); // c is primary
        let t0 = now();
        // Primary alive — HB just received.
        e.on_message(
            "c",
            Message::Hb {
                epoch: 1,
                node_id: "c".to_string(),
                role: Role::Primary,
                repl_offset: 100,
            },
            t0,
        );
        let out = e.tick(t0);
        assert!(out.iter().all(|o| matches!(o.msg, Message::Hb { .. })));
        assert_eq!(e.role(), Role::Replica);
    }

    #[test]
    fn replica_starts_candidacy_when_primary_down_and_im_best() {
        let mut e = mk("a", &["a", "b", "c"], Role::Replica);
        e.force_known_primary("c"); // c is primary
        e.set_repl_offset(100);
        let t0 = now();
        // No HB from primary ever → DOWN by default. Also b is
        // alive but with lower offset.
        e.on_message(
            "b",
            Message::Hb {
                epoch: 1,
                node_id: "b".to_string(),
                role: Role::Replica,
                repl_offset: 50,
            },
            t0,
        );
        let out = e.tick(t0 + Duration::from_millis(101)); // DOWN window crossed
        // Expect: some HBs + one OFFER broadcast.
        let offers: Vec<_> = out
            .iter()
            .filter(|o| matches!(o.msg, Message::Offer { .. }))
            .collect();
        assert_eq!(offers.len(), 1, "expected one OFFER, out: {out:?}");
        assert_eq!(e.role(), Role::Candidate);
        assert_eq!(e.epoch(), 2);
    }

    #[test]
    fn candidate_with_lower_offset_loses_to_higher() {
        let mut e = mk("a", &["a", "b", "c"], Role::Replica);
        e.set_repl_offset(50);
        // Primary c never sends HB → DOWN-by-default at any tick
        // time. b sends a recent HB so it's still alive when the
        // tick fires — the test point is: b's higher offset
        // disqualifies a from candidacy.
        let t0 = now();
        let trigger_at = t0 + Duration::from_millis(101); // > down_after for primary
        e.on_message(
            "b",
            Message::Hb {
                epoch: 1,
                node_id: "b".to_string(),
                role: Role::Replica,
                repl_offset: 100,
            },
            trigger_at - Duration::from_millis(20), // 20 ms < 100 ms down_after
        );
        e.force_known_primary("c");
        let out = e.tick(trigger_at);
        // a should NOT have started candidacy (b is better).
        assert!(
            !out.iter().any(|o| matches!(o.msg, Message::Offer { .. })),
            "out: {out:?}"
        );
        assert_eq!(e.role(), Role::Replica);
    }

    #[test]
    fn quorum_accept_promotes_candidate_to_primary() {
        let mut e = mk("a", &["a", "b", "c"], Role::Replica);
        e.set_repl_offset(100);
        e.force_known_primary("c");
        let t0 = now();
        e.on_message(
            "b",
            Message::Hb {
                epoch: 1,
                node_id: "b".to_string(),
                role: Role::Replica,
                repl_offset: 50,
            },
            t0,
        );
        // Start candidacy.
        let _ = e.tick(t0 + Duration::from_millis(101));
        assert_eq!(e.role(), Role::Candidate);
        // Peer b ACCEPTs.
        e.on_message(
            "b",
            Message::Accept {
                epoch: 2,
                accepter_id: "b".to_string(),
            },
            t0 + Duration::from_millis(102),
        );
        // Self-vote (1) + b's vote (1) = 2 = quorum for N=3.
        let out = e.tick(t0 + Duration::from_millis(103));
        let announces: Vec<_> = out
            .iter()
            .filter(|o| matches!(o.msg, Message::Announce { .. }))
            .collect();
        assert_eq!(announces.len(), 1);
        assert_eq!(e.role(), Role::Primary);
        assert_eq!(e.current_primary(), Some("a"));
    }

    #[test]
    fn replica_demotes_on_announce_for_newer_epoch() {
        let mut e = mk("a", &["a", "b", "c"], Role::Primary);
        let t0 = now();
        e.epoch = 1;
        // Sibling claims higher epoch.
        e.on_message(
            "b",
            Message::Announce {
                epoch: 2,
                new_primary_id: "b".to_string(),
                new_primary_addr: "10.0.0.2:6004".to_string(),
            },
            t0,
        );
        assert_eq!(e.role(), Role::Replica);
        assert_eq!(e.current_primary(), Some("b"));
        assert_eq!(e.epoch(), 2);
    }

    #[test]
    fn announce_for_self_keeps_primary_role() {
        let mut e = mk("a", &["a", "b", "c"], Role::Candidate);
        e.epoch = 5;
        let t0 = now();
        e.on_message(
            "a",
            Message::Announce {
                epoch: 5,
                new_primary_id: "a".to_string(),
                new_primary_addr: "10.0.0.1:6004".to_string(),
            },
            t0,
        );
        assert_eq!(e.role(), Role::Primary);
    }

    #[test]
    fn dueling_candidates_tied_offset_lower_node_id_wins() {
        // a + b tie on offset; a's id < b's. b receives a's OFFER
        // with the same offset, rejects → no ACCEPT from b.
        // Symmetrically, a receives b's OFFER with same offset
        // and HIGHER node-id → a ACCEPTs.
        let mut a = mk("a", &["a", "b", "c"], Role::Replica);
        let mut b = mk("b", &["a", "b", "c"], Role::Replica);
        a.set_repl_offset(100);
        b.set_repl_offset(100);

        let out_b_to_a = b.on_message(
            "a", // received from "a"
            Message::Offer {
                new_epoch: 2,
                candidate_id: "a".to_string(),
                repl_offset: 100,
            },
            now(),
        );
        assert!(out_b_to_a.iter().any(|o| matches!(o.msg, Message::Accept { .. })),
            "b should ACCEPT a's OFFER (a < b by node-id tiebreak)");

        let out_a_to_b = a.on_message(
            "b",
            Message::Offer {
                new_epoch: 2,
                candidate_id: "b".to_string(),
                repl_offset: 100,
            },
            now(),
        );
        assert!(out_a_to_b.is_empty(),
            "a should REJECT b's OFFER (a < b)");
    }

    #[test]
    fn accept_only_once_per_epoch() {
        let mut e = mk("c", &["a", "b", "c"], Role::Replica);
        let out1 = e.on_message(
            "a",
            Message::Offer {
                new_epoch: 2,
                candidate_id: "a".to_string(),
                repl_offset: 100,
            },
            now(),
        );
        assert_eq!(out1.len(), 1);
        // b ALSO sends an OFFER in the same epoch — c must NOT
        // ACCEPT again.
        let out2 = e.on_message(
            "b",
            Message::Offer {
                new_epoch: 2,
                candidate_id: "b".to_string(),
                repl_offset: 100,
            },
            now(),
        );
        assert!(out2.is_empty(), "c already voted in epoch 2");
    }

    #[test]
    fn stale_epoch_offer_rejected() {
        let mut e = mk("c", &["a", "b", "c"], Role::Replica);
        e.epoch = 5;
        let out = e.on_message(
            "a",
            Message::Offer {
                new_epoch: 3, // stale
                candidate_id: "a".to_string(),
                repl_offset: 999,
            },
            now(),
        );
        assert!(out.is_empty());
    }

    #[test]
    fn old_primary_rejoin_demotes_on_higher_epoch_hb() {
        let mut e = mk("a", &["a", "b", "c"], Role::Primary);
        e.epoch = 1;
        let t0 = now();
        // Partition healed — sibling reports epoch 2 as primary.
        e.on_message(
            "b",
            Message::Hb {
                epoch: 2,
                node_id: "b".to_string(),
                role: Role::Primary,
                repl_offset: 200,
            },
            t0,
        );
        assert_eq!(e.role(), Role::Replica);
        assert_eq!(e.current_primary(), Some("b"));
        assert_eq!(e.epoch(), 2);
    }

    #[test]
    fn election_timeout_falls_back_to_replica_with_backoff() {
        let mut e = mk("a", &["a", "b", "c"], Role::Replica);
        e.set_repl_offset(100);
        e.force_known_primary("c");
        let t0 = now();
        e.on_message(
            "b",
            Message::Hb {
                epoch: 1,
                node_id: "b".to_string(),
                role: Role::Replica,
                repl_offset: 50,
            },
            t0,
        );
        // Start candidacy.
        let _ = e.tick(t0 + Duration::from_millis(101));
        assert_eq!(e.role(), Role::Candidate);
        // No ACCEPTs arrive. Election timeout fires.
        let _ = e.tick(t0 + Duration::from_millis(101 + 81));
        assert_eq!(e.role(), Role::Replica);
        assert!(e.backoff_until.is_some());
    }

    #[test]
    fn split_brain_minority_cannot_promote() {
        // N=3, minority = 1 node (a). a sees primary c DOWN +
        // partner b DOWN. a starts candidacy, but no ACCEPTs
        // arrive → timeout → backoff. role stays Replica
        // (never reaches Primary).
        let mut a = mk("a", &["a", "b", "c"], Role::Replica);
        a.set_repl_offset(100);
        a.force_known_primary("c");
        let t0 = now();
        // a starts candidacy (no peer HBs since boot → DOWN-by-default).
        let _ = a.tick(t0 + Duration::from_millis(101));
        assert_eq!(a.role(), Role::Candidate);
        // No ACCEPTs (b + c are partitioned away).
        let _ = a.tick(t0 + Duration::from_millis(101 + 81));
        // Falls back to Replica.
        assert_eq!(a.role(), Role::Replica);
        // a NEVER reached Primary — split-brain protected.
        assert!(a.current_primary() != Some("a"));
    }

    #[test]
    fn n2_degenerate_needs_both_alive() {
        // N=2, quorum=2. a starts candidacy with self-vote = 1,
        // needs b's ACCEPT to reach 2. Without b, falls back.
        let mut a = mk("a", &["a", "b"], Role::Replica);
        a.set_repl_offset(100);
        a.force_known_primary("b");
        let t0 = now();
        let _ = a.tick(t0 + Duration::from_millis(101));
        assert_eq!(a.role(), Role::Candidate);
        // Election times out, no ACCEPT.
        let _ = a.tick(t0 + Duration::from_millis(101 + 81));
        assert_eq!(a.role(), Role::Replica);
    }
}