zakarya/puzzles
1
0
Fork 0
mirror of git://git.tartarus.org/simon/puzzles.git synced 2025-04-21 08:01:30 -07:00
Code Issues Packages Projects Releases Wiki Activity

Remove penrose_count_tiles().

Browse Source 
Nothing uses it, and that's not surprising, because if anything had,
we'd have noticed that it never actually got written!
This commit is contained in:
Simon Tatham
2023-04-02 13:07:25 +01:00
parent 83244294f5
commit 2296d6f078
2 changed files with 0 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
penrose.c
View File

@ -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

3
penrose.h
View File

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