mirror of
https://github.com/storytold/harfbuzz.git
synced 2026-11-21 06:51:01 +01:00
Coverage format 2 now reads intersection results a word at a time, but still inserted every selected glyph separately. Add an internal word-at-a-time set insertion path and use it when the output sink is an hb_set_t, preserving the generic per-glyph fallback for other sinks. This removes another about 121M instructions from Noto Nastaliq dependency construction. The compile-only run now takes about 226ms task-clock / 229ms elapsed and 2.83B instructions, over 2,000x faster than the original 7:44.77 run. Dependency graphs match the original output for Noto Nastaliq, Noto Sans Duployan, Gulzar, Iran Nastaliq, Noto COLRv1, Amiri, and Source Serif Variable Roman. Tested with: meson test -C build Assisted-by: OpenAI Codex <codex@openai.com>
286 lines
7.6 KiB
C++
286 lines
7.6 KiB
C++
/*
|
|
* Copyright © 2021 Behdad Esfahbod
|
|
*
|
|
* This is part of HarfBuzz, a text shaping library.
|
|
*
|
|
* Permission is hereby granted, without written agreement and without
|
|
* license or royalty fees, to use, copy, modify, and distribute this
|
|
* software and its documentation for any purpose, provided that the
|
|
* above copyright notice and the following two paragraphs appear in
|
|
* all copies of this software.
|
|
*
|
|
* IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR
|
|
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
|
|
* ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
|
|
* IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
|
|
* DAMAGE.
|
|
*
|
|
* THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
|
|
* BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
|
* FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
|
|
* ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO
|
|
* PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
|
|
*/
|
|
|
|
#include "hb.hh"
|
|
#include "hb-set.hh"
|
|
|
|
int
|
|
main (int argc, char **argv)
|
|
{
|
|
|
|
/* Test copy constructor. */
|
|
{
|
|
hb_set_t v1 {1, 2};
|
|
hb_set_t v2 {v1};
|
|
hb_always_assert (v1.get_population () == 2);
|
|
hb_always_assert (hb_len (hb_iter (v1)) == 2);
|
|
hb_always_assert (v2.get_population () == 2);
|
|
}
|
|
|
|
/* Test copy assignment. */
|
|
{
|
|
hb_set_t v1 {1, 2};
|
|
hb_set_t v2;
|
|
v2 = v1;
|
|
hb_always_assert (v1.get_population () == 2);
|
|
hb_always_assert (v2.get_population () == 2);
|
|
}
|
|
|
|
/* Test move constructor. */
|
|
{
|
|
hb_set_t s {1, 2};
|
|
hb_set_t v (std::move (s));
|
|
hb_always_assert (s.get_population () == 0);
|
|
hb_always_assert (hb_len (hb_iter (s)) == 0);
|
|
hb_always_assert (v.get_population () == 2);
|
|
}
|
|
|
|
/* Test move assignment. */
|
|
{
|
|
hb_set_t s = hb_set_t {1, 2};
|
|
hb_set_t v;
|
|
v = std::move (s);
|
|
hb_always_assert (s.get_population () == 0);
|
|
hb_always_assert (v.get_population () == 2);
|
|
}
|
|
|
|
/* Test initializing from iterable. */
|
|
{
|
|
hb_set_t s;
|
|
|
|
s.add (18);
|
|
s.add (12);
|
|
|
|
hb_vector_t<hb_codepoint_t> v (s);
|
|
hb_set_t v0 (v);
|
|
hb_set_t v1 (s);
|
|
hb_set_t v2 (std::move (s));
|
|
|
|
hb_always_assert (s.get_population () == 0);
|
|
hb_always_assert (v0.get_population () == 2);
|
|
hb_always_assert (v1.get_population () == 2);
|
|
hb_always_assert (v2.get_population () == 2);
|
|
}
|
|
|
|
/* Test initializing from iterator. */
|
|
{
|
|
hb_set_t s;
|
|
|
|
s.add (18);
|
|
s << 12;
|
|
|
|
/* Sink a range. */
|
|
s << hb_codepoint_pair_t {1, 3};
|
|
|
|
hb_set_t v (hb_iter (s));
|
|
|
|
hb_always_assert (v.get_population () == 5);
|
|
}
|
|
|
|
/* Test initializing from initializer list and swapping. */
|
|
{
|
|
hb_set_t v1 {1, 2, 3};
|
|
hb_set_t v2 {4, 5};
|
|
hb_swap (v1, v2);
|
|
hb_always_assert (v1.get_population () == 2);
|
|
hb_always_assert (v2.get_population () == 3);
|
|
}
|
|
|
|
/* Test inverted sets. */
|
|
{
|
|
hb_set_t s;
|
|
s.invert();
|
|
s.del (5);
|
|
|
|
hb_codepoint_t start = HB_SET_VALUE_INVALID, last = HB_SET_VALUE_INVALID;
|
|
hb_always_assert (s.next_range (&start, &last));
|
|
hb_always_assert (start == 0);
|
|
hb_always_assert (last == 4);
|
|
hb_always_assert (s.next_range (&start, &last));
|
|
hb_always_assert (start == 6);
|
|
hb_always_assert (last == HB_SET_VALUE_INVALID - 1);
|
|
hb_always_assert (!s.next_range (&start, &last));
|
|
|
|
start = HB_SET_VALUE_INVALID;
|
|
last = HB_SET_VALUE_INVALID;
|
|
hb_always_assert (s.previous_range (&start, &last));
|
|
hb_always_assert (start == 6);
|
|
hb_always_assert (last == HB_SET_VALUE_INVALID - 1);
|
|
hb_always_assert (s.previous_range (&start, &last));
|
|
hb_always_assert (start == 0);
|
|
hb_always_assert (last == 4);
|
|
hb_always_assert (!s.previous_range (&start, &last));
|
|
|
|
hb_always_assert (s.is_inverted ());
|
|
/* Inverted set returns true for invalid value; oh well. */
|
|
hb_always_assert (s.has (HB_SET_VALUE_INVALID));
|
|
}
|
|
|
|
/* Test set intersection. */
|
|
{
|
|
hb_set_t a {1, 2};
|
|
hb_set_t b {2, 3};
|
|
hb_set_t c {3, 4};
|
|
|
|
hb_always_assert (a.intersects (b));
|
|
hb_always_assert (!a.intersects (c));
|
|
|
|
b.invert ();
|
|
hb_always_assert (a.intersects (b));
|
|
hb_always_assert (b.intersects (a));
|
|
|
|
hb_set_t singleton {2};
|
|
hb_always_assert (!singleton.intersects (b));
|
|
hb_always_assert (!b.intersects (singleton));
|
|
|
|
c.invert ();
|
|
hb_always_assert (b.intersects (c));
|
|
}
|
|
|
|
/* Test singleton detection. */
|
|
{
|
|
hb_set_t s;
|
|
hb_codepoint_t singleton;
|
|
hb_always_assert (!s.get_singleton (&singleton));
|
|
|
|
s.add (63);
|
|
hb_always_assert (s.get_singleton (&singleton));
|
|
hb_always_assert (singleton == 63);
|
|
|
|
s.add (1024);
|
|
hb_always_assert (!s.get_singleton (&singleton));
|
|
s.del (63);
|
|
hb_always_assert (s.get_singleton (&singleton));
|
|
hb_always_assert (singleton == 1024);
|
|
|
|
s.invert ();
|
|
hb_always_assert (!s.get_singleton (&singleton));
|
|
}
|
|
|
|
/* Test word-at-a-time insertion. */
|
|
{
|
|
hb_set_t s;
|
|
s.add_bits (64, uint64_t (1) | (uint64_t (1) << 63));
|
|
hb_always_assert (s.get_population () == 2);
|
|
hb_always_assert (s.has (64));
|
|
hb_always_assert (s.has (127));
|
|
|
|
s.invert ();
|
|
s.add_bits (64, uint64_t (1) | (uint64_t (1) << 63));
|
|
hb_always_assert (s.has (64));
|
|
hb_always_assert (s.has (127));
|
|
}
|
|
|
|
/* Adding HB_SET_VALUE_INVALID */
|
|
{
|
|
hb_set_t s;
|
|
|
|
s.add(HB_SET_VALUE_INVALID);
|
|
hb_always_assert(!s.has(HB_SET_VALUE_INVALID));
|
|
|
|
s.clear();
|
|
hb_always_assert(!s.add_range(HB_SET_VALUE_INVALID - 2, HB_SET_VALUE_INVALID));
|
|
hb_always_assert(!s.has(HB_SET_VALUE_INVALID));
|
|
|
|
hb_codepoint_t array[] = {(unsigned) HB_SET_VALUE_INVALID, 0, 2};
|
|
s.clear();
|
|
s.add_array(array, 3);
|
|
hb_always_assert(!s.has(HB_SET_VALUE_INVALID));
|
|
hb_always_assert(s.has(2));
|
|
|
|
hb_codepoint_t sorted_array[] = {0, 2, (unsigned) HB_SET_VALUE_INVALID};
|
|
s.clear();
|
|
s.add_sorted_array(sorted_array, 3);
|
|
hb_always_assert(!s.has(HB_SET_VALUE_INVALID));
|
|
hb_always_assert(s.has(2));
|
|
}
|
|
|
|
/* Test iteration across words and pages. */
|
|
{
|
|
hb_set_t s {0, 1, 63, 64, 65, 127, 511, 512, 513, 1024,
|
|
HB_SET_VALUE_INVALID - 1};
|
|
hb_codepoint_t expected[] = {0, 1, 63, 64, 65, 127, 511, 512, 513,
|
|
1024, HB_SET_VALUE_INVALID - 1};
|
|
unsigned int i = 0;
|
|
for (hb_codepoint_t v : s)
|
|
{
|
|
hb_always_assert (i < ARRAY_LENGTH (expected));
|
|
hb_always_assert (v == expected[i++]);
|
|
}
|
|
hb_always_assert (i == ARRAY_LENGTH (expected));
|
|
|
|
auto it = s.iter ();
|
|
hb_always_assert (*it == 0);
|
|
hb_always_assert (it.len () == ARRAY_LENGTH (expected));
|
|
++it;
|
|
hb_always_assert (*it == 1);
|
|
hb_always_assert (it.len () == ARRAY_LENGTH (expected) - 1);
|
|
--it;
|
|
hb_always_assert (*it == 0);
|
|
++it;
|
|
hb_always_assert (*it == 1);
|
|
it += 3;
|
|
hb_always_assert (*it == 65);
|
|
--it;
|
|
hb_always_assert (*it == 64);
|
|
--it;
|
|
hb_always_assert (*it == 63);
|
|
++it;
|
|
hb_always_assert (*it == 64);
|
|
|
|
it = it.end ();
|
|
--it;
|
|
hb_always_assert (*it == HB_SET_VALUE_INVALID - 1);
|
|
--it;
|
|
hb_always_assert (*it == 1024);
|
|
++it;
|
|
hb_always_assert (*it == HB_SET_VALUE_INVALID - 1);
|
|
|
|
it = s.iter ();
|
|
it += 2;
|
|
hb_always_assert (it.len () == ARRAY_LENGTH (expected) - 2);
|
|
}
|
|
|
|
/* Test inverted-set iteration. */
|
|
{
|
|
hb_set_t s {0, 1, 63, 64};
|
|
s.invert ();
|
|
auto it = s.iter ();
|
|
hb_always_assert (*it == 2);
|
|
hb_always_assert (it.len () == HB_SET_VALUE_INVALID - 4);
|
|
++it;
|
|
hb_always_assert (*it == 3);
|
|
--it;
|
|
hb_always_assert (*it == 2);
|
|
|
|
it = it.end ();
|
|
--it;
|
|
hb_always_assert (*it == HB_SET_VALUE_INVALID - 1);
|
|
--it;
|
|
hb_always_assert (*it == HB_SET_VALUE_INVALID - 2);
|
|
}
|
|
|
|
return 0;
|
|
}
|