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

// =============================================================================
//! - Unit tests for the A* algorithm operations
//!
//! # Metadata
//! - Copyright: © 2022-2023 [`CroftSoft Inc`]
//! - Author: [`David Wallace Croft`]
//! - Created: 2022-10-22
//! - Updated: 2023-06-25
//!
//! [`CroftSoft Inc`]: https://www.croftsoft.com/
//! [`David Wallace Croft`]: https://www.croftsoft.com/people/david/
// =============================================================================

use crate::ai::astar::structures::NodeInfo;
use std::cmp::Ordering;

#[cfg(test)]
const NODE_INFO_0: NodeInfo = NodeInfo {
  cost_from_start: 0.0,
  total_cost: 0.0,
};

#[cfg(test)]
const NODE_INFO_1: NodeInfo = NodeInfo {
  cost_from_start: 0.0,
  total_cost: 1.0,
};

#[test]
fn test_eq() {
  assert!(NODE_INFO_0 != NODE_INFO_1);
}

#[test]
fn test_ge() {
  assert!(NODE_INFO_1 >= NODE_INFO_0);
}

#[test]
fn test_gt() {
  assert!(NODE_INFO_1 > NODE_INFO_0);
}

#[test]
fn test_le() {
  assert!(NODE_INFO_0 <= NODE_INFO_1);
}

#[test]
fn test_lt() {
  assert!(NODE_INFO_0 < NODE_INFO_1);
}

#[test]
fn test_partial_cmp() {
  assert_eq!(NODE_INFO_0.partial_cmp(&NODE_INFO_1), Some(Ordering::Less));
}