Trait lending_iterator::lending_iterator::LendingIteratorDyn

pub trait LendingIteratorDyn {
    type Item: ?Sized + HKT;

    fn dyn_next(&mut self) -> Option<Feed<'_, Self::Item>>;
}

dyn-friendly (dyn-safe) version of LendingIterator.

It is automagically implemented for all types implementing LendingIterator, and, conversely, LendingIterator is implemented for dyn LendingIteratorDyn.

Limitations

Beware that such a trait does still not play well with contexts which are generic over the “lending mode” ⚠️

So, if you intend to unify two heterogeneous LendingIterator under the same dyn LendingIteratorDyn, make sure to hard-code the dependency on the 'next-lending lifetime.

Otherwise you might have to:

• involve CanonicalHKT in your signatures,
• and use .dyn_boxed_auto() rather than the .dyn_boxed() direct shorthand.

Example: dyn coercion of a fully generic LendingIterator:

• use ::lending_iterator::prelude::*;
  
  fn coercions<'T, Item, T> (it: T)
  where
      Item : HKT,
      T : 'T + Send + Sync + LendingIterator,
      // THIS IS THE BOUND THAT YOU HAVE TO ADD TO MAKE IT WORK, for some reason:
      T : LendingIteratorDyn<Item = CanonicalHKT<Item>>, // 👈
  {
      match () {
          _ => {
              let _: Box<dyn 'T + LendingIteratorDyn<Item = CanonicalHKT<Item>>> =
                  it.dyn_boxed_auto()
              ;
          },
          _ => {
              let _: Box<dyn 'T + LendingIteratorDyn<Item = CanonicalHKT<Item>> + Send> =
                  it.dyn_boxed_auto()
              ;
          },
          _ => {
              let _: Box<dyn 'T + LendingIteratorDyn<Item = CanonicalHKT<Item>> + Sync> =
                  it.dyn_boxed_auto()
              ;
          },
          _ => {
              let _: Box<dyn 'T + LendingIteratorDyn<Item = CanonicalHKT<Item>> + Send + Sync> =
                  it.dyn_boxed_auto()
              ;
          },
      }
  }

Required Associated Types

type Item: ?Sized + HKT

Another approach to a GAT in stable Rust: use a classic associated type, but with a HKT bound on it, so that it can still be fed a lifetime parameter.

Required Methods

fn dyn_next(&mut self) -> Option<Feed<'_, Self::Item>>

A dyn-safe version of LendingIterator::next(), using [Self::Item].

Given that LendingIteratorDyn : LendingIterator, you should not need to call this function directly: calling .next() ought to work just as well.

• That being said, if defining a LendingIteratorDyn subtrait, you may then need to directly call into it.

Trait Implementations

impl<'usability, Item: HKT> LendingIterator for dyn LendingIteratorDyn<Item = Item> + 'usability

dyn LendingIteratorDyn + … : LendingIterator

fn next<'next>(
    self: &'next mut (dyn LendingIteratorDyn<Item = Item> + 'usability)
) -> Option<Feed<'next, Item>>

Query the next() Item of this Self iterator.

fn filter<F>(self, should_yield: F) -> Filter<Self, F> where
    Self: Sized,
    F: FnMut(&Item<'_, Self>) -> bool, 

LendingIterator counterpart of Iterator::filter().

fn for_each(self, f: impl FnMut(Item<'_, Self>)) where
    Self: Sized, 

LendingIterator counterpart of Iterator::for_each().

fn fold<Acc>(self, acc: Acc, f: impl FnMut(Acc, Item<'_, Self>) -> Acc) -> Acc where
    Self: Sized, 

LendingIterator counterpart of Iterator::fold().

fn try_for_each<Err>(
    &mut self,
    f: impl FnMut(Item<'_, Self>) -> Result<(), Err>
) -> Result<(), Err>

LendingIterator counterpart of Iterator::try_for_each().

fn try_fold<Acc, Err>(
    &mut self,
    acc: Acc,
    f: impl FnMut(Acc, Item<'_, Self>) -> Result<Acc, Err>
) -> Result<Acc, Err>

LendingIterator counterpart of Iterator::try_fold().

fn all(&mut self, predicate: impl FnMut(Item<'_, Self>) -> bool) -> bool where
    Self: Sized, 

LendingIterator counterpart of Iterator::all().

fn any(&mut self, predicate: impl FnMut(Item<'_, Self>) -> bool) -> bool where
    Self: Sized, 

LendingIterator counterpart of Iterator::any().

fn by_ref(&mut self) -> &mut Self where
    Self: Sized, 

LendingIterator counterpart of Iterator::by_ref().

fn count(self) -> usize where
    Self: Sized, 

LendingIterator counterpart of Iterator::count().

fn find<'find>(
    &'find mut self,
    predicate: impl 'find + FnMut(&Item<'_, Self>) -> bool
) -> Option<Item<'find, Self>> where
    Self: Sized, 

LendingIterator counterpart of Iterator::find().

fn fuse(self) -> Fuse<Self> where
    Self: Sized, 

LendingIterator counterpart of Iterator::fuse().

fn nth(&mut self, n: usize) -> Option<Item<'_, Self>>

LendingIterator counterpart of Iterator::nth().

fn position<F>(
    &mut self,
    predicate: impl FnMut(Item<'_, Self>) -> bool
) -> Option<usize> where
    Self: Sized, 

LendingIterator counterpart of Iterator::position().

fn skip(self, count: usize) -> Skip<Self> where
    Self: Sized, 

LendingIterator counterpart of Iterator::skip().

fn take(self, count: usize) -> Take<Self> where
    Self: Sized, 

LendingIterator counterpart of Iterator::take().

fn map<NewItemType: HKT, F>(self, f: F) -> Map<Self, F, NewItemType> where
    for<'next> F: FnMut([&'next Self; 0], Item<'next, Self>) -> Feed<'next, NewItemType>,
    Self: Sized, 

LendingIterator counterpart of Iterator::map().

fn map_to_ref<R: ?Sized, F>(self, f: F) -> Map<Self, F, HKTRef<R>> where
    for<'any> F: FnMut([&'any Self; 0], Item<'any, Self>) -> &'any R,
    Self: Sized, 

Convenience method: same as .map(), but for hard-coding the HKT parameter to HKTRef<R> = HKT!(&R).

fn map_to_mut<R: ?Sized, F>(self, f: F) -> Map<Self, F, HKTRefMut<R>> where
    for<'any> F: FnMut([&'any Self; 0], Item<'any, Self>) -> &'any mut R,
    Self: Sized, 

Convenience method: same as .map(), but for hard-coding the HKT parameter to HKTRefMut<R> = HKT!(&mut R).

fn map_into_iter<F, NonLendingItem>(self, f: F) -> MapIntoIter<Self, F> where
    F: FnMut(Item<'_, Self>) -> NonLendingItem,
    Self: Sized, 

Convenience shorthand for .map…(…).into_iter().

fn filter_map<NewItemType: HKT, F>(self, f: F) -> FilterMap<Self, F, NewItemType> where
    for<'next> F: FnMut([&'next Self; 0], Item<'next, Self>) -> Option<Feed<'next, NewItemType>>,
    Self: Sized, 

LendingIterator counterpart of Iterator::filter_map().

fn filter_map_to_ref<R: ?Sized, F>(self, f: F) -> FilterMap<Self, F, HKTRef<R>> where
    for<'any> F: FnMut([&'any Self; 0], Item<'any, Self>) -> Option<&'any R>,
    Self: Sized, 

Convenience method: same as .filter_map(), but for hard-coding the HKT parameter to HKTRef<R> = HKT!(&R).

fn filter_map_to_mut<R: ?Sized, F>(
    self,
    f: F
) -> FilterMap<Self, F, HKTRefMut<R>> where
    for<'any> F: FnMut([&'any Self; 0], Item<'any, Self>) -> Option<&'any mut R>,
    Self: Sized, 

Convenience method: same as .filter_map(), but for hard-coding the HKT parameter to HKTRefMut<R> = HKT!(&mut R).

fn filter_map_into_iter<F, NonLendingItem>(
    self,
    f: F
) -> FilterMapIntoIter<Self, F> where
    F: FnMut(Item<'_, Self>) -> Option<NonLendingItem>,
    Self: Sized, 

Convenience shorthand for .filter_map…(…).into_iter().

fn into_iter<Item>(self) -> IntoIter<Self> where
    Self: for<'any> LendingIteratorඞItem<'any, T = Item>,
    Self: Sized, 

Convert a Self : LendingIterator into an Iterator, provided Self::Item<'_> does not depend on '_.

fn dyn_boxed<'usability>(
    self
) -> Box<dyn LendingIteratorDyn<Item = HKTItem<Self>> + 'usability> where
    Self: 'usability,
    Self: Sized, 

Available on crate feature alloc only.

Converts this LendingIterator into a Box<dyn LendingIteratorDyn…>.

fn dyn_boxed_auto<BoxedDynLendingIterator, Item: HKT>(
    self
) -> BoxedDynLendingIterator where
    Self: Sized + DynCoerce<BoxedDynLendingIterator, Item>, 

Available on crate feature alloc only.

Converts this LendingIterator into a Box<dyn LendingIteratorDyn…>.

impl<'usability, Item: HKT> LendingIterator for dyn LendingIteratorDyn<Item = Item> + Send + 'usability

dyn LendingIteratorDyn + … : LendingIterator

fn next<'next>(
    self: &'next mut (dyn LendingIteratorDyn<Item = Item> + Send + 'usability)
) -> Option<Feed<'next, Item>>

Query the next() Item of this Self iterator.

fn filter<F>(self, should_yield: F) -> Filter<Self, F> where
    Self: Sized,
    F: FnMut(&Item<'_, Self>) -> bool, 

LendingIterator counterpart of Iterator::filter().

fn for_each(self, f: impl FnMut(Item<'_, Self>)) where
    Self: Sized, 

LendingIterator counterpart of Iterator::for_each().

fn fold<Acc>(self, acc: Acc, f: impl FnMut(Acc, Item<'_, Self>) -> Acc) -> Acc where
    Self: Sized, 

LendingIterator counterpart of Iterator::fold().

fn try_for_each<Err>(
    &mut self,
    f: impl FnMut(Item<'_, Self>) -> Result<(), Err>
) -> Result<(), Err>

LendingIterator counterpart of Iterator::try_for_each().

fn try_fold<Acc, Err>(
    &mut self,
    acc: Acc,
    f: impl FnMut(Acc, Item<'_, Self>) -> Result<Acc, Err>
) -> Result<Acc, Err>

LendingIterator counterpart of Iterator::try_fold().

fn all(&mut self, predicate: impl FnMut(Item<'_, Self>) -> bool) -> bool where
    Self: Sized, 

LendingIterator counterpart of Iterator::all().

fn any(&mut self, predicate: impl FnMut(Item<'_, Self>) -> bool) -> bool where
    Self: Sized, 

LendingIterator counterpart of Iterator::any().

fn by_ref(&mut self) -> &mut Self where
    Self: Sized, 

LendingIterator counterpart of Iterator::by_ref().

fn count(self) -> usize where
    Self: Sized, 

LendingIterator counterpart of Iterator::count().

fn find<'find>(
    &'find mut self,
    predicate: impl 'find + FnMut(&Item<'_, Self>) -> bool
) -> Option<Item<'find, Self>> where
    Self: Sized, 

LendingIterator counterpart of Iterator::find().

fn fuse(self) -> Fuse<Self> where
    Self: Sized, 

LendingIterator counterpart of Iterator::fuse().

fn nth(&mut self, n: usize) -> Option<Item<'_, Self>>

LendingIterator counterpart of Iterator::nth().

fn position<F>(
    &mut self,
    predicate: impl FnMut(Item<'_, Self>) -> bool
) -> Option<usize> where
    Self: Sized, 

LendingIterator counterpart of Iterator::position().

fn skip(self, count: usize) -> Skip<Self> where
    Self: Sized, 

LendingIterator counterpart of Iterator::skip().

fn take(self, count: usize) -> Take<Self> where
    Self: Sized, 

LendingIterator counterpart of Iterator::take().

fn map<NewItemType: HKT, F>(self, f: F) -> Map<Self, F, NewItemType> where
    for<'next> F: FnMut([&'next Self; 0], Item<'next, Self>) -> Feed<'next, NewItemType>,
    Self: Sized, 

LendingIterator counterpart of Iterator::map().

fn map_to_ref<R: ?Sized, F>(self, f: F) -> Map<Self, F, HKTRef<R>> where
    for<'any> F: FnMut([&'any Self; 0], Item<'any, Self>) -> &'any R,
    Self: Sized, 

Convenience method: same as .map(), but for hard-coding the HKT parameter to HKTRef<R> = HKT!(&R).

fn map_to_mut<R: ?Sized, F>(self, f: F) -> Map<Self, F, HKTRefMut<R>> where
    for<'any> F: FnMut([&'any Self; 0], Item<'any, Self>) -> &'any mut R,
    Self: Sized, 

Convenience method: same as .map(), but for hard-coding the HKT parameter to HKTRefMut<R> = HKT!(&mut R).

fn map_into_iter<F, NonLendingItem>(self, f: F) -> MapIntoIter<Self, F> where
    F: FnMut(Item<'_, Self>) -> NonLendingItem,
    Self: Sized, 

Convenience shorthand for .map…(…).into_iter().

fn filter_map<NewItemType: HKT, F>(self, f: F) -> FilterMap<Self, F, NewItemType> where
    for<'next> F: FnMut([&'next Self; 0], Item<'next, Self>) -> Option<Feed<'next, NewItemType>>,
    Self: Sized, 

LendingIterator counterpart of Iterator::filter_map().

fn filter_map_to_ref<R: ?Sized, F>(self, f: F) -> FilterMap<Self, F, HKTRef<R>> where
    for<'any> F: FnMut([&'any Self; 0], Item<'any, Self>) -> Option<&'any R>,
    Self: Sized, 

Convenience method: same as .filter_map(), but for hard-coding the HKT parameter to HKTRef<R> = HKT!(&R).

fn filter_map_to_mut<R: ?Sized, F>(
    self,
    f: F
) -> FilterMap<Self, F, HKTRefMut<R>> where
    for<'any> F: FnMut([&'any Self; 0], Item<'any, Self>) -> Option<&'any mut R>,
    Self: Sized, 

Convenience method: same as .filter_map(), but for hard-coding the HKT parameter to HKTRefMut<R> = HKT!(&mut R).

fn filter_map_into_iter<F, NonLendingItem>(
    self,
    f: F
) -> FilterMapIntoIter<Self, F> where
    F: FnMut(Item<'_, Self>) -> Option<NonLendingItem>,
    Self: Sized, 

Convenience shorthand for .filter_map…(…).into_iter().

fn into_iter<Item>(self) -> IntoIter<Self> where
    Self: for<'any> LendingIteratorඞItem<'any, T = Item>,
    Self: Sized, 

Convert a Self : LendingIterator into an Iterator, provided Self::Item<'_> does not depend on '_.

fn dyn_boxed<'usability>(
    self
) -> Box<dyn LendingIteratorDyn<Item = HKTItem<Self>> + 'usability> where
    Self: 'usability,
    Self: Sized, 

Available on crate feature alloc only.

Converts this LendingIterator into a Box<dyn LendingIteratorDyn…>.

fn dyn_boxed_auto<BoxedDynLendingIterator, Item: HKT>(
    self
) -> BoxedDynLendingIterator where
    Self: Sized + DynCoerce<BoxedDynLendingIterator, Item>, 

Available on crate feature alloc only.

Converts this LendingIterator into a Box<dyn LendingIteratorDyn…>.

impl<'usability, Item: HKT> LendingIterator for dyn LendingIteratorDyn<Item = Item> + Send + Sync + 'usability

dyn LendingIteratorDyn + … : LendingIterator

fn next<'next>(
    self: &'next mut (dyn LendingIteratorDyn<Item = Item> + Send + Sync + 'usability)
) -> Option<Feed<'next, Item>>

Query the next() Item of this Self iterator.

fn filter<F>(self, should_yield: F) -> Filter<Self, F> where
    Self: Sized,
    F: FnMut(&Item<'_, Self>) -> bool, 

LendingIterator counterpart of Iterator::filter().

fn for_each(self, f: impl FnMut(Item<'_, Self>)) where
    Self: Sized, 

LendingIterator counterpart of Iterator::for_each().

fn fold<Acc>(self, acc: Acc, f: impl FnMut(Acc, Item<'_, Self>) -> Acc) -> Acc where
    Self: Sized, 

LendingIterator counterpart of Iterator::fold().

fn try_for_each<Err>(
    &mut self,
    f: impl FnMut(Item<'_, Self>) -> Result<(), Err>
) -> Result<(), Err>

LendingIterator counterpart of Iterator::try_for_each().

fn try_fold<Acc, Err>(
    &mut self,
    acc: Acc,
    f: impl FnMut(Acc, Item<'_, Self>) -> Result<Acc, Err>
) -> Result<Acc, Err>

LendingIterator counterpart of Iterator::try_fold().

fn all(&mut self, predicate: impl FnMut(Item<'_, Self>) -> bool) -> bool where
    Self: Sized, 

LendingIterator counterpart of Iterator::all().

fn any(&mut self, predicate: impl FnMut(Item<'_, Self>) -> bool) -> bool where
    Self: Sized, 

LendingIterator counterpart of Iterator::any().

fn by_ref(&mut self) -> &mut Self where
    Self: Sized, 

LendingIterator counterpart of Iterator::by_ref().

fn count(self) -> usize where
    Self: Sized, 

LendingIterator counterpart of Iterator::count().

fn find<'find>(
    &'find mut self,
    predicate: impl 'find + FnMut(&Item<'_, Self>) -> bool
) -> Option<Item<'find, Self>> where
    Self: Sized, 

LendingIterator counterpart of Iterator::find().

fn fuse(self) -> Fuse<Self> where
    Self: Sized, 

LendingIterator counterpart of Iterator::fuse().

fn nth(&mut self, n: usize) -> Option<Item<'_, Self>>

LendingIterator counterpart of Iterator::nth().

fn position<F>(
    &mut self,
    predicate: impl FnMut(Item<'_, Self>) -> bool
) -> Option<usize> where
    Self: Sized, 

LendingIterator counterpart of Iterator::position().

fn skip(self, count: usize) -> Skip<Self> where
    Self: Sized, 

LendingIterator counterpart of Iterator::skip().

fn take(self, count: usize) -> Take<Self> where
    Self: Sized, 

LendingIterator counterpart of Iterator::take().

fn map<NewItemType: HKT, F>(self, f: F) -> Map<Self, F, NewItemType> where
    for<'next> F: FnMut([&'next Self; 0], Item<'next, Self>) -> Feed<'next, NewItemType>,
    Self: Sized, 

LendingIterator counterpart of Iterator::map().

fn map_to_ref<R: ?Sized, F>(self, f: F) -> Map<Self, F, HKTRef<R>> where
    for<'any> F: FnMut([&'any Self; 0], Item<'any, Self>) -> &'any R,
    Self: Sized, 

Convenience method: same as .map(), but for hard-coding the HKT parameter to HKTRef<R> = HKT!(&R).

fn map_to_mut<R: ?Sized, F>(self, f: F) -> Map<Self, F, HKTRefMut<R>> where
    for<'any> F: FnMut([&'any Self; 0], Item<'any, Self>) -> &'any mut R,
    Self: Sized, 

Convenience method: same as .map(), but for hard-coding the HKT parameter to HKTRefMut<R> = HKT!(&mut R).

fn map_into_iter<F, NonLendingItem>(self, f: F) -> MapIntoIter<Self, F> where
    F: FnMut(Item<'_, Self>) -> NonLendingItem,
    Self: Sized, 

Convenience shorthand for .map…(…).into_iter().

fn filter_map<NewItemType: HKT, F>(self, f: F) -> FilterMap<Self, F, NewItemType> where
    for<'next> F: FnMut([&'next Self; 0], Item<'next, Self>) -> Option<Feed<'next, NewItemType>>,
    Self: Sized, 

LendingIterator counterpart of Iterator::filter_map().

fn filter_map_to_ref<R: ?Sized, F>(self, f: F) -> FilterMap<Self, F, HKTRef<R>> where
    for<'any> F: FnMut([&'any Self; 0], Item<'any, Self>) -> Option<&'any R>,
    Self: Sized, 

Convenience method: same as .filter_map(), but for hard-coding the HKT parameter to HKTRef<R> = HKT!(&R).

fn filter_map_to_mut<R: ?Sized, F>(
    self,
    f: F
) -> FilterMap<Self, F, HKTRefMut<R>> where
    for<'any> F: FnMut([&'any Self; 0], Item<'any, Self>) -> Option<&'any mut R>,
    Self: Sized, 

Convenience method: same as .filter_map(), but for hard-coding the HKT parameter to HKTRefMut<R> = HKT!(&mut R).

fn filter_map_into_iter<F, NonLendingItem>(
    self,
    f: F
) -> FilterMapIntoIter<Self, F> where
    F: FnMut(Item<'_, Self>) -> Option<NonLendingItem>,
    Self: Sized, 

Convenience shorthand for .filter_map…(…).into_iter().

fn into_iter<Item>(self) -> IntoIter<Self> where
    Self: for<'any> LendingIteratorඞItem<'any, T = Item>,
    Self: Sized, 

Convert a Self : LendingIterator into an Iterator, provided Self::Item<'_> does not depend on '_.

fn dyn_boxed<'usability>(
    self
) -> Box<dyn LendingIteratorDyn<Item = HKTItem<Self>> + 'usability> where
    Self: 'usability,
    Self: Sized, 

Available on crate feature alloc only.

Converts this LendingIterator into a Box<dyn LendingIteratorDyn…>.

fn dyn_boxed_auto<BoxedDynLendingIterator, Item: HKT>(
    self
) -> BoxedDynLendingIterator where
    Self: Sized + DynCoerce<BoxedDynLendingIterator, Item>, 

Available on crate feature alloc only.

Converts this LendingIterator into a Box<dyn LendingIteratorDyn…>.

impl<'usability, Item: HKT> LendingIterator for dyn LendingIteratorDyn<Item = Item> + Sync + 'usability

dyn LendingIteratorDyn + … : LendingIterator

fn next<'next>(
    self: &'next mut (dyn LendingIteratorDyn<Item = Item> + Sync + 'usability)
) -> Option<Feed<'next, Item>>

Query the next() Item of this Self iterator.

fn filter<F>(self, should_yield: F) -> Filter<Self, F> where
    Self: Sized,
    F: FnMut(&Item<'_, Self>) -> bool, 

LendingIterator counterpart of Iterator::filter().

fn for_each(self, f: impl FnMut(Item<'_, Self>)) where
    Self: Sized, 

LendingIterator counterpart of Iterator::for_each().

fn fold<Acc>(self, acc: Acc, f: impl FnMut(Acc, Item<'_, Self>) -> Acc) -> Acc where
    Self: Sized, 

LendingIterator counterpart of Iterator::fold().

fn try_for_each<Err>(
    &mut self,
    f: impl FnMut(Item<'_, Self>) -> Result<(), Err>
) -> Result<(), Err>

LendingIterator counterpart of Iterator::try_for_each().

fn try_fold<Acc, Err>(
    &mut self,
    acc: Acc,
    f: impl FnMut(Acc, Item<'_, Self>) -> Result<Acc, Err>
) -> Result<Acc, Err>

LendingIterator counterpart of Iterator::try_fold().

fn all(&mut self, predicate: impl FnMut(Item<'_, Self>) -> bool) -> bool where
    Self: Sized, 

LendingIterator counterpart of Iterator::all().

fn any(&mut self, predicate: impl FnMut(Item<'_, Self>) -> bool) -> bool where
    Self: Sized, 

LendingIterator counterpart of Iterator::any().

fn by_ref(&mut self) -> &mut Self where
    Self: Sized, 

LendingIterator counterpart of Iterator::by_ref().

fn count(self) -> usize where
    Self: Sized, 

LendingIterator counterpart of Iterator::count().

fn find<'find>(
    &'find mut self,
    predicate: impl 'find + FnMut(&Item<'_, Self>) -> bool
) -> Option<Item<'find, Self>> where
    Self: Sized, 

LendingIterator counterpart of Iterator::find().

fn fuse(self) -> Fuse<Self> where
    Self: Sized, 

LendingIterator counterpart of Iterator::fuse().

fn nth(&mut self, n: usize) -> Option<Item<'_, Self>>

LendingIterator counterpart of Iterator::nth().

fn position<F>(
    &mut self,
    predicate: impl FnMut(Item<'_, Self>) -> bool
) -> Option<usize> where
    Self: Sized, 

LendingIterator counterpart of Iterator::position().

fn skip(self, count: usize) -> Skip<Self> where
    Self: Sized, 

LendingIterator counterpart of Iterator::skip().

fn take(self, count: usize) -> Take<Self> where
    Self: Sized, 

LendingIterator counterpart of Iterator::take().

fn map<NewItemType: HKT, F>(self, f: F) -> Map<Self, F, NewItemType> where
    for<'next> F: FnMut([&'next Self; 0], Item<'next, Self>) -> Feed<'next, NewItemType>,
    Self: Sized, 

LendingIterator counterpart of Iterator::map().

fn map_to_ref<R: ?Sized, F>(self, f: F) -> Map<Self, F, HKTRef<R>> where
    for<'any> F: FnMut([&'any Self; 0], Item<'any, Self>) -> &'any R,
    Self: Sized, 

Convenience method: same as .map(), but for hard-coding the HKT parameter to HKTRef<R> = HKT!(&R).

fn map_to_mut<R: ?Sized, F>(self, f: F) -> Map<Self, F, HKTRefMut<R>> where
    for<'any> F: FnMut([&'any Self; 0], Item<'any, Self>) -> &'any mut R,
    Self: Sized, 

Convenience method: same as .map(), but for hard-coding the HKT parameter to HKTRefMut<R> = HKT!(&mut R).

fn map_into_iter<F, NonLendingItem>(self, f: F) -> MapIntoIter<Self, F> where
    F: FnMut(Item<'_, Self>) -> NonLendingItem,
    Self: Sized, 

Convenience shorthand for .map…(…).into_iter().

fn filter_map<NewItemType: HKT, F>(self, f: F) -> FilterMap<Self, F, NewItemType> where
    for<'next> F: FnMut([&'next Self; 0], Item<'next, Self>) -> Option<Feed<'next, NewItemType>>,
    Self: Sized, 

LendingIterator counterpart of Iterator::filter_map().

fn filter_map_to_ref<R: ?Sized, F>(self, f: F) -> FilterMap<Self, F, HKTRef<R>> where
    for<'any> F: FnMut([&'any Self; 0], Item<'any, Self>) -> Option<&'any R>,
    Self: Sized, 

Convenience method: same as .filter_map(), but for hard-coding the HKT parameter to HKTRef<R> = HKT!(&R).

fn filter_map_to_mut<R: ?Sized, F>(
    self,
    f: F
) -> FilterMap<Self, F, HKTRefMut<R>> where
    for<'any> F: FnMut([&'any Self; 0], Item<'any, Self>) -> Option<&'any mut R>,
    Self: Sized, 

Convenience method: same as .filter_map(), but for hard-coding the HKT parameter to HKTRefMut<R> = HKT!(&mut R).

fn filter_map_into_iter<F, NonLendingItem>(
    self,
    f: F
) -> FilterMapIntoIter<Self, F> where
    F: FnMut(Item<'_, Self>) -> Option<NonLendingItem>,
    Self: Sized, 

Convenience shorthand for .filter_map…(…).into_iter().

fn into_iter<Item>(self) -> IntoIter<Self> where
    Self: for<'any> LendingIteratorඞItem<'any, T = Item>,
    Self: Sized, 

Convert a Self : LendingIterator into an Iterator, provided Self::Item<'_> does not depend on '_.

fn dyn_boxed<'usability>(
    self
) -> Box<dyn LendingIteratorDyn<Item = HKTItem<Self>> + 'usability> where
    Self: 'usability,
    Self: Sized, 

Available on crate feature alloc only.

Converts this LendingIterator into a Box<dyn LendingIteratorDyn…>.

fn dyn_boxed_auto<BoxedDynLendingIterator, Item: HKT>(
    self
) -> BoxedDynLendingIterator where
    Self: Sized + DynCoerce<BoxedDynLendingIterator, Item>, 

Available on crate feature alloc only.

Converts this LendingIterator into a Box<dyn LendingIteratorDyn…>.

impl<'next, 'usability, Item: HKT> LendingIteratorඞItem<'next, &'next (dyn LendingIteratorDyn<Item = Item> + 'usability)> for dyn LendingIteratorDyn<Item = Item> + 'usability

type T = <Item as WithLifetime<'next>>::T

The “output” of this whole hand-rolled GAT: think of LendingIteratorඞItem<'lt>::T as of LendingIterator::Item<'lt>.

impl<'next, 'usability, Item: HKT> LendingIteratorඞItem<'next, &'next (dyn LendingIteratorDyn<Item = Item> + Send + 'usability)> for dyn LendingIteratorDyn<Item = Item> + Send + 'usability

type T = <Item as WithLifetime<'next>>::T

The “output” of this whole hand-rolled GAT: think of LendingIteratorඞItem<'lt>::T as of LendingIterator::Item<'lt>.

impl<'next, 'usability, Item: HKT> LendingIteratorඞItem<'next, &'next (dyn LendingIteratorDyn<Item = Item> + Send + Sync + 'usability)> for dyn LendingIteratorDyn<Item = Item> + Send + Sync + 'usability

type T = <Item as WithLifetime<'next>>::T

The “output” of this whole hand-rolled GAT: think of LendingIteratorඞItem<'lt>::T as of LendingIterator::Item<'lt>.

impl<'next, 'usability, Item: HKT> LendingIteratorඞItem<'next, &'next (dyn LendingIteratorDyn<Item = Item> + Sync + 'usability)> for dyn LendingIteratorDyn<Item = Item> + Sync + 'usability

type T = <Item as WithLifetime<'next>>::T

The “output” of this whole hand-rolled GAT: think of LendingIteratorඞItem<'lt>::T as of LendingIterator::Item<'lt>.

Implementors

impl<T: LendingIterator> LendingIteratorDyn for T

impl LendingIterator : LendingIteratorDyn

type Item = HKT<dyn WithLifetime<'ඞ, T = <T as LendingIteratorඞItem<'ඞ, &'ඞ T>>::T> + 'static>