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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124

use core::ops::Range;
use std::collections::HashMap;
use thiserror::Error;

fn levels(threshold: u64) -> Result<Vec<Range<u64>>, Error> {
    if !(450..=1_000).contains(&threshold) {
        return Err(Error::InvalidThreshold(threshold));
    }

    Ok(vec![
        (0..450),
        (450..threshold),
        (threshold..1_000),
        (1_000..2_000),
        (2_000..5_000),
        (5_000..10_000),
        (10_000..20_000),
        (20_000..50_000),
        (50_000..100_000),
        (100_000..250_000),
        (250_000..500_000),
        (500_000..1_000_000),
        (1_000_000..5_000_000),
        (5_000_000..10_000_000),
        (10_000_000..25_000_000),
        (25_000_000..50_000_000),
        (50_000_000..32_000_000_000),
    ])
}

#[derive(Default)]
pub struct Record {
    pub count: u32,
    pub total: u64,
}

pub struct Stats {
    pub content: HashMap<Range<u64>, Record>,
}

impl Stats {
    pub fn new(threshold: u64) -> Result<Self, Error> {
        Ok(Self::new_with_levels(levels(threshold)?))
    }

    pub fn new_with_levels(levels: Vec<Range<u64>>) -> Self {
        Self {
            content: levels
                .into_iter()
                .map(|range| (range, Default::default()))
                .collect(),
        }
    }

    pub fn add_with_weight(&mut self, value: u64, weight: u32) {
        for (range, record) in self.content.iter_mut() {
            if range.contains(&value) {
                record.count += weight;
                record.total += value;
                return;
            }
        }
    }

    pub fn add(&mut self, value: u64) {
        self.add_with_weight(value, 1);
    }

    pub fn print_count_per_level(&self) {
        let mut keys = self.content.keys().cloned().collect::<Vec<Range<u64>>>();
        keys.sort_by_key(|x| x.start);

        for key in keys {
            let start = format_big_number(key.start);
            let end = format_big_number(key.end);
            println!("{} .. {} -> {} ", start, end, self.content[&key].count);
        }
        println!(
            "Total -> {} ",
            self.content.values().map(|x| x.count).sum::<u32>()
        );
    }

    pub fn print_ada_per_level(&self) {
        let mut keys = self.content.keys().cloned().collect::<Vec<Range<u64>>>();
        keys.sort_by_key(|x| x.start);

        for key in keys {
            let start = format_big_number(key.start);
            let end = format_big_number(key.end);
            println!(
                "{} .. {} -> {} ",
                start,
                end,
                format_big_number(self.content[&key].total)
            );
        }
        println!(
            "Total -> {} ",
            self.content.values().map(|x| x.total).sum::<u64>()
        );
    }
}

fn format_big_number(n: u64) -> String {
    if n == 0 {
        n.to_string()
    } else if n % 1_000_000_000 == 0 {
        format!("{} MLD", n / 1_000_000)
    } else if n % 1_00000 == 0 {
        format!("{} M", n / 1_000_000)
    } else if n % 1_000 == 0 {
        format!("{} k", n / 1_000)
    } else {
        n.to_string()
    }
}

#[allow(clippy::large_enum_variant)]
#[derive(Error, Debug)]
pub enum Error {
    #[error("invalid threshold for distribution levels ({0}). It should be more than 450 and less that 1000")]
    InvalidThreshold(u64),
}