forked from USU-Security/oip
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathparticlemanager.cpp
133 lines (119 loc) · 3.3 KB
/
particlemanager.cpp
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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
/*
Copyright 2008 Utah State University
This file is part of OIP.
OIP 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.
OIP 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 OIP. If not, see <http://www.gnu.org/licenses/>.
*/
#include "particlemanager.h"
#include "kdtree.h"
#include <iostream>
using std::cout;
#define MAXPARTICLES 1000
/*
* creates a packet starting at src, heading toward dst, with a specific size
*/
bool particlemanager::addpacket(unsigned int src, unsigned int dst, unsigned int color, unsigned int size)
{
if (particles.size() < MAXPARTICLES)
{
entity& e1 = entities[src];
entity& e2 = entities[dst];
if (e1.isvalid() && e2.isvalid())
{
e1.faderatedecrease();
particles.push_back(new particle(e1.getX(), e1.getY(), size/42000.0, color, dst));
}
}
return true;
}
particlemanager::~particlemanager()
{
vector<particle*>::iterator i;
for (i = particles.begin(); i != particles.end(); i++)
delete *i;
}
void particlemanager::process(double dt)
{
vector<particle*>::iterator i;
//kreate a kd tree with all the particles in it
//*
//kdtree pfind(particles);
for (i = particles.begin(); i != particles.end(); i++)
{
entity& e1 = entities[(*i)->dst];
if (e1.isvalid())
{
//check if it is at its destination
//since its text, they will be wider than they are tall
if ((e1.getX() - (*i)->getX())*(e1.getX() - (*i)->getX())/(e1.getW()/e1.getH()/2) +
(e1.getY() - (*i)->getY())*(e1.getY() - (*i)->getY()) < .0005)
(*i)->erase();
vector<particle*> pnear;
//pfind.collect(.2, (*i)->getX(), (*i)->getY(), pnear);
(*i)->move(e1.getX(), e1.getY(), pnear, dt);
//make a small attractive force for the destination toward the packet
e1.move(((*i)->getX()-e1.getX())*.01,((*i)->getY()-e1.getY())*.01,.9, dt);
}
else
e1.erase();
}
// */
entities.process(dt);
}
void particlemanager::draw(SDL_Surface* s)
{
xscale = s->w;
yscale = s->h;
vector<particle*>::iterator i = particles.begin();
//draw them, and delete them if they are marked for deletion
while (i != particles.end())
{
(*i)->draw(s);
if ((*i)->deleteme())
{
particle* d = *i;
*i = particles.back();
particles.pop_back();
delete d;
}
else
i++;
}
entities.draw(s);
}
//search for the entity they clicked on
void particlemanager::mousedown(int x, int y)
{
mouseisdown = entities.find(x, y);
if (mouseisdown)
{
mx = (int)(mouseisdown->getX() * xscale - x);
my = (int)(mouseisdown->getY() * yscale - y);
oldmoving = mouseisdown->moving;
mouseisdown->moving = false;
mouseisdown->fadeval = 1;
}
}
//move the given entity if we need to.
void particlemanager::mousemove(int x, int y)
{
if (mouseisdown)
mouseisdown->jump((x + mx)/xscale, (y+ my)/yscale);
}
//don't move the stuff anymore
void particlemanager::mouseup()
{
if (mouseisdown)
{
mouseisdown->moving = oldmoving;
mouseisdown = NULL;
}
}