1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103

use std::collections::HashMap;

use chain_addr::Discrimination;
use jormungandr_lib::{
    crypto::account::Identifier,
    interfaces::{InitialUTxO, Value},
};

use crate::{
    registration::{Delegations, VotingRegistration},
    RawSnapshot,
};

pub struct Snapshot {
    inner: HashMap<Identifier, Vec<VotingRegistration>>,
}

impl Snapshot {
    #[must_use]
    #[allow(clippy::missing_panics_doc)] // The one possible panic shouldn't happen in reality.
    pub fn new(raw_snapshot: RawSnapshot, min_stake_threshold: Value) -> (Self, usize) {
        let mut total_rejected_registrations: usize = 0;

        let mut inner = raw_snapshot
            .0
            .into_iter()
            .filter(|r| {
                if let Delegations::New(ds) = &r.delegations {
                    if ds.len() != 1 {
                        // eprintln!(
                        //     "Multiple Delegations unsupported for SVE:\n{}",
                        //     serde_json::to_string_pretty(r).unwrap()
                        // );

                        total_rejected_registrations += 1;
                        return false;
                    }
                }

                true
            })
            .fold(HashMap::<Identifier, Vec<_>>::new(), |mut acc, r| {
                let k = match &r.delegations {
                    Delegations::New(ds) => ds.first().unwrap().0.clone(),
                    Delegations::Legacy(id) => id.clone(),
                };

                acc.entry(k).or_default().push(r);
                acc
            });

        // Because of multiple registrations to the same voting key,  we can only
        // filter once all registrations for the same key are known.
        // `min_stake_threshold` is the minimum stake for all registrations COMBINED.
        inner.retain(|_, regs| {
            let value: Value = regs
                .iter()
                .map(|reg| u64::from(reg.voting_power))
                .sum::<u64>()
                .into();

            // If the total stake across all registrations is < threshold, then they are all rejects.
            if value < min_stake_threshold {
                total_rejected_registrations += regs.len();
            }

            value >= min_stake_threshold
        });

        (Self { inner }, total_rejected_registrations)
    }

    #[must_use]
    pub fn to_block0_initials(
        &self,
        discrimination: Discrimination,
        lovelace: bool,
    ) -> Vec<InitialUTxO> {
        self.inner
            .iter()
            .map(|(vk, regs)| {
                let mut value: Value = regs
                    .iter()
                    .map(|reg| u64::from(reg.voting_power))
                    .sum::<u64>()
                    .into();

                //convert to ADA
                if !lovelace {
                    value = (u64::from(value) / 1_000_000).into();
                }

                let address = chain_addr::Address(
                    discrimination,
                    chain_addr::Kind::Account(vk.to_inner().into()),
                )
                .into();

                InitialUTxO { address, value }
            })
            .collect()
    }
}