lispify 0.1.0

Pretty print lisp
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106

pub mod builder;
mod display;

use alloc::{
    borrow::{Cow, ToOwned},
    boxed::Box,
    collections::VecDeque,
};
use core::{
    fmt::{Display, Formatter},
    ops::{Add, AddAssign, BitAnd, BitAndAssign},
};
use pretty_print::{
    helpers::{PrettyPrintKind, PrettySequence},
    PrettyBuilder, PrettyPrint, PrettyProvider, PrettyTree,
};
/// The lisp data structure
#[derive(Clone, Debug)]
pub enum Lisp {
    /// A single atom
    Atomic(Box<LispStyled>),
    /// A list of atoms
    Concat(VecDeque<Lisp>),
    /// A list of lists
    Sequence(VecDeque<Lisp>),
}

/// A single atom
#[derive(Clone, Debug)]
pub struct LispStyled {
    text: Cow<'static, str>,
    style: PrettyPrintKind,
}

impl Default for Lisp {
    fn default() -> Self {
        Self::Sequence(VecDeque::new())
    }
}

impl<T> AddAssign<T> for Lisp
where
    T: Into<Lisp>,
{
    fn add_assign(&mut self, rhs: T) {
        match self {
            Lisp::Sequence(list) => list.push_back(rhs.into()),
            _ => {
                let mut list = VecDeque::with_capacity(2);
                list.push_back(self.clone());
                list.push_back(rhs.into());
                *self = Lisp::Sequence(list);
            }
        }
    }
}

impl<T> BitAndAssign<T> for Lisp
where
    T: Into<Lisp>,
{
    fn bitand_assign(&mut self, rhs: T) {
        match self {
            Lisp::Concat(list) => list.push_back(rhs.into()),
            _ => {
                let mut list = VecDeque::with_capacity(2);
                list.push_back(self.clone());
                list.push_back(rhs.into());
                *self = Lisp::Concat(list);
            }
        }
    }
}

impl<T> Add<T> for Lisp
where
    T: Into<Lisp>,
{
    type Output = Lisp;

    fn add(mut self, rhs: T) -> Self::Output {
        self += rhs;
        self
    }
}

impl<T> BitAnd<T> for Lisp
where
    T: Into<Lisp>,
{
    type Output = Lisp;

    fn bitand(mut self, rhs: T) -> Self::Output {
        self &= rhs;
        self
    }
}

impl<T> FromIterator<T> for Lisp
where
    T: Into<Lisp>,
{
    fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self {
        Lisp::Sequence(iter.into_iter().map(|x| x.into()).collect())
    }
}