< prev index next >
src/java.desktop/share/native/libfontmanager/harfbuzz/hb-set.hh
Print this page
*** 22,36 ****
* PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
*
* Google Author(s): Behdad Esfahbod
*/
! #ifndef HB_SET_PRIVATE_HH
! #define HB_SET_PRIVATE_HH
! #include "hb-private.hh"
! #include "hb-object-private.hh"
/*
* hb_set_t
*/
--- 22,35 ----
* PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
*
* Google Author(s): Behdad Esfahbod
*/
! #ifndef HB_SET_HH
! #define HB_SET_HH
! #include "hb.hh"
/*
* hb_set_t
*/
*** 38,76 ****
/* TODO Keep a free-list so we can free pages that are completely zeroed. At that
* point maybe also use a sentinel value for "all-1" pages? */
struct hb_set_t
{
struct page_map_t
{
! inline int cmp (const page_map_t *o) const { return (int) o->major - (int) major; }
uint32_t major;
uint32_t index;
};
struct page_t
{
! inline void init0 (void) { memset (&v, 0, sizeof (v)); }
! inline void init1 (void) { memset (&v, 0xff, sizeof (v)); }
! inline unsigned int len (void) const
{ return ARRAY_LENGTH_CONST (v); }
! inline bool is_empty (void) const
{
for (unsigned int i = 0; i < len (); i++)
if (v[i])
return false;
return true;
}
! inline void add (hb_codepoint_t g) { elt (g) |= mask (g); }
! inline void del (hb_codepoint_t g) { elt (g) &= ~mask (g); }
! inline bool has (hb_codepoint_t g) const { return !!(elt (g) & mask (g)); }
! inline void add_range (hb_codepoint_t a, hb_codepoint_t b)
{
elt_t *la = &elt (a);
elt_t *lb = &elt (b);
if (la == lb)
*la |= (mask (b) << 1) - mask(a);
--- 37,79 ----
/* TODO Keep a free-list so we can free pages that are completely zeroed. At that
* point maybe also use a sentinel value for "all-1" pages? */
struct hb_set_t
{
+ HB_NO_COPY_ASSIGN (hb_set_t);
+ hb_set_t () { init (); }
+ ~hb_set_t () { fini (); }
+
struct page_map_t
{
! int cmp (const page_map_t &o) const { return (int) o.major - (int) major; }
uint32_t major;
uint32_t index;
};
struct page_t
{
! void init0 () { v.clear (); }
! void init1 () { v.clear (0xFF); }
! unsigned int len () const
{ return ARRAY_LENGTH_CONST (v); }
! bool is_empty () const
{
for (unsigned int i = 0; i < len (); i++)
if (v[i])
return false;
return true;
}
! void add (hb_codepoint_t g) { elt (g) |= mask (g); }
! void del (hb_codepoint_t g) { elt (g) &= ~mask (g); }
! bool has (hb_codepoint_t g) const { return !!(elt (g) & mask (g)); }
! void add_range (hb_codepoint_t a, hb_codepoint_t b)
{
elt_t *la = &elt (a);
elt_t *lb = &elt (b);
if (la == lb)
*la |= (mask (b) << 1) - mask(a);
*** 83,106 ****
*lb |= ((mask (b) << 1) - 1);
}
}
! inline bool is_equal (const page_t *other) const
{
! return 0 == memcmp (&v, &other->v, sizeof (v));
}
! inline unsigned int get_population (void) const
{
unsigned int pop = 0;
for (unsigned int i = 0; i < len (); i++)
! pop += _hb_popcount (v[i]);
return pop;
}
! inline bool next (hb_codepoint_t *codepoint) const
{
unsigned int m = (*codepoint + 1) & MASK;
if (!m)
{
*codepoint = INVALID;
--- 86,109 ----
*lb |= ((mask (b) << 1) - 1);
}
}
! bool is_equal (const page_t *other) const
{
! return 0 == hb_memcmp (&v, &other->v, sizeof (v));
}
! unsigned int get_population () const
{
unsigned int pop = 0;
for (unsigned int i = 0; i < len (); i++)
! pop += hb_popcount (v[i]);
return pop;
}
! bool next (hb_codepoint_t *codepoint) const
{
unsigned int m = (*codepoint + 1) & MASK;
if (!m)
{
*codepoint = INVALID;
*** 118,128 ****
}
*codepoint = INVALID;
return false;
}
! inline bool previous (hb_codepoint_t *codepoint) const
{
unsigned int m = (*codepoint - 1) & MASK;
if (m == MASK)
{
*codepoint = INVALID;
--- 121,131 ----
}
*codepoint = INVALID;
return false;
}
! bool previous (hb_codepoint_t *codepoint) const
{
unsigned int m = (*codepoint - 1) & MASK;
if (m == MASK)
{
*codepoint = INVALID;
*** 140,178 ****
}
*codepoint = INVALID;
return false;
}
! inline hb_codepoint_t get_min (void) const
{
for (unsigned int i = 0; i < len (); i++)
if (v[i])
return i * ELT_BITS + elt_get_min (v[i]);
return INVALID;
}
! inline hb_codepoint_t get_max (void) const
{
for (int i = len () - 1; i >= 0; i--)
if (v[i])
return i * ELT_BITS + elt_get_max (v[i]);
return 0;
}
typedef unsigned long long elt_t;
! static const unsigned int PAGE_BITS = 512;
static_assert ((PAGE_BITS & ((PAGE_BITS) - 1)) == 0, "");
! static inline unsigned int elt_get_min (const elt_t &elt) { return _hb_ctz (elt); }
! static inline unsigned int elt_get_max (const elt_t &elt) { return _hb_bit_storage (elt) - 1; }
typedef hb_vector_size_t<elt_t, PAGE_BITS / 8> vector_t;
! static const unsigned int ELT_BITS = sizeof (elt_t) * 8;
! static const unsigned int ELT_MASK = ELT_BITS - 1;
! static const unsigned int BITS = sizeof (vector_t) * 8;
! static const unsigned int MASK = BITS - 1;
! static_assert (PAGE_BITS == BITS, "");
elt_t &elt (hb_codepoint_t g) { return v[(g & MASK) / ELT_BITS]; }
elt_t const &elt (hb_codepoint_t g) const { return v[(g & MASK) / ELT_BITS]; }
elt_t mask (hb_codepoint_t g) const { return elt_t (1) << (g & ELT_MASK); }
--- 143,181 ----
}
*codepoint = INVALID;
return false;
}
! hb_codepoint_t get_min () const
{
for (unsigned int i = 0; i < len (); i++)
if (v[i])
return i * ELT_BITS + elt_get_min (v[i]);
return INVALID;
}
! hb_codepoint_t get_max () const
{
for (int i = len () - 1; i >= 0; i--)
if (v[i])
return i * ELT_BITS + elt_get_max (v[i]);
return 0;
}
typedef unsigned long long elt_t;
! static constexpr unsigned PAGE_BITS = 512;
static_assert ((PAGE_BITS & ((PAGE_BITS) - 1)) == 0, "");
! static unsigned int elt_get_min (const elt_t &elt) { return hb_ctz (elt); }
! static unsigned int elt_get_max (const elt_t &elt) { return hb_bit_storage (elt) - 1; }
typedef hb_vector_size_t<elt_t, PAGE_BITS / 8> vector_t;
! static constexpr unsigned ELT_BITS = sizeof (elt_t) * 8;
! static constexpr unsigned ELT_MASK = ELT_BITS - 1;
! static constexpr unsigned BITS = sizeof (vector_t) * 8;
! static constexpr unsigned MASK = BITS - 1;
! static_assert ((unsigned) PAGE_BITS == (unsigned) BITS, "");
elt_t &elt (hb_codepoint_t g) { return v[(g & MASK) / ELT_BITS]; }
elt_t const &elt (hb_codepoint_t g) const { return v[(g & MASK) / ELT_BITS]; }
elt_t mask (hb_codepoint_t g) const { return elt_t (1) << (g & ELT_MASK); }
*** 181,255 ****
static_assert (page_t::PAGE_BITS == sizeof (page_t) * 8, "");
hb_object_header_t header;
bool successful; /* Allocations successful */
mutable unsigned int population;
! hb_vector_t<page_map_t, 1> page_map;
! hb_vector_t<page_t, 1> pages;
! inline void init_shallow (void)
{
successful = true;
population = 0;
page_map.init ();
pages.init ();
}
! inline void init (void)
{
hb_object_init (this);
init_shallow ();
}
! inline void fini_shallow (void)
{
page_map.fini ();
pages.fini ();
}
! inline void fini (void)
{
hb_object_fini (this);
fini_shallow ();
}
! inline bool resize (unsigned int count)
{
if (unlikely (!successful)) return false;
if (!pages.resize (count) || !page_map.resize (count))
{
! pages.resize (page_map.len);
successful = false;
return false;
}
return true;
}
! inline void clear (void) {
! if (unlikely (hb_object_is_inert (this)))
return;
successful = true;
population = 0;
page_map.resize (0);
pages.resize (0);
}
! inline bool is_empty (void) const {
! unsigned int count = pages.len;
for (unsigned int i = 0; i < count; i++)
if (!pages[i].is_empty ())
return false;
return true;
}
! inline void dirty (void) { population = (unsigned int) -1; }
! inline void add (hb_codepoint_t g)
{
if (unlikely (!successful)) return;
if (unlikely (g == INVALID)) return;
dirty ();
page_t *page = page_for_insert (g); if (unlikely (!page)) return;
page->add (g);
}
! inline bool add_range (hb_codepoint_t a, hb_codepoint_t b)
{
if (unlikely (!successful)) return true; /* https://github.com/harfbuzz/harfbuzz/issues/657 */
if (unlikely (a > b || a == INVALID || b == INVALID)) return false;
dirty ();
unsigned int ma = get_major (a);
--- 184,263 ----
static_assert (page_t::PAGE_BITS == sizeof (page_t) * 8, "");
hb_object_header_t header;
bool successful; /* Allocations successful */
mutable unsigned int population;
! hb_vector_t<page_map_t> page_map;
! hb_vector_t<page_t> pages;
! void init_shallow ()
{
successful = true;
population = 0;
page_map.init ();
pages.init ();
}
! void init ()
{
hb_object_init (this);
init_shallow ();
}
! void fini_shallow ()
{
+ population = 0;
page_map.fini ();
pages.fini ();
}
! void fini ()
{
hb_object_fini (this);
fini_shallow ();
}
! bool in_error () const { return !successful; }
!
! bool resize (unsigned int count)
{
if (unlikely (!successful)) return false;
if (!pages.resize (count) || !page_map.resize (count))
{
! pages.resize (page_map.length);
successful = false;
return false;
}
return true;
}
! void clear ()
! {
! if (unlikely (hb_object_is_immutable (this)))
return;
successful = true;
population = 0;
page_map.resize (0);
pages.resize (0);
}
! bool is_empty () const
! {
! unsigned int count = pages.length;
for (unsigned int i = 0; i < count; i++)
if (!pages[i].is_empty ())
return false;
return true;
}
! void dirty () { population = (unsigned int) -1; }
! void add (hb_codepoint_t g)
{
if (unlikely (!successful)) return;
if (unlikely (g == INVALID)) return;
dirty ();
page_t *page = page_for_insert (g); if (unlikely (!page)) return;
page->add (g);
}
! bool add_range (hb_codepoint_t a, hb_codepoint_t b)
{
if (unlikely (!successful)) return true; /* https://github.com/harfbuzz/harfbuzz/issues/657 */
if (unlikely (a > b || a == INVALID || b == INVALID)) return false;
dirty ();
unsigned int ma = get_major (a);
*** 275,285 ****
}
return true;
}
template <typename T>
! inline void add_array (const T *array, unsigned int count, unsigned int stride=sizeof(T))
{
if (unlikely (!successful)) return;
if (!count) return;
dirty ();
hb_codepoint_t g = *array;
--- 283,293 ----
}
return true;
}
template <typename T>
! void add_array (const T *array, unsigned int count, unsigned int stride=sizeof(T))
{
if (unlikely (!successful)) return;
if (!count) return;
dirty ();
hb_codepoint_t g = *array;
*** 301,311 ****
}
/* Might return false if array looks unsorted.
* Used for faster rejection of corrupt data. */
template <typename T>
! inline bool add_sorted_array (const T *array, unsigned int count, unsigned int stride=sizeof(T))
{
if (unlikely (!successful)) return true; /* https://github.com/harfbuzz/harfbuzz/issues/657 */
if (!count) return true;
dirty ();
hb_codepoint_t g = *array;
--- 309,319 ----
}
/* Might return false if array looks unsorted.
* Used for faster rejection of corrupt data. */
template <typename T>
! bool add_sorted_array (const T *array, unsigned int count, unsigned int stride=sizeof(T))
{
if (unlikely (!successful)) return true; /* https://github.com/harfbuzz/harfbuzz/issues/657 */
if (!count) return true;
dirty ();
hb_codepoint_t g = *array;
*** 329,387 ****
while (count && (g = *array, g < end));
}
return true;
}
! inline void del (hb_codepoint_t g)
{
/* TODO perform op even if !successful. */
if (unlikely (!successful)) return;
! page_t *p = page_for (g);
! if (!p)
return;
dirty ();
! p->del (g);
}
! inline void del_range (hb_codepoint_t a, hb_codepoint_t b)
{
/* TODO perform op even if !successful. */
/* TODO Optimize, like add_range(). */
if (unlikely (!successful)) return;
for (unsigned int i = a; i < b + 1; i++)
del (i);
}
! inline bool has (hb_codepoint_t g) const
{
! const page_t *p = page_for (g);
! if (!p)
return false;
! return p->has (g);
}
! inline bool intersects (hb_codepoint_t first,
hb_codepoint_t last) const
{
hb_codepoint_t c = first - 1;
return next (&c) && c <= last;
}
! inline void set (const hb_set_t *other)
{
if (unlikely (!successful)) return;
! unsigned int count = other->pages.len;
if (!resize (count))
return;
population = other->population;
! memcpy (pages.arrayZ, other->pages.arrayZ, count * sizeof (pages.arrayZ[0]));
! memcpy (page_map.arrayZ, other->page_map.arrayZ, count * sizeof (page_map.arrayZ[0]));
}
! inline bool is_equal (const hb_set_t *other) const
{
if (get_population () != other->get_population ())
return false;
! unsigned int na = pages.len;
! unsigned int nb = other->pages.len;
unsigned int a = 0, b = 0;
for (; a < na && b < nb; )
{
if (page_at (a).is_empty ()) { a++; continue; }
--- 337,395 ----
while (count && (g = *array, g < end));
}
return true;
}
! void del (hb_codepoint_t g)
{
/* TODO perform op even if !successful. */
if (unlikely (!successful)) return;
! page_t *page = page_for (g);
! if (!page)
return;
dirty ();
! page->del (g);
}
! void del_range (hb_codepoint_t a, hb_codepoint_t b)
{
/* TODO perform op even if !successful. */
/* TODO Optimize, like add_range(). */
if (unlikely (!successful)) return;
for (unsigned int i = a; i < b + 1; i++)
del (i);
}
! bool has (hb_codepoint_t g) const
{
! const page_t *page = page_for (g);
! if (!page)
return false;
! return page->has (g);
}
! bool intersects (hb_codepoint_t first,
hb_codepoint_t last) const
{
hb_codepoint_t c = first - 1;
return next (&c) && c <= last;
}
! void set (const hb_set_t *other)
{
if (unlikely (!successful)) return;
! unsigned int count = other->pages.length;
if (!resize (count))
return;
population = other->population;
! memcpy ((void *) pages, (const void *) other->pages, count * pages.item_size);
! memcpy ((void *) page_map, (const void *) other->page_map, count * page_map.item_size);
}
! bool is_equal (const hb_set_t *other) const
{
if (get_population () != other->get_population ())
return false;
! unsigned int na = pages.length;
! unsigned int nb = other->pages.length;
unsigned int a = 0, b = 0;
for (; a < na && b < nb; )
{
if (page_at (a).is_empty ()) { a++; continue; }
*** 398,429 ****
if (!other->page_at (b).is_empty ()) { return false; }
return true;
}
! inline bool is_subset (const hb_set_t *larger_set) const
{
if (get_population () > larger_set->get_population ())
return false;
hb_codepoint_t c = INVALID;
while (next (&c))
if (!larger_set->has (c))
return false;
return true;
}
template <class Op>
! inline void process (const hb_set_t *other)
{
if (unlikely (!successful)) return;
dirty ();
! unsigned int na = pages.len;
! unsigned int nb = other->pages.len;
unsigned int next_page = na;
unsigned int count = 0, newCount = 0;
unsigned int a = 0, b = 0;
for (; a < na && b < nb; )
--- 406,438 ----
if (!other->page_at (b).is_empty ()) { return false; }
return true;
}
! bool is_subset (const hb_set_t *larger_set) const
{
if (get_population () > larger_set->get_population ())
return false;
+ /* TODO Optimize to use pages. */
hb_codepoint_t c = INVALID;
while (next (&c))
if (!larger_set->has (c))
return false;
return true;
}
template <class Op>
! void process (const hb_set_t *other)
{
if (unlikely (!successful)) return;
dirty ();
! unsigned int na = pages.length;
! unsigned int nb = other->pages.length;
unsigned int next_page = na;
unsigned int count = 0, newCount = 0;
unsigned int a = 0, b = 0;
for (; a < na && b < nb; )
*** 450,460 ****
if (Op::passthru_left)
count += na - a;
if (Op::passthru_right)
count += nb - b;
! if (count > pages.len)
if (!resize (count))
return;
newCount = count;
/* Process in-place backward. */
--- 459,469 ----
if (Op::passthru_left)
count += na - a;
if (Op::passthru_right)
count += nb - b;
! if (count > pages.length)
if (!resize (count))
return;
newCount = count;
/* Process in-place backward. */
*** 506,555 ****
page_map[count].major = other->page_map[b].major;
page_map[count].index = next_page++;
page_at (count).v = other->page_at (b).v;
}
assert (!count);
! if (pages.len > newCount)
resize (newCount);
}
! inline void union_ (const hb_set_t *other)
{
process<HbOpOr> (other);
}
! inline void intersect (const hb_set_t *other)
{
process<HbOpAnd> (other);
}
! inline void subtract (const hb_set_t *other)
{
process<HbOpMinus> (other);
}
! inline void symmetric_difference (const hb_set_t *other)
{
process<HbOpXor> (other);
}
! inline bool next (hb_codepoint_t *codepoint) const
{
if (unlikely (*codepoint == INVALID)) {
*codepoint = get_min ();
return *codepoint != INVALID;
}
page_map_t map = {get_major (*codepoint), 0};
unsigned int i;
! page_map.bfind (map, &i);
! if (i < page_map.len && page_map[i].major == map.major)
{
if (pages[page_map[i].index].next (codepoint))
{
*codepoint += page_map[i].major * page_t::PAGE_BITS;
return true;
}
i++;
}
! for (; i < page_map.len; i++)
{
hb_codepoint_t m = pages[page_map[i].index].get_min ();
if (m != INVALID)
{
*codepoint = page_map[i].major * page_t::PAGE_BITS + m;
--- 515,564 ----
page_map[count].major = other->page_map[b].major;
page_map[count].index = next_page++;
page_at (count).v = other->page_at (b).v;
}
assert (!count);
! if (pages.length > newCount)
resize (newCount);
}
! void union_ (const hb_set_t *other)
{
process<HbOpOr> (other);
}
! void intersect (const hb_set_t *other)
{
process<HbOpAnd> (other);
}
! void subtract (const hb_set_t *other)
{
process<HbOpMinus> (other);
}
! void symmetric_difference (const hb_set_t *other)
{
process<HbOpXor> (other);
}
! bool next (hb_codepoint_t *codepoint) const
{
if (unlikely (*codepoint == INVALID)) {
*codepoint = get_min ();
return *codepoint != INVALID;
}
page_map_t map = {get_major (*codepoint), 0};
unsigned int i;
! page_map.bfind (map, &i, HB_BFIND_NOT_FOUND_STORE_CLOSEST);
! if (i < page_map.length && page_map[i].major == map.major)
{
if (pages[page_map[i].index].next (codepoint))
{
*codepoint += page_map[i].major * page_t::PAGE_BITS;
return true;
}
i++;
}
! for (; i < page_map.length; i++)
{
hb_codepoint_t m = pages[page_map[i].index].get_min ();
if (m != INVALID)
{
*codepoint = page_map[i].major * page_t::PAGE_BITS + m;
*** 557,577 ****
}
}
*codepoint = INVALID;
return false;
}
! inline bool previous (hb_codepoint_t *codepoint) const
{
if (unlikely (*codepoint == INVALID)) {
*codepoint = get_max ();
return *codepoint != INVALID;
}
page_map_t map = {get_major (*codepoint), 0};
unsigned int i;
! page_map.bfind (map, &i);
! if (i < page_map.len && page_map[i].major == map.major)
{
if (pages[page_map[i].index].previous (codepoint))
{
*codepoint += page_map[i].major * page_t::PAGE_BITS;
return true;
--- 566,586 ----
}
}
*codepoint = INVALID;
return false;
}
! bool previous (hb_codepoint_t *codepoint) const
{
if (unlikely (*codepoint == INVALID)) {
*codepoint = get_max ();
return *codepoint != INVALID;
}
page_map_t map = {get_major (*codepoint), 0};
unsigned int i;
! page_map.bfind (map, &i, HB_BFIND_NOT_FOUND_STORE_CLOSEST);
! if (i < page_map.length && page_map[i].major == map.major)
{
if (pages[page_map[i].index].previous (codepoint))
{
*codepoint += page_map[i].major * page_t::PAGE_BITS;
return true;
*** 588,598 ****
}
}
*codepoint = INVALID;
return false;
}
! inline bool next_range (hb_codepoint_t *first, hb_codepoint_t *last) const
{
hb_codepoint_t i;
i = *last;
if (!next (&i))
--- 597,607 ----
}
}
*codepoint = INVALID;
return false;
}
! bool next_range (hb_codepoint_t *first, hb_codepoint_t *last) const
{
hb_codepoint_t i;
i = *last;
if (!next (&i))
*** 606,616 ****
while (next (&i) && i == *last + 1)
(*last)++;
return true;
}
! inline bool previous_range (hb_codepoint_t *first, hb_codepoint_t *last) const
{
hb_codepoint_t i;
i = *first;
if (!previous (&i))
--- 615,625 ----
while (next (&i) && i == *last + 1)
(*last)++;
return true;
}
! bool previous_range (hb_codepoint_t *first, hb_codepoint_t *last) const
{
hb_codepoint_t i;
i = *first;
if (!previous (&i))
*** 625,700 ****
(*first)--;
return true;
}
! inline unsigned int get_population (void) const
{
if (population != (unsigned int) -1)
return population;
unsigned int pop = 0;
! unsigned int count = pages.len;
for (unsigned int i = 0; i < count; i++)
pop += pages[i].get_population ();
population = pop;
return pop;
}
! inline hb_codepoint_t get_min (void) const
{
! unsigned int count = pages.len;
for (unsigned int i = 0; i < count; i++)
if (!page_at (i).is_empty ())
return page_map[i].major * page_t::PAGE_BITS + page_at (i).get_min ();
return INVALID;
}
! inline hb_codepoint_t get_max (void) const
{
! unsigned int count = pages.len;
for (int i = count - 1; i >= 0; i++)
if (!page_at (i).is_empty ())
! return page_map[i].major * page_t::PAGE_BITS + page_at (i).get_max ();
return INVALID;
}
! static const hb_codepoint_t INVALID = HB_SET_VALUE_INVALID;
! inline page_t *page_for_insert (hb_codepoint_t g)
{
! page_map_t map = {get_major (g), pages.len};
unsigned int i;
! if (!page_map.bfind (map, &i))
{
! if (!resize (pages.len + 1))
return nullptr;
pages[map.index].init0 ();
! memmove (&page_map[i + 1], &page_map[i], (page_map.len - 1 - i) * sizeof (page_map[0]));
page_map[i] = map;
}
return &pages[page_map[i].index];
}
! inline page_t *page_for (hb_codepoint_t g)
{
page_map_t key = {get_major (g)};
const page_map_t *found = page_map.bsearch (key);
if (found)
return &pages[found->index];
return nullptr;
}
! inline const page_t *page_for (hb_codepoint_t g) const
{
page_map_t key = {get_major (g)};
const page_map_t *found = page_map.bsearch (key);
if (found)
return &pages[found->index];
return nullptr;
}
! inline page_t &page_at (unsigned int i) { return pages[page_map[i].index]; }
! inline const page_t &page_at (unsigned int i) const { return pages[page_map[i].index]; }
! inline unsigned int get_major (hb_codepoint_t g) const { return g / page_t::PAGE_BITS; }
! inline hb_codepoint_t major_start (unsigned int major) const { return major * page_t::PAGE_BITS; }
};
! #endif /* HB_SET_PRIVATE_HH */
--- 634,738 ----
(*first)--;
return true;
}
! unsigned int get_population () const
{
if (population != (unsigned int) -1)
return population;
unsigned int pop = 0;
! unsigned int count = pages.length;
for (unsigned int i = 0; i < count; i++)
pop += pages[i].get_population ();
population = pop;
return pop;
}
! hb_codepoint_t get_min () const
{
! unsigned int count = pages.length;
for (unsigned int i = 0; i < count; i++)
if (!page_at (i).is_empty ())
return page_map[i].major * page_t::PAGE_BITS + page_at (i).get_min ();
return INVALID;
}
! hb_codepoint_t get_max () const
{
! unsigned int count = pages.length;
for (int i = count - 1; i >= 0; i++)
if (!page_at (i).is_empty ())
! return page_map[(unsigned) i].major * page_t::PAGE_BITS + page_at (i).get_max ();
return INVALID;
}
! static constexpr hb_codepoint_t INVALID = HB_SET_VALUE_INVALID;
!
! /*
! * Iterator implementation.
! */
! struct const_iter_t : hb_sorted_iter_t<const_iter_t, const hb_codepoint_t>
! {
! const_iter_t (const hb_set_t &s_) :
! s (s_), v (INVALID), l (s.get_population () + 1) { __next__ (); }
!
! typedef hb_codepoint_t __item_type__;
! hb_codepoint_t __item__ () const { return v; }
! bool __more__ () const { return v != INVALID; }
! void __next__ () { s.next (&v); if (l) l--; }
! void __prev__ () { s.previous (&v); }
! unsigned __len__ () { return l; }
!
! protected:
! const hb_set_t &s;
! hb_codepoint_t v;
! unsigned l;
! };
! const_iter_t const_iter () const { return const_iter_t (*this); }
! operator const_iter_t () const { return const_iter (); }
! typedef const_iter_t iter_t;
! iter_t iter () const { return const_iter (); }
!
! protected:
! page_t *page_for_insert (hb_codepoint_t g)
{
! page_map_t map = {get_major (g), pages.length};
unsigned int i;
! if (!page_map.bfind (map, &i, HB_BFIND_NOT_FOUND_STORE_CLOSEST))
{
! if (!resize (pages.length + 1))
return nullptr;
pages[map.index].init0 ();
! memmove (page_map + i + 1,
! page_map + i,
! (page_map.length - 1 - i) * page_map.item_size);
page_map[i] = map;
}
return &pages[page_map[i].index];
}
! page_t *page_for (hb_codepoint_t g)
{
page_map_t key = {get_major (g)};
const page_map_t *found = page_map.bsearch (key);
if (found)
return &pages[found->index];
return nullptr;
}
! const page_t *page_for (hb_codepoint_t g) const
{
page_map_t key = {get_major (g)};
const page_map_t *found = page_map.bsearch (key);
if (found)
return &pages[found->index];
return nullptr;
}
! page_t &page_at (unsigned int i) { return pages[page_map[i].index]; }
! const page_t &page_at (unsigned int i) const { return pages[page_map[i].index]; }
! unsigned int get_major (hb_codepoint_t g) const { return g / page_t::PAGE_BITS; }
! hb_codepoint_t major_start (unsigned int major) const { return major * page_t::PAGE_BITS; }
};
! #endif /* HB_SET_HH */
< prev index next >