tailspin 6.0.0

A log file highlighter
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
107
108
109
110
111
112
113
114
115
116
117
118

use memchr::memchr2;
use regex::{Regex, RegexBuilder};

use crate::style::Style;

use super::super::span::{Collector, Finder};

#[derive(Debug)]
pub(crate) struct PointerFinder {
    regex: Regex,
    number: Style,
    letter: Style,
    x: Style,
}

impl PointerFinder {
    pub fn new(number: Style, letter: Style, x: Style) -> Self {
        // Matches 0x + 8 hex (32-bit) or 0x + 16 hex (64-bit).
        // Both branches produce the same character classes, so find_iter
        // is sufficient — we just classify each byte by style.
        let pattern = r"(?i)\b0x(?:[0-9a-f]{16}|[0-9a-f]{8})\b";
        let regex = RegexBuilder::new(pattern)
            .unicode(false)
            .build()
            .expect("hardcoded pointer regex must compile");

        Self {
            regex,
            number,
            letter,
            x,
        }
    }
}

impl Finder for PointerFinder {
    fn find_spans(&self, input: &str, collector: &mut Collector) {
        if memchr2(b'x', b'X', input.as_bytes()).is_none() {
            return;
        }

        for m in self.regex.find_iter(input) {
            let offset = m.start();
            for (i, &b) in m.as_str().as_bytes().iter().enumerate() {
                let style = match b {
                    b'0'..=b'9' => self.number,
                    b'x' | b'X' => self.x,
                    b'a'..=b'f' | b'A'..=b'F' => self.letter,
                    _ => continue,
                };
                collector.push(offset + i, offset + i + 1, style);
            }
        }
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::style::Color;

    fn make_finder() -> PointerFinder {
        PointerFinder::new(
            Style::new().fg(Color::Blue),
            Style::new().fg(Color::Magenta),
            Style::new().fg(Color::Red),
        )
    }

    fn span_count(input: &str) -> usize {
        let mut collector = Collector::new(0);
        make_finder().find_spans(input, &mut collector);
        collector.into_spans().len()
    }

    fn matched_range(input: &str) -> Option<(usize, usize)> {
        let mut collector = Collector::new(0);
        make_finder().find_spans(input, &mut collector);
        let spans = collector.into_spans();
        if spans.is_empty() {
            None
        } else {
            Some((spans.first().unwrap().start, spans.last().unwrap().end))
        }
    }

    #[test]
    fn pointer_32bit() {
        let (start, end) = matched_range("0x8c2a0aeb").unwrap();
        assert_eq!(start, 0);
        assert_eq!(end, 10); // "0x" + 8 hex chars
    }

    #[test]
    fn pointer_64bit() {
        let (start, end) = matched_range("0xd7b3b2f446e2c21b").unwrap();
        assert_eq!(start, 0);
        assert_eq!(end, 18); // "0x" + 16 hex chars
    }

    #[test]
    fn pointer_distinguishes_digits_and_letters() {
        let finder = make_finder();
        // Must be exactly 8 hex chars after 0x to match 32-bit pattern
        let input = "0xab12cd34";
        let mut collector = Collector::new(0);
        finder.find_spans(input, &mut collector);
        let spans = collector.into_spans();
        // Per-char spans coalesced by style: "0" (number), "x" (x), "ab" (letter),
        // "12" (number), "cd" (letter), "34" (number)
        assert!(spans.len() >= 4);
    }

    #[test]
    fn no_pointer_no_match() {
        assert_eq!(span_count("No numbers here!"), 0);
    }
}