organicmaps/harfbuzz
13
Fork 0
mirror of https://github.com/harfbuzz/harfbuzz.git synced 2025-04-13 08:42:59 +00:00
Code Issues 1 Projects Releases Wiki Activity Actions 7

[decycler] Add test

Browse source
This commit is contained in:
Behdad Esfahbod 2025-02-16 09:47:58 -07:00
parent 0aa400b1d8
commit d5faabe7ea
2 changed files with 89 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
src/meson.build
View file

@ -726,6 +726,7 @@ if get_option('tests').enabled()
'test-bimap': ['test-bimap.cc', 'hb-static.cc'],
'test-cff': ['test-cff.cc', 'hb-static.cc'],
'test-classdef-graph': ['graph/test-classdef-graph.cc', 'hb-static.cc', 'graph/gsubgpos-context.cc'],
'test-decycler': ['test-decycler.cc', 'hb-static.cc'],
'test-iter': ['test-iter.cc', 'hb-static.cc'],
'test-machinery': ['test-machinery.cc', 'hb-static.cc'],
'test-map': ['test-map.cc', 'hb-static.cc'],

88
src/test-decycler.cc Normal file
View file

@ -0,0 +1,88 @@
/*
* Copyright © 2025 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.
*
* Author(s): Behdad Esfahbod
*/
#include "hb.hh"
#include "hb-decycler.hh"
static void
tree_recurse (unsigned value,
unsigned max_value,
hb_decycler_t &decycler)
{
if (value >= max_value)
return;
hb_decycler_node_t node (decycler);
bool ret = node.visit (value);
assert (ret);
tree_recurse (value * 2 + 1, max_value, decycler);
tree_recurse (value * 2 + 2, max_value, decycler);
}
static void
test_tree ()
{
hb_decycler_t decycler;
tree_recurse (0, 64, decycler);
}
static void
cycle_recurse (signed value,
signed cycle_length,
hb_decycler_t &decycler)
{
assert (cycle_length > 0);
hb_decycler_node_t node (decycler);
if (!node.visit (value))
return;
if (value >= cycle_length)
value = value % cycle_length;
cycle_recurse (value + 1, cycle_length, decycler);
}
static void
test_cycle ()
{
hb_decycler_t decycler;
cycle_recurse (2, 3, decycler);
cycle_recurse (-20, 8, decycler);
}
int
main (int argc, char **argv)
{
test_tree ();
test_cycle ();
return 0;
}