nil-core 0.5.5

Multiplayer strategy game
Documentation 
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

// Copyright (C) Call of Nil contributors
// SPDX-License-Identifier: AGPL-3.0-only

pub mod score;

use crate::ruler::Ruler;
use bon::Builder;
use derive_more::Deref;
use itertools::Itertools;
use score::Score;
use serde::{Deserialize, Serialize};

#[derive(Clone, Debug, Deref, Deserialize, Serialize)]
#[derive_const(Default)]
#[cfg_attr(feature = "typescript", derive(ts_rs::TS))]
pub struct Ranking(Vec<RankingEntry>);

impl Ranking {
  #[inline]
  pub fn get(&self, ruler: &Ruler) -> Option<&RankingEntry> {
    self
      .0
      .iter()
      .find(|entry| &entry.ruler == ruler)
  }

  pub fn update<T>(&mut self, entries: T)
  where
    T: IntoIterator<Item = RankingEntry>,
  {
    self.0.clear();
    let entries = entries
      .into_iter()
      .sorted_by_key(|it| it.score)
      .rev()
      .zip(1u32..)
      .map(|(mut entry, rank)| {
        entry.rank = Rank(rank);
        entry
      });

    self.0.extend(entries);
  }
}

#[derive(Builder, Clone, Debug, Deserialize, Serialize)]
#[serde(rename_all = "camelCase")]
#[cfg_attr(feature = "typescript", derive(ts_rs::TS))]
pub struct RankingEntry {
  #[builder(skip)]
  rank: Rank,

  #[builder(into)]
  ruler: Ruler,

  #[builder(into)]
  score: Score,

  #[builder(into)]
  cities: u32,
}

#[derive(Copy, Debug, Deserialize, Serialize)]
#[derive_const(Clone, Default, PartialEq, Eq, PartialOrd, Ord)]
#[cfg_attr(feature = "typescript", derive(ts_rs::TS))]
pub struct Rank(u32);