src/list.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

#include "list.hpp"

List::List()
{
        int i;
        DNA d;
        Rectangle tmp;
        for(i=0;i<CREATURES;i++){
                Creature X(tmp,d);
                creatures.push_back(X);
        }

        for(i=0;i<RESOURCES;i++){
                Resource Y(tmp);
                resources.push_back(Y);
        }

        Rectangle R1    = Rectangle(0,0,60,60);
        tree            = Quadtree(0, R1);
}

void List::Remove()
{
        for(std::list<Creature>::iterator it = creatures.begin(); it!= creatures.end(); it++)    
                if(it->getHealth()<=0){
                        Resource Y(it->getRectangle());
                        resources.push_back(Y);
                        creatures.erase(it--);
                }

        for(std::list<Resource>::iterator it = resources.begin(); it!= resources.end(); it++)
                if(it->getAmount()<=0)
                        resources.erase(it--);
}

void List::Behavior()
{
        for(std::list<Creature>::iterator it = creatures.begin(); it!= creatures.end(); it++){
                std::vector<Entity*> N = getNear(*it); 
                it->giveNearMe(N); 
                it->Behavior();

                if(it->getPregnancyReady()){
                        DNA d           = it->getChildsDNA();
                        Rectangle tmp   = it->getRectangle();
                        Creature X(tmp,d);
                        creatures.push_back(X);
                        it->hadPregnancy();
                }
        }

        for(std::list<Resource>::iterator it = resources.begin(); it!= resources.end(); it++)
                it->grow(); 
}

void List::Place()
{ 
        tree.clear();

        Rectangle tmp;
        while(resources.size() < MINIMUM_RESOURCES){
                Resource Y(tmp);
                resources.push_back(Y);
        }

        for(std::list<Creature>::iterator it = creatures.begin(); it!= creatures.end(); it++){
                it->Place();
                tree.insert(&(*it));;
        }

        for(std::list<Resource>::iterator it = resources.begin(); it!=resources.end(); it++){
                it->Place();
                tree.insert(&(*it));;
        }
}

std::vector<Entity*> List::getNear(Creature nC)
{
        std::vector<Entity*> N;
        N = tree.retrieve(N, nC.getGFXD()); 

        return N;
}

std::vector<GraphicsData> List::drawQuadTree(){
        return tree.Draw();
}