Lines Matching refs:strings
74 void Build(const std::vector<std::string>& strings);
338 void PrefixStrings::Builder::Build(const std::vector<std::string>& strings) { in Build() argument
340 for (size_t i = 0; i < strings.size(); ++i) { in Build()
343 CHECK_GT(strings[i], strings[i - 1]); in Build()
344 len = std::max(len, PrefixLen(strings[i], strings[i - 1])); in Build()
346 if (i < strings.size() - 1) { in Build()
347 len = std::max(len, PrefixLen(strings[i], strings[i + 1])); in Build()
351 prefixe_trie->Add(strings[i].substr(0, len))->value_ = 1u; in Build()
402 for (const std::string& str : strings) { in Build()
448 void AnalyzeStrings::ProcessStrings(const std::vector<std::string>& strings) { in ProcessStrings() argument
451 for (size_t i = 0; i < strings.size(); ++i) { in ProcessStrings()
454 best_len = std::max(best_len, PrefixLen(strings[i], strings[i - 1])); in ProcessStrings()
456 if (i < strings.size() - 1) { in ProcessStrings()
457 best_len = std::max(best_len, PrefixLen(strings[i], strings[i + 1])); in ProcessStrings()
464 if (strings[i].length() < 64) { in ProcessStrings()
475 prefix_builder.Build(strings); in ProcessStrings()
477 Benchmark(prefix_strings, strings, &prefix_timings_); in ProcessStrings()
485 for (const std::string& s : strings) { in ProcessStrings()
492 Benchmark(normal_strings, strings, &normal_timings_); in ProcessStrings()
497 void AnalyzeStrings::Benchmark(const Strings& strings, in Benchmark() argument
506 CHECK(strings.Equal( in Benchmark()
510 << i << ": " << strings.GetString(i) << " vs " << reference[i]; in Benchmark()
519 count += strings.Equal( in Benchmark()