feanor_math/seq/
conversion.rs

use std::{marker::PhantomData, num::NonZero};

use super::*;

///
/// Iterator over the elements of a [`VectorFn`].
/// Produced by the function [`VectorFn::iter()`] and [`VectorFn::into_iter()`].
/// 
#[derive(Debug)]
pub struct VectorFnIter<V: VectorFn<T>, T> {
    content: V,
    begin: usize,
    end: usize,
    element: PhantomData<T>
}

impl<V: VectorFn<T>, T> VectorFnIter<V, T> {

    pub fn new(content: V) -> Self {
        Self {
            end: content.len(),
            content: content,
            begin: 0,
            element: PhantomData
        }
    }
}

impl<V: Clone + VectorFn<T>, T> Clone for VectorFnIter<V, T> {
    
    fn clone(&self) -> Self {
        Self {
            begin: self.begin,
            end: self.end,
            content: self.content.clone(),
            element: PhantomData
        }
    }
}

impl<V: Copy + VectorFn<T>, T> Copy for VectorFnIter<V, T> {}

impl<V: VectorFn<T>, T> Iterator for VectorFnIter<V, T> {

    type Item = T;

    fn next(&mut self) -> Option<Self::Item> {
        if self.begin < self.end {
            self.begin += 1;
            return Some(self.content.at(self.begin - 1));
        } else {
            return None;
        }
    }

    fn advance_by(&mut self, n: usize) -> Result<(), NonZero<usize>> {
        if self.begin + n <= self.end {
            self.begin += n;
            return Ok(());
        } else {
            let lacking_elements = n - (self.end - self.begin);
            self.begin = self.end;
            return Err(NonZero::new(lacking_elements).unwrap())
        }
    }
}

impl<V: VectorFn<T>, T> DoubleEndedIterator for VectorFnIter<V, T> {
    fn next_back(&mut self) -> Option<Self::Item> {
        if self.begin < self.end {
            self.end -= 1;
            return Some(self.content.at(self.end));
        } else {
            return None;
        }
    }

    fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>> {
        if self.begin + n <= self.end {
            self.end -= n;
            return Ok(());
        } else {
            let lacking_elements = n - (self.end - self.begin);
            self.end = self.begin;
            return Err(NonZero::new(lacking_elements).unwrap())
        }
    }
}

impl<V: VectorFn<T>, T> ExactSizeIterator for VectorFnIter<V, T> {
    fn len(&self) -> usize {
        self.end - self.begin
    }
}

///
/// A [`VectorFn`] that produces its elements by cloning the elements of an underlying [`VectorView`].
/// Produced by the functions [`VectorView::clone_els()`] and [`VectorView::clone_ring_els()`].
/// 
#[derive(Debug)]
pub struct CloneElFn<V: VectorView<T>, T, F: Fn(&T) -> T> {
    content: V,
    clone_el: F,
    element: PhantomData<T>
}

impl<V: Clone + VectorView<T>, T, F: Clone + Fn(&T) -> T> Clone for CloneElFn<V, T, F> {
    
    fn clone(&self) -> Self {
        Self {
            clone_el: self.clone_el.clone(),
            content: self.content.clone(),
            element: PhantomData
        }
    }
}

impl<V: Copy + VectorView<T>, T, F: Copy + Fn(&T) -> T> Copy for CloneElFn<V, T, F> {}

impl<V: VectorView<T>, T, F: Fn(&T) -> T> CloneElFn<V, T, F> {

    ///
    /// Creates a new [`CloneElFn`].
    /// 
    /// In most circumstances, it is easier to instead use the functions [`VectorView::clone_els()`] 
    /// and [`VectorView::clone_ring_els()`] to produce a [`CloneElFn`].
    /// 
    pub fn new(content: V, clone_el: F) -> Self {
        Self {
            content: content,
            clone_el: clone_el,
            element: PhantomData
        }
    }
}

impl<V: SelfSubvectorView<T>, T, F: Fn(&T) -> T> SelfSubvectorFn<T> for CloneElFn<V, T, F> {

    fn restrict_full(self, range: Range<usize>) -> Self {
        Self {
            content: self.content.restrict_full(range),
            clone_el: self.clone_el,
            element: PhantomData
        }
    }
}

impl<V: VectorView<T>, T, F: Fn(&T) -> T> VectorFn<T> for CloneElFn<V, T, F> {
    
    fn at(&self, i: usize) -> T {
        (self.clone_el)(self.content.at(i))
    }

    fn len(&self) -> usize {
        self.content.len()
    }
}

///
/// Wrapper around [`VectorView`] that interprets it as a [`VectorFn`]. The elements it provides are
/// just the same references that would be returned through [`VectorFn::at()`].
/// Produced by the function [`VectorView::as_fn()`].
/// 
#[derive(Debug)]
pub struct VectorViewFn<'a, V: ?Sized + VectorView<T>, T: ?Sized> {
    content: &'a V,
    element: PhantomData<T>
}

impl<'a, V: ?Sized + VectorView<T>, T: ?Sized> Clone for VectorViewFn<'a, V, T> {
    
    fn clone(&self) -> Self {
        *self
    }
}

impl<'a, V: ?Sized + VectorView<T>, T: ?Sized> Copy for VectorViewFn<'a, V, T> {}

impl<'a, V: ?Sized + VectorView<T>, T: ?Sized> VectorViewFn<'a, V, T> {

    ///
    /// Creates a new [`VectorViewFn`].
    /// In most circumstances, it is easier to instead use the function [`VectorView::as_fn()`].
    /// 
    pub fn new(content: &'a V) -> Self {
        Self {
            content: content,
            element: PhantomData
        }
    }
}

impl<'a, V: ?Sized + VectorView<T>, T: ?Sized> VectorFn<&'a T> for VectorViewFn<'a, V, T> {
    
    fn at(&self, i: usize) -> &'a T {
        self.content.at(i)
    }

    fn len(&self) -> usize {
        self.content.len()
    }
}
feanor_math/seq/conversion.rs

feanor_math/seq/
conversion.rs
