ember_os 0.1.3

A simple OS kernel implemented in rust, which has referenced https://os.phil-opp.com/
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
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

pub mod cached_greedy_extreme_path;
pub mod greedy_extreme_path;

pub struct Edge<Node, Value> {
  pub(crate) dst: Node,
  pub(crate) cost: Value,
}

impl<Node, Value> Edge<Node, Value> {
  pub fn new(dst: Node, cost: Value) -> Self {
    Self { dst, cost }
  }
}

impl<Node: Copy, Value: Copy> Copy for Edge<Node, Value> {}

impl<Node: Clone, Value: Clone> Clone for Edge<Node, Value> {
  fn clone(&self) -> Self {
    Self {
      dst: self.dst.clone(),
      cost: self.cost.clone(),
    }
  }
}

impl<Node: Default, Value: Default> Default for Edge<Node, Value> {
  fn default() -> Self {
    Self {
      dst: Default::default(),
      cost: Default::default(),
    }
  }
}

#[allow(unused)]
pub type MaxHeapAccumulation<Node, Value> = Accumulation<Node, Value, true>;
#[allow(unused)]
pub type MinHeapAccumulation<Node, Value> = Accumulation<Node, Value, false>;
#[allow(unused)]
pub type OriginalOrderedAccumulation<Node, Value> = Accumulation<Node, Value, true>;
#[allow(unused)]
pub type ReversedOrderedAccumulation<Node, Value> = Accumulation<Node, Value, false>;

pub struct Accumulation<Node, Value, const ADAPT_MAX_HEAP: bool = false> {
  pub(crate) dst: Node,
  pub(crate) cost: Value,
}

impl<Node, Value: Ord, const ADAPT_MAX_HEAP: bool> Ord
  for Accumulation<Node, Value, ADAPT_MAX_HEAP>
{
  fn cmp(&self, other: &Self) -> core::cmp::Ordering {
    let order = self.cost.cmp(&other.cost);
    if !ADAPT_MAX_HEAP {
      order.reverse()
    } else {
      order
    }
  }
}

impl<Node, Value: PartialOrd, const ADAPT_MAX_HEAP: bool> PartialOrd
  for Accumulation<Node, Value, ADAPT_MAX_HEAP>
{
  fn partial_cmp(&self, other: &Self) -> Option<core::cmp::Ordering> {
    let wrapped_order = self.cost.partial_cmp(&other.cost);
    if !ADAPT_MAX_HEAP {
      wrapped_order.map(|res| res.reverse())
    } else {
      wrapped_order
    }
  }
}

impl<Node, Value: Eq, const ADAPT_MAX_HEAP: bool> Eq for Accumulation<Node, Value, ADAPT_MAX_HEAP> {}

impl<Node, Value: PartialEq, const ADAPT_MAX_HEAP: bool> PartialEq
  for Accumulation<Node, Value, ADAPT_MAX_HEAP>
{
  fn eq(&self, other: &Self) -> bool {
    self.cost == other.cost
  }
}

impl<Node: Copy, Value: Copy, const ADAPT_MAX_HEAP: bool> Copy
  for Accumulation<Node, Value, ADAPT_MAX_HEAP>
{
}

impl<Node: Clone, Value: Clone, const ADAPT_MAX_HEAP: bool> Clone
  for Accumulation<Node, Value, ADAPT_MAX_HEAP>
{
  fn clone(&self) -> Self {
    Self {
      dst: self.dst.clone(),
      cost: self.cost.clone(),
    }
  }
}

impl<Node: Default, Value: Default, const ADAPT_MAX_HEAP: bool> Default
  for Accumulation<Node, Value, ADAPT_MAX_HEAP>
{
  fn default() -> Self {
    Self {
      dst: Default::default(),
      cost: Default::default(),
    }
  }
}