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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
|
use enum_set::{CLike, EnumSet};
use ncurses::{attr_t, init_pair, A_BLINK, A_BOLD, A_ITALIC, A_UNDERLINE, COLORS, COLOR_PAIR};
use nom::{
branch::alt,
bytes::complete::tag,
error::{Error as NomError, ErrorKind, ParseError},
multi::many0,
Err as NomErr, IResult,
};
use std::collections::HashMap;
use std::mem;
use std::sync::Mutex;
#[derive(Debug, PartialEq, Clone, Copy)]
#[repr(u32)]
pub enum Attr {
Bold,
Italic,
Underline,
Blink,
}
impl Attr {
pub fn get_attron(&self) -> attr_t {
match *self {
Attr::Bold => A_BOLD(),
Attr::Italic => A_ITALIC(),
Attr::Underline => A_UNDERLINE(),
Attr::Blink => A_BLINK(),
}
}
}
impl CLike for Attr {
fn to_u32(&self) -> u32 {
*self as u32
}
unsafe fn from_u32(v: u32) -> Self {
mem::transmute(v)
}
}
fn parse_attr(input: &str) -> IResult<&str, Attr> {
let (input, attr) = alt((tag("b"), tag("i"), tag("u"), tag("a")))(input)?;
Ok((
input,
match attr {
"b" => Attr::Bold,
"i" => Attr::Italic,
"u" => Attr::Underline,
"a" => Attr::Blink,
_ => {
return Err(NomErr::Error(NomError::from_error_kind(
input,
ErrorKind::Tag,
)))
}
},
))
}
pub(crate) fn parse_attrs<'a>(input: &'a str) -> Result<EnumSet<Attr>, NomErr<NomError<&'a str>>> {
let (_, vec) = many0(parse_attr)(input)?;
let mut set = EnumSet::new();
set.extend(vec);
Ok(set)
}
lazy_static! {
// TODO: probably replace that mutex with an atomic.
static ref NEXT_PAIR: Mutex<i16> = Mutex::new(1);
/// a dict "color tuple -> color_pair"
/// Each time we use a color tuple, we check if it has already been used.
/// If not we create a new color_pair and keep it in that dict, to use it
/// the next time.
static ref COLOURS_DICT: Mutex<HashMap<(i16, i16), i16>> = {
Mutex::new(HashMap::new())
};
static ref TABLE_256_TO_16: Vec<u8> = vec![
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
0, 4, 4, 4, 12, 12, 2, 6, 4, 4, 12, 12, 2, 2, 6, 4,
12, 12, 2, 2, 2, 6, 12, 12, 10, 10, 10, 10, 14, 12, 10, 10,
10, 10, 10, 14, 1, 5, 4, 4, 12, 12, 3, 8, 4, 4, 12, 12,
2, 2, 6, 4, 12, 12, 2, 2, 2, 6, 12, 12, 10, 10, 10, 10,
14, 12, 10, 10, 10, 10, 10, 14, 1, 1, 5, 4, 12, 12, 1, 1,
5, 4, 12, 12, 3, 3, 8, 4, 12, 12, 2, 2, 2, 6, 12, 12,
10, 10, 10, 10, 14, 12, 10, 10, 10, 10, 10, 14, 1, 1, 1, 5,
12, 12, 1, 1, 1, 5, 12, 12, 1, 1, 1, 5, 12, 12, 3, 3,
3, 7, 12, 12, 10, 10, 10, 10, 14, 12, 10, 10, 10, 10, 10, 14,
9, 9, 9, 9, 13, 12, 9, 9, 9, 9, 13, 12, 9, 9, 9, 9,
13, 12, 9, 9, 9, 9, 13, 12, 11, 11, 11, 11, 7, 12, 10, 10,
10, 10, 10, 14, 9, 9, 9, 9, 9, 13, 9, 9, 9, 9, 9, 13,
9, 9, 9, 9, 9, 13, 9, 9, 9, 9, 9, 13, 9, 9, 9, 9,
9, 13, 11, 11, 11, 11, 11, 15, 0, 0, 0, 0, 0, 0, 8, 8,
8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 15, 15, 15, 15, 15, 15
];
}
fn colour_256_to_16(colour: i16) -> i16 {
if colour == -1 {
return -1;
}
return TABLE_256_TO_16[colour as usize] as i16;
}
fn get_pair(fg: i16, bg: i16) -> attr_t {
let mut dict = COLOURS_DICT.lock().unwrap();
if let Some(val) = dict.get(&(fg, bg)) {
return COLOR_PAIR(*val);
}
let mut pair_mut = NEXT_PAIR.lock().unwrap();
let pair = *pair_mut;
init_pair(pair, fg, bg);
dict.insert((fg, bg), pair);
*pair_mut += 1;
COLOR_PAIR(pair)
}
/// Takes a color tuple (as defined at the top of this file) and
/// returns a valid curses attr that can be passed directly to attron() or attroff()
pub fn curses_attr(mut fg: i16, mut bg: i16, mut attrs: EnumSet<Attr>) -> attr_t {
if COLORS() < 256 {
// We are not in a term supporting 256 colors, so we convert
// colors to numbers between -1 and 8.
fg = colour_256_to_16(fg);
bg = colour_256_to_16(bg);
if fg >= 8 {
fg -= 8;
attrs.insert(Attr::Bold);
}
if bg >= 8 {
bg -= 8;
}
};
let mut pair = get_pair(fg, bg);
for attr in attrs.iter() {
pair |= attr.get_attron();
}
pair
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn none() {
let attrs = "";
let expected = EnumSet::new();
let received = parse_attrs(attrs).unwrap();
assert_eq!(received, expected);
}
#[test]
fn bold_twice() {
let attrs = "bb";
let mut expected = EnumSet::new();
expected.insert(Attr::Bold);
let received = parse_attrs(attrs).unwrap();
assert_eq!(received, expected);
}
#[test]
fn all() {
let attrs = "baiu";
let mut expected = EnumSet::new();
expected.insert(Attr::Bold);
expected.insert(Attr::Blink);
expected.insert(Attr::Italic);
expected.insert(Attr::Underline);
let received = parse_attrs(attrs).unwrap();
assert_eq!(received, expected);
}
}
|
