Use std::array for indexing structure

[hubacji1/iamcar.git] / incl / nn.h

diff --git a/incl/nn.h b/incl/nn.h
index 0fc7e982b2f580fe6a0ee0b83c802cdc8fb011c3..4870667c884abeb7b65618ac678b74ff7d7116ce 100644 (file)
--- a/incl/nn.h
+++ b/incl/nn.h
@@ -18,6 +18,7 @@ along with I am car. If not, see <http://www.gnu.org/licenses/>.
 #ifndef NEARESTNEIGHBOUR_H
 #define NEARESTNEIGHBOUR_H
 
+#include <array>
 #include "aux.h"
 #include "rrtbase.h"
 #include "rrtnode.h"
@@ -45,7 +46,7 @@ RRTNode *nn3(
                 RRTNode *node,
                 float (*cost)(RRTNode *, RRTNode *));
 RRTNode *nn4(
-                std::vector<RRTNode *> (&nodes)[IYSIZE],
+                std::array<std::vector<RRTNode *>, IYSIZE> &nodes,
                 RRTNode *node,
                 float (*cost)(RRTNode *, RRTNode *));
 RRTNode *nn5(
@@ -53,5 +54,9 @@ RRTNode *nn5(
                 RRTNode *node,
                 float (*cost)(RRTNode *, RRTNode *),
                 char tree);
+RRTNode *nn6(
+                std::vector<RRTNode *> (&nodes)[IYSIZE],
+                RRTNode *node,
+                float (*cost)(RRTNode *, RRTNode *));
 
 #endif