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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
use crate::MyResult;
use itertools::Itertools;
use std::{
collections::{BTreeSet, HashSet},
fs::File,
io::Write,
path::Path,
};
/// Trait extension for HashSet
pub trait HashSetExtension<T> {
/**
Convert HashSet to a Vector with unique elements
Example:
```
use std::collections::HashSet;
use claudiofsr_lib::HashSetExtension;
let set1 = HashSet::from([2, 3, 1, 4, 5, 2]);
let mut vec1 = set1.to_vec();
println!("{:?}", vec1);
let set2 = HashSet::from(["b", "a", "c", "a", "b"]);
let mut vec2 = set2.to_vec();
println!("{:?}", vec2);
let mut vec3: Vec<u16> = [2, 3, 1, 4, 3, 3, 5, 2]
.into_iter()
.collect::<HashSet<_>>()
.to_vec();
vec1.sort();
vec2.sort();
vec3.sort();
assert_eq!(vec1, [1, 2, 3, 4, 5]);
assert_eq!(vec2, ["a", "b", "c"]);
assert_eq!(vec3, [1, 2, 3, 4, 5]);
```
*/
fn to_vec(&self) -> Vec<T>;
/**
Convert HashSet to a Vector with unique and ordered elements
Example:
```
use std::collections::HashSet;
use claudiofsr_lib::HashSetExtension;
let set1 = HashSet::from([2, 3, 1, 4, 5, 2]);
let vec1 = set1.to_vec_sorted();
println!("{:?}", vec1);
let set2 = HashSet::from(["b", "a", "c", "a", "b"]);
let vec2 = set2.to_vec_sorted();
println!("{:?}", vec2);
let vec3: Vec<u16> = [2, 3, 1, 4, 3, 3, 5, 2]
.into_iter()
.collect::<HashSet<_>>()
.to_vec_sorted();
assert_eq!(vec1, [1, 2, 3, 4, 5]);
assert_eq!(vec2, ["a", "b", "c"]);
assert_eq!(vec3, [1, 2, 3, 4, 5]);
```
*/
fn to_vec_sorted(&self) -> Vec<T>
where
T: Ord;
/// Write all HashSet elements to an output file.
fn write_to_file<P>(&self, output_file: P) -> MyResult<()>
where
P: AsRef<Path>;
}
impl<T> HashSetExtension<T> for HashSet<T>
where
T: Clone + std::fmt::Display,
{
fn to_vec(&self) -> Vec<T> {
self.iter().cloned().collect()
}
fn to_vec_sorted(&self) -> Vec<T>
where
T: Ord,
{
self.iter().sorted().cloned().collect()
}
fn write_to_file<P>(&self, output_file: P) -> MyResult<()>
where
P: AsRef<Path>,
{
// If the set is empty, return Ok() immediately
if self.is_empty() {
return Ok(());
}
// Create a new file with the given path
let mut file = File::create(output_file)?;
// Iterate over each element in the BTreeSet
for elem in self {
// Write each element to the file, followed by a newline character
writeln!(file, "{elem}")?;
}
// Return Ok() to indicate that writing was successful
Ok(())
}
}
/// Trait extension for BTreeSet
pub trait BTreeSetExtension<T> {
/**
Convert BTreeSet to a Vector with unique and ordered elements
Example:
```
use std::collections::BTreeSet;
use claudiofsr_lib::BTreeSetExtension;
let set1 = BTreeSet::from([2, 3, 1, 4, 5, 2]);
let vec1 = set1.to_vec();
println!("{:?}", vec1);
let set2 = BTreeSet::from(["b", "a", "c", "a", "b"]);
let vec2 = set2.to_vec();
println!("{:?}", vec2);
let vec3: Vec<u16> = [2, 3, 1, 4, 3, 3, 5, 2]
.into_iter()
.collect::<BTreeSet<_>>()
.to_vec();
assert_eq!(vec1, [1, 2, 3, 4, 5]);
assert_eq!(vec2, ["a", "b", "c"]);
assert_eq!(vec3, [1, 2, 3, 4, 5]);
```
*/
fn to_vec(&self) -> Vec<T>;
/// Write all BTreeSet elements to an output file.
fn write_to_file<P>(&self, output_file: P) -> MyResult<()>
where
P: AsRef<Path>;
}
impl<T> BTreeSetExtension<T> for BTreeSet<T>
where
T: Clone + std::fmt::Display,
{
fn to_vec(&self) -> Vec<T> {
self.iter().cloned().collect()
}
fn write_to_file<P>(&self, output_file: P) -> MyResult<()>
where
P: AsRef<Path>,
{
// If the set is empty, return Ok() immediately
if self.is_empty() {
return Ok(());
}
// Create a new file with the given path
let mut file = File::create(output_file)?;
// Iterate over each element in the BTreeSet
for elem in self {
// Write each element to the file, followed by a newline character
writeln!(file, "{elem}")?;
}
// Return Ok() to indicate that writing was successful
Ok(())
}
}