Mercurial > hg > Members > kono > tree_dandy2

comparison Enemy.c @ 0:01387a2e419e

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
initial version
author Shinji KONO <kono@ie.u-ryukyu.ac.jp>
date Tue, 07 Dec 2010 15:39:45 +0900
parents
children
comparison
equal deleted inserted replaced
-1:000000000000 0:01387a2e419e
1 #include "Enemy.h"
2 #include"syokika.h"
3
4 int filpcount = 0;
5 int stage = 0;
6
7 teki enemy[300];
8 teki *e;
9 BOOL tf = FALSE;
10
11 #define ENEMY_STATUS(id,charno,score,hardness) {charno,score,hardness}
12 const state enemystate[] = ENEMY_STATUS_TABLE;
13
14 void TFon()
15 {
16 tf = TRUE;
17 }
18
19 void TFoff()
20 {
21 tf = FALSE;
22 }
23
24 void Putenemy(int charno, float x, float y, float sx, float sy, int move)
25 {
26 int ii = 0;
27 e = &enemy[0];
28 while ((e->f) == TRUE) {
29 ii++;
30 if (ii == 100)
31 return;
32 e++;
33 }
34 e->x = x;
35 e->y = y;
36 e->sx = sx;
37 e->sy = sy;
38 e->charno = enemystate[charno].charno;
39 e->f = TRUE;
40 e->p = enemystate[charno].p;
41 e->move = move;
42 e->sc = enemystate[charno].sc;
43 e->dt1 = e->dt2 = 0;
44 e->tama = tf;
45 }
46
47 void
48 Putenemyb(int b, int charno, float x, float y, float sx, float sy,
49 int move)
50 {
51 //int ii=0;
52 e = &enemy[b];
53 e->x = x;
54 e->y = y;
55 e->sx = sx;
56 e->sy = sy;
57 e->charno = enemystate[charno].charno;
58 e->f = TRUE;
59 e->p = enemystate[charno].p;
60 e->move = move;
61 e->sc = enemystate[charno].sc;
62 e->dt1 = e->dt2 = 0;
63 e->tama = tf;
64 }