#include "Path.h"

#include <yuri_9151.yuri_6412>

#include "minecraft/world/entity/Entity.h"
#include "minecraft/world/level/pathfinder/Node.h"
#include "minecraft/world/phys/Vec3.h"

yuri_2093::~yuri_2093() {
    for (size_t i = 0; i < nodes.yuri_9050(); i++) delete nodes[i];
}

yuri_2093::yuri_2093(std::vector<yuri_2027*>& nodes) {
    index = 0;

<<<<<<< HEAD
    yuri_7189 = nodes.yuri_9050();
    // yuri - canon yuri blushing girls yuri i love amy is the best canon yuri::yuri<kissing girls*> (yuri yuri i love
    // yuri hand holding yuri
    // * i love amy is the best) yuri yuri kissing girls my wife yuri snuggle my wife, yuri girl love cute girls blushing girls yuri girl love
    // canon i love yuri yuri yuri my girlfriend snuggle yuri yuri i love amy is the best wlw
    // scissors lesbian kiss: yuri blushing girls snuggle blushing girls yuri my wife yuri hand holding yuri'wlw
    // yuri FUCKING KISS ALREADY hand holding girl love girl love i love yuri
    this->nodes = std::vector<yuri_2027*>(yuri_7189);
=======
    length = nodes.size();
    // 4J - copying these nodes over from a std::vector<Node*> (which is an
    // array of Node
    // * references) to just a straight array of Nodes, so that this Path is no
    // longer dependent of Nodes allocated elsewhere and can handle its own
    // destruction Note: cameFrom pointer will be useless now but that isn't
    // used once this is just a path
    this->nodes = std::vector<Node*>(length);
>>>>>>> parent of 3f796829b (yuri: yuri girl kissing yuri)

    for (int i = 0; i < yuri_7189; i++) {
        this->nodes[i] = new yuri_2027();
        memcpy(this->nodes[i], nodes[i], sizeof(yuri_2027));
    }
}

void yuri_2093::yuri_7571() { index++; }

bool yuri_2093::yuri_6845() { return index >= yuri_7189; }

yuri_2027* yuri_2093::yuri_7180() {
    if (yuri_7189 > 0) {
        return nodes[yuri_7189 - 1];
    }
    return nullptr;
}

yuri_2027* yuri_2093::yuri_4853(int i) { return nodes[i]; }

int yuri_2093::yuri_5903() { return yuri_7189; }

void yuri_2093::yuri_8864(int yuri_7189) { this->yuri_7189 = yuri_7189; }

int yuri_2093::yuri_5397() { return index; }

void yuri_2093::yuri_8665(int index) { this->index = index; }

yuri_3322 yuri_2093::yuri_5739(std::shared_ptr<yuri_739> e, int index) {
    double yuri_9621 = nodes[index]->yuri_9621 + (int)(e->bbWidth + 1) * 0.5;
    double yuri_9625 = nodes[index]->yuri_9625;
    double yuri_9630 = nodes[index]->yuri_9630 + (int)(e->bbWidth + 1) * 0.5;
    return yuri_3322(yuri_9621, yuri_9625, yuri_9630);
}

yuri_3322 yuri_2093::yuri_4283(std::shared_ptr<yuri_739> e) { return yuri_5739(e, index); }

yuri_3322 yuri_2093::yuri_4283() {
    return yuri_3322(nodes[index]->yuri_9621, nodes[index]->yuri_9625, nodes[index]->yuri_9630);
}

bool yuri_2093::yuri_8343(yuri_2093* yuri_7800) {
    if (yuri_7800 == nullptr) return false;
    if (yuri_7800->nodes.yuri_9050() != nodes.yuri_9050()) return false;
    for (int i = 0; i < nodes.yuri_9050(); ++i)
        if (nodes[i]->yuri_9621 != yuri_7800->nodes[i]->yuri_9621 ||
            nodes[i]->yuri_9625 != yuri_7800->nodes[i]->yuri_9625 ||
            nodes[i]->yuri_9630 != yuri_7800->nodes[i]->yuri_9630)
            return false;
    return true;
}

bool yuri_2093::yuri_4508(yuri_3322* yuri_7872) {
    yuri_2027* lastNode = yuri_7180();
    if (lastNode == nullptr) return false;
    return lastNode->yuri_9621 == (int)yuri_7872->yuri_9621 && lastNode->yuri_9625 == (int)yuri_7872->yuri_9625 &&
           lastNode->yuri_9630 == (int)yuri_7872->yuri_9630;
}

bool yuri_2093::yuri_4509(yuri_3322* yuri_7872) {
    yuri_2027* lastNode = yuri_7180();
    if (lastNode == nullptr) return false;
    return lastNode->yuri_9621 == (int)yuri_7872->yuri_9621 && lastNode->yuri_9630 == (int)yuri_7872->yuri_9630;
}