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

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

use crate::error::{Error, Result};
use crate::ranking::score::Score;
use crate::ranking::{Ranking, RankingEntry};
use crate::ruler::Ruler;
use crate::world::World;

impl World {
  #[inline]
  pub fn ranking(&self) -> &Ranking {
    &self.ranking
  }

  pub fn get_score<R>(&self, ruler: R) -> Result<Score>
  where
    R: Into<Ruler>,
  {
    let ruler: Ruler = ruler.into();
    let stats = self.stats.infrastructure.as_ref();
    let mut score = self.military.score_of(ruler.clone());
    score += self
      .continent
      .cities_of(ruler)
      .try_fold(Score::default(), |mut score, city| {
        score += city.score(stats)?;
        Ok::<_, Error>(score)
      })?;

    Ok(score)
  }

  pub(super) fn update_ranking(&mut self) -> Result<()> {
    let len = self.ranking.len();
    let mut entries = Vec::with_capacity(len);

    for ruler in self.rulers() {
      let ruler = Ruler::from(ruler);
      let score = self.get_score(ruler.clone())?;
      let cities = self.count_cities(ruler.clone());
      let entry = RankingEntry::builder()
        .ruler(ruler)
        .score(score)
        .cities(cities)
        .build();

      entries.push(entry);
    }

    self.ranking.update(entries);

    Ok(())
  }
}