From f8a714ec714b6a1ed63d7ca568eec153db6e5d37 Mon Sep 17 00:00:00 2001
From: Tom French <tom@tomfren.ch>
Date: Wed, 18 Dec 2024 19:21:33 +0000
Subject: [PATCH] .

---
 compiler/noirc_evaluator/src/ssa/ir/list.rs | 187 --------------------
 compiler/noirc_evaluator/src/ssa/ir/mod.rs  |   1 -
 2 files changed, 188 deletions(-)
 delete mode 100644 compiler/noirc_evaluator/src/ssa/ir/list.rs

diff --git a/compiler/noirc_evaluator/src/ssa/ir/list.rs b/compiler/noirc_evaluator/src/ssa/ir/list.rs
deleted file mode 100644
index 9a84d304444..00000000000
--- a/compiler/noirc_evaluator/src/ssa/ir/list.rs
+++ /dev/null
@@ -1,187 +0,0 @@
-use serde::{Deserialize, Serialize};
-use std::sync::Arc;
-
-/// A shared linked list type intended to be cloned
-#[derive(Clone, PartialEq, Eq, Hash, Serialize, Deserialize)]
-pub struct List<T> {
-    head: Arc<Node<T>>,
-    len: usize,
-}
-
-#[derive(Default, Clone, PartialEq, Eq, Hash, Serialize, Deserialize)]
-enum Node<T> {
-    #[default]
-    Nil,
-    Cons(T, Arc<Node<T>>),
-}
-
-impl<T> Default for List<T> {
-    fn default() -> Self {
-        List { head: Arc::new(Node::Nil), len: 0 }
-    }
-}
-
-impl<T> List<T> {
-    pub fn new() -> Self {
-        Self::default()
-    }
-
-    /// This is actually a push_front since we just create a new head for the
-    /// list. This is done so that the tail of the list can still be shared.
-    /// In the case of call stacks, the last node will be main, while the top
-    /// of the call stack will be the head of this list.
-    pub fn push_back(&mut self, value: T) {
-        self.len += 1;
-        self.head = Arc::new(Node::Cons(value, self.head.clone()));
-    }
-
-    /// It is more efficient to iterate from the head of the list towards the tail.
-    /// For callstacks this means from the top of the call stack towards main.
-    fn iter_rev(&self) -> IterRev<T> {
-        IterRev { head: &self.head, len: self.len }
-    }
-
-    pub fn clear(&mut self) {
-        *self = Self::default();
-    }
-
-    pub fn append(&mut self, other: Self)
-    where
-        T: Copy + std::fmt::Debug,
-    {
-        let other = other.into_iter().collect::<Vec<_>>();
-
-        for item in other {
-            self.push_back(item);
-        }
-    }
-
-    pub fn len(&self) -> usize {
-        self.len
-    }
-
-    pub fn is_empty(&self) -> bool {
-        self.len == 0
-    }
-
-    fn pop_front(&mut self) -> Option<T>
-    where
-        T: Copy,
-    {
-        match self.head.as_ref() {
-            Node::Nil => None,
-            Node::Cons(value, rest) => {
-                let value = *value;
-                self.head = rest.clone();
-                self.len -= 1;
-                Some(value)
-            }
-        }
-    }
-
-    pub fn truncate(&mut self, len: usize)
-    where
-        T: Copy,
-    {
-        if self.len > len {
-            for _ in 0..self.len - len {
-                self.pop_front();
-            }
-        }
-    }
-
-    pub fn unit(item: T) -> Self {
-        let mut this = Self::default();
-        this.push_back(item);
-        this
-    }
-
-    pub fn back(&self) -> Option<&T> {
-        match self.head.as_ref() {
-            Node::Nil => None,
-            Node::Cons(item, _) => Some(item),
-        }
-    }
-}
-
-pub struct IterRev<'a, T> {
-    head: &'a Node<T>,
-    len: usize,
-}
-
-impl<T> IntoIterator for List<T>
-where
-    T: Copy + std::fmt::Debug,
-{
-    type Item = T;
-
-    type IntoIter = std::iter::Rev<std::vec::IntoIter<T>>;
-
-    fn into_iter(self) -> Self::IntoIter {
-        let items: Vec<_> = self.iter_rev().copied().collect();
-        items.into_iter().rev()
-    }
-}
-
-impl<'a, T> IntoIterator for &'a List<T> {
-    type Item = &'a T;
-
-    type IntoIter = std::iter::Rev<<Vec<&'a T> as IntoIterator>::IntoIter>;
-
-    fn into_iter(self) -> Self::IntoIter {
-        let items: Vec<_> = self.iter_rev().collect();
-        items.into_iter().rev()
-    }
-}
-
-impl<'a, T> Iterator for IterRev<'a, T> {
-    type Item = &'a T;
-
-    fn next(&mut self) -> Option<Self::Item> {
-        match self.head {
-            Node::Nil => None,
-            Node::Cons(value, rest) => {
-                self.head = rest;
-                Some(value)
-            }
-        }
-    }
-
-    fn size_hint(&self) -> (usize, Option<usize>) {
-        (0, Some(self.len))
-    }
-}
-
-impl<'a, T> ExactSizeIterator for IterRev<'a, T> {}
-
-impl<T> std::fmt::Debug for List<T>
-where
-    T: std::fmt::Debug,
-{
-    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
-        write!(f, "[")?;
-        for (i, item) in self.iter_rev().enumerate() {
-            if i != 0 {
-                write!(f, ", ")?;
-            }
-            write!(f, "{item:?}")?;
-        }
-        write!(f, "]")
-    }
-}
-
-impl<T> std::fmt::Display for List<T>
-where
-    T: std::fmt::Display,
-{
-    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
-        write!(f, "[")?;
-        for (i, item) in self.iter_rev().enumerate() {
-            if i != 0 {
-                write!(f, ", ")?;
-            }
-            write!(f, "{item}")?;
-        }
-        write!(f, "]")
-    }
-}
diff --git a/compiler/noirc_evaluator/src/ssa/ir/mod.rs b/compiler/noirc_evaluator/src/ssa/ir/mod.rs
index 88e0d8900db..686606452fb 100644
--- a/compiler/noirc_evaluator/src/ssa/ir/mod.rs
+++ b/compiler/noirc_evaluator/src/ssa/ir/mod.rs
@@ -6,7 +6,6 @@ pub(crate) mod dom;
 pub(crate) mod function;
 pub(crate) mod function_inserter;
 pub(crate) mod instruction;
-pub mod list;
 pub(crate) mod map;
 pub(crate) mod post_order;
 pub(crate) mod printer;