Решение на упр.07 задача 1 от Венислав Трендафилов
Към профила на Венислав Трендафилов
Резултати
- 4 точки от тестове
- 0 бонус точки
- 4 точки общо
- 2 успешни тест(а)
- 0 неуспешни тест(а)
Код
struct Map<I, F> {
iter: I,
f: F,
}
fn iter_map<I, F, U>(iter: I, f: F) -> Map<I, F>
where
I: Iterator,
F: Fn(I::Item) -> U
{
Map { iter, f }
}
impl<I, F, U> Iterator for Map<I, F>
where
I: Iterator,
F: Fn(I::Item) -> U
{
type Item = U;
fn next(&mut self) -> Option<Self::Item> {
match self.iter.next() {
Some(item) => Some((self.f)(item)),
None => None,
}
}
}
struct Filter<I, F> {
iter: I,
func: F,
}
fn iter_filter<I, F>(iter: I, func: F) -> Filter<I, F>
where
I: Iterator,
F: Fn(&I::Item) -> bool,
{
Filter { iter, func }
}
impl<I, F> Iterator for Filter<I, F>
where
I: Iterator,
F: Fn(&I::Item) -> bool,
{
type Item = I::Item;
fn next(&mut self) -> Option<Self::Item> {
while let Some(item) = self.iter.next() {
if (self.func)(&item) {
return Some(item);
}
}
None
}
}
fn iter_filter_map<I, F, U>(iter: I, func: F) -> impl Iterator<Item = U>
where
I: Iterator,
F: Fn(I::Item) -> Option<U>,
{
let mapped = iter_map(iter, func);
let filtered = iter_filter(mapped, |opt_u: &Option<U>| opt_u.is_some());
iter_map(filtered, |opt_u: Option<U>| opt_u.unwrap())
}
fn get_sum(text: &str) -> i32 {
let lines_iter = text.lines();
let trimmed_iter = iter_map(lines_iter, |line| line.trim());
let non_empty_iter = iter_filter(trimmed_iter, |line| !line.is_empty());
let final_numbers_iter = iter_filter_map(non_empty_iter,|line| line.parse::<i32>().ok());
final_numbers_iter.sum()
}
#[derive(Debug, Eq, PartialEq)]
pub struct FoundWord<'a>(pub &'a str);
fn get_num_list(text: &str) -> Result<Vec<i32>, FoundWord<'_>> {
let lines_iter = text.lines();
let trimmed_iter = iter_map(lines_iter, |line| line.trim());
let non_empty_iter = iter_filter(trimmed_iter, |line| !line.is_empty());
let result_iter = iter_map(non_empty_iter, |line| {
match line.parse::<i32>() {
Ok(num) => Ok(num),
Err(_) => Err(FoundWord(line)),
}
});
result_iter.collect::<Result<Vec<i32>, FoundWord<'_>>>()
}
Лог от изпълнението
Updating crates.io index
Locking 17 packages to latest compatible versions
Compiling proc-macro2 v1.0.103
Compiling unicode-ident v1.0.22
Compiling quote v1.0.42
Compiling futures-sink v0.3.31
Compiling futures-core v0.3.31
Compiling futures-channel v0.3.31
Compiling futures-task v0.3.31
Compiling futures-io v0.3.31
Compiling pin-project-lite v0.2.16
Compiling syn v2.0.111
Compiling pin-utils v0.1.0
Compiling slab v0.4.11
Compiling memchr v2.7.6
Compiling solution v0.1.0 (/tmp/d20251127-1757769-z9ego1/solution)
warning: struct `Map` is never constructed
--> src/lib.rs:1:8
|
1 | struct Map<I, F> {
| ^^^
|
= note: `#[warn(dead_code)]` on by default
warning: function `iter_map` is never used
--> src/lib.rs:6:4
|
6 | fn iter_map<I, F, U>(iter: I, f: F) -> Map<I, F>
| ^^^^^^^^
warning: struct `Filter` is never constructed
--> src/lib.rs:29:8
|
29 | struct Filter<I, F> {
| ^^^^^^
warning: function `iter_filter` is never used
--> src/lib.rs:34:4
|
34 | fn iter_filter<I, F>(iter: I, func: F) -> Filter<I, F>
| ^^^^^^^^^^^
warning: function `iter_filter_map` is never used
--> src/lib.rs:59:4
|
59 | fn iter_filter_map<I, F, U>(iter: I, func: F) -> impl Iterator<Item = U>
| ^^^^^^^^^^^^^^^
warning: function `get_sum` is never used
--> src/lib.rs:70:4
|
70 | fn get_sum(text: &str) -> i32 {
| ^^^^^^^
warning: function `get_num_list` is never used
--> src/lib.rs:82:4
|
82 | fn get_num_list(text: &str) -> Result<Vec<i32>, FoundWord<'_>> {
| ^^^^^^^^^^^^
warning: `solution` (lib) generated 7 warnings
Compiling futures-macro v0.3.31
Compiling futures-util v0.3.31
Compiling futures-executor v0.3.31
Compiling futures v0.3.31
Finished `test` profile [unoptimized + debuginfo] target(s) in 8.49s
Running tests/solution_test.rs (target/debug/deps/solution_test-ee0783488e12dce9)
running 2 tests
test solution_test::test_adapters_ ... ok
test solution_test::test_text_parsers_ ... ok
test result: ok. 2 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s