mirror of
https://github.com/harfbuzz/harfbuzz.git
synced 2025-04-13 08:42:59 +00:00
[set-digest] Rename a method
This commit is contained in:
parent
7d17ea4996
commit
80bbb0b2e9
3 changed files with 6 additions and 6 deletions
|
@ -172,7 +172,7 @@ struct RearrangementSubtable
|
|||
StateTableDriver<Types, EntryData> driver (machine, c->face);
|
||||
|
||||
if (driver.is_idempotent_on_all_out_of_bounds (&dc, c) &&
|
||||
!c->buffer_digest.may_have (c->machine_glyph_set))
|
||||
!c->buffer_digest.intersects (c->machine_glyph_set))
|
||||
{
|
||||
(void) c->buffer->message (c->font, "skipped chainsubtable because no glyph matches");
|
||||
return_trace (false);
|
||||
|
@ -340,7 +340,7 @@ struct ContextualSubtable
|
|||
StateTableDriver<Types, EntryData> driver (machine, c->face);
|
||||
|
||||
if (driver.is_idempotent_on_all_out_of_bounds (&dc, c) &&
|
||||
!c->buffer_digest.may_have (c->machine_glyph_set))
|
||||
!c->buffer_digest.intersects (c->machine_glyph_set))
|
||||
{
|
||||
(void) c->buffer->message (c->font, "skipped chainsubtable because no glyph matches");
|
||||
return_trace (false);
|
||||
|
@ -606,7 +606,7 @@ struct LigatureSubtable
|
|||
StateTableDriver<Types, EntryData> driver (machine, c->face);
|
||||
|
||||
if (driver.is_idempotent_on_all_out_of_bounds (&dc, c) &&
|
||||
!c->buffer_digest.may_have (c->machine_glyph_set))
|
||||
!c->buffer_digest.intersects (c->machine_glyph_set))
|
||||
{
|
||||
(void) c->buffer->message (c->font, "skipped chainsubtable because no glyph matches");
|
||||
return_trace (false);
|
||||
|
@ -885,7 +885,7 @@ struct InsertionSubtable
|
|||
StateTableDriver<Types, EntryData> driver (machine, c->face);
|
||||
|
||||
if (driver.is_idempotent_on_all_out_of_bounds (&dc, c) &&
|
||||
!c->buffer_digest.may_have (c->machine_glyph_set))
|
||||
!c->buffer_digest.intersects (c->machine_glyph_set))
|
||||
{
|
||||
(void) c->buffer->message (c->font, "skipped chainsubtable because no glyph matches");
|
||||
return_trace (false);
|
||||
|
|
|
@ -2033,7 +2033,7 @@ inline void hb_ot_map_t::apply (const Proxy &proxy,
|
|||
* (plus some past glyphs).
|
||||
*
|
||||
* Only try applying the lookup if there is any overlap. */
|
||||
if (accel->digest.may_have (c.digest))
|
||||
if (accel->digest.intersects (c.digest))
|
||||
{
|
||||
c.set_lookup_index (lookup_index);
|
||||
c.set_lookup_mask (lookup.mask, false);
|
||||
|
|
|
@ -158,7 +158,7 @@ struct hb_set_digest_t
|
|||
return true;
|
||||
}
|
||||
|
||||
bool may_have (const hb_set_digest_t &o) const
|
||||
bool intersects (const hb_set_digest_t &o) const
|
||||
{
|
||||
for (unsigned i = 0; i < n; i++)
|
||||
if (!(masks[i] & o.masks[i]))
|
||||
|
|
Loading…
Add table
Reference in a new issue