nil-util 0.5.1

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

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

use std::collections::{HashMap, HashSet, VecDeque};
use std::hash::Hash;
use std::ops::{ControlFlow, Try};

pub trait IterExt: Iterator {
  fn collect_deque(self) -> VecDeque<Self::Item>
  where
    Self: Sized,
  {
    self.collect()
  }

  fn collect_map<K, V>(self) -> HashMap<K, V>
  where
    Self: Sized + Iterator<Item = (K, V)>,
    K: Hash + Eq,
  {
    self.collect()
  }

  fn collect_set(self) -> HashSet<Self::Item>
  where
    Self: Sized,
    Self::Item: Hash + Eq,
  {
    self.collect()
  }

  fn try_each<R>(self) -> R
  where
    Self: Iterator<Item = R> + Sized,
    R: Try<Output = ()>,
  {
    for item in self {
      if let ControlFlow::Break(e) = item.branch() {
        return R::from_residual(e);
      }
    }

    R::from_output(())
  }
}

impl<T: Iterator> IterExt for T {}