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
|
#include "list.hpp"
List::List(Window m)
{
main = m;
int i;
SDL_Rect Rect = {0,0,CREATURE_SIZE_START,CREATURE_SIZE_START};
for(i=0;i<CREATURES;i++){
Creature X(main,Rect);
C.push_back(X);
}
Rect = {0,0,RESOURCE_SIZE_START,RESOURCE_SIZE_START};
for(i=0;i<RESOURCES;i++){
Resource Y(main,Rect);
R.push_back(Y);
}
}
void List::Remove()
{
for(list<Creature>::iterator it = C.begin(); it!=C.end(); it++)
if(it->getHealth()<=0){
SDL_Rect Rect = it->getRect();
Resource r = Resource(main,Rect);
R.push_back(r);
C.erase(it--);
}
for(list<Resource>::iterator it = R.begin(); it!=R.end(); it++)
if(it->getAmount()<=0)
R.erase(it--);
}
void List::Behavior()
{
for(list<Creature>::iterator it = C.begin(); it!=C.end(); it++){
list<Entity*> N = getNear(*it);
it->giveN(N);
it->Behavior();
if(it->getPregnancyReady()){
SDL_Rect Rect = it->getRect();
Rect.h = Rect.w = CREATURE_SIZE_START;
Creature X(main,Rect);
C.push_back(X);
it->hadPregnancy();
}
}
for(list<Resource>::iterator it = R.begin(); it!=R.end(); it++)
it->grow();
}
void List::Place()
{
SDL_Rect Rect = {0,0,RESOURCE_SIZE_START,RESOURCE_SIZE_START};
while(R.size() < MINIMUM_RESOURCES){
Resource Y(main,Rect);
R.push_back(Y);
}
for(list<Creature>::iterator it = C.begin(); it!=C.end(); it++)
it->Place();
for(list<Resource>::iterator it = R.begin(); it!=R.end(); it++)
it->Place();
}
list<Entity*> List::getNear(Creature nC)
{
list<Entity*> N;
for(list <Resource>::iterator it = R.begin(); it!=R.end(); it++)
if( nC.getBestSense() > Distance(nC.getRect(),it->getRect()) )
N.push_back(&(*it));
for(list <Creature>::iterator it = C.begin(); it!=C.end(); it++)
if( &nC == &(*it))
continue;
else if( nC.getBestSense() > Distance(nC.getRect(),it->getRect()) )
N.push_back(&(*it));
return N;
}
|