Решение на упр.07 задача 1 от Димитър Николов
Към профила на Димитър Николов
Резултати
- 4 точки от тестове
- 0 бонус точки
- 4 точки общо
- 2 успешни тест(а)
- 0 неуспешни тест(а)
Код
struct Map<I, F, U>
where
I: Iterator,
F: Fn(I::Item) -> U,
{
iter: I,
mapper: F,
}
fn iter_map<I, F, U>(iter: I, f: F) -> Map<I, F, U>
where
I: Iterator,
F: Fn(I::Item) -> U,
{
Map {
iter: iter,
mapper: f,
}
}
impl<I, F, U> Iterator for Map<I, F, U>
where
I: Iterator,
F: Fn(I::Item) -> U,
{
type Item = U;
fn next(&mut self) -> Option<Self::Item> {
Some((self.mapper)(self.iter.next()?))
}
}
struct Filter<I, F>
where
I: Iterator,
F: Fn(&I::Item) -> bool,
{
iter: I,
filter: F,
}
fn iter_filter<I, F>(iter: I, func: F) -> Filter<I, F>
where
I: Iterator,
F: Fn(&I::Item) -> bool,
{
Filter {
iter: iter,
filter: 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.filter)(&item) {
return Some(item);
}
}
return 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>,
{
// Possibly better via flat mapping optionals?
iter_map(
iter_filter(iter_map(iter, func), |opt| opt.is_some()),
|opt| opt.unwrap(),
)
}
fn get_sum(text: &str) -> i32 {
iter_map(text.lines(), |line| line.trim().parse::<i32>().unwrap_or(0)).sum()
}
#[derive(Debug, Eq, PartialEq)]
struct FoundWord<'a>(&'a str);
fn get_num_list(text: &str) -> Result<Vec<i32>, FoundWord<'_>> {
iter_map(
iter_filter_map(text.lines(), |line| {
let trimmed = line.trim();
if trimmed.is_empty() {
return None;
}
Some(trimmed)
}),
|line| line.parse::<i32>().map_err(|_| FoundWord(line)),
)
.collect()
}
Лог от изпълнението
Updating crates.io index
Locking 17 packages to latest compatible versions
Compiling proc-macro2 v1.0.103
Compiling quote v1.0.42
Compiling unicode-ident v1.0.22
Compiling futures-core v0.3.31
Compiling futures-sink v0.3.31
Compiling futures-channel v0.3.31
Compiling slab v0.4.11
Compiling syn v2.0.111
Compiling futures-io v0.3.31
Compiling futures-task v0.3.31
Compiling memchr v2.7.6
Compiling pin-project-lite v0.2.16
Compiling pin-utils v0.1.0
Compiling solution v0.1.0 (/tmp/d20251127-1757769-1jrco04/solution)
warning: struct `Map` is never constructed
--> src/lib.rs:1:8
|
1 | struct Map<I, F, U>
| ^^^
|
= note: `#[warn(dead_code)]` on by default
warning: function `iter_map` is never used
--> src/lib.rs:10:4
|
10 | fn iter_map<I, F, U>(iter: I, f: F) -> Map<I, F, U>
| ^^^^^^^^
warning: struct `Filter` is never constructed
--> src/lib.rs:33:8
|
33 | struct Filter<I, F>
| ^^^^^^
warning: function `iter_filter` is never used
--> src/lib.rs:42:4
|
42 | fn iter_filter<I, F>(iter: I, func: F) -> Filter<I, F>
| ^^^^^^^^^^^
warning: function `iter_filter_map` is never used
--> src/lib.rs:70:4
|
70 | 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:82:4
|
82 | fn get_sum(text: &str) -> i32 {
| ^^^^^^^
warning: struct `FoundWord` is never constructed
--> src/lib.rs:87:8
|
87 | struct FoundWord<'a>(&'a str);
| ^^^^^^^^^
warning: function `get_num_list` is never used
--> src/lib.rs:89:4
|
89 | fn get_num_list(text: &str) -> Result<Vec<i32>, FoundWord<'_>> {
| ^^^^^^^^^^^^
warning: `solution` (lib) generated 8 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.58s
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