harfbuzz/src/test-iter.cc

202 lines
4.8 KiB
C++
Raw Normal View History

2018-12-21 06:23:34 +01:00
/*
* Copyright © 2018 Google, Inc.
*
* 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.
*
* Google Author(s): Behdad Esfahbod
*/
2018-12-21 23:35:58 +01:00
#include "hb.hh"
2018-12-21 06:23:34 +01:00
#include "hb-iter.hh"
2018-12-21 07:53:27 +01:00
#include "hb-array.hh"
#include "hb-set.hh"
2018-12-27 22:55:18 +01:00
#include "hb-ot-layout-common.hh"
2018-12-21 07:53:27 +01:00
template <typename T>
struct array_iter_t : hb_iter_with_fallback_t<array_iter_t<T>, T&>
2018-12-21 07:53:27 +01:00
{
array_iter_t (hb_array_t<T> arr_) : arr (arr_) {}
typedef T& __item_t__;
2019-01-25 15:34:03 +01:00
static constexpr bool is_random_access_iterator = true;
2018-12-21 07:53:27 +01:00
T& __item_at__ (unsigned i) const { return arr[i]; }
void __forward__ (unsigned n) { arr += n; }
void __rewind__ (unsigned n) { arr -= n; }
2018-12-22 00:46:51 +01:00
unsigned __len__ () const { return arr.length; }
2018-12-21 07:53:27 +01:00
private:
hb_array_t<T> arr;
};
2018-12-21 09:03:46 +01:00
template <typename T>
struct some_array_t
{
some_array_t (hb_array_t<T> arr_) : arr (arr_) {}
typedef array_iter_t<T> iter_t;
array_iter_t<T> iter () { return array_iter_t<T> (arr); }
operator array_iter_t<T> () { return iter (); }
operator hb_iter_t<array_iter_t<T> > () { return iter (); }
private:
hb_array_t<T> arr;
};
2018-12-27 00:54:27 +01:00
template <typename Iter,
hb_enable_if (hb_is_iterator (Iter))>
static void
test_iterator (Iter it)
2018-12-27 00:54:27 +01:00
{
Iter default_constructed;
2018-12-27 01:56:37 +01:00
assert (!default_constructed);
2018-12-27 00:54:27 +01:00
/* Iterate over a copy of it. */
for (auto c = it.iter (); c; c++)
*c;
/* Same. */
for (auto c = +it; c; c++)
*c;
it += it.len ();
it = it + 10;
it = 10 + it;
2018-12-27 00:54:27 +01:00
assert (*it == it[0]);
static_assert (true || it.is_random_access_iterator, "");
static_assert (true || it.is_sorted_iterator, "");
2018-12-27 00:54:27 +01:00
}
template <typename Iterable,
hb_enable_if (hb_is_iterable (Iterable))>
static void
2018-12-27 22:55:18 +01:00
test_iterable (const Iterable &lst = Null(Iterable))
2018-12-27 00:54:27 +01:00
{
// Test that can take iterator from.
test_iterator (lst.iter ());
}
2018-12-21 06:23:34 +01:00
int
main (int argc, char **argv)
{
2018-12-21 06:54:55 +01:00
const int src[10] = {};
int dst[20];
2018-12-21 07:59:37 +01:00
hb_vector_t<int> v;
2018-12-21 06:54:55 +01:00
2018-12-21 07:59:37 +01:00
array_iter_t<const int> s (src); /* Implicit conversion from static array. */
array_iter_t<const int> s2 (v); /* Implicit conversion from vector. */
2018-12-21 07:53:27 +01:00
array_iter_t<int> t (dst);
2018-12-21 06:54:55 +01:00
static_assert (hb_is_random_access_iterator (array_iter_t<int>), "");
2018-12-21 09:03:46 +01:00
some_array_t<const int> a (src);
2018-12-21 06:54:55 +01:00
s2 = s;
2019-01-27 01:03:56 +01:00
hb_iter (src);
hb_iter (src, 2);
2018-12-21 08:47:04 +01:00
hb_fill (t, 42);
hb_copy (s, t);
hb_copy (a.iter (), t);
2018-12-21 06:54:55 +01:00
2018-12-27 00:54:27 +01:00
test_iterable (v);
hb_set_t st;
test_iterable (st);
hb_sorted_array_t<int> sa;
test_iterable (sa);
2018-12-27 00:54:27 +01:00
2018-12-27 22:55:18 +01:00
test_iterable<hb_array_t<int> > ();
test_iterable<hb_sorted_array_t<const int> > ();
test_iterable<hb_vector_t<float> > ();
test_iterable<hb_set_t> ();
test_iterable<OT::Coverage> ();
2019-01-09 08:57:16 +01:00
test_iterator (hb_zip (st, v));
hb_any (st);
2019-02-16 01:55:08 +01:00
2019-01-08 03:38:49 +01:00
hb_array_t<hb_vector_t<int> > pa;
pa->as_array ();
2019-01-27 01:03:56 +01:00
+ hb_iter (src)
| hb_map (hb_identity)
| hb_filter ()
| hb_filter (hb_bool)
| hb_filter (hb_bool, hb_identity)
| hb_sink (st)
;
2019-02-14 20:40:22 +01:00
+ hb_iter (src)
2019-02-14 23:04:05 +01:00
| hb_apply (&st)
;
2019-03-31 10:11:58 +02:00
+ hb_iter (src)
| hb_map ([&] (int i) -> int { return 1; })
| hb_reduce ([&] (int acc, int value) -> int { return acc; }, 2)
2019-03-31 10:11:58 +02:00
;
unsigned int temp1 = 10;
unsigned int temp2 = 0;
hb_map_t *result =
+ hb_iter (src)
| hb_map ([&] (int i) -> hb_set_t *
{
hb_set_t *set = hb_set_create ();
for (unsigned int i = 0; i < temp1; ++i)
hb_set_add (set, i);
temp1++;
return set;
})
| hb_reduce ([&] (hb_map_t *acc, hb_set_t *value) -> hb_map_t *
{
hb_map_set (acc, temp2++, hb_set_get_population (value));
2019-04-02 17:57:00 +02:00
/* This is not a memory managed language, take care! */
hb_set_destroy (value);
return acc;
}, hb_map_create ())
;
2019-04-02 17:57:00 +02:00
/* The result should be something like 0->10, 1->11, ..., 9->19 */
assert (hb_map_get (result, 9) == 19);
unsigned int temp3 = 0;
+ hb_iter(src)
| hb_map([&] (int i) -> int { return ++temp3; })
| hb_reduce([&] (float acc, int value) -> float { return acc + value + .05; }, 0)
;
hb_map_destroy (result);
2019-02-14 23:04:05 +01:00
+ hb_iter (src)
| hb_drain
;
2019-02-14 20:40:22 +01:00
2019-01-28 22:23:12 +01:00
t << 1;
long vl;
s >> vl;
2018-12-21 06:23:34 +01:00
return 0;
}