use crate::event::Callback;
use crate::Cursive;
use crate::With;
use std::rc::Rc;
#[derive(Default, Clone)]
pub struct MenuTree {
pub children: Vec<MenuItem>,
}
#[derive(Clone)]
pub enum MenuItem {
Leaf(String, Callback),
Subtree(String, Rc<MenuTree>),
Delimiter,
}
impl MenuItem {
pub fn label(&self) -> &str {
match *self {
MenuItem::Delimiter => "│",
MenuItem::Leaf(ref label, _) | MenuItem::Subtree(ref label, _) => {
label
}
}
}
pub fn is_delimiter(&self) -> bool {
match *self {
MenuItem::Delimiter => true,
_ => false,
}
}
pub fn is_leaf(&self) -> bool {
match *self {
MenuItem::Leaf(_, _) => true,
_ => false,
}
}
pub fn is_subtree(&self) -> bool {
match *self {
MenuItem::Subtree(_, _) => true,
_ => false,
}
}
pub fn as_subtree(&mut self) -> Option<&mut MenuTree> {
match *self {
MenuItem::Subtree(_, ref mut tree) => Some(Rc::make_mut(tree)),
_ => None,
}
}
}
impl MenuTree {
pub fn new() -> Self {
Self::default()
}
pub fn clear(&mut self) {
self.children.clear();
}
pub fn insert(&mut self, i: usize, item: MenuItem) {
self.children.insert(i, item);
}
pub fn insert_delimiter(&mut self, i: usize) {
self.insert(i, MenuItem::Delimiter);
}
pub fn add_delimiter(&mut self) {
let i = self.children.len();
self.insert_delimiter(i);
}
pub fn delimiter(self) -> Self {
self.with(Self::add_delimiter)
}
pub fn add_leaf<S, F>(&mut self, title: S, cb: F)
where
S: Into<String>,
F: 'static + Fn(&mut Cursive),
{
let i = self.children.len();
self.insert_leaf(i, title, cb);
}
pub fn insert_leaf<S, F>(&mut self, i: usize, title: S, cb: F)
where
S: Into<String>,
F: 'static + Fn(&mut Cursive),
{
let title = title.into();
self.insert(i, MenuItem::Leaf(title, Callback::from_fn(cb)));
}
pub fn leaf<S, F>(self, title: S, cb: F) -> Self
where
S: Into<String>,
F: 'static + Fn(&mut Cursive),
{
self.with(|menu| menu.add_leaf(title, cb))
}
pub fn insert_subtree<S>(&mut self, i: usize, title: S, tree: MenuTree)
where
S: Into<String>,
{
let title = title.into();
let tree = MenuItem::Subtree(title, Rc::new(tree));
self.insert(i, tree);
}
pub fn add_subtree<S>(&mut self, title: S, tree: MenuTree)
where
S: Into<String>,
{
let i = self.children.len();
self.insert_subtree(i, title, tree);
}
pub fn subtree<S>(self, title: S, tree: MenuTree) -> Self
where
S: Into<String>,
{
self.with(|menu| menu.add_subtree(title, tree))
}
pub fn get_mut(&mut self, i: usize) -> Option<&mut MenuItem> {
self.children.get_mut(i)
}
pub fn get_subtree(&mut self, i: usize) -> Option<&mut MenuTree> {
self.get_mut(i).and_then(MenuItem::as_subtree)
}
pub fn find_item(&mut self, title: &str) -> Option<&mut MenuItem> {
self.children
.iter_mut()
.find(|child| child.label() == title)
}
pub fn find_subtree(&mut self, title: &str) -> Option<&mut MenuTree> {
self.children
.iter_mut()
.filter(|child| child.label() == title)
.filter_map(MenuItem::as_subtree)
.next()
}
pub fn find_position(&mut self, title: &str) -> Option<usize> {
self.children
.iter()
.position(|child| child.label() == title)
}
pub fn remove(&mut self, i: usize) {
self.children.remove(i);
}
pub fn len(&self) -> usize {
self.children.len()
}
pub fn is_empty(&self) -> bool {
self.children.is_empty()
}
}