some RailGraphUtil

Author: shibbo

include/Game/Map/RailGraphIter.hpp

@@ -8,6 +8,10 @@ class RailGraphIter {
 public:
     RailGraphIter(const RailGraph*);
 
+    RailGraphIter(const RailGraphIter& rIter) NO_INLINE {
+        *this = rIter;
+    }
+
     void moveNodeNext();
     void setNode(s32);
     void watchStartEdge();
@@ -28,4 +32,4 @@ class RailGraphIter {
     s32 mSelectedEdge;  // 0x8
     s32 mNextEdge;      // 0xC
     s32 _10;
-};
+};

include/Game/Util/RailGraphUtil.hpp

@@ -21,4 +21,6 @@ namespace MR {
     bool isWatchedPrevEdge(const RailGraphIter* pRailGraphIter);
     s32 getWatchEdgeArg7(const RailGraphIter* pRailGraphIter);
     void calcWatchEdgeDirection(const RailGraphIter* pRailGraphIter, TVec3f* pVec);
+
+    s32 getNearNodeIndex(const RailGraph*, const TVec3f&, f32, RailGraphNodeSelecter*);
 }  // namespace MR

src/Game/Util/RailGraphUtil.cpp

@@ -0,0 +1,71 @@
+#include "Game/Util/RailGraphUtil.hpp"
+#include "Game/Map/RailGraph.hpp"
+#include "Game/Util/MathUtil.hpp"
+
+namespace MR {
+    RailGraphIter* createRailGraphIter(const RailGraph* pGraph) {
+        return new RailGraphIter(pGraph->getIterator());
+    }
+
+    void moveNextNode(RailGraphIter* pIter) {
+        pIter->moveNodeNext();
+    }
+
+    void moveNodeNearPosition(RailGraphIter* pRailGraphIter, const TVec3f& rVec, f32 f, RailGraphNodeSelecter* pSelector) {
+        pRailGraphIter->setNode(getNearNodeIndex(pRailGraphIter->mGraph, rVec, f, pSelector));
+    }
+
+    void selectReverseEdge(RailGraphIter* pRailGraphIter) {
+        s32 next = pRailGraphIter->mSelectedEdge;
+        pRailGraphIter->moveNodeNext();
+        pRailGraphIter->selectEdge(next);
+    }
+
+    bool isSelectedEdge(const RailGraphIter* pRailGraphIter) {
+        return pRailGraphIter->isSelectedEdge();
+    }
+
+    bool isWatchedPrevEdge(const RailGraphIter* pRailGraphIter) {
+        return pRailGraphIter->isWatchedPrevEdge();
+    }
+
+    TVec3f* getCurrentNodePosition(const RailGraphIter* pGraph) {
+        return &pGraph->getCurrentNode()->_0;
+    }
+
+    TVec3f* getNextNodePosition(const RailGraphIter* pIter) {
+        return &pIter->getNextNode()->_0;
+    }
+
+    void calcWatchEdgeVector(const RailGraphIter* pIter, TVec3f* pEdge) {
+        pEdge->set< f32 >(pIter->getWatchNode()->_0 - pIter->getCurrentNode()->_0);
+    }
+
+    void calcWatchEdgeDirection(const RailGraphIter* pRailGraphIter, TVec3f* pVec) {
+        calcWatchEdgeVector(pRailGraphIter, pVec);
+        MR::normalize(pVec);
+    }
+
+    // MR::getNearNodeIndex
+
+    s32 getSelectEdgeArg0(const RailGraphIter* pIter) {
+        return pIter->getCurrentEdge()->mPointArg0;
+    }
+
+    s32 getSelectEdgeArg1(const RailGraphIter* pIter) {
+        return pIter->getCurrentEdge()->mPointArg1;
+    }
+
+    s32 getSelectEdgeArg2(const RailGraphIter* pIter) {
+        return pIter->getCurrentEdge()->mPointArg2;
+    }
+
+    s32 getSelectEdgeArg3(const RailGraphIter* pIter) {
+        return pIter->getCurrentEdge()->mPointArg3;
+    }
+
+    s32 getWatchEdgeArg7(const RailGraphIter* pIter) {
+        return pIter->getWatchEdge()->mPointArg7;
+    }
+
+};  // namespace MR