2 * Copyright © 2018 Google, Inc.
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.
24 * Google Author(s): Behdad Esfahbod
30 #include "hb-array.hh"
32 #include "hb-ot-layout-common.hh"
35 struct array_iter_t : hb_iter_with_fallback_t<array_iter_t<T>, T&>
37 array_iter_t (hb_array_t<T> arr_) : arr (arr_) {}
39 typedef T& __item_t__;
40 static constexpr bool is_random_access_iterator = true;
41 T& __item_at__ (unsigned i) const { return arr[i]; }
42 void __forward__ (unsigned n) { arr += n; }
43 void __rewind__ (unsigned n) { arr -= n; }
44 unsigned __len__ () const { return arr.length; }
45 bool operator != (const array_iter_t& o) { return arr != o.arr; }
54 some_array_t (hb_array_t<T> arr_) : arr (arr_) {}
56 typedef array_iter_t<T> iter_t;
57 array_iter_t<T> iter () { return array_iter_t<T> (arr); }
58 operator array_iter_t<T> () { return iter (); }
59 operator hb_iter_t<array_iter_t<T>> () { return iter (); }
66 template <typename Iter,
67 hb_requires (hb_is_iterator (Iter))>
69 test_iterator_non_default_constructable (Iter it)
71 /* Iterate over a copy of it. */
72 for (auto c = it.iter (); c; c++)
76 for (auto c = +it; c; c++)
79 /* Range-based for over a copy. */
87 assert (*it == it[0]);
89 static_assert (true || it.is_random_access_iterator, "");
90 static_assert (true || it.is_sorted_iterator, "");
93 template <typename Iter,
94 hb_requires (hb_is_iterator (Iter))>
96 test_iterator (Iter it)
98 Iter default_constructed;
99 assert (!default_constructed);
101 test_iterator_non_default_constructable (it);
104 template <typename Iterable,
105 hb_requires (hb_is_iterable (Iterable))>
107 test_iterable (const Iterable &lst = Null (Iterable))
112 // Test that can take iterator from.
113 test_iterator (lst.iter ());
116 template <typename It>
117 static void check_sequential (It it)
125 static void test_concat ()
127 hb_vector_t<int> a = {1, 2, 3};
128 hb_vector_t<int> b = {4, 5};
130 hb_vector_t<int> c = {};
131 hb_vector_t<int> d = {1, 2, 3, 4, 5};
133 auto it1 = hb_concat (a, b);
134 assert (it1.len () == 5);
135 assert (it1.is_random_access_iterator);
136 auto it2 = hb_concat (c, d);
137 assert (it2.len () == 5);
138 auto it3 = hb_concat (d, c);
139 assert (it3.len () == 5);
140 for (int i = 0; i < 5; i++) {
141 assert(it1[i] == i + 1);
142 assert(it2[i] == i + 1);
143 assert(it3[i] == i + 1);
146 check_sequential (it1);
147 check_sequential (it2);
148 check_sequential (it3);
157 assert (it4.len () == 3);
162 assert (it4.len () == 1);
166 assert (it4.len () == 0);
172 hb_set_t s_a = {1, 2, 3};
173 hb_set_t s_b = {4, 5};
174 auto it6 = hb_concat (s_a, s_b);
175 assert (!it6.is_random_access_iterator);
176 check_sequential (it6);
177 assert (it6.len () == 5);
185 assert (it6.len () == 2);
189 main (int argc, char **argv)
191 const int src[10] = {};
195 array_iter_t<const int> s (src); /* Implicit conversion from static array. */
196 array_iter_t<const int> s2 (v); /* Implicit conversion from vector. */
197 array_iter_t<int> t (dst);
199 static_assert (array_iter_t<int>::is_random_access_iterator, "");
201 some_array_t<const int> a (src);
210 hb_copy (a.iter (), t);
216 hb_sorted_array_t<int> sa;
217 (void) static_cast<hb_iter_t<hb_sorted_array_t<int>, hb_sorted_array_t<int>::item_t>&> (sa);
218 (void) static_cast<hb_iter_t<hb_sorted_array_t<int>, hb_sorted_array_t<int>::__item_t__>&> (sa);
219 (void) static_cast<hb_iter_t<hb_sorted_array_t<int>, int&>&>(sa);
220 (void) static_cast<hb_iter_t<hb_sorted_array_t<int>>&>(sa);
221 (void) static_cast<hb_iter_t<hb_array_t<int>, int&>&> (sa);
224 test_iterable<hb_array_t<int>> ();
225 test_iterable<hb_sorted_array_t<const int>> ();
226 test_iterable<hb_vector_t<float>> ();
227 test_iterable<hb_set_t> ();
228 test_iterable<OT::Array16Of<OT::HBUINT16>> ();
230 test_iterator (hb_zip (st, v));
231 test_iterator_non_default_constructable (hb_enumerate (st));
232 test_iterator_non_default_constructable (hb_enumerate (st, -5));
233 test_iterator_non_default_constructable (hb_enumerate (hb_iter (st)));
234 test_iterator_non_default_constructable (hb_enumerate (hb_iter (st) + 1));
235 test_iterator_non_default_constructable (hb_iter (st) | hb_filter ());
236 test_iterator_non_default_constructable (hb_iter (st) | hb_map (hb_lidentity));
238 assert (true == hb_all (st));
239 assert (false == hb_all (st, 42u));
240 assert (true == hb_any (st));
241 assert (false == hb_any (st, 14u));
242 assert (true == hb_any (st, 14u, [] (unsigned _) { return _ - 1u; }));
243 assert (true == hb_any (st, [] (unsigned _) { return _ == 15u; }));
244 assert (true == hb_any (st, 15u));
245 assert (false == hb_none (st));
246 assert (false == hb_none (st, 15u));
247 assert (true == hb_none (st, 17u));
249 hb_array_t<hb_vector_t<int>> pa;
263 | hb_filter (hb_bool)
264 | hb_filter (hb_bool, hb_identity)
269 | hb_sink (hb_array (dst))
277 | hb_map ([] (int i) { return 1; })
278 | hb_reduce ([=] (int acc, int value) { return acc; }, 2)
281 using map_pair_t = hb_item_type<hb_map_t>;
283 | hb_map ([] (map_pair_t p) { return p.first * p.second; })
287 using map_key_t = decltype (*m.keys());
288 + hb_iter (m.keys ())
289 | hb_filter ([] (map_key_t k) { return k < 42; })
294 using map_value_t = decltype (*m.values());
295 + hb_iter (m.values ())
296 | hb_filter ([] (map_value_t k) { return k < 42; })
300 unsigned int temp1 = 10;
301 unsigned int temp2 = 0;
304 | hb_map ([&] (int i) -> hb_set_t *
306 hb_set_t *set = hb_set_create ();
307 for (unsigned int i = 0; i < temp1; ++i)
312 | hb_reduce ([&] (hb_map_t *acc, hb_set_t *value) -> hb_map_t *
314 hb_map_set (acc, temp2++, hb_set_get_population (value));
315 /* This is not a memory managed language, take care! */
316 hb_set_destroy (value);
320 /* The result should be something like 0->10, 1->11, ..., 9->19 */
321 assert (hb_map_get (result, 9) == 19);
322 hb_map_destroy (result);
324 /* Like above, but passing hb_set_t instead of hb_set_t * */
329 | hb_map ([&] (int i) -> hb_set_t
332 for (unsigned int i = 0; i < temp1; ++i)
333 hb_set_add (&set, i);
337 | hb_reduce ([&] (hb_map_t *acc, hb_set_t value) -> hb_map_t *
339 hb_map_set (acc, temp2++, hb_set_get_population (&value));
343 /* The result should be something like 0->10, 1->11, ..., 9->19 */
344 assert (hb_map_get (result, 9) == 19);
345 hb_map_destroy (result);
347 unsigned int temp3 = 0;
349 | hb_map([&] (int i) { return ++temp3; })
350 | hb_reduce([&] (float acc, int value) { return acc + value; }, 0)
364 assert ((&vl) + 1 == *++hb_iota (&vl, hb_inc));
368 hb_repeat (vl) | hb_chop (3);
369 assert (hb_len (hb_range (10) | hb_take (3)) == 3);
370 assert (hb_range (9).len () == 9);
371 assert (hb_range (2, 9).len () == 7);
372 assert (hb_range (2, 9, 3).len () == 3);
373 assert (hb_range (2, 8, 3).len () == 2);
374 assert (hb_range (2, 7, 3).len () == 2);
375 assert (hb_range (-2, -9, -3).len () == 3);
376 assert (hb_range (-2, -8, -3).len () == 2);
377 assert (hb_range (-2, -7, -3).len () == 2);