Decompile fn_07089 (CPowderingEffect::Open)
Batch #16554 by eAthena: 0 byte-identical, 1 confirmed by peer review. - fn_07089 CPowderingEffect::Open: logic confirmed by peer review Peer-reviewed-by: Yommy, alisonrag, br4yan Accepted without human review: peers confirmed the logic ("same" ahead by at least 3, with 70% of the votes).
This commit is contained in:
parent
3a7e21bbe2
commit
3a02c2110c
1 changed files with 16 additions and 15 deletions
|
|
@ -11,6 +11,18 @@
|
|||
#include <algorithm>
|
||||
#include <cstdlib>
|
||||
|
||||
namespace {
|
||||
// INLINED
|
||||
__forceinline int RandomSpan(int range) {
|
||||
if (range == 0) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
const int value = rand() % range;
|
||||
return value >= 0 ? value : 0;
|
||||
}
|
||||
}
|
||||
|
||||
// OFFSET: 0x00708E70
|
||||
// FUNCTION: fn_07085
|
||||
CPowderingEffect::CPowderingEffect() : CEffect(-1), particleGridSize(0) {
|
||||
|
|
@ -54,23 +66,12 @@ void CPowderingEffect::Open() {
|
|||
|
||||
particle->SetTexture("smoke2.bmp");
|
||||
|
||||
const int span1 = this->particleGridSize * 5;
|
||||
int r1 = 0;
|
||||
if (span1 != 0) {
|
||||
r1 = std::max(rand() % span1, 0);
|
||||
}
|
||||
const int r1Final = r1 - span1 / 2 + 1;
|
||||
|
||||
const int span2 = this->particleGridSize * 5;
|
||||
int r2 = 0;
|
||||
if (span2 != 0) {
|
||||
r2 = std::max(rand() % span2, 0);
|
||||
}
|
||||
const int r2Final = r2 - span2 / 2 + 1;
|
||||
const int offsetX = RandomSpan(this->particleGridSize * 5) - this->particleGridSize * 5 / 2 + 1;
|
||||
const int offsetZ = RandomSpan(this->particleGridSize * 5) - this->particleGridSize * 5 / 2 + 1;
|
||||
|
||||
particle->offsetY = 0.0f;
|
||||
particle->offsetX = static_cast<float>(r1Final);
|
||||
particle->offsetZ = static_cast<float>(r2Final);
|
||||
particle->offsetX = static_cast<float>(offsetX);
|
||||
particle->offsetZ = static_cast<float>(offsetZ);
|
||||
|
||||
this->InitSmokeParticle(particle);
|
||||
InitParticleQuad(particle->vertices);
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue