[go: up one dir, main page]

unicode-segmentation 0.1.3

This crate provides Grapheme Cluster and Word boundaries according to Unicode Standard Annex #29 rules.
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

// Copyright 2012-2015 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.

use super::UnicodeSegmentation;

use std::prelude::v1::*;

#[test]
fn test_graphemes() {
    use testdata::{TEST_SAME, TEST_DIFF};

    for &(s, g) in TEST_SAME {
        // test forward iterator
        assert!(UnicodeSegmentation::graphemes(s, true)
                .zip(g.iter().cloned())
                .all(|(a,b)| a == b));
        assert!(UnicodeSegmentation::graphemes(s, false)
                .zip(g.iter().cloned())
                .all(|(a,b)| a == b));

        // test reverse iterator
        assert!(UnicodeSegmentation::graphemes(s, true).rev()
                .zip(g.iter().rev().cloned())
                .all(|(a,b)| a == b));
        assert!(UnicodeSegmentation::graphemes(s, false).rev()
                .zip(g.iter().rev().cloned())
                .all(|(a,b)| a == b));
    }

    for &(s, gt, gf) in TEST_DIFF {
        // test forward iterator
        assert!(UnicodeSegmentation::graphemes(s, true)
                .zip(gt.iter().cloned())
                .all(|(a,b)| a == b));
        assert!(UnicodeSegmentation::graphemes(s, false)
                .zip(gf.iter().cloned())
                .all(|(a,b)| a == b));

        // test reverse iterator
        assert!(UnicodeSegmentation::graphemes(s, true).rev()
                .zip(gt.iter().rev().cloned())
                .all(|(a,b)| a == b));
        assert!(UnicodeSegmentation::graphemes(s, false).rev()
                .zip(gf.iter().rev().cloned())
                .all(|(a,b)| a == b));
    }

    // test the indices iterators
    let s = "a̐éö̲\r\n";
    let gr_inds = UnicodeSegmentation::grapheme_indices(s, true).collect::<Vec<(usize, &str)>>();
    let b: &[_] = &[(0, "a̐"), (3, "é"), (6, "ö̲"), (11, "\r\n")];
    assert_eq!(gr_inds, b);
    let gr_inds = UnicodeSegmentation::grapheme_indices(s, true).rev().collect::<Vec<(usize, &str)>>();
    let b: &[_] = &[(11, "\r\n"), (6, "ö̲"), (3, "é"), (0, "a̐")];
    assert_eq!(gr_inds, b);
    let mut gr_inds_iter = UnicodeSegmentation::grapheme_indices(s, true);
    {
        let gr_inds = gr_inds_iter.by_ref();
        let e1 = gr_inds.size_hint();
        assert_eq!(e1, (1, Some(13)));
        let c = gr_inds.count();
        assert_eq!(c, 4);
    }
    let e2 = gr_inds_iter.size_hint();
    assert_eq!(e2, (0, Some(0)));

    // make sure the reverse iterator does the right thing with "\n" at beginning of string
    let s = "\n\r\n\r";
    let gr = UnicodeSegmentation::graphemes(s, true).rev().collect::<Vec<&str>>();
    let b: &[_] = &["\r", "\r\n", "\n"];
    assert_eq!(gr, b);
}

#[test]
fn test_words() {
    use testdata::TEST_WORD;

    for &(s, w) in TEST_WORD {
        // test forward iterator
        assert!(s.split_word_bounds()
                .zip(w.iter().cloned())
                .all(|(a,b)| a == b));

        // test reverse iterator
        assert!(s.split_word_bounds().rev()
                .zip(w.iter().rev().cloned())
                .all(|(a,b)| a == b));

        // generate offsets from word string lengths
        let mut indices = vec![0];
        for i in w.iter().cloned().map(|s| s.len()).scan(0, |t, n| { *t += n; Some(*t) }) {
            indices.push(i);
        }
        indices.pop();
        let indices = indices;

        // test forward indices iterator
        assert!(s.split_word_bound_indices()
                 .zip(indices.iter())
                 .all(|((l,_),m)| l == *m));

        // test backward indices iterator
        assert!(s.split_word_bound_indices().rev()
                 .zip(indices.iter().rev())
                 .all(|((l,_),m)| l == *m));
    }
}