From 09aa8de52cb962f1ceebfb1fd44f2c54a924fc5c Mon Sep 17 00:00:00 2001 From: Franklin Wei Date: Mon, 22 Jul 2024 21:43:25 -0400 Subject: puzzles: resync with upstream This brings the puzzles source in sync with Simon's branch, commit fd304c5 (from March 2024), with some added Rockbox-specific compatibility changes: https://www.franklinwei.com/git/puzzles/commit/?h=rockbox-devel&id=516830d9d76bdfe64fe5ccf2a9b59c33f5c7c078 There are quite a lot of backend changes, including a new "Mosaic" puzzle. In addition, some new frontend changes were necessary: - New "Preferences" menu to access the user preferences system. - Enabled spacebar input for several games. Change-Id: I94c7df674089c92f32d5f07025f6a1059068af1e --- apps/plugins/puzzles/src/penrose-legacy.h | 63 +++++++++++++++++++++++++++++++ 1 file changed, 63 insertions(+) create mode 100644 apps/plugins/puzzles/src/penrose-legacy.h (limited to 'apps/plugins/puzzles/src/penrose-legacy.h') diff --git a/apps/plugins/puzzles/src/penrose-legacy.h b/apps/plugins/puzzles/src/penrose-legacy.h new file mode 100644 index 0000000000..514fd8b592 --- /dev/null +++ b/apps/plugins/puzzles/src/penrose-legacy.h @@ -0,0 +1,63 @@ +/* penrose-legacy.h: legacy Penrose tiling functions. + * + * Provides an interface with which to generate Penrose tilings + * by recursive subdivision of an initial tile of choice (one of the + * four sets of two pairs kite/dart, or thin/thick rhombus). + * + * You supply a callback function and a context pointer, which is + * called with each tile in turn: you choose how many times to recurse. + * + * This method of generating Penrose tiling fragments is superseded by + * the completely different algorithm in penrose.c. We keep the legacy + * algorithm around only for interpreting Loopy game IDs generated by + * older versions of the code. + */ + +#ifndef PUZZLES_PENROSE_LEGACY_H +#define PUZZLES_PENROSE_LEGACY_H + +#ifndef PHI +#define PHI 1.6180339887 +#endif + +typedef struct vector vector; + +double penrose_legacy_vx(vector *vs, int i); +double penrose_legacy_vy(vector *vs, int i); + +typedef struct penrose_legacy_state penrose_legacy_state; + +/* Return non-zero to clip the tree here (i.e. not recurse + * below this tile). + * + * Parameters are state, vector array, npoints, depth. + * ctx is inside state. + */ +typedef int (*tile_callback)(penrose_legacy_state *, vector *, int, int); + +struct penrose_legacy_state { + int start_size; /* initial side length */ + int max_depth; /* Recursion depth */ + + tile_callback new_tile; + void *ctx; /* for callback */ +}; + +#ifndef PENROSE_ENUM_DEFINED +#define PENROSE_ENUM_DEFINED +enum { PENROSE_P2, PENROSE_P3 }; +#endif + +extern int penrose_legacy(penrose_legacy_state *state, int which, int angle); + +/* Returns the side-length of a penrose tile at recursion level + * gen, given a starting side length. */ +extern double penrose_legacy_side_length(double start_size, int depth); + +/* Calculate start size and recursion depth required to produce a + * width-by-height sized patch of penrose tiles with the given tilesize */ +extern void penrose_legacy_calculate_size( + int which, int tilesize, int w, int h, + double *required_radius, int *start_size, int *depth); + +#endif -- cgit v1.2.3