cirru_edn 0.7.5

use crate::Edn;

// List

/// List interface for Edn::List
#[derive(Debug, Clone, Default, Hash, PartialEq, Eq, PartialOrd, Ord)]
pub struct EdnListView(pub Vec<Edn>);

impl From<Vec<Edn>> for EdnListView {
  fn from(xs: Vec<Edn>) -> EdnListView {
    EdnListView(xs)
  }
}

impl From<EdnListView> for Vec<Edn> {
  fn from(x: EdnListView) -> Vec<Edn> {
    x.0
  }
}

impl From<&[Edn]> for EdnListView {
  fn from(xs: &[Edn]) -> EdnListView {
    EdnListView(xs.to_vec())
  }
}

impl From<&Vec<Edn>> for EdnListView {
  fn from(xs: &Vec<Edn>) -> EdnListView {
    EdnListView(xs.to_owned())
  }
}

impl TryFrom<Edn> for EdnListView {
  type Error = String;
  fn try_from(value: Edn) -> Result<Self, Self::Error> {
    match value {
      Edn::List(xs) => Ok(xs),
      _ => Err(format!("expecting list, got: {value}")),
    }
  }
}

impl From<EdnListView> for Edn {
  fn from(x: EdnListView) -> Edn {
    Edn::List(x)
  }
}

pub struct EdnListViewIter<'a> {
  xs: &'a [Edn],
  idx: usize,
}

impl<'a> Iterator for EdnListViewIter<'a> {
  type Item = &'a Edn;
  fn next(&mut self) -> Option<Self::Item> {
    let ret = self.xs.get(self.idx);
    self.idx += 1;
    ret
  }
}

impl<'a> IntoIterator for &'a EdnListView {
  type Item = &'a Edn;
  type IntoIter = EdnListViewIter<'a>;
  fn into_iter(self) -> Self::IntoIter {
    self.iter()
  }
}

impl EdnListView {
  /// get reference of element
  pub fn get(&self, index: usize) -> Option<&Edn> {
    self.0.get(index)
  }

  pub fn get_or_nil(&self, index: usize) -> Edn {
    if index >= self.0.len() {
      return Edn::Nil;
    }
    self.0[index].to_owned()
  }

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

  pub fn is_empty(&self) -> bool {
    self.0.is_empty()
  }

  pub fn push(&mut self, x: Edn) {
    self.0.push(x)
  }

  pub fn iter(&self) -> EdnListViewIter<'_> {
    EdnListViewIter { xs: &self.0, idx: 0 }
  }
}