shithub: puzzles

Info  •  Files  •  Log  •  Branches

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!

--- a/penrose.c

+++ b/penrose.c

@@ -417,11 +417,6 @@

   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

--- a/penrose.h

+++ b/penrose.h

@@ -48,9 +48,6 @@

  * 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,