1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
|
/*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <element.h>
int update_SING(UPDATE_FUNC_ARGS) {
int r, rx, ry, cry, crx, rad, nxi, nxj, nb, j, spawncount;
int singularity = -parts[i].life;
float angle, v;
if (pv[y/CELL][x/CELL]<singularity)
pv[y/CELL][x/CELL] += 0.1f*(singularity-pv[y/CELL][x/CELL]);
if (y+CELL<YRES && pv[y/CELL+1][x/CELL]<singularity)
pv[y/CELL+1][x/CELL] += 0.1f*(singularity-pv[y/CELL+1][x/CELL]);
if (x+CELL<XRES)
{
pv[y/CELL][x/CELL+1] += 0.1f*(singularity-pv[y/CELL][x/CELL+1]);
if (y+CELL<YRES)
pv[y/CELL+1][x/CELL+1] += 0.1f*(singularity-pv[y/CELL+1][x/CELL+1]);
}
if (y-CELL>=0 && pv[y/CELL-1][x/CELL]<singularity)
pv[y/CELL-1][x/CELL] += 0.1f*(singularity-pv[y/CELL-1][x/CELL]);
if (x-CELL>=0)
{
pv[y/CELL][x/CELL-1] += 0.1f*(singularity-pv[y/CELL][x/CELL-1]);
if (y-CELL>=0)
pv[y/CELL-1][x/CELL-1] += 0.1f*(singularity-pv[y/CELL-1][x/CELL-1]);
}
if (parts[i].life<1) {
//Pop!
for (rx=-1; rx<2; rx++) {
crx = (x/CELL)+rx;
for (ry=-1; ry<2; ry++) {
cry = (y/CELL)+ry;
if (cry >= 0 && crx >= 0 && crx < (XRES/CELL) && cry < (YRES/CELL)) {
pv[cry][crx] += (float)parts[i].tmp;
}
}
}
spawncount = (parts[i].tmp>255)?255:parts[i].tmp;
if (spawncount>=1)
spawncount = spawncount/8;
spawncount = spawncount*spawncount*M_PI;
for (j=0;j<spawncount;j++)
{
switch(rand()%3)
{
case 0:
nb = create_part(-3, x, y, PT_PHOT);
break;
case 1:
nb = create_part(-3, x, y, PT_NEUT);
break;
case 2:
nb = create_part(-3, x, y, PT_ELEC);
break;
}
if (nb!=-1) {
parts[nb].life = (rand()%300);
parts[nb].temp = MAX_TEMP/2;
angle = rand()*2.0f*M_PI/RAND_MAX;
v = (float)(rand())*5.0f/RAND_MAX;
parts[nb].vx = v*cosf(angle);
parts[nb].vy = v*sinf(angle);
}
else if (pfree==-1)
break;//if we've run out of particles, stop trying to create them - saves a lot of lag on "sing bomb" saves
}
kill_part(i);
return 1;
}
for (rx=-1; rx<2; rx++)
for (ry=-1; ry<2; ry++)
if (x+rx>=0 && y+ry>0 && x+rx<XRES && y+ry<YRES && (rx || ry))
{
r = pmap[y+ry][x+rx];
if (!r)
continue;
if ((r&0xFF)!=PT_DMND&&33>=rand()/(RAND_MAX/100)+1)
{
if ((r&0xFF)==PT_SING && parts[r>>8].life >10)
{
if (parts[i].life+parts[r>>8].life > 255)
continue;
parts[i].life += parts[r>>8].life;
}
else
{
if (parts[i].life+3 > 255)
{
if (parts[r>>8].type!=PT_SING && 1>rand()%100)
{
int np;
np = create_part(r>>8,x+rx,y+ry,PT_SING);
parts[np].life = rand()%50+60;
}
continue;
}
parts[i].life += 3;
parts[i].tmp++;
}
parts[i].temp = restrict_flt(parts[r>>8].temp+parts[i].temp, MIN_TEMP, MAX_TEMP);
kill_part(r>>8);
}
}
return 0;
}
|
