mirror of
https://github.com/yanyiwu/cppjieba.git
synced 2025-07-18 00:00:12 +08:00
commit
6aff1f637c
@ -48,17 +48,17 @@ class FullSegment: public SegmentBase {
|
|||||||
void Cut(RuneStrArray::const_iterator begin,
|
void Cut(RuneStrArray::const_iterator begin,
|
||||||
RuneStrArray::const_iterator end,
|
RuneStrArray::const_iterator end,
|
||||||
vector<WordRange>& res) const {
|
vector<WordRange>& res) const {
|
||||||
//resut of searching in trie tree
|
// resut of searching in trie tree
|
||||||
LocalVector<pair<size_t, const DictUnit*> > tRes;
|
LocalVector<pair<size_t, const DictUnit*> > tRes;
|
||||||
|
|
||||||
//max index of res's words
|
// max index of res's words
|
||||||
int maxIdx = 0;
|
size_t maxIdx = 0;
|
||||||
|
|
||||||
// always equals to (uItr - begin)
|
// always equals to (uItr - begin)
|
||||||
int uIdx = 0;
|
size_t uIdx = 0;
|
||||||
|
|
||||||
//tmp variables
|
// tmp variables
|
||||||
int wordLen = 0;
|
size_t wordLen = 0;
|
||||||
assert(dictTrie_);
|
assert(dictTrie_);
|
||||||
vector<struct Dag> dags;
|
vector<struct Dag> dags;
|
||||||
dictTrie_->Find(begin, end, dags);
|
dictTrie_->Find(begin, end, dags);
|
||||||
|
@ -142,7 +142,7 @@ inline RuneStrLite DecodeRuneInString(const char* str, size_t len) {
|
|||||||
inline bool DecodeRunesInString(const char* s, size_t len, RuneStrArray& runes) {
|
inline bool DecodeRunesInString(const char* s, size_t len, RuneStrArray& runes) {
|
||||||
runes.clear();
|
runes.clear();
|
||||||
runes.reserve(len / 2);
|
runes.reserve(len / 2);
|
||||||
for (size_t i = 0, j = 0; i < len;) {
|
for (uint32_t i = 0, j = 0; i < len;) {
|
||||||
RuneStrLite rp = DecodeRuneInString(s + i, len - i);
|
RuneStrLite rp = DecodeRuneInString(s + i, len - i);
|
||||||
if (rp.len == 0) {
|
if (rp.len == 0) {
|
||||||
runes.clear();
|
runes.clear();
|
||||||
|
Loading…
x
Reference in New Issue
Block a user