Transfer commit

src/utils/substack.rs

@@ -1,8 +1,10 @@
 use std::fmt::Debug;
 
-/// Implement a FILO stack that lives on the regular call stack as a linked list.
-/// Mainly useful to detect loops in recursive algorithms where the recursion isn't
-/// deep enough to warrant a heap-allocated set
+// TODO: extract to crate
+
+/// A FILO stack that lives on the regular call stack as a linked list.
+/// Mainly useful to detect loops in recursive algorithms where
+/// the recursion isn't deep enough to warrant a heap-allocated set.
 #[derive(Clone, Copy)]
 pub struct Stackframe<'a, T> {
   pub item: T,
@@ -33,6 +35,7 @@ impl<'a, T: 'a> Stackframe<'a, T> {
       len: self.len + 1
     }
   }
+  #[allow(unused)]
   pub fn opush(prev: Option<&'a Self>, item: T) -> Self {
     Self {
       item,
@@ -40,15 +43,19 @@ impl<'a, T: 'a> Stackframe<'a, T> {
       len: prev.map_or(1, |s| s.len)
     }
   }
+  #[allow(unused)]
   pub fn len(&self) -> usize { self.len }
+  #[allow(unused)]
   pub fn pop(&self, count: usize) -> Option<&Self> {
     if count == 0 {Some(self)}
     else {self.prev.expect("Index out of range").pop(count - 1)}
   }
+  #[allow(unused)]
   pub fn opop(cur: Option<&Self>, count: usize) -> Option<&Self> {
     if count == 0 {cur}
     else {Self::opop(cur.expect("Index out of range").prev, count - 1)}
   }
+  #[allow(unused)]
   pub fn o_into_iter(curr: Option<&Self>) -> StackframeIterator<T> {
     StackframeIterator { curr }
   }
@@ -66,7 +73,9 @@ pub struct StackframeIterator<'a, T> {
 }
 
 impl<'a, T> StackframeIterator<'a, T> {
-  pub fn first_some<U, F: Fn(&T) -> Option<U>>(&mut self, f: F) -> Option<U> {
+  #[allow(unused)]
+  pub fn first_some<U, F>(&mut self, f: F) -> Option<U>
+  where F: Fn(&T) -> Option<U> {
     while let Some(x) = self.next() {
       if let Some(result) = f(x) {
         return Some(result)