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
use std::io::{self};
use std::path::Path;
use std::cmp::min;
use dictionary::{self, CharCategory, WordDic, SPACE_CHAR};
use Utf16String;
pub struct Unknown {
pub category: CharCategory,
pub space_id: i32
}
impl Unknown {
pub fn new(data_dir: &Path) -> io::Result<Unknown> {
let category = CharCategory::new(data_dir)?;
Ok(Unknown {
space_id: category.category(SPACE_CHAR).id,
category: category
})
}
pub fn search(&self, text: &Utf16String, start: usize, wdic: &WordDic, callback: &mut dictionary::Callback) {
let ch = text[start];
let ct = self.category.category(ch);
if callback.is_empty() == false && ct.invoke == false {
return;
}
let is_space = ct.id == self.space_id;
let limit = min(text.len(), (ct.length as usize) + start);
for i in start..limit {
wdic.search_from_trie_id(ct.id, start, (i - start) + 1, is_space, callback);
if (i + 1) != limit && !self.category.is_compatible(ch, text[i + 1]) {
return;
}
}
if ct.group && limit < text.len() {
for i in limit..text.len() {
if !self.category.is_compatible(ch, text[i]) {
wdic.search_from_trie_id(ct.id, start, i - start, is_space, callback);
return;
}
}
wdic.search_from_trie_id(ct.id, start, text.len() - start, is_space, callback);
}
}
}