planner_multi: substitute map to track request counts

Problem: when updating the Fluxion resource graph `request_multi`
`counts`' indices can be reordered. Reordering will cause inconsistent
lookups.

Update the `request_multi` `counts` to be map-based to handle reordering
of indices.

Author: milroy

resource/planner/c++/planner_multi.cpp

@@ -50,7 +50,7 @@ planner_multi::planner_multi (int64_t base_time, uint64_t duration,
            errno = ENOMEM;
            throw std::bad_alloc ();
         }
-        m_iter.counts.push_back (0);
+        m_iter.counts[type] = 0;
         m_types_totals_planners.push_back ({type, resource_totals[i], p});
     }
     m_span_counter = 0;
@@ -82,8 +82,8 @@ planner_multi::planner_multi (const planner_multi &o)
         m_types_totals_planners.push_back ({iter.resource_type,
                                             iter.resource_total, np});
     }
-    m_span_lookup = o.m_span_lookup;
     m_iter = o.m_iter;
+    m_span_lookup = o.m_span_lookup;
     m_span_lookup_iter = o.m_span_lookup_iter;
     m_span_counter = o.m_span_counter;
 }
@@ -119,8 +119,8 @@ planner_multi &planner_multi::operator= (const planner_multi &o)
         m_types_totals_planners.push_back ({iter.resource_type,
                                             iter.resource_total, np});
     }
-    m_span_lookup = o.m_span_lookup;
     m_iter = o.m_iter;
+    m_span_lookup = o.m_span_lookup;
     m_span_lookup_iter = o.m_span_lookup_iter;
     m_span_counter = o.m_span_counter;
 

resource/planner/c++/planner_multi.hpp

@@ -12,6 +12,7 @@
 #define PLANNER_MULTI_HPP
 
 #include "planner.hpp"
+#include <unordered_map>
 #include <boost/multi_index_container.hpp>
 #include <boost/multi_index/member.hpp>
 #include <boost/multi_index/random_access_index.hpp>
@@ -20,7 +21,7 @@
 struct request_multi {
     int64_t on_or_after = 0;
     uint64_t duration = 0;
-    std::vector<int64_t> counts;
+    std::unordered_map<std::string, int64_t> counts;
 };
 
 struct planner_multi_meta {

resource/planner/c/planner_multi_c_interface.cpp

@@ -32,7 +32,8 @@ static void fill_iter_request (planner_multi_t *ctx, struct request_multi *iter,
     iter->on_or_after = at;
     iter->duration = duration;
     for (i = 0; i < len; ++i)
-        iter->counts[i] = resources[i];
+        iter->counts[ctx->plan_multi->get_resource_type_at (i)] =
+                resources[i];
 }
 
 extern "C" planner_multi_t *planner_multi_new (
@@ -261,6 +262,7 @@ extern "C" int64_t planner_multi_avail_time_next (planner_multi_t *ctx)
     size_t i = 0;
     int unmet = 0;
     int64_t t = -1;
+    std::string type;
 
     if (!ctx) {
         errno = EINVAL;
@@ -272,9 +274,10 @@ extern "C" int64_t planner_multi_avail_time_next (planner_multi_t *ctx)
                         ctx->plan_multi->get_planner_at (static_cast<size_t> (0)))) == -1)
             break;
         for (i = 1; i < ctx->plan_multi->get_planners_size (); ++i) {
+            type = ctx->plan_multi->get_resource_type_at (i);
             if ((unmet = planner_avail_during (ctx->plan_multi->get_planner_at (i), t,
                                                ctx->plan_multi->get_iter ().duration,
-                                               ctx->plan_multi->get_iter ().counts[i])) == -1)
+                                               ctx->plan_multi->get_iter ().counts.at (type))) == -1)
                 break;
         }
     } while (unmet);