| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Add missing includes.•••Change-Id: Ic7199045d0cffb208871f52cc167194013351d32
|   Ken Wakasa | 2012-05-16 | 1 | -0/+1 |
| * | Contacts dictionary rebuilds only when contact names have changed.•••Bug: 6396600
Change-Id: Iad693ec4bab6351793d624e5c5b0a9f5c12a60e3
|   Tom Ouyang | 2012-05-11 | 1 | -1/+21 |
| * | Perform the actual bigram frequency lookup.•••This still returns the unigram frequency, because the values stored
for bigrams in the dictionary are not ready to be returned in-place
instead of unigram values. Aside from this, the code is complete.
Bug: 6313806
Change-Id: If7bb7b644730782277f0f6663334c170b7fe13fb
|   Jean Chalard | 2012-05-10 | 1 | -11/+2 |
| * | Replace the bigram list position with the map and filter•••Passing the position will not allow us a reasonable lookup
time. Replace this with a map and bloom filter for very fast
lookup.
Bug: 6313806
Change-Id: I3a61c0001cbc987c1c3c7b8df635d4590a370144
| Jean Chalard | 2012-05-07 | 1 | -0/+5 |
| * | Fill in the bloom filter for bigram lookup.•••Bug: 6313806
Change-Id: Ib79e14f6f8b241f053da6069c15f19c71084317e
| Jean Chalard | 2012-05-07 | 1 | -2/+9 |
| * | Fill up a map of bigram addresses for lookup.•••We don't want to do a linear search on each terminal when there
may be 100+ bigrams for a given word because that would be
disastrous for performance. Also, we need to resolve each bigram
address anyway.
This change resolves the addresses at first and puts them in a
balanced tree so that lookup will be O(log(n)).
Bug: 6313806
Change-Id: Ibf088035870b9acb41e948f0ab7af4726f2cee24
| Jean Chalard | 2012-05-02 | 1 | -0/+17 |
| * | Fetch and pass the bigram position on suggestions.•••This is a cherry-pick of change I2d81742f
Bug: 6313806
Change-Id: Ic1190b7980d032bc11b57841bca040d980889b6b
| Jean Chalard | 2012-04-26 | 1 | -4/+5 |
| * | Pass words as int[] to the native code.•••We need to get the bigrams during the call to getSuggestions for
bug#6313806. We already give an int[] to getSuggestions and we
wanted to get rid of char[]'s anyway because it doesn't work with
surrogate pairs, so here we go.
Bug: 6313806
Change-Id: I56ce99f1db6b3302cdf42f0527343bded837091e
| Jean Chalard | 2012-04-23 | 1 | -2/+2 |
| * | Fix debug compilation + small cleanup•••Change-Id: Ia89d84f62ba38dee05d25fbc94698e889cf27d2c
| Jean Chalard | 2012-04-17 | 1 | -1/+0 |
| * | Fix a native crash•••This was introduced by Ieb2e306a which failed to keep the return
behavior in case the word doesn't have a bigram.
Change-Id: I6d2f0b79d41c4335e94696690c8331e314961133
| Jean Chalard | 2012-04-17 | 1 | -0/+4 |
| * | Preparatory refactoring•••Split out getting the pointer to the bigrams to a separate
function. This is a preparative change to bug#6313806
Change-Id: Ieb2e306a1151cd95dc1a16793c8dc2f7fed8b654
| Jean Chalard | 2012-04-17 | 1 | -13/+19 |
| * | Remove write-only stuff•••Change-Id: I5ac8ab64c77a298502b3d063ea70db9b4da41716
| Jean Chalard | 2012-04-06 | 1 | -4/+1 |
| * | Read shortcuts as strings in the dictionary.•••This has no impact on performance.
Before:
(0) 9.61 (0.01%)
(1) 57514.58 (56.70%)
(2) 10.55 (0.01%)
(3) 10.79 (0.01%)
(4) 133.20 (0.13%)
(5) 43553.87 (42.94%)
(6) 10.03 (0.01%)
(20) 47.20 (0.05%)
Total 101431.47 (sum of others 101289.84)
After:
(0) 10.52 (0.01%)
(1) 56311.16 (56.66%)
(2) 13.40 (0.01%)
(3) 10.98 (0.01%)
(4) 136.72 (0.14%)
(5) 42707.92 (42.97%)
(6) 9.79 (0.01%)
(20) 51.35 (0.05%)
Total 99390.76 (sum of others 99251.84)
The difference is not significant with regard to measure imprecision
Change-Id: I2e4f1ef7a5e99082e67dd27f56cf4fc432bb48fa
| Jean Chalard | 2012-04-06 | 1 | -0/+1 |
| * | Move the "src" directory as a preparation for Ib4a47342 and I66f6c5b9•••Change-Id: I3ab65059f6e356530484bfd0bba26a634a4cba65
| Ken Wakasa | 2012-03-30 | 1 | -0/+165 |
