Miroirs/c-urs_-toil-s
1
0
Fork 0
mirror of https://github.com/gwenhael-le-moine/c-urs_-toil-s.git synced 2024-12-27 09:58:44 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

more functional, store state in state

Browse source
This commit is contained in:
Gwenhael Le Moine 2011-07-01 17:59:38 +02:00
parent 771f4ff155
commit 1d92fb056f
1 changed files with 31 additions and 28 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

59
star.c
View file

@ -284,16 +284,18 @@ typedef enum {
} direction; } direction;
struct state { struct state {
char level[ LEVEL_HEIGHT * LEVEL_WIDTH ]; char board[ LEVEL_HEIGHT * LEVEL_WIDTH ];
char moving; char moving;
int moves; int moves;
int level;
int nb_levels;
}; };
int count_gifts( struct state *s ) int count_gifts( struct state *s )
{ {
int i, n = 0; int i, n = 0;
for( i = 0 ; i < LEVEL_HEIGHT * LEVEL_WIDTH ; i++ ) { for( i = 0 ; i < LEVEL_HEIGHT * LEVEL_WIDTH ; i++ ) {
if ( s->level[ i ] == GIFT ) { if ( s->board[ i ] == GIFT ) {
n++; n++;
} }
} }
@ -304,7 +306,7 @@ void get_pos( struct state *s, int* pos )
{ {
int p; int p;
p = (int)( strchr( s->level, s->moving ) - s->level ); p = (int)( strchr( s->board, s->moving ) - s->board );
pos[ 1 ] = p / LEVEL_WIDTH; pos[ 1 ] = p / LEVEL_WIDTH;
pos[ 0 ] = p - ( pos[ 1 ] * LEVEL_WIDTH ); pos[ 0 ] = p - ( pos[ 1 ] * LEVEL_WIDTH );
@ -312,17 +314,18 @@ void get_pos( struct state *s, int* pos )
char get_cell( struct state *s, int x, int y ) char get_cell( struct state *s, int x, int y )
{ {
return s->level[ y * LEVEL_WIDTH + x ]; return s->board[ y * LEVEL_WIDTH + x ];
} }
void set_cell( struct state *s, int x, int y, cell value ) void set_cell( struct state *s, int x, int y, cell value )
{ {
s->level[ y * LEVEL_WIDTH + x ] = value; s->board[ y * LEVEL_WIDTH + x ] = value;
} }
void load_level( struct state *s, char* lvl ) void load_level( struct state *s, char* lvl[], int nb )
{ {
strncpy( s->level, lvl, LEVEL_HEIGHT * LEVEL_WIDTH ); strncpy( s->board, lvl[ nb ], LEVEL_HEIGHT * LEVEL_WIDTH );
s->level = nb;
s->moving = BALL; s->moving = BALL;
s->moves = 0; s->moves = 0;
} }
@ -446,20 +449,18 @@ void display_level( struct state *s )
} }
} }
mvprintw( 1, 35, "%i gifts left", count_gifts( s ) ); mvprintw( 1, 35, "level %i of %i", s->level + 1, s->nb_levels );
mvprintw( 2, 35, "%i moves made", s->moves ); mvprintw( 2, 35, "%i gifts left", count_gifts( s ) );
mvprintw( 3, 35, "%i moves made", s->moves );
refresh(); refresh();
} }
int main( int argc, char* argv[] ) int main( int argc, char* argv[] )
{ {
int i = 0, lvl = 0, key, load_requested = 0; int i = 0, key;
struct state *s = malloc( sizeof( struct state ) ); struct state *s = malloc( sizeof( struct state ) );
/* trick to count how many levels we have */
int nb_levels = sizeof( levels ) / sizeof( levels[ 0 ] );
/* ncurses */ /* ncurses */
WINDOW *w_main = initscr( ); /* why can't stdscr be used transparently? */ WINDOW *w_main = initscr( ); /* why can't stdscr be used transparently? */
cbreak(); cbreak();
@ -478,17 +479,21 @@ int main( int argc, char* argv[] )
init_pair( color_BALL_SELECTED, COLOR_BLUE, COLOR_YELLOW ); init_pair( color_BALL_SELECTED, COLOR_BLUE, COLOR_YELLOW );
} }
/* s->level = 0; */
/* trick to count how many levels we have */
s->nb_levels = sizeof( levels ) / sizeof( levels[ 0 ] );
/* load the first level to start the loop in a correct state */ /* load the first level to start the loop in a correct state */
load_level( s, levels[ lvl ] ); load_level( s, levels, 0 );
do { do {
if ( won_or_not( s ) ) { if ( won_or_not( s ) ) {
lvl++; if ( s->level < s->nb_levels - 1 ) {
load_requested = 1; load_level( s, levels, s->level + 1 );
} }
if ( load_requested == 1 ) { else {
load_requested = 0; // Damn it you finished the whole game!!
load_level( s, levels[ lvl ] ); }
} }
display_level( s ); display_level( s );
@ -510,24 +515,22 @@ int main( int argc, char* argv[] )
switch_actor( s ); switch_actor( s );
break; break;
case 'n': case 'n':
if ( lvl < nb_levels - 1 ) { if ( s->level < s->nb_levels - 1 ) {
lvl++; load_level( s, levels, s->level + 1 );
load_requested = 1;
} }
break; break;
case 'p': case 'p':
if ( lvl > 0 ) { if ( s->level > 0 ) {
lvl--; load_level( s, levels, s->level - 1 );
load_requested = 1;
} }
break; break;
case 'r': case 'r':
load_requested = 1; load_level( s, levels, s->level );
break; break;
default: default:
break; break;
} }
} while( lvl < nb_levels && (( key != 'q' ) && ( key != 'Q' )) ); } while( ( s->level < s->nb_levels ) && (( key != 'q' ) && ( key != 'Q' )) );
display_level( s ); display_level( s );
free( s ); free( s );