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
111
112
use std::convert;
use std::f64::MAX;
type Vector = Vec<f64>;
pub fn nearly_eq<S, T>(x: S, y: T) -> bool
where
S: convert::Into<f64>,
T: convert::Into<f64>,
{
let mut b: bool = false;
let e = 1e-7;
let p: f64 = x.into().abs();
let q: f64 = y.into().abs();
if (p - q).abs() < e {
b = true;
} else if (p - q).abs() / (p + q).min(MAX) < e {
b = true;
}
b
}
#[allow(unused_comparisons)]
pub fn tab(s: &str, space: usize) -> String {
let l = s.len();
let mut m: String = String::new();
let fs = format!("{}{}", " ".repeat(space - l), s);
m.push_str(&fs);
return m;
}
pub fn quot_rem(x: usize, y: usize) -> (i32, i32) {
((x / y) as i32, (x % y) as i32)
}
pub fn choose_shorter_string(x1: String, x2: String) -> String {
if x1.len() > x2.len() {
x2
} else {
x1
}
}
pub fn choose_shorter_vec(x1: &Vector, x2: &Vector) -> Vector {
if x1.len() > x2.len() {
x2.clone()
} else {
x1.clone()
}
}
pub fn choose_longer_vec(x1: &Vector, x2: &Vector) -> Vector {
if x1.len() <= x2.len() {
x2.clone()
} else {
x1.clone()
}
}
pub fn max<T>(v: Vec<T>) -> T
where
T: PartialOrd + Copy + Clone,
{
let l = v.len();
if l == 1 {
v[0]
} else {
let mut t = if v[0] >= v[1] { v[0] } else { v[1] };
for i in 2..v.len() {
if v[i] > t {
t = v[i];
}
}
t
}
}
pub fn min<T>(v: Vec<T>) -> T
where
T: PartialOrd + Copy + Clone,
{
let l = v.len();
if l == 1 {
v[0]
} else {
let mut t = if v[0] <= v[1] { v[0] } else { v[1] };
for i in 2..v.len() {
if v[i] < t {
t = v[i];
}
}
t
}
}