Home
last modified time | relevance | path

Searched refs:larger_set (Results 1 – 5 of 5) sorted by relevance

/third_party/skia/third_party/externals/harfbuzz/src/
Dhb-bit-set-invertible.hh163 bool is_subset (const hb_bit_set_invertible_t &larger_set) const in is_subset()
165 if (unlikely (inverted != larger_set.inverted)) in is_subset()
166 return hb_all (hb_iter (s) | hb_map (larger_set.s)); in is_subset()
168 return unlikely (inverted) ? larger_set.s.is_subset (s) : s.is_subset (larger_set.s); in is_subset()
Dhb-bit-set.hh377 bool is_subset (const hb_bit_set_t &larger_set) const in is_subset()
379 if (has_population () && larger_set.has_population () && in is_subset()
380 get_population () != larger_set.get_population ()) in is_subset()
384 for (uint32_t lpi = 0; spi < page_map.length && lpi < larger_set.page_map.length; lpi++) in is_subset()
387 uint32_t lpm = larger_set.page_map[lpi].major; in is_subset()
389 auto lp = larger_set.page_at (lpi); in is_subset()
Dhb-set.cc351 const hb_set_t *larger_set) in hb_set_is_subset() argument
353 return set->is_subset (*larger_set); in hb_set_is_subset()
Dhb-set.hh128 bool is_subset (const hb_sparseset_t &larger_set) const { return s.is_subset (larger_set.s); } in is_subset()
Dhb-set.h128 const hb_set_t *larger_set);