com-croftsoft-core 0.14.0

A core library of highly reusable code
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

// =============================================================================
//! - Operation implementations for the A* algorithm
//!
//! # Metadata
//! - Copyright: © 2022-2023 [`CroftSoft Inc`]
//! - Author: [`David Wallace Croft`]
//! - Java created: 2002-04-21
//! - Java updated: 2003-05-09
//! - Rust created: 2022-10-22
//! - Rust updated: 2023-06-25
//!
//! # History
//! - Adapted from the classes in the Java-based [`CroftSoft Core Library`]
//!   - com.croftsoft.core.ai.astar.NodeInfo
//!
//! [`CroftSoft Core Library`]: https://www.croftsoft.com/library/code/
//! [`CroftSoft Inc`]: https://www.croftsoft.com/
//! [`David Wallace Croft`]: https://www.croftsoft.com/people/david/
// =============================================================================

use super::structures::NodeInfo;
use std::cmp::Ordering;

#[cfg(test)]
mod test;

impl PartialEq for NodeInfo {
  fn eq(
    &self,
    other: &Self,
  ) -> bool {
    self.total_cost.eq(&other.total_cost)
  }
}

impl PartialOrd for NodeInfo {
  fn lt(
    &self,
    other: &Self,
  ) -> bool {
    self.total_cost.lt(&other.total_cost)
  }

  fn le(
    &self,
    other: &Self,
  ) -> bool {
    self.total_cost.le(&other.total_cost)
  }

  fn gt(
    &self,
    other: &Self,
  ) -> bool {
    self.total_cost.gt(&other.total_cost)
  }

  fn ge(
    &self,
    other: &Self,
  ) -> bool {
    self.total_cost.ge(&other.total_cost)
  }

  fn partial_cmp(
    &self,
    other: &Self,
  ) -> Option<Ordering> {
    self.total_cost.partial_cmp(&other.total_cost)
  }
}