core: drop using deques in favor of vectors

No point in most of these.

src/helpers/BezierCurve.cpp

@@ -9,18 +9,18 @@ void CBezierCurve::setup(std::vector<Vector2D>* pVec) {
     const auto BEGIN = std::chrono::high_resolution_clock::now();
 
     // Avoid reallocations by reserving enough memory upfront
-    m_dPoints.resize(pVec->size() + 2);
-    m_dPoints[0] = Vector2D(0, 0); // Start point
+    m_vPoints.resize(pVec->size() + 2);
+    m_vPoints[0] = Vector2D(0, 0); // Start point
     size_t index = 1;              // Start after the first element
     for (const auto& vec : *pVec) {
-        if (index < m_dPoints.size() - 1) { // Bounds check to ensure safety
-            m_dPoints[index] = vec;
+        if (index < m_vPoints.size() - 1) { // Bounds check to ensure safety
+            m_vPoints[index] = vec;
             ++index;
         }
     }
-    m_dPoints.back() = Vector2D(1, 1); // End point
+    m_vPoints.back() = Vector2D(1, 1); // End point
 
-    RASSERT(m_dPoints.size() == 4, "CBezierCurve only supports cubic beziers! (points num: {})", m_dPoints.size());
+    RASSERT(m_vPoints.size() == 4, "CBezierCurve only supports cubic beziers! (points num: {})", m_vPoints.size());
 
     // bake BAKEDPOINTS points for faster lookups
     // T -> X ( / BAKEDPOINTS )
@@ -47,14 +47,14 @@ float CBezierCurve::getXForT(float const& t) {
     float t2 = t * t;
     float t3 = t2 * t;
 
-    return 3 * t * (1 - t) * (1 - t) * m_dPoints[1].x + 3 * t2 * (1 - t) * m_dPoints[2].x + t3 * m_dPoints[3].x;
+    return 3 * t * (1 - t) * (1 - t) * m_vPoints[1].x + 3 * t2 * (1 - t) * m_vPoints[2].x + t3 * m_vPoints[3].x;
 }
 
 float CBezierCurve::getYForT(float const& t) {
     float t2 = t * t;
     float t3 = t2 * t;
 
-    return 3 * t * (1 - t) * (1 - t) * m_dPoints[1].y + 3 * t2 * (1 - t) * m_dPoints[2].y + t3 * m_dPoints[3].y;
+    return 3 * t * (1 - t) * (1 - t) * m_vPoints[1].y + 3 * t2 * (1 - t) * m_vPoints[2].y + t3 * m_vPoints[3].y;
 }
 
 // Todo: this probably can be done better and faster

src/helpers/BezierCurve.hpp

@@ -1,6 +1,6 @@
 #pragma once
 
-#include <deque>
+#include <vector>
 #include <array>
 #include <vector>
 #include "math/Math.hpp"
@@ -22,7 +22,7 @@ class CBezierCurve {
 
   private:
     // this INCLUDES the 0,0 and 1,1 points.
-    std::vector<Vector2D>             m_dPoints;
+    std::vector<Vector2D>             m_vPoints;
 
     std::array<Vector2D, BAKEDPOINTS> m_aPointsBaked;
 };

src/helpers/Monitor.cpp

@@ -314,7 +314,7 @@ void CMonitor::onDisconnect(bool destroy) {
         g_pCompositor->warpCursorTo(BACKUPMON->vecPosition + BACKUPMON->vecTransformedSize / 2.F, true);
 
         // move workspaces
-        std::deque<PHLWORKSPACE> wspToMove;
+        std::vector<PHLWORKSPACE> wspToMove;
         for (auto const& w : g_pCompositor->m_vWorkspaces) {
             if (w->m_pMonitor == self || !w->m_pMonitor)
                 wspToMove.push_back(w);
@@ -541,7 +541,7 @@ void CMonitor::setMirror(const std::string& mirrorOf) {
         }
 
         // move all the WS
-        std::deque<PHLWORKSPACE> wspToMove;
+        std::vector<PHLWORKSPACE> wspToMove;
         for (auto const& w : g_pCompositor->m_vWorkspaces) {
             if (w->m_pMonitor == self || !w->m_pMonitor)
                 wspToMove.push_back(w);

src/helpers/Monitor.hpp

@@ -1,7 +1,7 @@
 #pragma once
 
 #include "../defines.hpp"
-#include <deque>
+#include <vector>
 #include "WLClasses.hpp"
 #include <vector>
 #include <array>