/third_party/skia/third_party/externals/abseil-cpp/absl/strings/ |
D | cord_ring_reader_test.cc | 44 CordRepRing* FromFlats(Span<absl::string_view const> flats) { in FromFlats() argument 45 CordRepRing* ring = CordRepRing::Create(MakeFlat(flats[0]), flats.size() - 1); in FromFlats() 46 for (int i = 1; i < flats.size(); ++i) { in FromFlats() 47 ring = CordRepRing::Append(ring, MakeFlat(flats[i])); in FromFlats() 73 auto flats = TestFlats(); in TEST() local 74 CordRepRing* ring = FromFlats(flats); in TEST() 77 EXPECT_THAT(first, Eq(flats[0])); in TEST() 83 EXPECT_THAT(reader.consumed(), Eq(flats[0].length())); in TEST() 95 auto flats = TestFlats(); in TEST() local 96 CordRepRing* ring = FromFlats(flats); in TEST() [all …]
|
D | cord_ring_test.cc | 135 std::vector<string_view> flats; in ToFlats() local 136 flats.reserve(r->entries()); in ToFlats() 139 flats.push_back(r->entry_data(pos)); in ToFlats() 141 return flats; in ToFlats() 176 std::vector<not_a_string_view> flats; in ToRawFlats() local 177 flats.reserve(r->entries()); in ToRawFlats() 180 flats.emplace_back(r->entry_data(pos)); in ToRawFlats() 182 return flats; in ToRawFlats() 301 CordRepRing* FromFlats(Span<const char* const> flats, in FromFlats() argument 303 if (flats.empty()) return nullptr; in FromFlats() [all …]
|
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
D | cord_rep_btree_navigator_test.cc | 77 const std::vector<CordRep*>& flats() const { return flats_; } in flats() function in absl::cord_internal::__anon78aad8a50111::CordRepBtreeNavigatorTest 114 EXPECT_THAT(nav.Current(), Eq(flats().front())); in TEST_P() 115 EXPECT_THAT(edge, Eq(flats().front())); in TEST_P() 123 EXPECT_THAT(nav.Current(), Eq(flats().back())); in TEST_P() 124 EXPECT_THAT(edge, Eq(flats().back())); in TEST_P() 130 const Flats& flats = this->flats(); in TEST_P() local 133 EXPECT_THAT(nav.Current(), Eq(flats.front())); in TEST_P() 134 for (int i = 1; i < flats.size(); ++i) { in TEST_P() 135 ASSERT_THAT(nav.Next(), Eq(flats[i])); in TEST_P() 136 EXPECT_THAT(nav.Current(), Eq(flats[i])); in TEST_P() [all …]
|
D | cord_rep_btree_test.cc | 209 std::vector<CordRep*> flats = CreateFlatsFromString(data, chunk_size); in CreateTree() local 210 auto it = flats.begin(); in CreateTree() 212 while (++it != flats.end()) tree = CordRepBtree::Append(tree, *it); in CreateTree() 217 std::vector<CordRep*> flats = CreateFlatsFromString(data, chunk_size); in CreateTreeReverse() local 218 auto rit = flats.rbegin(); in CreateTreeReverse() 220 while (++rit != flats.rend()) tree = CordRepBtree::Prepend(tree, *rit); in CreateTreeReverse() 369 std::vector<CordRep*> flats; in TEST_P() local 370 flats.push_back(MakeHexFlat(0)); in TEST_P() 371 auto* leaf = CordRepBtree::Create(flats.back()); in TEST_P() 375 flats.push_back(MakeHexFlat(i)); in TEST_P() [all …]
|
D | cord_rep_test_util.h | 101 std::vector<cord_internal::CordRep*> flats; in CreateFlatsFromString() local 103 flats.push_back(MakeFlat(s.substr(0, chunk_size))); in CreateFlatsFromString() 105 return flats; in CreateFlatsFromString() 109 absl::Span<cord_internal::CordRep* const> flats) { in CordRepBtreeFromFlats() argument 110 assert(!flats.empty()); in CordRepBtreeFromFlats() 111 auto* node = cord_internal::CordRepBtree::Create(flats[0]); in CordRepBtreeFromFlats() 112 for (size_t i = 1; i < flats.size(); ++i) { in CordRepBtreeFromFlats() 113 node = cord_internal::CordRepBtree::Append(node, flats[i]); in CordRepBtreeFromFlats()
|
D | cord_rep_btree_reader_test.cc | 57 std::vector<CordRep*> flats = CreateFlatsFromString(data, kChars); in TEST() local 58 CordRepBtree* node = CordRepBtreeFromFlats(flats); in TEST() 89 std::vector<CordRep*> flats = CreateFlatsFromString(data, kChars); in TEST() local 90 CordRepBtree* node = CordRepBtreeFromFlats(flats); in TEST() 132 std::vector<CordRep*> flats = CreateFlatsFromString(data, kChars); in TEST() local 133 CordRepBtree* node = CordRepBtreeFromFlats(flats); in TEST() 162 std::vector<CordRep*> flats = CreateFlatsFromString(data, 5); in TEST() local 163 CordRepBtree* node = CordRepBtreeFromFlats(flats); in TEST() 244 std::vector<CordRep*> flats = CreateFlatsFromString(data, kChars); in TEST() local 245 CordRepBtree* node = CordRepBtreeFromFlats(flats); in TEST()
|
D | cord_rep_ring.cc | 516 const size_t flats = (data.length() - 1) / kMaxFlatLength + 1; in Append() local 517 rep = Mutable(rep, flats); in Append() 551 const size_t flats = (data.length() - 1) / kMaxFlatLength + 1; in Prepend() local 552 rep = Mutable(rep, flats); in Prepend() 554 Filler filler(rep, rep->retreat(rep->head_, static_cast<index_type>(flats))); in Prepend() 556 size_t first_size = data.size() - (flats - 1) * kMaxFlatLength; in Prepend()
|
/third_party/skia/third_party/externals/freetype/src/autofit/ |
D | afcjk.c | 281 FT_Pos flats[AF_BLUE_STRING_MAX_LEN]; in af_cjk_metrics_init_blues() local 487 flats[num_flats++] = best_pos; in af_cjk_metrics_init_blues() 505 af_sort_pos( num_flats, flats ); in af_cjk_metrics_init_blues() 521 *blue_shoot = flats[num_flats / 2]; in af_cjk_metrics_init_blues() 526 *blue_shoot = flats[num_flats / 2]; in af_cjk_metrics_init_blues()
|
D | aflatin.c | 317 FT_Pos flats [AF_BLUE_STRING_MAX_LEN]; in af_latin_metrics_init_blues() local 891 flats[num_flats++] = best_y_extremum; in af_latin_metrics_init_blues() 910 af_sort_pos( num_flats, flats ); in af_latin_metrics_init_blues() 926 *blue_shoot = flats[num_flats / 2]; in af_latin_metrics_init_blues() 930 *blue_ref = flats [num_flats / 2]; in af_latin_metrics_init_blues()
|
/third_party/rust/crates/memchr/bench/data/opensubtitles/ |
D | en-medium.txt | 325 Otherwise ride the flats. 1751 Otherwise ride the flats.
|
D | en-huge.txt | 325 Otherwise ride the flats. 1751 Otherwise ride the flats. 3181 Otherwise ride the flats.
|
/third_party/icu/icu4j/perf-tests/data/collation/ |
D | ulyss10.txt | 31976 somewhere I went up Windmill hill to the flats that Sunday morning with
|