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.
31 main (int argc, char **argv)
34 /* Test copy constructor. */
39 assert (v1.get_population () == 1);
40 assert (v2.get_population () == 1);
45 /* Test copy assignment. */
50 assert (v1.get_population () == 1);
51 assert (v2.get_population () == 1);
56 /* Test move constructor. */
60 hb_map_t v (std::move (s));
61 assert (s.get_population () == 0);
62 assert (v.get_population () == 1);
65 /* Test move assignment. */
71 assert (s.get_population () == 0);
72 assert (v.get_population () == 1);
75 /* Test initializing from iterable. */
82 hb_vector_t<hb_codepoint_pair_t> v (s);
85 hb_map_t v2 (std::move (s));
87 assert (s.get_population () == 0);
88 assert (v0.get_population () == 2);
89 assert (v1.get_population () == 2);
90 assert (v2.get_population () == 2);
93 /* Test call fini() twice. */
96 for (int i = 0; i < 16; i++)
101 /* Test initializing from iterator. */
108 hb_map_t v (hb_iter (s));
110 assert (v.get_population () == 2);
113 /* Test initializing from initializer list and swapping. */
115 using pair_t = hb_codepoint_pair_t;
116 hb_map_t v1 {pair_t{1,2}, pair_t{4,5}};
117 hb_map_t v2 {pair_t{3,4}};
119 assert (v1.get_population () == 1);
120 assert (v2.get_population () == 2);
123 /* Test class key / value types. */
125 hb_hashmap_t<hb_bytes_t, int> m1;
126 hb_hashmap_t<int, hb_bytes_t> m2;
127 hb_hashmap_t<hb_bytes_t, hb_bytes_t> m3;
128 assert (m1.get_population () == 0);
129 assert (m2.get_population () == 0);
130 assert (m3.get_population () == 0);
134 hb_hashmap_t<int, int> m0;
135 hb_hashmap_t<std::string, int> m1;
136 hb_hashmap_t<int, std::string> m2;
137 hb_hashmap_t<std::string, std::string> m3;
140 for (unsigned i = 1; i < 1000; i++)
150 /* Test hashing maps. */
152 using pair = hb_codepoint_pair_t;
154 hb_hashmap_t<hb_map_t, hb_map_t> m1;
156 m1.set (hb_map_t (), hb_map_t {});
157 m1.set (hb_map_t (), hb_map_t {pair (1u, 2u)});
158 m1.set (hb_map_t {pair (1u, 2u)}, hb_map_t {pair (2u, 3u)});
160 assert (m1.get (hb_map_t ()) == hb_map_t {pair (1u, 2u)});
161 assert (m1.get (hb_map_t {pair (1u, 2u)}) == hb_map_t {pair (2u, 3u)});
164 /* Test hashing sets. */
166 hb_hashmap_t<hb_set_t, hb_set_t> m1;
168 m1.set (hb_set_t (), hb_set_t ());
169 m1.set (hb_set_t (), hb_set_t {1});
170 m1.set (hb_set_t {1, 1000}, hb_set_t {2});
172 assert (m1.get (hb_set_t ()) == hb_set_t {1});
173 assert (m1.get (hb_set_t {1000, 1}) == hb_set_t {2});
176 /* Test hashing vectors. */
178 using vector_t = hb_vector_t<unsigned>;
180 hb_hashmap_t<vector_t, vector_t> m1;
182 m1.set (vector_t (), vector_t {1});
183 m1.set (vector_t {1}, vector_t {2});
185 m1 << hb_pair_t<vector_t, vector_t> {vector_t {2}, vector_t ()};
187 assert (m1.get (vector_t ()) == vector_t {1});
188 assert (m1.get (vector_t {1}) == vector_t {2});
191 /* Test moving values */
193 using vector_t = hb_vector_t<unsigned>;
195 hb_hashmap_t<vector_t, vector_t> m1;
197 assert (v.length == 1);
198 m1 << hb_pair_t<vector_t, vector_t> {vector_t {3}, v};
199 assert (v.length == 1);
200 m1 << hb_pair_t<vector_t, vector_t&&> {vector_t {4}, std::move (v)};
201 assert (v.length == 0);
202 m1 << hb_pair_t<vector_t&&, vector_t> {vector_t {4}, vector_t {5}};
203 m1 << hb_pair_t<vector_t&&, vector_t&&> {vector_t {4}, vector_t {5}};
205 hb_hashmap_t<vector_t, vector_t> m2;
207 m2.set (vector_t {4}, v2);
208 assert (v2.length == 1);
209 m2.set (vector_t {5}, std::move (v2));
210 assert (v2.length == 0);
213 /* Test hb::shared_ptr. */
215 hb_hashmap_t<hb::shared_ptr<hb_set_t>, hb::shared_ptr<hb_set_t>> m;
217 m.set (hb::shared_ptr<hb_set_t> (hb_set_get_empty ()),
218 hb::shared_ptr<hb_set_t> (hb_set_get_empty ()));
219 m.get (hb::shared_ptr<hb_set_t> (hb_set_get_empty ()));
227 /* Test hb::unique_ptr. */
229 hb_hashmap_t<hb::unique_ptr<hb_set_t>, hb::unique_ptr<hb_set_t>> m;
231 m.set (hb::unique_ptr<hb_set_t> (hb_set_get_empty ()),
232 hb::unique_ptr<hb_set_t> (hb_set_get_empty ()));
233 m.get (hb::unique_ptr<hb_set_t> (hb_set_get_empty ()));
234 hb::unique_ptr<hb_set_t> *v;
235 m.has (hb::unique_ptr<hb_set_t> (hb_set_get_empty ()), &v);
240 /* Test hashmap with complex shared_ptrs as keys. */
242 hb_hashmap_t<hb::shared_ptr<hb_map_t>, unsigned> m;
244 hb_map_t *m1 = hb_map_create ();
245 hb_map_t *m2 = hb_map_create ();
249 hb::shared_ptr<hb_map_t> p1 {m1};
250 hb::shared_ptr<hb_map_t> p2 {m2};
256 assert (!m.has (p2));
258 /* Test value type with hb_bytes_t. */
260 hb_hashmap_t<int, hb_bytes_t> m;
261 char c_str[] = "Test";
262 hb_bytes_t bytes (c_str);
266 assert (m.get (1) == hb_bytes_t {"Test"});
268 /* Test operators. */
280 assert (!(m2 == m3));
284 assert (!m2.has (2));
291 hb_hashmap_t<int, hb_set_t> m;
292 m.set (1, hb_set_t {1, 2, 3});
295 /* Test iteration. */
309 m.next (&i, &k, &v);)
312 if (k == 1) assert (v == 1);
313 else if (k == 2) assert (v == 1);
314 else if (k == 3) assert (v == 2);
315 else if (k == 4) assert (v == 3);
316 else if (k == 5) assert (v == 5);
317 else if (k == 6) assert (v == 8);
320 assert (pop == m.get_population ());
330 assert (m1.get_population () == 2);
334 /* Test keys / values */
347 hb_copy (m.keys (), keys);
348 hb_copy (m.values (), values);
350 assert (keys.is_equal (hb_set_t ({1, 2, 3, 4, 5, 6})));
351 assert (values.is_equal (hb_set_t ({1, 1, 2, 3, 5, 8})));
353 assert (keys.is_equal (hb_set_t (m.keys ())));
354 assert (values.is_equal (hb_set_t (m.values ())));