Решение на упр.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(x) => Some((self.f)(x)),
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> {
loop {
match self.iter.next() {
Some(item) => {
if (self.func)(&item) {
return Some(item);
}
}
None => 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>,
{
let mapped = iter_map(iter, func);
let filtered = iter_filter(mapped, |opt| opt.is_some());
iter_map(filtered, |opt| opt.unwrap())
}
// Конкретният тип на резултата е Map<Filter<Map<I, F>, closure1>, closure2>,
// но типовете на |opt| opt.is_some() и |opt| opt.unwrap() са анонимни
// и не могат да бъдат изписани в сигнатурата на функцията.
// Затова използваме impl Iterator, което ни спестява изписването на пълния тип.
fn get_sum(text: &str) -> i32 {
text.lines()
.map(|line| line.trim())
.filter(|line| !line.is_empty())
.filter_map(|line| line.parse::<i32>().ok())
.sum()
}
#[derive(Debug, Eq, PartialEq)]
struct FoundWord<'a>(&'a str);
fn get_num_list(text: &str) -> Result<Vec<i32>, FoundWord<'_>> {
text.lines()
.map(|line| line.trim())
.filter(|line| !line.is_empty())
.map(|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-sink v0.3.31
Compiling futures-core v0.3.31
Compiling futures-channel v0.3.31
Compiling futures-io v0.3.31
Compiling memchr v2.7.6
Compiling syn v2.0.111
Compiling slab v0.4.11
Compiling pin-project-lite v0.2.16
Compiling pin-utils v0.1.0
Compiling futures-task v0.3.31
Compiling solution v0.1.0 (/tmp/d20251127-1757769-1qykeu9/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:63:4
|
63 | 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:77:4
|
77 | fn get_sum(text: &str) -> i32 {
| ^^^^^^^
warning: struct `FoundWord` is never constructed
--> src/lib.rs:86:8
|
86 | struct FoundWord<'a>(&'a str);
| ^^^^^^^^^
warning: function `get_num_list` is never used
--> src/lib.rs:88:4
|
88 | 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.66s
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
История (2 версии и 0 коментара)
Йоанна качи решение на 26.11.2025 11:07 (преди 10 дена)
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> {
- self.iter.next().map(|x| (self.f)(x))
+ match self.iter.next() {
+ Some(x) => Some((self.f)(x)),
+ 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> {
loop {
match self.iter.next() {
Some(item) => {
if (self.func)(&item) {
return Some(item);
}
}
None => 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>,
{
let mapped = iter_map(iter, func);
let filtered = iter_filter(mapped, |opt| opt.is_some());
iter_map(filtered, |opt| opt.unwrap())
}
+// Конкретният тип на резултата е Map<Filter<Map<I, F>, closure1>, closure2>,
+// но типовете на |opt| opt.is_some() и |opt| opt.unwrap() са анонимни
+// и не могат да бъдат изписани в сигнатурата на функцията.
+// Затова използваме impl Iterator, което ни спестява изписването на пълния тип.
fn get_sum(text: &str) -> i32 {
text.lines()
.map(|line| line.trim())
.filter(|line| !line.is_empty())
.filter_map(|line| line.parse::<i32>().ok())
.sum()
}
#[derive(Debug, Eq, PartialEq)]
struct FoundWord<'a>(&'a str);
fn get_num_list(text: &str) -> Result<Vec<i32>, FoundWord<'_>> {
text.lines()
.map(|line| line.trim())
.filter(|line| !line.is_empty())
.map(|line| {
line.parse::<i32>()
.map_err(|_| FoundWord(line))
})
.collect()
}