From 2296d6f078f543f8c17d9f9181ec10bd228110f2 Mon Sep 17 00:00:00 2001 From: Simon Tatham Date: Sun, 2 Apr 2023 13:07:25 +0100 Subject: [PATCH] Remove penrose_count_tiles(). Nothing uses it, and that's not surprising, because if anything had, we'd have noticed that it never actually got written! --- penrose.c | 5 ----- penrose.h | 3 --- 2 files changed, 8 deletions(-) diff --git a/penrose.c b/penrose.c index 457b3fd..df0b72e 100644 --- a/penrose.c +++ b/penrose.c @@ -417,11 +417,6 @@ double penrose_side_length(double start_size, int depth) return start_size / pow(PHI, depth); } -void penrose_count_tiles(int depth, int *nlarge, int *nsmall) -{ - /* Steal sgt's fibonacci thingummy. */ -} - /* * It turns out that an acute isosceles triangle with sides in ratio 1:phi:phi * has an incentre which is conveniently 2*phi^-2 of the way from the apex to diff --git a/penrose.h b/penrose.h index d1010b9..838364d 100644 --- a/penrose.h +++ b/penrose.h @@ -48,9 +48,6 @@ extern int penrose(penrose_state *state, int which, int angle); * gen, given a starting side length. */ extern double penrose_side_length(double start_size, int depth); -/* Returns the count of each type of tile at a given recursion depth. */ -extern void penrose_count_tiles(int gen, int *nlarge, int *nsmall); - /* 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_calculate_size(int which, int tilesize, int w, int h,