Delete old stuff

1 files changed, 0 insertions, 66 deletions

diff --git a/libraries/detectorBuilding/src/detectorBuilding.cpp b/libraries/detectorBuilding/src/detectorBuilding.cpp
deleted file mode 100644
index 0c31c28..0000000
--- a/libraries/detectorBuilding/src/detectorBuilding.cpp
+++ /dev/null
@@ -1,66 +0,0 @@
-/*
-  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"
-
-// Temperature conversions
-ld f2c(ld f) { return (f - 32) * 5 / 9; } // Fahrenheit to Celsius
-ld c2f(ld c) { return c * 9 / 5 + 32; } // Celsius to Fahrenheit
-ld k2c(ld k) { return k - 273.15; } // Kelvin to Celsius
-ld c2k(ld c) { return c + 273.15; } // Celsius to Kelvin
-ld f2k(ld f) { return c2k(f2c(f)); } // Fahrenheit to Kelvin
-ld k2f(ld k) { return c2f(k2c(k)); } // Kelvin to Fahrenheit
-
-
-// Analog to digital conversion
-ld a2d(int a) { return V_in * a / analog_max; }
-int d2a(ld d) { return d * analog_max / V_in; }
-
-
-// Voltage to resistance conversion
-ld v2r(ld V_out) { return R_k * (V_in / V_out - 1); }
-
-
-// Utility functions
-// No C++ standard library :(
-void sort(ld 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]) {
-        ld 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);
-  ld 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