lazy-cogs 1.0.0

use std::{collections::LinkedList, mem};

use crate::{lazy::LazyClone, lc::Lc};

#[derive(Debug)]
/// lazy-cogs implementation of a LinkedList. 
/// It's a collection meant to be used when you need to work with the whole data, not it's elements
/// 
/// Cloning a LazyList is always O(1). Modifing or getting piecies of data is O(n). 
/// Actually, pushing and popping into/from the front or back of the list may be O(1) is the list is mutable
pub struct LazyList<T: Clone> { 
    list: Lc<LinkedList<Lc<T>>>,
}

impl<T: Clone> LazyList<T> {
    /// Creates a new empty LazyList
    pub fn new() -> Self {
        Self{
            list: Lc::new(LinkedList::new())
        }
    }

    /// Obtains a reference to a specific value in the list
    /// 
    /// If the index is out of range it returns `None`
    /// 
    /// This operation is **always** O(n)
    pub fn get(&self, index: usize) -> Option<&T> {
        let list = self.list.read();
        
        list.iter().nth(index).map(Lc::read)
    }

    /// Obtains a mutable reference to a specific value in the list
    /// 
    /// If the index is out of range it returns `None`
    /// 
    /// This operation is protected, it means, that the other clones aren't affected
    pub fn get_mut(&mut self, index: usize) -> Option<&mut T> {
        let list = self.list.read_mut();
        
        list.iter_mut().nth(index).map(Lc::read_mut)
    }

    /// Obtains a lazy clone to a specific value in the list
    pub fn get_lazy(&self, index: usize) -> Option<Lc<T>> {
        self.list.iter().nth(index).cloned()
    }

    /// Changes the value at a given position of the list
    ///
    /// Returns Ok(()) if the index is in-bounds and Err(()) if not
    pub fn set(&mut self, index: usize, value: T) -> Result<(), ()>{
        let mut list = if self.is_mutable() {
            // We can modify ourselves with no side effects
            
            unsafe { 
                mem::replace(
                    &mut self.list,
                    Lc::new(LinkedList::new()))
                .destroy() 
            }
        } else {
            // We need to clone the vector so we don't mess with other clones
            self.list.take()
        };

        let res = match list.iter_mut().nth(index) {
            Some(elem) => {
                elem.write(value);
                Ok(())
            },
            None => Err(()),
        };

        // We need to mutate ourselves, to use the new modified vector, 
        // and update our state to Mutable
        self.list = Lc::new(list);

        res
    }

    /// Pushes a new element at the end of the list
    pub fn push_back(&mut self, value: T) {
        let mut list = if self.is_mutable() {
            unsafe {
                mem::replace(
                    &mut self.list, 
                    Lc::new(LinkedList::new()))
                    .destroy()
            }
        } else {
            self.list.take()
        };

        list.push_back(Lc::new(value));

        self.list = Lc::new(list);
    }

    /// Pushes a new element at the beginning of the list
    pub fn push_front(&mut self, value: T) {
        let mut list = if self.is_mutable() {
            unsafe {
                mem::replace(
                    &mut self.list, 
                    Lc::new(LinkedList::new()))
                    .destroy()
            }

        } else {
            self.list.take()
        };

        list.push_front(Lc::new(value));

        self.list = Lc::new(list);

    }

    /// Pops an element from the end of the list and returns the lazy clone to the value
    pub fn pop_back_lazy(&mut self) -> Option<Lc<T>> {
        let mut list = if self.is_mutable() {
            unsafe {
                mem::replace(
                    &mut self.list, 
                    Lc::new(LinkedList::new()))
                    .destroy()
            }
        } else {
            self.list.take()
        };

        let res = list.pop_back();

        self.list = Lc::new(list);

        res
    }

    /// Pops an element from the beginning of the list and returns the lazy clone to the value
    pub fn pop_front_lazy(&mut self) -> Option<Lc<T>> {
        let mut list = if self.is_mutable() {
            unsafe {
                mem::replace(
                    &mut self.list, 
                    Lc::new(LinkedList::new()))
                    .destroy()
            }
        } else {
            self.list.take()
        };

        let res = list.pop_front();

        self.list = Lc::new(list);

        res
    }

    #[inline(always)]
    /// Pops an element from the end of the list and returns the lazy clone to the value
    pub fn pop_back(&mut self) -> Option<T> {
        self.pop_back_lazy().map(Lc::unwrap)
    }

    #[inline(always)]
    /// Pops an element from the beginning of the list and returns the lazy clone to the value
    pub fn pop_front(&mut self) -> Option<T> {
        self.pop_front_lazy().map(Lc::unwrap)
    }

    #[inline(always)]
    /// Returns a reference to the first element of the list
    ///
    /// Return `None` if the list is empty
    pub fn front(&self) -> Option<&T> {
        self.list.read().front().map(Lc::read)
    }

    #[inline(always)]
    /// Returns a mutable reference to the first element of the list
    /// 
    /// Return `None` if the list is empty
    /// 
    /// This operation is protected, it means, that the other clones aren't affected
    pub fn front_mut(&mut self) -> Option<&mut T> {
        self.list.read_mut().front_mut().map(Lc::read_mut)
    }

    #[inline(always)]
    /// Returns a lazy clone to the first element of the list
    ///
    /// Returns `None` if the list is empty
    pub fn front_lazy(&self) -> Option<Lc<T>> {
        self.list.read().front().cloned()
    }

    #[inline(always)]
    /// Returns a reference to the last element of the list
    ///
    /// Return `None` if the list is empty
    pub fn back(&self) -> Option<&T> {
        self.list.read().back().map(Lc::read)
    }

    #[inline(always)]
    /// Returns a mutable reference to the last element of the list
    ///
    /// Return `None` if the list is empty
    /// 
    /// This operation is protected, it means, that the other clones aren't affected
    pub fn back_mut(&mut self) -> Option<&mut T> {
        self.list.read_mut().back_mut().map(Lc::read_mut)
    }

    #[inline(always)]
    /// Returns a lazy clone to the last element of the list
    ///
    /// Returns `None` if the list is empty
    pub fn back_lazy(&self) -> Option<Lc<T>> {
        self.list.read().back().cloned()
    }

    #[inline(always)]
    /// Produces an iterator over the elements of the list
    pub fn iter(&self) -> impl Iterator<Item = &T> {
        let list = self.list.read();
        list.iter().map(Lc::read)
    }

    #[inline(always)]
    /// Produces a mutable iterator over the elements of the list
    pub fn iter_mut(&mut self) -> impl Iterator<Item = &mut T> {
        let list = self.list.read_mut();
        list.iter_mut().map(Lc::read_mut)
    }
}

impl<T: Clone> LazyClone for LazyList<T> {
    fn lazy(&self) -> Self {
        Self { 
            list: self.list.lazy()
        }
    }

    fn eager(&self) -> Self {
        Self { 
            list: self.list.eager()
        }
    }

    fn is_mutable(&self) -> bool {
        self.list.is_mutable()
    }
}

impl<T: Clone> From<LinkedList<Lc<T>>> for LazyList<T> {
    fn from(value: LinkedList<Lc<T>>) -> Self {
        Self { 
            list: Lc::new(value) 
        }
    }
}

impl<T: Clone> From<LinkedList<T>> for LazyList<T> {
    fn from(value: LinkedList<T>) -> Self {
        Self {
            list: Lc::new(value.into_iter()
                .map(Lc::new)
                .collect()
            ),
        }
    }
}

impl<T: Clone> From<Vec<Lc<T>>> for LazyList<T> {
    fn from(value: Vec<Lc<T>>) -> Self {
        Self { 
            list: Lc::new(value.into_iter().collect()) 
        }
    }
}

impl<T: Clone> From<Vec<T>> for LazyList<T> {
    fn from(value: Vec<T>) -> Self {
        Self {
            list: Lc::new(value.into_iter()
                .map(Lc::new)
                .collect()
            ),
        }
    }
}

impl<T: Clone> From<&[T]> for LazyList<T> {
    fn from(value: &[T]) -> Self {
        value.to_vec()
            .into_iter()
            .collect()
    }
}

impl<T: Clone> Into<LinkedList<Lc<T>>> for LazyList<T> {
    fn into(self) -> LinkedList<Lc<T>> {
        self.list.unwrap()
            .into_iter()
            .collect()
    }
}

impl<T: Clone> Into<LinkedList<T>> for LazyList<T> {
    fn into(self) -> LinkedList<T> {
        self.list.unwrap()
            .into_iter()
            .map(|elem| elem.unwrap())
            .collect()
    }
}

impl<T: Clone> FromIterator<T> for LazyList<T> {
    fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self {
        LinkedList::from_iter(iter).into()
    }
}

impl<T: Clone> IntoIterator for LazyList<T> {
    type Item = T;
    type IntoIter = std::collections::linked_list::IntoIter<T>;

    fn into_iter(self) -> Self::IntoIter {
        self.list.take()
            .into_iter()
            .map(Lc::unwrap)
            .collect::<LinkedList<T>>().into_iter()
    }
}


#[cfg(test)]
mod tests {
    use std::iter::zip;

    use crate::lazy::LazyClone;

    use super::LazyList;

    #[test]
    fn create() {
        let mut lv = LazyList::<Box<str>>::from(&["Hello".into(), "World".into(), "Take".into(), "a look at this".into()] as &[Box<str>]);
        let mut lv2 = lv.lazy();
        let mut lv3 = lv2.lazy();

        let _ = lv.set(0, "Bye".into());
        let _ = lv2.set(2, "Give".into());
        let _ = lv3.set(1, "Värld".into());

        // Check if the boxes are the same, so we are safely reusing memory
        assert_eq!(lv.get(1).unwrap().as_ref() as *const str, lv2.get(1).unwrap().as_ref() as *const str);
        // Check if the boxes are not the same, so we cloned what was needed
        assert_ne!(lv.get(1).unwrap().as_ref() as *const str, lv3.get(1).unwrap().as_ref() as *const str);
    }

    #[test]
    #[allow(unused_mut)]
    #[allow(unused_results)]
    #[allow(unused_must_use)]
    fn mutability_check() {
        let mut lv = LazyList::from(vec!["HI", "Goodbye", "Farwell", "Hello"]);
        let mut lv2 = lv.lazy();
        let mut lv3 = lv2.lazy();
        let mut lv4 = lv2.lazy();
        
        lv2.set(3, "Halo");
        lv.set(0, "Hej");

        assert!(lv.is_mutable());
        assert!(lv2.is_mutable());
        assert!(!lv3.is_mutable());
        assert!(!lv4.is_mutable());

        for e in zip(zip(lv.iter(), lv2.iter()), zip(lv3.iter(), lv4.iter())) {
            println!("{:?} : {:?} : {:?} : {:?}", e.0.0.as_ptr(), e.0.1.as_ptr(), e.1.0.as_ptr(), e.1.1.as_ptr())
        }
    }

    #[test]
    fn iterators() {
        let lv = LazyList::from([String::from("rust"), String::from("mojo"), String::from("zig"), String::from("carbon"),String::from("aura")].to_vec());

        lv.iter()
            .map(|elem| elem.to_uppercase())
            .for_each(|elem| println!("{:?}", elem));

        lv.into_iter()
            .map(|elem| elem
                .chars()
                .rev()
                .collect::<String>()
            )
            .for_each(|elem| println!("{:?}", elem));
    }

    #[test]
    fn collecting() {
        let v = vec!["Hi", "my", "name", "is", "something"];
        let lv: LazyList<_> = v.into_iter()
            .collect();

        dbg!(lv);
    }
}