This change also fixes copyright comments.

Bug: 4442045
Change-Id: I297a2c64e709fb0d613404e5f1de45d810f9de15

Cherry-pick: Iae1d8e9752c355d08d7f3d0fe7057fce61ea702f
Bug: 4406840
Change-Id: I5e0109b427093a459d2937809498985dc8409f97

This is the cherry-pick Ie6e8d31e41010db27e2db415b577458b73a9f1a2

Bug: 4442045
Change-Id: I004b15858d3d69b336c66accd0e078f0eaec0a9a

Bug: 4442045
Change-Id: Iaec97c019eed8f035fef0e8f0b7604db7ecba2b7

* commit '43e0fa3a':
  Import revised translations.  DO NOT MERGE

Change-Id: I7d3771cac30793818a12ddd57baf980d7495c87e

This change considers that the point is on the key while sorting in
proximity key detection.

This change is the cherry-pick of I3ee91367.

Bug: 4353949
Change-Id: I04fa0acf4d32c18bea9640b39a5c770466a37803

Change-Id: Ifb14123f6b1f46cbfa8501696164db7b1ceb66f9

* commit 'c1fc2fe2':
  Import revised translations.  DO NOT MERGE

Change-Id: I683ff5dde869ecfe1d0a20ee69ae55d53a91feb2

Change-Id: Ica512df634b9152aac5bcd5f15d783110724fd7d

* commit '4bad47f9':
  Import revised translations.  DO NOT MERGE

Change-Id: I33a83686f71aa49855d807d580648f50ac4513da

Change-Id: I9c0ccba49ec84860ad5390d4c5f878a48f873cfe

Change-Id: Icac4b15118a9a49cac6d0c70e5783e64fa430782

Change-Id: Ieb00b75f2eb2f9a85e11c1694d42d2ee449e29e0

It used to be the case that the scoring system turns up the same word
that was entered with a different capitalization, but with a lower
score than some other, more frequent word. To cope with this, there
was code that would order such candidates in the first slot no matter
what. This processing is now useless because fully matching words now
have a huge boost that ensures they will get to the top of the list,
before any non-fully matching word (which means, differing only by
capitalization or accents).

The bug that did happen with this was, if a fully-matching word got
matched by several processing passes, and the (chronologically) later
score affected to this word was weaker, it would result in the
duplicate removal pass removing the stronger score. This in turn would
mess with autocorrect.

In an effort to keep the risk at a minimum for MR1, this change does
not actually remove the useless code, but adds a check in the odd case
to avoid the bad situation. Another change will remove the code for
ICS release.

bug: 4100269

Change-Id: I18c0575332981ffec0e257e26a360995838d521e

Change-Id: I6eaad0ee53243ae5eece9bc6f8013eb77472e988

Change-Id: I660c6bc3b40072e209fe31c3c86ad11ce7928a71

Bug: 4063047
Change-Id: I53e79edcb15d4da73a72d14a38224e80b612c115

Bug: 4051276
Change-Id: I980c0dfefdf3ae70935aca9755a55d1c925a23f9

Bug: 4027223

Change-Id: Ie9a5552d2f41d60f433573fde52efc097f5143bf

Bug: 3447571

Change-Id: I538e4e706982129b666ca1ab1085f1b68b69f87f

Bug: 4027223

Change-Id: Icf7c5b917c18b565dca95b98b96c1c8e2963f540

Change-Id: I2d90d6842d8572db68b3034917fa45e642c7f123

Bug: 3311719

-- also fixed compiler warnings

Change-Id: I6941c0d02f10d67af88bc943748dde8d8783fabb

Bug: 3311719

Change-Id: Ide12a4a6280103c092fa0f563dd5b9e3f7f5c89b

Words that matched user input with skipped characters used to be demoted
in BinaryDictionary by a constant factor and not at all in those dictionaries
implemented in java code. To represent the fact that the impact of a skipped
character gets larger as the word is shorter, this change will implement a
demotion that gets larger as the typed word is shorter. The demotion rate
is (n - 2) / (n - 1) where n is the length of the typed word for n >= 2.
It implements it for both BinaryDictionary and java dictionaries.

Bug: 3340731
Change-Id: I3a18be80a9708981d56a950dc25fe08f018b5b89

bug: 3514797
Change-Id: Ie1056745ded1f848d1e4f70c5344d6969de509b0

Change-Id: Icc96e318e240e58b07ec52e64fb640b3bc9f6443

Change-Id: I161b451404bbecb30d8e229004786b9e9882e41c