lalrpop 0.12.2

convenient LR(1) parser generator
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

use ascii_canvas::AsciiView;
use std::cmp;
use super::*;

#[derive(Debug)]
pub struct Wrap {
    items: Vec<Box<Content>>
}

impl Wrap {
    pub fn new(items: Vec<Box<Content>>) -> Self {
        let mut wrap_items = vec![];
        for item in items {
            item.into_wrap_items(&mut wrap_items);
        }
        Wrap { items: wrap_items }
    }
}

impl Content for Wrap {
    fn min_width(&self) -> usize {
        self.items.iter()
                  .map(|c| c.min_width())
                  .max()
                  .unwrap()
    }

    fn emit(&self, view: &mut AsciiView) {
        let columns = view.columns();
        let mut row = 0;    // current row
        let mut height = 1; // max height of anything in this row
        let mut column = 0; // current column in this row

        for item in &self.items {
            let len = item.min_width();

            // If we don't have enough space for this content,
            // then move to the next line.
            if column + len > columns {
                column = 0;
                row += height;
                height = 1;
            }

            assert!(column + len <= columns);

            let (c_row, c_column) = item.emit_at(view, row, column);
            assert!(c_column >= column);
            column = c_column + 2;
            height = cmp::max(c_row - row + 1, height);
        }
    }

    fn into_wrap_items(self: Box<Self>, wrap_items: &mut Vec<Box<Content>>) {
        wrap_items.extend(self.items); // `items` are already subdivided
    }
}