refactoring

Author: tomoikey

src/rule/non_empty/non_empty_iter.rs

@@ -1,6 +1,10 @@
 use crate::rule::NonEmptyRule;
 use crate::Refined;
+use std::slice::Iter;
 use std::vec::IntoIter;
 
 pub type NonEmptyIntoIter<T> = Refined<NonEmptyIntoIterRule<T>>;
 pub type NonEmptyIntoIterRule<T> = NonEmptyRule<IntoIter<T>>;
+
+pub type NonEmptyIter<'a, T> = Refined<NonEmptyIterRule<'a, T>>;
+pub type NonEmptyIterRule<'a, T> = NonEmptyRule<Iter<'a, T>>;

src/rule/non_empty/non_empty_vec.rs

@@ -1,4 +1,4 @@
-use crate::rule::{EmptyDefinition, NonEmptyIntoIter, NonEmptyRule};
+use crate::rule::{EmptyDefinition, NonEmptyIntoIter, NonEmptyIter, NonEmptyRule};
 use crate::Refined;
 
 use std::ops::Add;
@@ -16,6 +16,13 @@ where
             .ok()
             .expect("This error is always unreachable")
     }
+
+    #[allow(clippy::should_implement_trait)]
+    pub fn iter(&self) -> NonEmptyIter<T> {
+        Refined::new(self.value().iter())
+            .ok()
+            .expect("This error is always unreachable")
+    }
 }
 
 impl<T> Add for NonEmptyVec<T> {
@@ -57,4 +64,12 @@ mod test {
         assert_eq!(ne_vec.into_value(), vec![6, 12, 18]);
         Ok(())
     }
+
+    #[test]
+    fn test_iter() -> anyhow::Result<()> {
+        let ne_vec = NonEmptyVec::new(vec![1, 2, 3])?;
+        let ne_vec: NonEmptyVec<i32> = ne_vec.iter().map(|n| n * 2).map(|n| n * 3).collect();
+        assert_eq!(ne_vec.into_value(), vec![6, 12, 18]);
+        Ok(())
+    }
 }