use crate::{Node, NodeIndex, Tree, WindowState};
#[derive(Clone, Debug)]
#[cfg_attr(feature = "serde", derive(serde::Deserialize, serde::Serialize))]
pub enum Surface<Tab> {
Empty,
Main(Tree<Tab>),
Window(Tree<Tab>, WindowState),
}
impl<Tab> Surface<Tab> {
pub const fn is_empty(&self) -> bool {
matches!(self, Self::Empty)
}
pub fn node_tree(&self) -> Option<&Tree<Tab>> {
match self {
Surface::Empty => None,
Surface::Main(tree) => Some(tree),
Surface::Window(tree, _) => Some(tree),
}
}
pub fn node_tree_mut(&mut self) -> Option<&mut Tree<Tab>> {
match self {
Surface::Empty => None,
Surface::Main(tree) => Some(tree),
Surface::Window(tree, _) => Some(tree),
}
}
pub fn iter_nodes(&self) -> impl Iterator<Item = &Node<Tab>> {
match self.node_tree() {
Some(tree) => tree.iter(),
None => core::slice::Iter::default(),
}
}
pub fn iter_nodes_mut(&mut self) -> impl Iterator<Item = &mut Node<Tab>> {
match self.node_tree_mut() {
Some(tree) => tree.iter_mut(),
None => core::slice::IterMut::default(),
}
}
pub fn iter_all_tabs(&self) -> impl Iterator<Item = (NodeIndex, &Tab)> {
self.iter_nodes()
.enumerate()
.flat_map(|(index, node)| node.iter_tabs().map(move |tab| (NodeIndex(index), tab)))
}
pub fn iter_all_tabs_mut(&mut self) -> impl Iterator<Item = (NodeIndex, &mut Tab)> {
self.iter_nodes_mut()
.enumerate()
.flat_map(|(index, node)| node.iter_tabs_mut().map(move |tab| (NodeIndex(index), tab)))
}
pub fn map_tabs<F, NewTab>(&self, function: F) -> Surface<NewTab>
where
F: FnMut(&Tab) -> NewTab + Clone,
{
match self {
Surface::Empty => Surface::Empty,
Surface::Main(tree) => Surface::Main(tree.map_tabs(function)),
Surface::Window(tree, window_state) => {
Surface::Window(tree.map_tabs(function), window_state.clone())
}
}
}
}