-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathitem.cpp
147 lines (122 loc) · 4.07 KB
/
item.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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
#include "item.h"
namespace planet{
Item vectorItems::getItemByIndex(const size_t index) const{
if(!(index < sizeVector))
exit(EXIT_FAILURE);
return Item((baseArr[index/4] >> (3 - index % 4) * 2) & 3);
}
vectorItems::~vectorItems(){
delete[] baseArr;
}
vectorItems::ItemRef::~ItemRef(){}
void vectorItems::Push(void) {
if (sizeBaseArr == 0) {
baseArr = new unsigned char[1];
baseArr[0] = 0;
++sizeBaseArr;
} else {
unsigned char* newArr = new unsigned char[sizeBaseArr * 2];
for (size_t i = 0; i < sizeBaseArr; ++i)
newArr[i] = baseArr[i];
for (size_t i = sizeBaseArr; i < sizeBaseArr * 2; ++i)
newArr[i] = 0;
sizeBaseArr *= 2;
delete[] baseArr;
baseArr = newArr;
}
}
void vectorItems::Pop(void) {
if (sizeBaseArr > 1) {
unsigned char* newArr = new unsigned char[--sizeBaseArr];
for (size_t i = 0; i < sizeBaseArr; ++i)
newArr[i] = baseArr[i];
delete[] baseArr;
baseArr = newArr;
} else {
delete[] baseArr;
--sizeBaseArr;
}
}
void vectorItems::changeItemByIndex(size_t index, Item elem){
if (!(index < sizeVector))
exit(EXIT_FAILURE);
baseArr[index / 4] -= ((baseArr[index / 4] >> (3 - index % 4) * 2) & 3) << ((3 - index % 4) * 2);
baseArr[index / 4] += elem << (3 - index % 4) * 2;
}
size_t vectorItems::capacity() const{
return sizeVector;
}
size_t vectorItems::cardinality() const{
return sizeBaseArr;
}
vectorItems::ItemRef::ItemRef(size_t index, vectorItems& obj){
itemIndex = index;
vectorItemsObj = &obj;
}
vectorItems::ItemRef& vectorItems::ItemRef::operator=(Item elem){
vectorItemsObj->changeItemByIndex(itemIndex, elem);
return *this;
}
vectorItems::ItemRef::operator Item(){
return vectorItemsObj->getItemByIndex(itemIndex);
}
vectorItems::ItemRef vectorItems::operator[](const size_t index){
while (index >= this->sizeVector)
this->push_back(Item::ROCK);
return ItemRef(index, *this);
}
void vectorItems::push_back(const Item elem){
++sizeVector;
if(sizeVector > sizeBaseArr * 4)
Push();
baseArr[(sizeVector - 1) / 4] += (unsigned char)elem << (3 - (sizeVector - 1) % 4) *2;
}
vectorItems::vectorItems(const vectorItems& other){
if(sizeVector > 0){
delete baseArr;
sizeVector = 0;
sizeBaseArr = 0;
}
if(other.capacity() > 0)
for(size_t i = 0; i < other.capacity(); ++i)
this -> push_back(other.getItemByIndex(i));
sizeVector = other.capacity();
sizeBaseArr = other.cardinality();
}
vectorItems& vectorItems::operator=(const vectorItems& other){
if(this == &other)
return *this;
if(sizeVector != 0){
sizeVector = 0;
sizeBaseArr = 0;
delete[] baseArr;
}
for(size_t i = 0; i < other.capacity(); ++i)
this -> push_back(other.getItemByIndex(i));
return *this;
}
void vectorItems::randItem(){
(*this)[rand() % length] = Item(rand() % 2);
}
void vectorItems::randEmpty(){
(*this)[rand() % length] = EMPTY;
}
void vectorItems::genItems(void){
size_t chances = length / 20;
for(chances; chances > 0; --chances)
(*this).randItem();
}
void vectorItems::genTerrain(void){
size_t chances = length / 1.5;
for(chances; chances > 0; --chances)
(*this).randEmpty();
}
vectorItems::vectorItems(size_t length) : length(length){
if(length > 0){
(*this)[length - 1]; // firstly: filling vector by rocks
srand(time(NULL));
genTerrain(); // then gen empty places
genItems(); // add bombs and apples
}
}
}