|
|
|
|
|
|
|
|
normalized_tld.c_str()); |
|
|
normalized_tld.c_str()); |
|
|
if (n >= 0) { |
|
|
if (n >= 0) { |
|
|
// TLD is four bytes, probability table is ~12 bytes |
|
|
// TLD is four bytes, probability table is ~12 bytes |
|
|
int best_sub = ApplyCompressedProb(&kTLDHintProbs[n].key_prob[kMaxTldKey], |
|
|
|
|
|
|
|
|
int best_sub = ApplyCompressedProb((const char *)&kTLDHintProbs[n].key_prob[kMaxTldKey], |
|
|
kMaxTldVector, weight, destatep); |
|
|
kMaxTldVector, weight, destatep); |
|
|
// Never boost ASCII7; do CP1252 instead |
|
|
// Never boost ASCII7; do CP1252 instead |
|
|
if (best_sub == F_ASCII_7_bit) {best_sub = F_CP1252;} |
|
|
if (best_sub == F_ASCII_7_bit) {best_sub = F_CP1252;} |
|
|
|
|
|
|
|
|
normalized_charset.c_str()); |
|
|
normalized_charset.c_str()); |
|
|
if (n >= 0) { |
|
|
if (n >= 0) { |
|
|
// Charset is eight bytes, probability table is ~eight bytes |
|
|
// Charset is eight bytes, probability table is ~eight bytes |
|
|
int best_sub = ApplyCompressedProb(&kCharsetHintProbs[n].key_prob[kMaxCharsetKey], |
|
|
|
|
|
|
|
|
int best_sub = ApplyCompressedProb((const char *)&kCharsetHintProbs[n].key_prob[kMaxCharsetKey], |
|
|
kMaxCharsetVector, weight, destatep); |
|
|
kMaxCharsetVector, weight, destatep); |
|
|
// Never boost ASCII7; do CP1252 instead |
|
|
// Never boost ASCII7; do CP1252 instead |
|
|
if (best_sub == F_ASCII_7_bit) {best_sub = F_CP1252;} |
|
|
if (best_sub == F_ASCII_7_bit) {best_sub = F_CP1252;} |
|
|
|
|
|
|
|
|
normalized_lang.c_str()); |
|
|
normalized_lang.c_str()); |
|
|
if (n >= 0) { |
|
|
if (n >= 0) { |
|
|
// Language is eight bytes, probability table is ~eight bytes |
|
|
// Language is eight bytes, probability table is ~eight bytes |
|
|
int best_sub = ApplyCompressedProb(&kLangHintProbs[n].key_prob[kMaxLangKey], |
|
|
|
|
|
|
|
|
int best_sub = ApplyCompressedProb((const char *)&kLangHintProbs[n].key_prob[kMaxLangKey], |
|
|
kMaxLangVector, weight, destatep); |
|
|
kMaxLangVector, weight, destatep); |
|
|
// Never boost ASCII7; do CP1252 instead |
|
|
// Never boost ASCII7; do CP1252 instead |
|
|
if (best_sub == F_ASCII_7_bit) {best_sub = F_CP1252;} |
|
|
if (best_sub == F_ASCII_7_bit) {best_sub = F_CP1252;} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// Charset is eight bytes, probability table is eight bytes |
|
|
// Charset is eight bytes, probability table is eight bytes |
|
|
int toprankenc = |
|
|
int toprankenc = |
|
|
TopCompressedProb(&kLangHintProbs[n].key_prob[kMaxLangKey], |
|
|
|
|
|
|
|
|
TopCompressedProb((const char *)&kLangHintProbs[n].key_prob[kMaxLangKey], |
|
|
kMaxLangVector); |
|
|
kMaxLangVector); |
|
|
return kMapToEncoding[toprankenc]; |
|
|
return kMapToEncoding[toprankenc]; |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// TLD is four bytes, probability table is 12 bytes |
|
|
// TLD is four bytes, probability table is 12 bytes |
|
|
int toprankenc = |
|
|
int toprankenc = |
|
|
TopCompressedProb(&kTLDHintProbs[n].key_prob[kMaxTldKey], |
|
|
|
|
|
|
|
|
TopCompressedProb((const char *)&kTLDHintProbs[n].key_prob[kMaxTldKey], |
|
|
kMaxTldVector); |
|
|
kMaxTldVector); |
|
|
return kMapToEncoding[toprankenc]; |
|
|
return kMapToEncoding[toprankenc]; |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// Charset is eight bytes, probability table is eight bytes |
|
|
// Charset is eight bytes, probability table is eight bytes |
|
|
int toprankenc = |
|
|
int toprankenc = |
|
|
TopCompressedProb(&kCharsetHintProbs[n].key_prob[kMaxCharsetKey], |
|
|
|
|
|
|
|
|
TopCompressedProb((const char *)&kCharsetHintProbs[n].key_prob[kMaxCharsetKey], |
|
|
kMaxCharsetVector); |
|
|
kMaxCharsetVector); |
|
|
return kMapToEncoding[toprankenc]; |
|
|
return kMapToEncoding[toprankenc]; |
|
|
} |
|
|
} |