Searched refs:possible_lengths (Results 1 – 5 of 5) sorted by relevance
68 absl::btree_set<int> possible_lengths; in TestPrefixDescriptions() local75 possible_lengths.insert(log10(prefix) + 1); in TestPrefixDescriptions()80 int possible_length = descriptions->possible_lengths[i]; in TestPrefixDescriptions()83 EXPECT_LT(descriptions->possible_lengths[i - 1], possible_length); in TestPrefixDescriptions()86 possible_lengths.find(possible_length) != possible_lengths.end()); in TestPrefixDescriptions()172 EXPECT_EQ(expected_lengths[i], desc_1_de->possible_lengths[i]); in TEST()
45 const int32* possible_lengths; member
48 possible_lengths_ = descriptions->possible_lengths; in ReadFromMap()
348 absl::btree_set<int> possible_lengths; in WritePrefixDescriptions() local354 possible_lengths.insert(static_cast<int>(log10(it->first) + 1)); in WritePrefixDescriptions()374 for (absl::btree_set<int>::const_iterator it = possible_lengths.begin(); in WritePrefixDescriptions()375 it != possible_lengths.end(); ++it) { in WritePrefixDescriptions()
415 RepeatedField<int> possible_lengths = in TestNumberLength() local436 possible_lengths.MergeFrom( in TestNumberLength()440 std::sort(possible_lengths.begin(), possible_lengths.end()); in TestNumberLength()454 if (possible_lengths.Get(0) == -1) { in TestNumberLength()465 int minimum_length = possible_lengths.Get(0); in TestNumberLength()470 } else if (*(possible_lengths.end() - 1) < actual_length) { in TestNumberLength()474 return std::find(possible_lengths.begin() + 1, possible_lengths.end(), in TestNumberLength()475 actual_length) != possible_lengths.end() in TestNumberLength()