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
|
//! Functions for computing properties of the terminal grid
use std::collections::{vec_deque, VecDeque};
use std::ops::{Index, IndexMut, Deref, DerefMut};
use std::slice::{Iter, IterMut};
use term::Cursor;
use ::Rgb;
/// Calculate the number of cells for an axis
pub fn num_cells_axis(cell_width: u32, cell_sep: i32, screen_width: u32) -> u32 {
println!("num_cells_axis(cell_width: {}, cell_sep: {}, screen_width: {}",
cell_width, cell_sep, screen_width);
((screen_width as i32 - cell_sep) as f64 / (cell_width as i32 + cell_sep) as f64) as u32
}
#[derive(Clone, Debug)]
pub struct Cell {
pub c: char,
pub fg: Rgb,
pub bg: Rgb,
}
impl Cell {
pub fn new(c: char) -> Cell {
Cell {
c: c.into(),
bg: Default::default(),
fg: Default::default(),
}
}
}
/// Represents the terminal display contents
#[derive(Clone)]
pub struct Grid {
/// Rows in the grid. Each row holds a list of cells corresponding to the columns in that row.
raw: VecDeque<Row>,
/// Number of columns
cols: usize,
/// Number of rows.
///
/// Invariant: rows is equivalent to cells.len()
rows: usize,
}
impl Grid {
pub fn new(rows: usize, cols: usize) -> Grid {
let mut raw = VecDeque::with_capacity(rows);
for _ in 0..raw.capacity() {
raw.push_back(Row::new(cols));
}
Grid {
raw: raw,
cols: cols,
rows: rows,
}
}
pub fn rows(&self) -> vec_deque::Iter<Row> {
self.raw.iter()
}
pub fn rows_mut(&mut self) -> vec_deque::IterMut<Row> {
self.raw.iter_mut()
}
pub fn num_rows(&self) -> usize {
self.rows
}
pub fn num_cols(&self) -> usize {
self.cols
}
pub fn feed(&mut self) {
// do the borrowck dance
let row = self.raw.pop_front().unwrap();
self.raw.push_back(row);
}
pub fn unfeed(&mut self) {
// do the borrowck dance
let row = self.raw.pop_back().unwrap();
self.raw.push_front(row);
}
pub fn clear(&mut self) {
for row in self.raw.iter_mut() {
for cell in row.iter_mut() {
cell.c = ' ';
}
}
}
}
impl Index<usize> for Grid {
type Output = Row;
#[inline]
fn index<'a>(&'a self, index: usize) -> &'a Row {
&self.raw[index]
}
}
impl IndexMut<usize> for Grid {
#[inline]
fn index_mut<'a>(&'a mut self, index: usize) -> &'a mut Row {
&mut self.raw[index]
}
}
impl Index<Cursor> for Grid {
type Output = Cell;
#[inline]
fn index<'a>(&'a self, cursor: Cursor) -> &'a Cell {
&self.raw[cursor.y as usize][cursor.x as usize]
}
}
impl IndexMut<Cursor> for Grid {
#[inline]
fn index_mut<'a>(&'a mut self, cursor: Cursor) -> &'a mut Cell {
&mut self.raw[cursor.y as usize][cursor.x as usize]
}
}
/// A row in the grid
#[derive(Debug, Clone)]
pub struct Row(Vec<Cell>);
impl Row {
pub fn new(columns: usize) -> Row {
Row(vec![Cell::new(' '); columns])
}
pub fn cells(&self) -> Iter<Cell> {
self.0.iter()
}
pub fn cells_mut(&mut self) -> IterMut<Cell> {
self.0.iter_mut()
}
}
impl Deref for Row {
type Target = Vec<Cell>;
fn deref(&self) -> &Self::Target {
&self.0
}
}
impl DerefMut for Row {
fn deref_mut(&mut self) -> &mut Self::Target {
&mut self.0
}
}
impl Index<usize> for Row {
type Output = Cell;
#[inline]
fn index<'a>(&'a self, index: usize) -> &'a Cell {
&self.0[index]
}
}
impl IndexMut<usize> for Row {
#[inline]
fn index_mut<'a>(&'a mut self, index: usize) -> &'a mut Cell {
&mut self.0[index]
}
}
|
