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
/// This file is a copy/pasted version of https://crates.io/crates/line-col with some modifications to compile with this project
#[cfg(feature = "grapheme-clusters")]
use unicode_segmentation::UnicodeSegmentation;
/// Pre-cached line/column lookup table for a string slice.
#[derive(Debug, Clone)]
pub struct LineColLookup<'source> {
src: &'source str,
line_heads: Vec<usize>
}
impl<'source> LineColLookup<'source> {
/// Creates a new line/col lookup table. The `src` parameter provides the input string used to calculate lines and columns.
///
/// Internally, this scans `src` and caches the starting positions of all lines. This means this is an O(n) operation.
pub fn new(src: &'source str) -> Self {
let line_heads: Vec<usize> = std::iter::once(0)
.chain(
src.char_indices()
.filter_map(|(i, c)| Some(i + 1).filter(|_| c == '\n'))
)
.collect();
Self { src, line_heads }
}
fn heads(&self) -> &[usize] {
&self.line_heads
}
/// Looks up the 1-based line and column numbers of the specified byte index.
///
/// Returns a tuple with the line number first, then column number.
///
/// # Panics
///
/// Panics if `index` is greater than the length of the input `&str`.
///
/// # Notes
/// This function uses a binary search to locate the line on which `index` resides.
/// This means that it runs in approximately O(log n) time.
pub fn get(&self, index: usize) -> (usize, usize) {
if index > self.src.len() {
panic!("Index cannot be greater than the length of the input slice.");
}
let heads = self.heads();
// Perform a binary search to locate the line on which `index` resides
let mut line_range = 0..heads.len();
while line_range.end - line_range.start > 1 {
let range_middle = line_range.start + (line_range.end - line_range.start) / 2;
let (left, right) = (line_range.start..range_middle, range_middle..line_range.end);
// Check which line window contains our character index
if (heads[left.start]..heads[left.end]).contains(&index) {
line_range = left;
}
else {
line_range = right;
}
}
let line_start_index = heads[line_range.start];
let line = line_range.start + 1;
let col = index - line_start_index + 1;
(line, col)
}
/// Looks up the 1-based line and column numbers of the specified byte index.
/// The column number correlates to the number of grapheme clusters up to and at the specified index.
///
/// Returns a tuple with the line number first, then column number.
///
/// # Panics
///
/// Panics if `index` is greater than the length of the input `&str`.
///
/// # Notes
/// This function uses a binary search to locate the line on which `index` resides.
/// This means that it runs in approximately O(log n) time.
#[cfg(feature = "grapheme-clusters")]
pub fn get_by_cluster(&self, index: usize) -> (usize, usize) {
if index > self.src.len() {
panic!("Index cannot be greater than the length of the input slice.");
}
if let Some(heads) = self.heads().as_ref() {
// Perform a binary search to locate the line on which `index` resides
let mut line_range = 0..heads.len();
while line_range.end - line_range.start > 1 {
let range_middle = line_range.start + (line_range.end - line_range.start) / 2;
let (left, right) = (line_range.start..range_middle, range_middle..line_range.end);
// Check which line window contains our character index
if (heads[left.start]..heads[left.end]).contains(&index) {
line_range = left;
}
else {
line_range = right;
}
}
let line_start_index = heads[line_range.start];
let line = line_range.start + 1;
let col = UnicodeSegmentation::graphemes(&self.src[line_start_index..index], true)
.count()
+ 1;
return (line, col);
}
unreachable!()
}
}
#[cfg(test)]
mod tests {
use crate::parser::line_col::LineColLookup;
use crate::*;
#[test]
fn empty_str() {
let text = "";
let lookup = LineColLookup::new(text);
assert_eq!(lookup.get(0), (1, 1));
}
#[test]
fn line_col_iter_by_codepoints() {
let text = "a\nab\nabc";
let lookup = LineColLookup::new(text);
assert_eq!(lookup.get(0), (1, 1));
assert_eq!(lookup.get(1), (1, 2));
assert_eq!(lookup.get(2), (2, 1));
assert_eq!(lookup.get(3), (2, 2));
assert_eq!(lookup.get(4), (2, 3));
assert_eq!(lookup.get(5), (3, 1));
assert_eq!(lookup.get(6), (3, 2));
assert_eq!(lookup.get(7), (3, 3));
assert_eq!(lookup.get(8), (3, 4));
}
#[test]
#[cfg(feature = "grapheme-clusters")]
fn emoji_text_by_grapheme_clusters() {
let text = "The 👨👩👦 emoji is made of 5 code points and 18 bytes in UTF-8.";
let lookup = LineColLookup::new(text);
assert_eq!(lookup.get_by_cluster(4), (1, 5));
assert_eq!(lookup.get_by_cluster(22), (1, 6));
}
#[test]
fn emoji_text_by_codepoints() {
let text = "The 👨👩👦 emoji is made of 5 code points and 18 bytes in UTF-8.";
let lookup = LineColLookup::new(text);
assert_eq!(lookup.get(4), (1, 5));
assert_eq!(lookup.get(22), (1, 23));
}
}