/* Apache License, Version 2.0 */

#include "testing/testing.h"

/* Use to write out OBJ files, handy for checking output */
// #define USE_OBJ_PREVIEW

/* test every possible offset and reverse */
#define USE_COMBINATIONS_ALL
#define USE_BEAUTIFY

extern "C" {
#include "BLI_array_utils.h"
#include "BLI_polyfill2d.h"
#include "BLI_math.h"
#include "BLI_edgehash.h"
#include "MEM_guardedalloc.h"

#ifdef USE_OBJ_PREVIEW
#  include "BLI_string.h"
#endif

#ifdef USE_BEAUTIFY
#include "BLI_polyfill2d_beautify.h"
#include "BLI_memarena.h"
#include "BLI_heap.h"
#endif
}

#include "stubs/bf_intern_eigen_stubs.h"

static void polyfill_to_obj(
        const char *id,
        const float poly[][2], const unsigned int poly_tot,
        const unsigned int tris[][3], const unsigned int tris_tot);

/* -------------------------------------------------------------------- */
/* test utility functions */

#define TRI_ERROR_VALUE (unsigned int)-1

static void test_valid_polyfill_prepare(unsigned int tris[][3], unsigned int tris_tot)
{
	unsigned int i;
	for (i = 0; i < tris_tot; i++) {
		unsigned int j;
		for (j = 0; j < 3; j++) {
			tris[i][j] = TRI_ERROR_VALUE;
		}
	}
}

/**
 * Basic check for face index values:
 *
 * - no duplicates.
 * - all tris set.
 * - all verts used at least once.
 */
static void test_polyfill_simple(
        const float poly[][2], const unsigned int poly_tot,
        const unsigned int tris[][3], const unsigned int tris_tot)
{
	unsigned int i;
	int *tot_used = (int *)MEM_callocN(poly_tot * sizeof(int), __func__);
	for (i = 0; i < tris_tot; i++) {
		unsigned int j;
		for (j = 0; j < 3; j++) {
			EXPECT_NE(TRI_ERROR_VALUE, tris[i][j]);
			tot_used[tris[i][j]] += 1;
		}
		EXPECT_NE(tris[i][0], tris[i][1]);
		EXPECT_NE(tris[i][1], tris[i][2]);
		EXPECT_NE(tris[i][2], tris[i][0]);
	}
	for (i = 0; i < poly_tot; i++) {
		EXPECT_NE(0, tot_used[i]);
	}
	MEM_freeN(tot_used);
}

static void  test_polyfill_topology(
        const float poly[][2], const unsigned int poly_tot,
        const unsigned int tris[][3], const unsigned int tris_tot)
{
	EdgeHash *edgehash = BLI_edgehash_new(__func__);
	EdgeHashIterator *ehi;
	unsigned int i;
	for (i = 0; i < tris_tot; i++) {
		unsigned int j;
		for (j = 0; j < 3; j++) {
			const unsigned int v1 = tris[i][j];
			const unsigned int v2 = tris[i][(j + 1) % 3];
			void **p = BLI_edgehash_lookup_p(edgehash, v1, v2);
			if (p) {
				*p = (void *)((intptr_t)*p + (intptr_t)1);
			}
			else {
				BLI_edgehash_insert(edgehash, v1, v2, (void *)(intptr_t)1);
			}
		}
	}
	EXPECT_EQ(BLI_edgehash_size(edgehash), poly_tot + (poly_tot - 3));

	for (i = 0; i < poly_tot; i++) {
		const unsigned int v1 = i;
		const unsigned int v2 = (i + 1) % poly_tot;
		void **p = BLI_edgehash_lookup_p(edgehash, v1, v2);
		EXPECT_EQ((void *)p != NULL, 1);
		EXPECT_EQ((intptr_t)*p, 1);
	}

	for (ehi = BLI_edgehashIterator_new(edgehash), i = 0;
	     BLI_edgehashIterator_isDone(ehi) == false;
	     BLI_edgehashIterator_step(ehi), i++)
	{
		void **p = BLI_edgehashIterator_getValue_p(ehi);
		EXPECT_TRUE(ELEM((intptr_t)*p, 1, 2));
	}

	BLI_edgehashIterator_free(ehi);
	BLI_edgehash_free(edgehash, NULL);
}

/**
 * Check all faces are flipped the same way
 */
static void  test_polyfill_winding(
        const float poly[][2], const unsigned int poly_tot,
        const unsigned int tris[][3], const unsigned int tris_tot)
{
	unsigned int i;
	unsigned int count[2] = {0, 0};
	for (i = 0; i < tris_tot; i++) {
		float winding_test = cross_tri_v2(poly[tris[i][0]], poly[tris[i][1]], poly[tris[i][2]]);
		if (fabsf(winding_test) > FLT_EPSILON) {
			count[winding_test < 0.0f] += 1;
		}
	}
	EXPECT_TRUE(ELEM(0, count[0], count[1]));
}

/**
 * Check the accumulated triangle area is close to the original area.
 */
static void test_polyfill_area(
        const float poly[][2], const unsigned int poly_tot,
        const unsigned int tris[][3], const unsigned int tris_tot)
{
	unsigned int i;
	const float area_tot = area_poly_v2(poly, poly_tot);
	float       area_tot_tris = 0.0f;
	const float eps_abs = 0.00001f;
	const float eps = area_tot > 1.0f ? (area_tot * eps_abs) : eps_abs;
	for (i = 0; i < tris_tot; i++) {
		area_tot_tris += area_tri_v2(poly[tris[i][0]], poly[tris[i][1]], poly[tris[i][2]]);
	}
	EXPECT_NEAR(area_tot, area_tot_tris, eps);
}


/* -------------------------------------------------------------------- */
/* Macro and helpers to manage checking */
/**
 * Main template for polyfill testing.
 */
static void test_polyfill_template_check(
        const char *id, bool is_degenerate,
        const float poly[][2], const unsigned int poly_tot,
        const unsigned int tris[][3], const unsigned int tris_tot)
{
	test_polyfill_simple(poly, poly_tot, tris, tris_tot);
	test_polyfill_topology(poly, poly_tot, tris, tris_tot);
	if (!is_degenerate) {
		test_polyfill_winding(poly, poly_tot, tris, tris_tot);

		test_polyfill_area(poly, poly_tot, tris, tris_tot);
	}
	polyfill_to_obj(id, poly, poly_tot, tris, tris_tot);
}

static void test_polyfill_template(
        const char *id, bool is_degenerate,
        const float poly[][2], const unsigned int poly_tot,
        unsigned int tris[][3], const unsigned int tris_tot)
{
	test_valid_polyfill_prepare(tris, tris_tot);
	BLI_polyfill_calc(poly, poly_tot, 0, tris);

	/* check all went well */
	test_polyfill_template_check(id, is_degenerate, poly, poly_tot, tris, tris_tot);

#ifdef USE_BEAUTIFY
	/* check beautify gives good results too */
	{
		MemArena *pf_arena = BLI_memarena_new(BLI_POLYFILL_ARENA_SIZE, __func__);
		Heap *pf_heap = BLI_heap_new_ex(BLI_POLYFILL_ALLOC_NGON_RESERVE);
		EdgeHash *pf_ehash = BLI_edgehash_new_ex(__func__, BLI_POLYFILL_ALLOC_NGON_RESERVE);

		BLI_polyfill_beautify(
		        poly, poly_tot, tris,
		        pf_arena, pf_heap, pf_ehash);

		test_polyfill_template_check(id, is_degenerate, poly, poly_tot, tris, tris_tot);

		BLI_memarena_free(pf_arena);
		BLI_heap_free(pf_heap, NULL);
		BLI_edgehash_free(pf_ehash, NULL);
	}
#endif
}

static void test_polyfill_template_flip_sign(
        const char *id, bool is_degenerate,
        const float poly[][2], const unsigned int poly_tot,
        unsigned int tris[][3], const unsigned int tris_tot)
{
	float (*poly_copy)[2] = (float (*)[2])MEM_mallocN(sizeof(float[2]) * poly_tot, id);
	for (int flip_x = 0; flip_x < 2; flip_x++) {
		for (int flip_y = 0; flip_y < 2; flip_y++) {
			float sign_x = flip_x ? -1.0f : 1.0f;
			float sign_y = flip_y ? -1.0f : 1.0f;
			for (int i = 0; i < poly_tot; i++) {
				poly_copy[i][0] = poly[i][0] * sign_x;
				poly_copy[i][1] = poly[i][1] * sign_y;
			}
			test_polyfill_template(id, is_degenerate, poly_copy, poly_tot, tris, tris_tot);
		}
	}
	MEM_freeN(poly_copy);
}

#ifdef USE_COMBINATIONS_ALL
static void test_polyfill_template_main(
        const char *id, bool is_degenerate,
        const float poly[][2], const unsigned int poly_tot,
        unsigned int tris[][3], const unsigned int tris_tot)
{
	/* overkill? - try at _every_ offset & reverse */
	unsigned int poly_reverse;
	float (*poly_copy)[2] = (float (*)[2])MEM_mallocN(sizeof(float[2]) * poly_tot, id);
	float tmp[2];

	memcpy(poly_copy, poly, sizeof(float[2]) * poly_tot);

	for (poly_reverse = 0; poly_reverse < 2; poly_reverse++) {
		unsigned int poly_cycle;

		if (poly_reverse) {
			BLI_array_reverse(poly_copy, poly_tot);
		}

		for (poly_cycle = 0; poly_cycle < poly_tot; poly_cycle++) {
			// printf("polytest %s ofs=%d, reverse=%d\n", id, poly_cycle, poly_reverse);
			test_polyfill_template_flip_sign(id, is_degenerate, poly, poly_tot, tris, tris_tot);

			/* cycle */
			copy_v2_v2(tmp, poly_copy[0]);
			memmove(&poly_copy[0], &poly_copy[1], (poly_tot - 1) * sizeof(float[2]));
			copy_v2_v2(poly_copy[poly_tot - 1], tmp);
		}
	}

	MEM_freeN(poly_copy);
}
#else  /* USE_COMBINATIONS_ALL */
static void test_polyfill_template_main(
        const char *id, bool is_degenerate,
        const float poly[][2], const unsigned int poly_tot,
        unsigned int tris[][3], const unsigned int tris_tot)
{
	test_polyfill_template_flip_sign(id, is_degenerate, poly, poly_tot, tris, tris_tot);
}
#endif  /* USE_COMBINATIONS_ALL */

#define TEST_POLYFILL_TEMPLATE_STATIC(poly, is_degenerate) \
{ \
	unsigned int tris[POLY_TRI_COUNT(ARRAY_SIZE(poly))][3]; \
	const unsigned int poly_tot = ARRAY_SIZE(poly); \
	const unsigned int tris_tot = ARRAY_SIZE(tris); \
	const char *id = typeid(*this).name(); \
	\
	test_polyfill_template_main(id, is_degenerate, poly, poly_tot, tris, tris_tot); \
} (void)0

/* -------------------------------------------------------------------- */
/* visualisation functions (not needed for testing) */

#ifdef USE_OBJ_PREVIEW
static void polyfill_to_obj(
        const char *id,
        const float poly[][2], const unsigned int poly_tot,
        const unsigned int tris[][3], const unsigned int tris_tot)
{
	char path[1024];
	FILE *f;
	unsigned int i;

	BLI_snprintf(path, sizeof(path), "%s.obj", id);

	f = fopen(path, "w");
	if (!f) {
		return;
	}

	for (i = 0; i < poly_tot; i++) {
		fprintf(f, "v %f %f 0.0\n", UNPACK2(poly[i]));
	}

	for (i = 0; i < tris_tot; i++) {
		fprintf(f, "f %u %u %u\n", UNPACK3_EX(1 +, tris[i], ));
	}

	fclose(f);
}
#else
static void polyfill_to_obj(
        const char *id,
        const float poly[][2], const unsigned int poly_tot,
        const unsigned int tris[][3], const unsigned int tris_tot)
{
	(void)id;
	(void)poly, (void)poly_tot;
	(void)tris, (void)tris_tot;
}
#endif  /* USE_OBJ_PREVIEW */


/* -------------------------------------------------------------------- */
/* tests */

/**
 * Script to generate the data below:
 *
 * \code{.py}
 * # This example assumes we have a mesh object in edit-mode
 *
 * import bpy
 * import bmesh
 *
 * obj = bpy.context.edit_object
 * me = obj.data
 * bm = bmesh.from_edit_mesh(me)
 *
 * def clean_float(num):
 *     if int(num) == num:
 *         return str(int(num))
 *     prec = 1
 *     while True:
 *         text = f"{num:.{prec}f}"
 *         if float(text) == num:
 *             return text
 *         prec += 1
 *
 * for f in bm.faces:
 *     if f.select:
 *         print(f"\t// data for face: {f.index}")
 *         print("\tconst float poly[][2] = {", end="")
 *         coords = [[clean_float(num) for num in l.vert.co[0:2]] for l in f.loops]
 *         print("\t    ", end="")
 *         for i, (x, y) in enumerate(coords):
 *             if (i % 2) == 0:
 *                 print("\n\t    ", end="")
 *             print(f"{{{x}, {y}}}", end=",")
 *         print("\n\t};")
 * \endcode
 */

#define POLY_TRI_COUNT(len) ((len) - 2)


/* A counterclockwise triangle */
TEST(polyfill2d, TriangleCCW)
{
	const float poly[][2] = {{0, 0}, {0, 1}, {1, 0}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* A counterclockwise square */
TEST(polyfill2d, SquareCCW)
{
	const float poly[][2] = {{0, 0}, {0, 1}, {1, 1}, {1, 0}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* A clockwise square */
TEST(polyfill2d, SquareCW)
{
	const float poly[][2] = {{0, 0}, {1, 0}, {1, 1}, {0, 1}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Starfleet insigna */
TEST(polyfill2d, Starfleet)
{
	const float poly[][2] = {{0, 0}, {0.6f, 0.4f}, {1, 0}, {0.5f, 1}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Starfleet insigna with repeated point */
TEST(polyfill2d, StarfleetDegenerate)
{
	const float poly[][2] = {{0, 0}, {0.6f, 0.4f}, {0.6f, 0.4f}, {1, 0}, {0.5f, 1}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Three collinear points */
TEST(polyfill2d, 3Colinear)
{
	const float poly[][2] = {{0, 0}, {1, 0}, {2, 0}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Four collinear points */
TEST(polyfill2d, 4Colinear)
{
	const float poly[][2] = {{0, 0}, {1, 0}, {2, 0}, {3, 0}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Non-consecutive collinear points */
TEST(polyfill2d, UnorderedColinear)
{
	const float poly[][2] = {{0, 0}, {1, 1}, {2, 0}, {3, 1}, {4, 0}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Plus shape */
TEST(polyfill2d, PlusShape)
{
	const float poly[][2] = {
	    {1, 0}, {2, 0}, {2, 1}, {3, 1}, {3, 2}, {2, 2}, {2, 3}, {1, 3}, {1, 2}, {0, 2}, {0, 1}, {1, 1}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Star shape */
TEST(polyfill2d, StarShape)
{
	const float poly[][2] = {
	    {4, 0}, {5, 3}, {8, 4}, {5, 5}, {4, 8}, {3, 5}, {0, 4}, {3, 3}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* U shape */
TEST(polyfill2d, UShape)
{
	const float poly[][2] = {
	    {1, 0}, {2, 0}, {3, 1}, {3, 3}, {2, 3}, {2, 1}, {1, 1}, {1, 3}, {0, 3}, {0, 1}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Spiral */
TEST(polyfill2d, Spiral)
{
	const float poly[][2] = {
	    {1, 0}, {4, 0}, {5, 1}, {5, 4}, {4, 5}, {1, 5}, {0, 4}, {0, 3},
	    {1, 2}, {2, 2}, {3, 3}, {1, 3}, {1, 4}, {4, 4}, {4, 1}, {0, 1}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Test case from http:# www.flipcode.com/archives/Efficient_Polygon_Triangulation.shtml */
TEST(polyfill2d, TestFlipCode)
{
	const float poly[][2] = {
	    {0, 6}, {0, 0}, {3, 0}, {4, 1}, {6, 1}, {8, 0}, {12, 0}, {13, 2},
	    {8, 2}, {8, 4}, {11, 4}, {11, 6}, {6, 6}, {4, 3}, {2, 6}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Self-intersection */
TEST(polyfill2d, SelfIntersect)
{
	const float poly[][2] = {{0, 0}, {1, 1}, {2, -1}, {3, 1}, {4, 0}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, true);
}

/* Self-touching */
TEST(polyfill2d, SelfTouch)
{
	const float poly[][2] = {
	    {0, 0}, {4, 0}, {4, 4}, {2, 4}, {2, 3}, {3, 3}, {3, 1}, {1, 1}, {1, 3}, {2, 3}, {2, 4}, {0, 4}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Self-overlapping */
TEST(polyfill2d, SelfOverlap)
{
	const float poly[][2] = {
	    {0, 0}, {4, 0}, {4, 4}, {1, 4}, {1, 3}, {3, 3}, {3, 1}, {1, 1}, {1, 3}, {3, 3}, {3, 4}, {0, 4}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, true);
}

/* Test case from http:# www.davdata.nl/math/polygons.html */
TEST(polyfill2d, TestDavData)
{
	const float poly[][2] = {
	    {190, 480}, {140, 180}, {310, 100}, {330, 390}, {290, 390}, {280, 260}, {220, 260}, {220, 430}, {370, 430},
	    {350, 30}, {50, 30}, {160, 560}, {730, 510}, {710, 20}, {410, 30}, {470, 440}, {640, 410}, {630, 140},
	    {590, 140}, {580, 360}, {510, 370}, {510, 60}, {650, 70}, {660, 450}, {190, 480}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Issue 815, http:# code.google.com/p/libgdx/issues/detail?id=815 */
TEST(polyfill2d, Issue815)
{
	const float poly[][2] = {
	    {-2.0f, 0.0f}, {-2.0f, 0.5f}, {0.0f, 1.0f}, {0.5f, 2.875f},
	    {1.0f, 0.5f}, {1.5f, 1.0f}, {2.0f, 1.0f}, {2.0f, 0.0f}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Issue 207, comment #1, http:# code.google.com/p/libgdx/issues/detail?id=207#c1 */
TEST(polyfill2d, Issue207_1)
{
	const float poly[][2] = {
	    {72.42465f, 197.07095f}, {78.485535f, 189.92776f}, {86.12059f, 180.92929f}, {99.68253f, 164.94557f},
	    {105.24325f, 165.79604f}, {107.21862f, 166.09814f}, {112.41958f, 162.78253f}, {113.73238f, 161.94562f},
	    {123.29477f, 167.93805f}, {126.70667f, 170.07617f}, {73.22717f, 199.51062f}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, true);
}

/* Issue 207, comment #11, http:# code.google.com/p/libgdx/issues/detail?id=207#c11 */
/* Also on issue 1081, http:# code.google.com/p/libgdx/issues/detail?id=1081 */
TEST(polyfill2d, Issue207_11)
{
	const float poly[][2] = {
	    {2400.0f, 480.0f}, {2400.0f, 176.0f}, {1920.0f, 480.0f}, {1920.0459f, 484.22314f},
	    {1920.1797f, 487.91016f}, {1920.3955f, 491.0874f}, {1920.6875f, 493.78125f}, {1921.0498f, 496.01807f},
	    {1921.4766f, 497.82422f}, {1921.9619f, 499.22607f}, {1922.5f, 500.25f}, {1923.085f, 500.92236f},
	    {1923.7109f, 501.26953f}, {1924.3721f, 501.31787f}, {1925.0625f, 501.09375f}, {1925.7764f, 500.62354f},
	    {1926.5078f, 499.9336f}, {1927.251f, 499.0503f}, {1928.0f, 498.0f}, {1928.749f, 496.80908f},
	    {1929.4922f, 495.5039f}, {1930.2236f, 494.11084f}, {1930.9375f, 492.65625f}, {1931.6279f, 491.1665f},
	    {1932.2891f, 489.66797f}, {1932.915f, 488.187f}, {1933.5f, 486.75f}, {1934.0381f, 485.3833f},
	    {1934.5234f, 484.11328f}, {1934.9502f, 482.9663f}, {1935.3125f, 481.96875f}, {1935.6045f, 481.14697f},
	    {1935.8203f, 480.52734f}, {1935.9541f, 480.13623f}, {1936.0f, 480.0f}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Issue 1407, http:# code.google.com/p/libgdx/issues/detail?id=1407 */
TEST(polyfill2d, Issue1407)
{
	const float poly[][2] = {
	    {3.914329f, 1.9008259f}, {4.414321f, 1.903619f}, {4.8973203f, 1.9063174f}, {5.4979978f, 1.9096732f}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Issue 1407, http:# code.google.com/p/libgdx/issues/detail?id=1407, */
/* with an additional point to show what is happening. */
TEST(polyfill2d, Issue1407_pt)
{
	const float poly[][2] = {
	    {3.914329f, 1.9008259f}, {4.414321f, 1.903619f}, {4.8973203f, 1.9063174f}, {5.4979978f, 1.9096732f}, {4, 4}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Simplified from Blender bug T40777 */
TEST(polyfill2d, IssueT40777_colinear)
{
	const float poly[][2] = {
	    {0.7, 0.37}, {0.7, 0}, {0.76, 0}, {0.76, 0.4}, {0.83, 0.4}, {0.83, 0}, {0.88, 0}, {0.88, 0.4},
	    {0.94, 0.4}, {0.94, 0}, {1, 0}, {1, 0.4}, {0.03, 0.62}, {0.03, 0.89}, {0.59, 0.89}, {0.03, 1},
	    {0, 1}, {0, 0}, {0.03, 0}, {0.03, 0.37}};
	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Blender bug T41986 */
TEST(polyfill2d, IssueT41986_axis_align)
{
	const float poly[][2] = {
	    {-0.25, -0.07}, {-0.25, 0.27}, {-1.19, 0.14}, {-0.06, 0.73}, {0.17, 1.25}, {-0.25, 1.07},
	    {-0.38, 1.02}, {-0.25, 0.94}, {-0.40, 0.90}, {-0.41, 0.86}, {-0.34, 0.83}, {-0.25, 0.82},
	    {-0.66, 0.73}, {-0.56, 1.09}, {-0.25, 1.10}, {0.00, 1.31}, {-0.03, 1.47}, {-0.25, 1.53},
	    {0.12, 1.62}, {0.36, 1.07}, {0.12, 0.67}, {0.29, 0.57}, {0.44, 0.45}, {0.57, 0.29},
	    {0.66, 0.12}, {0.68, 0.06}, {0.57, -0.36}, {-0.25, -0.37}, {0.49, -0.74}, {-0.59, -1.21},
	    {-0.25, -0.15}, {-0.46, -0.52}, {-1.08, -0.83}, {-1.45, -0.33}, {-1.25, -0.04}};

	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}

/* Blender bug T52834 */
TEST(polyfill2d, IssueT52834_axis_align_co_linear)
{
	const float poly[][2] = {
	    {40, 0}, {36, 0}, {36, 5}, {35, 5}, {35, 0}, {30, 0}, {30, 5}, {29, 5}, {29, 0}, {24, 0}, {24, 3},
	    {23, 4}, {23, 0}, {18, 0}, {18, 5}, {17, 5}, {17, 0}, {12, 0}, {12, 5}, {11, 5}, {11, 0}, {6, 0},
	    {6, 5}, {5, 5}, {5, 0}, {0, 0}, {0, 5}, {-1, 5}, {-1, 0}, {-6, 0}, {-9, -3}, {-6, -3}, {-6, -2},
	    {-1, -2}, {0, -2}, {5, -2}, {6, -2}, {11, -2}, {12, -2}, {17, -2}, {18, -2}, {23, -2}, {24, -2},
	    {29, -2}, {30, -2}, {35, -2}, {36, -2}, {40, -2},
	};

	TEST_POLYFILL_TEMPLATE_STATIC(poly, false);
}