use homemade queue to avoid problems with stdlib

Author: ianfixes

cpp/arduino/AvrMath.h

@@ -11,4 +11,18 @@
 #define radians(deg) ((deg)*DEG_TO_RAD)
 #define degrees(rad) ((rad)*RAD_TO_DEG)
 
+#ifdef abs
+#undef abs
+#endif
+#define abs(x) ((x)>0?(x):-(x))
+
+#ifdef max
+#undef max
+#endif
+#define max(a,b) ((a)>(b)?(a):(b))
+
+#ifdef min
+#undef min
+#endif
+#define min(a,b) ((a)<(b)?(a):(b))
 

cpp/arduino/Forced.h

@@ -3,8 +3,7 @@
 #include <avr/io.h>
 #include "WString.h"
 
-#include <queue>
-#include "Forced.h"
+#include "queue.h"
 
 // random
 void randomSeed(unsigned long seed);
@@ -22,12 +21,12 @@ unsigned long micros();
 template <typename T>
 class PinHistory {
 private:
-  std::queue<T> qIn;
-  std::queue<T> qOut;
+  queue<T> qIn;
+  queue<T> qOut;
 
   unsigned long mLastRead = 0;
 
-  void clear(std::queue<T>* q) {
+  void clear(queue<T>* q) {
     while (!q->empty()) q->pop();
   }
 
@@ -53,9 +52,9 @@ class PinHistory {
   }
 
   // this sets the value of the pin authoritatively
-  // so if there was a queue dump it.
+  // so if there was a queue, dump it.
   // the actual "set" operation doesn't happen until the next read
-  T &operator=(T const i) {
+  const T &operator=(const T& i) {
     qOut.push(i);
     return qOut.back();
   }
@@ -96,7 +95,7 @@ class PinHistory {
   // copy elements to an array, up to a given length
   // return the number of elements moved
   int toArray(T* arr, unsigned int length) {
-    std::queue<T> q2(qOut);
+    queue<T> q2(qOut);
 
     int ret = 0;
     for (int i = 0; i < length && q2.size(); ++i) {
@@ -110,7 +109,7 @@ class PinHistory {
   // see if the array matches the elements in the queue
   bool hasElements(T* arr, unsigned int length) {
     int i;
-    std::queue<T> q2(qOut);
+    queue<T> q2(qOut);
     for (i = 0; i < length && q2.size(); ++i) {
       if (q2.front() != arr[i]) return false;
       q2.pop();
@@ -123,7 +122,7 @@ class PinHistory {
   String toAscii(unsigned int offset, bool bigEndian) {
     String ret = "";
 
-    std::queue<T> q2(qOut);
+    queue<T> q2(qOut);
 
     while (offset) {
       q2.pop();

cpp/arduino/Godmode.h

@@ -0,0 +1,73 @@
+#pragma once
+
+template <typename T>
+class queue {
+  private:
+    struct Node {
+      T data;
+      Node* next;
+    };
+
+    Node* mFront;
+    Node* mBack;
+    unsigned long mSize;
+    T mNil;
+
+    void init() {
+      mFront = mBack = NULL;
+      mSize = 0;
+    }
+
+  public:
+    queue() { init(); }
+
+    queue(const queue<T>& q) {
+      init();
+      for (Node* n = q.mFront; n; n = n->next) push(n->data);
+    }
+
+    inline unsigned long size() const { return mSize; }
+
+    inline bool empty() const { return 0 == mSize; }
+
+    const T& front() const { return empty() ? mNil : mFront->data; }
+
+    const T& back() const { return empty() ? mNil : mBack->data; }
+
+    bool push(const T& v)
+    {
+      Node *n = new Node;
+      if (n == NULL) return false;
+
+      n->data = v;
+      n->next = NULL;
+
+      if (mFront == NULL)
+      {
+        mFront = mBack = n;
+      } else {
+        mBack->next = n;
+        mBack = n;
+      }
+
+      ++mSize;
+      return true;
+    }
+
+    void pop() {
+      if (empty()) return;
+      if (mFront == mBack) {
+        mFront = mBack = NULL;
+      } else {
+        Node* n = mFront;
+        mFront = mFront->next;
+        delete n;
+      }
+
+      --mSize;
+    }
+
+    void clear() { while (!empty()) pop(); }
+
+    ~queue() { clear(); }
+};