-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathvec.sw
161 lines (126 loc) · 3.75 KB
/
vec.sw
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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
library;
use std::vec::*;
use ::utils::{numbers::*, test_helpers::With};
impl<T> Vec<T>
where
T: Eq,
{
pub fn index_of(self, value: T) -> Option<u64> {
let mut i = 0;
while (i < self.len()) {
if value == self.get(i).unwrap() {
return Some(i);
}
i += 1;
}
None
}
pub fn find_duplicate(self) -> Option<T> {
let mut i = 0;
while (i < self.len()) {
let mut j = i + 1;
while (j < self.len()) {
if (self.get(i) == self.get(j)) {
return Some(self.get(i).unwrap());
}
j += 1;
}
i += 1;
}
None
}
fn sort(ref mut self)
where
T: Ord,
{
let mut n = self.len();
while (n > 1) {
let mut i = 0;
while (i < n - 1) {
if self.get(i).unwrap() > self.get(i + 1).unwrap() {
self.swap(i, i + 1);
}
i += 1;
}
n -= 1;
}
}
}
impl Vec<u256> {
pub fn median(self) -> Option<u256> {
match self.len() {
0 => None,
1 => Some(self.get(0).unwrap()),
2 => Some(self.get(0).unwrap().avg_with(self.get(1).unwrap())),
_ => {
let mut values = self;
values.sort();
let mid = values.len() / 2;
if (values.len() % 2 == 1) {
Some(values.get(mid).unwrap())
} else {
Some(values.get(mid).unwrap().avg_with(values.get(mid - 1).unwrap()))
}
}
}
}
}
#[test]
fn test_median_single_value() {
let data = Vec::<u256>::new().with(0x333u256);
assert(data.median().unwrap() == 0x333u256);
}
#[test]
fn test_median_two_values() {
let data = Vec::<u256>::new().with(0x333u256).with(0x222u256);
assert(data.median().unwrap() == 0x2aau256);
}
#[test]
fn test_median_three_values() {
let data = Vec::<u256>::new().with(0x444u256).with(0x222u256).with(0x333u256);
assert(data.median().unwrap() == 0x333u256);
}
#[test]
fn test_median_four_values() {
let data = Vec::<u256>::new().with(0x444u256).with(0x222u256).with(0x111u256).with(0x555u256);
assert(data.median().unwrap() == 0x333u256);
}
#[test]
fn test_median_five_values() {
let data = Vec::<u256>::new().with(0x444u256).with(0x222u256).with(0x111u256).with(0x333u256).with(0x555u256);
assert(data.median().unwrap() == 0x333u256);
}
#[test]
fn test_median_three_other_values() {
let data = Vec::<u256>::new().with(0x222u256).with(0x222u256).with(0x333u256);
assert(data.median().unwrap() == 0x222u256);
}
#[test]
fn test_median_zero_values() {
assert(Vec::<u256>::new().median() == None);
}
#[test]
fn test_find_duplicate() {
let data = Vec::<u256>::new().with(0x444u256).with(0x222u256).with(0x333u256);
assert(data.find_duplicate() == None);
}
#[test]
fn test_find_duplicate_one_element() {
let data = Vec::<u256>::new().with(0x444u256).with(0x222u256).with(0x333u256);
assert(data.find_duplicate() == None);
}
#[test]
fn test_find_duplicate_duplcated() {
let data = Vec::<u256>::new().with(0x444u256).with(0x222u256).with(0x444u256);
assert(data.find_duplicate().unwrap() == 0x444u256);
}
#[test]
fn test_find_duplicate_duplcated_nearby() {
let data = Vec::<u256>::new().with(0x222u256).with(0x444u256).with(0x444u256);
assert(data.find_duplicate().unwrap() == 0x444u256);
}
#[test]
fn test_find_duplicate_option_as_dup() {
let data = Vec::<Option<u256>>::new().with(Some(0x444u256)).with(Some(0x444u256)).with(None);
assert(data.find_duplicate().unwrap() == Some(0x444u256));
}