1 files changed, 61 insertions, 0 deletions
diff --git a/libraries/detectorBuilding/detectorBuilding.cpp b/libraries/detectorBuilding/detectorBuilding.cpp
new file mode 100644
index 0000000..8c38009
--- /dev/null
+++ b/libraries/detectorBuilding/detectorBuilding.cpp
@@ -0,0 +1,61 @@
+/*
+  detectorBuilding.cpp - Library for Detector Building utility functions
+  Created by Anthony Wang, February 21, 2020.
+  Released into the public domain.
+*/
+
+#include "Arduino.h"
+#include "detectorBuilding.h"
+
+const int LED_R = 4, LED_G = 3, LED_B = 2, THERM = 0; // Device component pins
+const double R_k = 10000, V_in = 5, analog_max = 1023; // Device constants
+
+// Temperature conversions
+inline double f2c(double f) { return (f - 32) * 5 / 9; } // Fahrenheit to Celsius
+inline double c2f(double c) { return c * 9 / 5 + 32; } // Celsius to Fahrenheit
+inline double k2c(double k) { return k - 273.15; } // Kelvin to Celsius
+inline double c2k(double c) { return c + 273.15; } // Celsius to Kelvin
+inline double f2k(double f) { return c2k(f2c(f)); } // Fahrenheit to Kelvin
+inline double k2f(double k) { return c2f(k2c(k)); } // Kelvin to Fahrenheit
+
+// Analog to digital conversion
+inline double a2d(int a) { return V_in * a / analog_max; }
+inline int d2a(double d) { return d * analog_max / V_in; }
+
+// Utility functions
+// No C++ standard library :(
+void sort(double a[], int n) {
+  // Bubble sort
+  // Slow but n < 30 so OK
+  // Too lazy to implement a fast sort
+  for (int i = 0; i < n; i++) {
+    for (int j = 0; j < n - 1; j++) {
+      if (a[j] > a[j + 1]) {
+        double tmp = a[j];
+        a[j] = a[j + 1];
+        a[j + 1] = tmp;
+      }
+    }
+  }
+}
+
+// Calculations: Steinhart-hart stuff
+// Probably unused but can include anyways
+void calculate() {
+  sort(V, n);
+  sort(T, n);
+  double R[n], L[n], Y[n], G[n];
+  for (int i = 0; i < n; i++) R[i] = R_k * (V_in / V[i] - 1);
+  for (int i = 0; i < n; i++) L[i] = log(R[i]);
+  for (int i = 0; i < n; i++) Y[i] = 1 / c2k(T[i]);
+  for (int i = 0; i < n; i += 3) {
+    G[i + 1] = (Y[i + 1] - Y[i]) / (L[i + 1] - L[i]);
+    G[i + 2] = (Y[i + 2] - Y[i]) / (L[i + 2] - L[i]);
+  }
+  for (int i = 0; i < n; i += 3) { // Don't ask how this works
+    C[i / 3] = (G[i + 2] - G[i + 1]) / (L[i + 2] - L[i + 1]) / (L[i] + L[i + 1] + L[i + 2]);
+    B[i / 3] = G[i + 1] - C[i / 3] * (L[i] * L[i] + L[i] * L[i + 1] + L[i + 1] * L[i + 1]);
+    A[i / 3] = Y[i] - L[i] * (B[i / 3] + L[i] * L[i] * C[i / 3]);
+  }
+  for (int i = 0; i < n; i += 3) V_mid[i / 3] = (i ? (V[i - 1] + V[i]) / 2 : V[i]);
+}
+\ No newline at end of file