technofab/tmux-copyrat
1
0
Fork 0
mirror of https://github.com/TECHNOFAB11/tmux-copyrat.git synced 2026-02-02 17:35:12 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

refactor: rename Match -> Span

Browse source
This commit is contained in:
graelo 2021-03-22 23:56:35 +01:00
parent 4fc7a75046
commit 9fbfff70f3
16 changed files with 316 additions and 330 deletions
Download patch file Download diff file Expand all files Collapse all files

14
src/textbuf/alphabet.rs
View file

@ -139,35 +139,35 @@ mod tests {
use super::*;
#[test]
fn simple_matches() {
fn simple_hints() {
let alphabet = Alphabet("abcd".to_string());
let hints = alphabet.make_hints(3);
assert_eq!(hints, ["a", "b", "c"]);
}
#[test]
fn composed_matches() {
fn composed_hints() {
let alphabet = Alphabet("abcd".to_string());
let hints = alphabet.make_hints(6);
assert_eq!(hints, ["a", "b", "c", "da", "db", "dc"]);
}
#[test]
fn composed_matches_multiple() {
fn composed_hints_multiple() {
let alphabet = Alphabet("abcd".to_string());
let hints = alphabet.make_hints(8);
assert_eq!(hints, ["a", "b", "ca", "cb", "da", "db", "dc", "dd"]);
}
#[test]
fn composed_matches_max_2() {
fn composed_hints_max_2() {
let alphabet = Alphabet("ab".to_string());
let hints = alphabet.make_hints(4);
assert_eq!(hints, ["aa", "ab", "ba", "bb"]);
}
#[test]
fn composed_matches_max_4() {
fn composed_hints_max_4() {
let alphabet = Alphabet("abcd".to_string());
let hints = alphabet.make_hints(13);
assert_eq!(
@ -177,7 +177,7 @@ mod tests {
}
#[test]
fn matches_with_longest_alphabet() {
fn hints_with_longest_alphabet() {
let alphabet = Alphabet("ab".to_string());
let hints = alphabet.make_hints(2500);
assert_eq!(hints.len(), 2500);
@ -186,7 +186,7 @@ mod tests {
}
#[test]
fn matches_exceed_longest_alphabet() {
fn hints_exceed_longest_alphabet() {
let alphabet = Alphabet("ab".to_string());
let hints = alphabet.make_hints(10000);
// 2500 unique hints are produced from the longest alphabet