Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
LatinIME
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Deploy
Releases
Package Registry
Container Registry
Model registry
Operate
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
keyboard
LatinIME
Commits
bb15e775
Commit
bb15e775
authored
13 years ago
by
Jean Chalard
Browse files
Options
Downloads
Patches
Plain Diff
Move a function to make next commit more readable
Change-Id: Ieaa935ff4d68ce88137dcc5c672a4149a4c9c64f
parent
e6715e32
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
native/src/unigram_dictionary.h
+2
-2
2 additions, 2 deletions
native/src/unigram_dictionary.h
with
2 additions
and
2 deletions
native/src/unigram_dictionary.h
+
2
−
2
View file @
bb15e775
...
...
@@ -90,6 +90,8 @@ private:
inline
const
int
*
getInputCharsAt
(
const
int
index
)
const
{
return
mInputCodes
+
(
index
*
MAX_PROXIMITY_CHARS
);
}
int
getMostFrequentWordLike
(
const
int
startInputIndex
,
const
int
inputLength
,
unsigned
short
*
word
);
void
getWordsRec
(
const
int
childrenCount
,
const
int
pos
,
const
int
depth
,
const
int
maxDepth
,
const
bool
traverseAllNodes
,
const
int
snr
,
const
int
inputIndex
,
const
int
diffs
,
const
int
skipPos
,
const
int
excessivePos
,
const
int
transposedPos
,
int
*
nextLetters
,
...
...
@@ -98,8 +100,6 @@ private:
void
getWordsOld
(
const
int
initialPos
,
const
int
inputLength
,
const
int
skipPos
,
const
int
excessivePos
,
const
int
transposedPos
,
int
*
nextLetters
,
const
int
nextLettersSize
);
int
getMostFrequentWordLike
(
const
int
startInputIndex
,
const
int
inputLength
,
unsigned
short
*
word
);
// Process a node by considering missing space
bool
processCurrentNodeForExactMatch
(
const
int
firstChildPos
,
const
int
startInputIndex
,
const
int
depth
,
unsigned
short
*
word
,
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment