Branch
Hash :
75f91987
Author :
Date :
2025-07-25T02:39:47
[src/test-*] Use hb_always_assert() which isn't compiled out under NDEBUG Part of https://github.com/harfbuzz/harfbuzz/issues/5418
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165
/*
* 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));
}
/* 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));
}
return 0;
}