[12057] | 1 | /* |
---|
| 2 | * ORXONOX - the hottest 3D action shooter ever to exist |
---|
| 3 | * > www.orxonox.net < |
---|
| 4 | * |
---|
| 5 | * |
---|
| 6 | * License notice: |
---|
| 7 | * |
---|
| 8 | * This program is free software; you can redistribute it and/or |
---|
| 9 | * modify it under the terms of the GNU General Public License |
---|
| 10 | * as published by the Free Software Foundation; either version 2 |
---|
| 11 | * of the License, or (at your option) any later version. |
---|
| 12 | * |
---|
| 13 | * This program is distributed in the hope that it will be useful, |
---|
| 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
---|
| 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
---|
| 16 | * GNU General Public License for more details. |
---|
| 17 | * |
---|
| 18 | * You should have received a copy of the GNU General Public License |
---|
| 19 | * along with this program; if not, write to the Free Software |
---|
| 20 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. |
---|
| 21 | * |
---|
| 22 | * Author: |
---|
| 23 | * Manuel Meier |
---|
| 24 | * Co-authors: |
---|
| 25 | * Cyrill Burgener |
---|
| 26 | * |
---|
| 27 | */ |
---|
| 28 | |
---|
| 29 | /** |
---|
| 30 | @file OrxoKart.cc |
---|
| 31 | @brief Implementation of the OrxoKart class. Sets up the whole Minigame |
---|
| 32 | */ |
---|
| 33 | |
---|
| 34 | #include "OrxoKart.h" |
---|
[12108] | 35 | #include "OrxoKartFlag.h" |
---|
| 36 | #include "OrxoKartKart.h" |
---|
[12057] | 37 | #include "OrxoKartOrigin.h" |
---|
[12062] | 38 | #include "OrxoKartTile.h" |
---|
[12057] | 39 | #include "core/CoreIncludes.h" |
---|
| 40 | |
---|
| 41 | namespace orxonox |
---|
| 42 | { |
---|
| 43 | RegisterUnloadableClass(OrxoKart); |
---|
| 44 | |
---|
| 45 | OrxoKart::OrxoKart(Context* context) : Gametype(context) |
---|
| 46 | { |
---|
| 47 | RegisterObject(OrxoKart); |
---|
| 48 | |
---|
| 49 | this->origin_ = nullptr; |
---|
[12128] | 50 | this->raceFinished = false; |
---|
[12057] | 51 | this->firstTick_ = true; |
---|
[12144] | 52 | this->numberOfShrooms = 3; |
---|
[12156] | 53 | this->player = nullptr; |
---|
[12057] | 54 | |
---|
[12079] | 55 | this->setHUDTemplate("OrxoKartHUD"); |
---|
[12057] | 56 | } |
---|
| 57 | |
---|
| 58 | void OrxoKart::tick(float dt) |
---|
[12062] | 59 | { |
---|
[12057] | 60 | SUPER(OrxoKart, tick, dt); |
---|
| 61 | if(this->firstTick_ && this->origin_) |
---|
| 62 | { |
---|
| 63 | this->firstTick_ = false; |
---|
[12111] | 64 | this->wayPoints = std::vector<OrxoKartTile*>(3, nullptr); |
---|
[12057] | 65 | |
---|
[12116] | 66 | this->n = this->origin_->getNumCells(); |
---|
| 67 | this->s = this->origin_->getCellSize(); |
---|
| 68 | this->level = this->origin_->getLevel(); |
---|
[12108] | 69 | int map_1[] = {1,1,1,1,1,1,1,1,0,0,0 |
---|
| 70 | ,1,0,0,0,0,0,0,1,1,1,0 |
---|
| 71 | ,1,0,1,1,1,1,0,0,0,1,1 |
---|
| 72 | ,1,1,1,0,0,1,1,0,0,0,1 |
---|
| 73 | ,0,0,0,0,0,0,1,0,1,1,1 |
---|
| 74 | ,1,1,1,1,1,1,1,0,1,0,0 |
---|
| 75 | ,1,0,0,0,0,0,0,0,1,0,0 |
---|
| 76 | ,1,0,0,0,0,0,0,0,1,0,0 |
---|
| 77 | ,1,1,1,1,1,0,0,0,1,1,1 |
---|
| 78 | ,0,0,0,0,1,0,0,0,0,0,1 |
---|
| 79 | ,0,0,0,0,1,1,1,2,1,1,1}; |
---|
[12057] | 80 | |
---|
[12108] | 81 | int map_2[] = {1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0, |
---|
| 82 | 1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0, |
---|
| 83 | 1,0,1,1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0, |
---|
| 84 | 1,0,1,0,0,0,0,0,0,0,1,0,1,0,1,1,1,1,1,1,1,1,1,0,0, |
---|
| 85 | 1,0,1,0,1,1,1,1,1,0,1,0,1,0,1,0,0,0,0,0,0,0,1,0,0, |
---|
| 86 | 1,0,1,0,1,0,0,0,1,0,1,0,1,0,1,0,1,1,1,1,1,0,1,0,0, |
---|
| 87 | 1,0,1,0,1,1,1,0,1,0,1,0,1,0,1,0,1,0,0,0,1,0,1,0,0, |
---|
| 88 | 1,0,1,0,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,1,0,1,0,0, |
---|
| 89 | 1,0,1,1,1,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0,0,1,0,0, |
---|
| 90 | 1,0,0,0,0,0,0,0,1,0,1,0,1,0,1,0,1,0,1,1,1,1,1,0,0, |
---|
| 91 | 1,1,1,1,1,1,1,1,1,0,1,0,1,0,1,0,1,0,0,0,0,0,0,0,0, |
---|
| 92 | 0,0,0,0,0,0,0,0,0,0,1,0,1,0,1,0,1,1,1,1,1,1,1,1,1, |
---|
| 93 | 0,1,1,1,1,1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0,0,0,1, |
---|
| 94 | 0,1,0,0,0,0,0,0,0,0,0,0,1,0,1,1,1,1,0,0,0,0,0,0,1, |
---|
| 95 | 0,1,0,0,0,0,0,0,1,1,1,1,1,0,0,0,0,1,0,0,0,0,0,0,1, |
---|
| 96 | 0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,1,1,1,1,1, |
---|
| 97 | 0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0, |
---|
| 98 | 0,1,0,1,1,1,0,0,1,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0, |
---|
| 99 | 0,1,0,1,0,1,0,0,1,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0, |
---|
| 100 | 0,1,0,1,0,1,0,0,1,1,1,1,1,1,1,1,1,1,0,0,1,1,1,1,1, |
---|
| 101 | 0,1,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1, |
---|
| 102 | 0,1,0,1,0,1,0,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,1, |
---|
| 103 | 0,1,1,1,0,1,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1, |
---|
| 104 | 0,0,0,0,0,1,1,1,0,0,0,1,0,0,0,0,0,0,0,0,1,1,1,0,1, |
---|
| 105 | 0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,2,1,1,1,0,1,1,1}; |
---|
[12057] | 106 | |
---|
[12116] | 107 | int *levelcodeArray = level==1 ? map_1 : map_2; |
---|
[12111] | 108 | // int z = 0; |
---|
[12089] | 109 | //Generate floor according to levelcode |
---|
| 110 | for(int i=0; i<n; i++){ |
---|
| 111 | for(int j=0; j<n; j++){ |
---|
[12111] | 112 | if (int type = levelcodeArray[i*n + j]) { |
---|
| 113 | OrxoKartTile* tile = new OrxoKartTile(origin_->getContext()); |
---|
[12128] | 114 | tile->init((n-1-i)*s, j*s, s, 0, type); |
---|
[12111] | 115 | // tiles.push_back(tile); |
---|
| 116 | //++z; |
---|
[12116] | 117 | if (level == 1) { |
---|
| 118 | //map 1 |
---|
[12128] | 119 | if ( i == 9 && j == 4 ) |
---|
[12116] | 120 | wayPoints.at(0) = tile; |
---|
[12111] | 121 | |
---|
[12128] | 122 | if ( i == 0 && j == 1) |
---|
[12116] | 123 | wayPoints.at(1) = tile; |
---|
| 124 | if ( i == 10 && j == 7) |
---|
| 125 | wayPoints.at(2) = tile; |
---|
| 126 | } |
---|
| 127 | else if (level == 2) { |
---|
| 128 | //map 2 |
---|
[12128] | 129 | if ( i == 23 && j == 11 ) |
---|
[12116] | 130 | wayPoints.at(0) = tile; |
---|
| 131 | |
---|
[12128] | 132 | if ( i == 0 && j == 1) |
---|
[12116] | 133 | wayPoints.at(1) = tile; |
---|
| 134 | if ( i == 24 && j == 17) |
---|
| 135 | wayPoints.at(2) = tile; |
---|
| 136 | } |
---|
[12111] | 137 | } |
---|
[12057] | 138 | } |
---|
| 139 | } |
---|
[12108] | 140 | //bottom flag |
---|
[12062] | 141 | |
---|
[12111] | 142 | OrxoKartFlag* flag = new OrxoKartFlag(origin_->getContext()); |
---|
| 143 | flag->init(n, s); |
---|
| 144 | flag_ = flag; |
---|
[12057] | 145 | |
---|
[12192] | 146 | |
---|
[12108] | 147 | |
---|
[12111] | 148 | } //firsttick end |
---|
[12128] | 149 | |
---|
[12111] | 150 | if (wayPointCounter >= 3) |
---|
[12128] | 151 | raceFinished = true; |
---|
| 152 | |
---|
[12111] | 153 | else if (wayPointCounter < 3 && wayPointCounter >= 0 && wayPoints.at(wayPointCounter) != nullptr) { |
---|
| 154 | if (wayPoints.at(wayPointCounter)->getCollided()) { |
---|
| 155 | for (int i = 0; i < 3; ++i) { |
---|
| 156 | wayPoints.at(i)->setCollided(false); |
---|
| 157 | } |
---|
| 158 | ++wayPointCounter; |
---|
| 159 | } |
---|
| 160 | } |
---|
| 161 | else { |
---|
[12168] | 162 | //orxout() << " Should not happen, look in OrxoKart.cc"; |
---|
[12111] | 163 | } |
---|
[12108] | 164 | |
---|
[12111] | 165 | |
---|
| 166 | |
---|
[12168] | 167 | //orxout() << numberOfShrooms << endl; |
---|
[12111] | 168 | |
---|
| 169 | |
---|
[12156] | 170 | // Check if ship collided with the flag, flag is the bottom that is responsible for the game to detect the spaceship falling. |
---|
[12108] | 171 | if(flag_->getCollided()){ |
---|
[12168] | 172 | //orxout() << numberOfShrooms << endl; |
---|
[12155] | 173 | player = flag_->getObjectofCollision(); |
---|
[12116] | 174 | if (level == 1) |
---|
[12144] | 175 | player->setPosition(Vector3(s*0, 20, s*8.5)); |
---|
[12116] | 176 | if (level == 2) |
---|
[12144] | 177 | player->setPosition(Vector3(s*0, 20, s*18.5)); |
---|
[12108] | 178 | player->setOrientation(Quaternion(1, 0, 0, 0)); // 0, 0, 0 |
---|
| 179 | player->setVelocity(Vector3(0,0,0)); |
---|
| 180 | player->setAcceleration(Vector3(0,0,0)); |
---|
| 181 | flag_->setCollided(false); |
---|
[12111] | 182 | wayPointCounter = 0; |
---|
[12192] | 183 | |
---|
| 184 | |
---|
| 185 | |
---|
[12156] | 186 | } |
---|
[12108] | 187 | |
---|
[12062] | 188 | |
---|
[12057] | 189 | } |
---|
| 190 | } |
---|