tweak reflecting review & add test cases
This commit is contained in:
parent
de896278f7
commit
4081439d2a
|
@ -384,6 +384,23 @@ struct hb_set_t
|
|||
page->del (g);
|
||||
}
|
||||
|
||||
private:
|
||||
void del_pages (int ds, int de)
|
||||
{
|
||||
if (ds <= de)
|
||||
{
|
||||
unsigned int write_index = 0;
|
||||
for (unsigned int i = 0; i < page_map.length; i++)
|
||||
{
|
||||
int m = (int) page_map[i].major;
|
||||
if (m < ds || de < m)
|
||||
page_map[write_index++] = page_map[i];
|
||||
}
|
||||
compact (write_index);
|
||||
}
|
||||
}
|
||||
|
||||
public:
|
||||
void del_range (hb_codepoint_t a, hb_codepoint_t b)
|
||||
{
|
||||
/* TODO perform op even if !successful. */
|
||||
|
@ -412,17 +429,7 @@ struct hb_set_t
|
|||
if (page)
|
||||
page->del_range (major_start (mb), b);
|
||||
}
|
||||
if (ds <= de)
|
||||
{
|
||||
unsigned int write_index = 0;
|
||||
for (unsigned int i = 0; i < page_map.length; i++)
|
||||
{
|
||||
unsigned int m = page_map[i].major;
|
||||
if ((int)m < ds || de < (int)m)
|
||||
page_map[write_index++] = page_map[i];
|
||||
}
|
||||
compact (write_index);
|
||||
}
|
||||
del_pages (ds, de);
|
||||
}
|
||||
|
||||
bool get (hb_codepoint_t g) const
|
||||
|
|
|
@ -473,29 +473,46 @@ test_set_empty (void)
|
|||
static void
|
||||
test_set_delrange (void)
|
||||
{
|
||||
const unsigned P = 512; /* Page size. */
|
||||
struct { unsigned b, e; } ranges[] = {
|
||||
{ 35, P-15 }, /* From page middle thru middle. */
|
||||
{ P, P+100 }, /* From page start thru middle. */
|
||||
{ P+300, P*2-1 }, /* From page middle thru end. */
|
||||
{ P*3, P*4+100 }, /* From page start thru next page middle. */
|
||||
{ P*4+300, P*6-1 }, /* From page middle thru next page end. */
|
||||
{ P*6+200,P*8+100 }, /* From page middle covering one page thru page middle. */
|
||||
{ P*9, P*10+105 }, /* From page start covering one page thru page middle. */
|
||||
{ P*10+305, P*12-1 }, /* From page middle covering one page thru page end. */
|
||||
{ P*13, P*15-1 }, /* From page start covering two pages thru page end. */
|
||||
{ P*15+100, P*18+100 } /* From page middle covering two pages thru page middle. */
|
||||
};
|
||||
unsigned n = sizeof (ranges) / sizeof(ranges[0]);
|
||||
|
||||
hb_set_t *s = hb_set_create ();
|
||||
|
||||
test_empty (s);
|
||||
for (unsigned int g = 0; g < 2100; g += 10)
|
||||
for (unsigned int g = 0; g < ranges[n - 1].e + P; g += 2)
|
||||
hb_set_add (s, g);
|
||||
|
||||
hb_set_add (s, 512); /* edge case */
|
||||
hb_set_add (s, 2047); /* (=512*4-1) edge case */
|
||||
hb_set_add (s, P*2-1);
|
||||
hb_set_add (s, P*6-1);
|
||||
hb_set_add (s, P*12-1);
|
||||
hb_set_add (s, P*15-1);
|
||||
|
||||
hb_set_del_range (s, 512, 705);
|
||||
hb_set_del_range (s, 795, 2047);
|
||||
for (unsigned i = 0; i < n; i++)
|
||||
hb_set_del_range (s, ranges[i].b, ranges[i].e);
|
||||
|
||||
g_assert ( hb_set_has (s, 0));
|
||||
g_assert ( hb_set_has (s, 510));
|
||||
g_assert (!hb_set_has (s, 512));
|
||||
g_assert (!hb_set_has (s, 700));
|
||||
g_assert ( hb_set_has (s, 710));
|
||||
g_assert ( hb_set_has (s, 790));
|
||||
g_assert (!hb_set_has (s, 800));
|
||||
g_assert (!hb_set_has (s, 1500));
|
||||
g_assert (!hb_set_has (s, 2040));
|
||||
g_assert (!hb_set_has (s, 2047));
|
||||
g_assert ( hb_set_has (s, 2050));
|
||||
hb_set_del_range (s, P*13+5, P*15-10); /* Deletion from deleted pages. */
|
||||
|
||||
for (unsigned i = 0; i < n; i++)
|
||||
{
|
||||
unsigned b = ranges[i].b;
|
||||
unsigned e = ranges[i].e;
|
||||
g_assert (hb_set_has (s, (b-2)&~1));
|
||||
while (b <= e)
|
||||
g_assert (!hb_set_has (s, b++));
|
||||
g_assert (hb_set_has (s, (e+2)&~1));
|
||||
}
|
||||
|
||||
hb_set_destroy (s);
|
||||
}
|
||||
|
|
Loading…
Reference in New Issue