web search done right
// Stract is an open source web search engine.
// Copyright (C) 2024 Stract ApS
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as
// published by the Free Software Foundation, either version 3 of the
// License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with this program. If not, see <https://www.gnu.org/licenses/>.
use crate::LendingIterator;
pub struct Map<I, F> {
iter: I,
f: F,
}
impl<I, F> Map<I, F> {
pub fn new(iter: I, f: F) -> Self {
Self { iter, f }
}
}
impl<I, F, T> LendingIterator for Map<I, F>
where
I: LendingIterator,
F: for<'a> FnMut(I::Item<'a>) -> T,
{
type Item<'a> = T
where
Self: 'a;
fn next(&mut self) -> Option<Self::Item<'_>> {
self.iter.next().map(&mut self.f)
}
}