2 * Copyright © 2021 Behdad Esfahbod
4 * This is part of HarfBuzz, a text shaping library.
6 * Permission is hereby granted, without written agreement and without
7 * license or royalty fees, to use, copy, modify, and distribute this
8 * software and its documentation for any purpose, provided that the
9 * above copyright notice and the following two paragraphs appear in
10 * all copies of this software.
12 * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR
13 * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
14 * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
15 * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
18 * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
19 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
20 * FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
21 * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO
22 * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
29 main (int argc, char **argv)
32 /* Test copy constructor. */
36 assert (v1.get_population () == 2);
37 assert (hb_len (hb_iter (v1)) == 2);
38 assert (v2.get_population () == 2);
41 /* Test copy assignment. */
46 assert (v1.get_population () == 2);
47 assert (v2.get_population () == 2);
50 /* Test move constructor. */
53 hb_set_t v (std::move (s));
54 assert (s.get_population () == 0);
55 assert (hb_len (hb_iter (s)) == 0);
56 assert (v.get_population () == 2);
59 /* Test move assignment. */
61 hb_set_t s = hb_set_t {1, 2};
64 assert (s.get_population () == 0);
65 assert (v.get_population () == 2);
68 /* Test initializing from iterable. */
75 hb_vector_t<hb_codepoint_t> v (s);
78 hb_set_t v2 (std::move (s));
80 assert (s.get_population () == 0);
81 assert (v0.get_population () == 2);
82 assert (v1.get_population () == 2);
83 assert (v2.get_population () == 2);
86 /* Test initializing from iterator. */
94 s << hb_codepoint_pair_t {1, 3};
96 hb_set_t v (hb_iter (s));
98 assert (v.get_population () == 5);
101 /* Test initializing from initializer list and swapping. */
103 hb_set_t v1 {1, 2, 3};
106 assert (v1.get_population () == 2);
107 assert (v2.get_population () == 3);
110 /* Test inverted sets. */
116 hb_codepoint_t start = HB_SET_VALUE_INVALID, last = HB_SET_VALUE_INVALID;
117 assert (s.next_range (&start, &last));
120 assert (s.next_range (&start, &last));
122 assert (last == HB_SET_VALUE_INVALID - 1);
123 assert (!s.next_range (&start, &last));
125 start = HB_SET_VALUE_INVALID;
126 last = HB_SET_VALUE_INVALID;
127 assert (s.previous_range (&start, &last));
129 assert (last == HB_SET_VALUE_INVALID - 1);
130 assert (s.previous_range (&start, &last));
133 assert (!s.previous_range (&start, &last));
135 assert (s.is_inverted ());
136 /* Inverted set returns true for invalid value; oh well. */
137 assert (s.has (HB_SET_VALUE_INVALID));
140 /* Adding HB_SET_VALUE_INVALID */
144 s.add(HB_SET_VALUE_INVALID);
145 assert(!s.has(HB_SET_VALUE_INVALID));
148 assert(!s.add_range(HB_SET_VALUE_INVALID - 2, HB_SET_VALUE_INVALID));
149 assert(!s.has(HB_SET_VALUE_INVALID));
151 hb_codepoint_t array[] = {(unsigned) HB_SET_VALUE_INVALID, 0, 2};
153 s.add_array(array, 3);
154 assert(!s.has(HB_SET_VALUE_INVALID));
157 hb_codepoint_t sorted_array[] = {0, 2, (unsigned) HB_SET_VALUE_INVALID};
159 s.add_sorted_array(sorted_array, 3);
160 assert(!s.has(HB_SET_VALUE_INVALID));