13 files changed, 0 insertions, 434 deletions
diff --git a/libraries/arduinoCurveFitting-master/.gitattributes b/libraries/arduinoCurveFitting-master/.gitattributes
deleted file mode 100644
index dfe0770..0000000
--- a/libraries/arduinoCurveFitting-master/.gitattributes
+++ /dev/null
@@ -1,2 +0,0 @@
-# Auto detect text files and perform LF normalization
-* text=auto
diff --git a/libraries/arduinoCurveFitting-master/LICENSE b/libraries/arduinoCurveFitting-master/LICENSE
deleted file mode 100644
index 646b41f..0000000
--- a/libraries/arduinoCurveFitting-master/LICENSE
+++ /dev/null
@@ -1,21 +0,0 @@
-MIT License
-
-Copyright (c) 2019 Andrey Fedorov
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
diff --git a/libraries/arduinoCurveFitting-master/README.md b/libraries/arduinoCurveFitting-master/README.md
deleted file mode 100644
index 59e2831..0000000
--- a/libraries/arduinoCurveFitting-master/README.md
+++ /dev/null
@@ -1,7 +0,0 @@
-# arduinoCurveFitting
-Fit polynomial curves to given points using least squares regression. The max order of polynomial fitting is 20, this should be more than enough to fit most practical problems. All values are kept as double for precision, this works well on a Teensy due to its floating point unit and large (64 bit) double precision. the numbers required increase exponentially as the number of points or order increases.
-
-This library solves the least squares problem using Cramer's rule and a small function to calculate the determinant of each matrix.
-
-More explained in this article
-https://medium.com/@rowaner111/fitting-curves-to-data-on-an-arduino-part-1-how-to-use-arduinocurvefitting-a3173c6dd4ef
diff --git a/libraries/arduinoCurveFitting-master/examples/fitCurve/fitCurve.ino b/libraries/arduinoCurveFitting-master/examples/fitCurve/fitCurve.ino
deleted file mode 100644
index cbc8966..0000000
--- a/libraries/arduinoCurveFitting-master/examples/fitCurve/fitCurve.ino
+++ /dev/null
@@ -1,37 +0,0 @@
-#include <curveFitting.h>
-
-void setup(){
-  Serial.begin(9600);
-  while(!Serial);
-  Serial.println("Starting");
-  
-  char buf[100];
-  int xpower = 3;
-  int order = 3;
-  snprintf(buf, 100, "Fitting curve of order %i to data of power %i...\n", order, xpower);
-  Serial.print(buf);
-  
-  double x[26];
-  double t[26];
-  for (int i = 0; i < sizeof(x)/sizeof(double); i++){
-    t[i] = i;
-    x[i] = pow(i, xpower);
-  }
-  
-  double coeffs[order+1];
-  int ret = fitCurve(order, sizeof(x)/sizeof(double), t, x, sizeof(coeffs)/sizeof(double), coeffs);
-  
-  if (ret == 0){ //Returned value is 0 if no error
-    uint8_t c = 'a';
-    Serial.println("Coefficients are");
-    for (int i = 0; i < sizeof(coeffs)/sizeof(double); i++){
-      snprintf(buf, 100, "%c=",c++);
-      Serial.print(buf);
-      Serial.print(coeffs[i]);
-      Serial.print('\t');
-    }
-  }
-}
-
-void loop(){
-}
diff --git a/libraries/arduinoCurveFitting-master/keywords.txt b/libraries/arduinoCurveFitting-master/keywords.txt
deleted file mode 100644
index e155106..0000000
--- a/libraries/arduinoCurveFitting-master/keywords.txt
+++ /dev/null
@@ -1 +0,0 @@
-fitCurve	KEYWORD2
diff --git a/libraries/arduinoCurveFitting-master/library.properties b/libraries/arduinoCurveFitting-master/library.properties
deleted file mode 100644
index 469dba8..0000000
--- a/libraries/arduinoCurveFitting-master/library.properties
+++ /dev/null
@@ -1,10 +0,0 @@
-name=CurveFitting
-version=1.0.6
-author=Rotario <rotarioner@gmail.com>
-maintainer=Rotario <rotarioner@gmail.com>
-sentence=Fits polynomial curves to given datapoints
-paragraph=Fit polynomial curves to given points using least squares regression. The max order of polynomial fitting is 20, this should be more than enough to fit most practical problems. All values are kept as double for precision, this works well on a Teensy due to its floating point unit and large (64 bit) double precision. the numbers required increase exponentially as the number of points or order increases.
-url=https://github.com/Rotario/arduinoCurveFitting
-includes=curveFitting.h
-category=Data Processing
-architectures=*
diff --git a/libraries/arduinoCurveFitting-master/src/curveFitting.cpp b/libraries/arduinoCurveFitting-master/src/curveFitting.cpp
deleted file mode 100644
index 7155675..0000000
--- a/libraries/arduinoCurveFitting-master/src/curveFitting.cpp
+++ /dev/null
@@ -1,195 +0,0 @@
-/*
-  curveFitting.h - Library for fitting curves to given
-  points using Least Squares method, with Cramer's rule
-  used to solve the linear equation. Max polynomial order 20.
-  Created by Rowan Easter-Robinson, August 23, 2018.
-  Released into the public domain.
-*/
-
-#include <Arduino.h>
-#include "curveFitting.h"
-
-void printMat(const char *s, ld*m, int n){
-  Serial.println(s);
-  char buf[40];
-  for (int i = 0; i < n; i++) {
-    for (int j = 0; j < n; j++) {
-      snprintf(buf, 40, "%30.4f\t", m[i*n+j]);
-      Serial.print(buf);
-    }
-    Serial.println();
-  }
-}
-
-void showmat(const char *s, ld **m, int n){
-  Serial.println(s);
-  char buf[40];
-  for (int i = 0; i < n; i++) {
-    for (int j = 0; j < n; j++){
-      snprintf(buf, 40, "%30.4f\t", m[i][j]);
-      Serial.print(buf);
-    }
-    Serial.println();
-  }
-}
-
-void cpyArray(ld *src, ld*dest, int n){
-  for (int i = 0; i < n*n; i++){
-    dest[i] = src[i];
-  }
-}
-
-void subCol(ld *mat, ld* sub, uint8_t coln, uint8_t n){
-  if (coln >= n) return;
-  for (int i = 0; i < n; i++){
-    mat[(i*n)+coln] = sub[i];
-  }
-}
-
-/*Determinant algorithm taken from https://codeforwin.org/2015/08/c-program-to-find-determinant-of-matrix.html */
-int trianglize(ld **m, int n)
-{
-  int sign = 1;
-  for (int i = 0; i < n; i++) {
-    int max = 0;
-    for (int row = i; row < n; row++)
-      if (fabs(m[row][i]) > fabs(m[max][i]))
-        max = row;
-    if (max) {
-      sign = -sign;
-      ld *tmp = m[i];
-      m[i] = m[max], m[max] = tmp;
-    }
-    if (!m[i][i]) return 0;
-    for (int row = i + 1; row < n; row++) {
-      ld r = m[row][i] / m[i][i];
-      if (!r) continue;
-      for (int col = i; col < n; col ++)
-        m[row][col] -= m[i][col] * r;
-    }
-  }
-  return sign;
-}
- 
-ld det(ld *in, int n, uint8_t prnt)
-{
-  ld *m[n];
-  m[0] = in;
- 
-  for (int i = 1; i < n; i++)
-    m[i] = m[i - 1] + n;
-  if(prnt) showmat("Matrix", m, n);
-  int sign = trianglize(m, n);
-  if (!sign)
-    return 0;
-  if(prnt) showmat("Upper triangle", m, n);
-  ld p = 1;
-  for (int i = 0; i < n; i++)
-    p *= m[i][i];
-  return p * sign;
-}
-/*End of Determinant algorithm*/
-
-//Raise x to power
-ld curveFitPower(ld base, int exponent){
-  if (exponent == 0){
-    return 1;
-  } else {
-    ld val = base;
-    for (int i = 1; i < exponent; i++){
-      val = val * base;
-    }
-    return val;
-  }
-}
-
-int fitCurve (int order, int nPoints, ld py[], int nCoeffs, ld *coeffs) {
-  uint8_t maxOrder = MAX_ORDER;
-  if (nCoeffs != order + 1) return ORDER_AND_NCOEFFS_DO_NOT_MATCH; 	// no of coefficients is one larger than the order of the equation
-  if (nCoeffs > maxOrder || nCoeffs < 2) return ORDER_INCORRECT; 		//matrix memory hard coded for max of 20 order, which is huge
-  if (nPoints < 1) return NPOINTS_INCORRECT; 							//Npoints needs to be positive and nonzero
-  int i, j;
-  ld T[MAX_ORDER] = {0}; //Values to generate RHS of linear equation
-  ld S[MAX_ORDER*2+1] = {0}; //Values for LHS and RHS of linear equation
-  ld denom; //denominator for Cramer's rule, determinant of LHS linear equation
-  ld x, y;
-  
-  ld px[nPoints]; //Generate X values, from 0 to n
-  for (i=0; i<nPoints; i++){
-	px[i] = i;
-  }
-  
-  for (i=0; i<nPoints; i++) {//Generate matrix elements
-    x = px[i];
-    y = py[i];
-    for (j = 0; j < (nCoeffs*2)-1; j++){
-      S[j] += curveFitPower(x, j); // x^j iterated , S10 S20 S30 etc, x^0, x^1...
-    }
-    for (j = 0; j < nCoeffs; j++){
-      T[j] += y * curveFitPower(x, j); //y * x^j iterated, S01 S11 S21 etc, x^0*y, x^1*y, x^2*y...
-    }
-  }
-
-  ld masterMat[nCoeffs*nCoeffs]; //Master matrix LHS of linear equation
-  for (i = 0; i < nCoeffs ;i++){//index by matrix row each time
-    for (j = 0; j < nCoeffs; j++){//index within each row
-      masterMat[i*nCoeffs+j] = S[i+j];
-    }
-  }
-  
-  ld mat[nCoeffs*nCoeffs]; //Temp matrix as det() method alters the matrix given
-  cpyArray(masterMat, mat, nCoeffs);
-  denom = det(mat, nCoeffs, CURVE_FIT_DEBUG);
-  cpyArray(masterMat, mat, nCoeffs);
-
-  //Generate cramers rule mats
-  for (i = 0; i < nCoeffs; i++){ //Temporary matrix to substitute RHS of linear equation as per Cramer's rule
-    subCol(mat, T, i, nCoeffs);
-    coeffs[nCoeffs-i-1] = det(mat, nCoeffs, CURVE_FIT_DEBUG)/denom; //Coefficients are det(M_i)/det(Master)
-    cpyArray(masterMat, mat, nCoeffs);
-  }
-  return 0;
-}
-
-int fitCurve (int order, int nPoints, ld px[], ld py[], int nCoeffs, ld *coeffs) {
-  uint8_t maxOrder = MAX_ORDER;
-  if (nCoeffs != order + 1) return ORDER_AND_NCOEFFS_DO_NOT_MATCH; 	//Number of coefficients is one larger than the order of the equation
-  if(nCoeffs > maxOrder || nCoeffs < 2) return ORDER_INCORRECT; 		//Matrix memory hard coded for max of 20 order, which is huge
-  if (nPoints < 1) return NPOINTS_INCORRECT; 							//Npoints needs to be positive and nonzero
-  int i, j;
-  ld T[MAX_ORDER] = {0}; //Values to generate RHS of linear equation
-  ld S[MAX_ORDER*2+1] = {0}; //Values for LHS and RHS of linear equation
-  ld denom; //denominator for Cramer's rule, determinant of LHS linear equation
-  ld x, y;
-  
-  for (i=0; i<nPoints; i++) {//Generate matrix elements
-    x = px[i];
-    y = py[i];
-    for (j = 0; j < (nCoeffs*2)-1; j++){
-      S[j] += curveFitPower(x, j); // x^j iterated , S10 S20 S30 etc, x^0, x^1...
-    }
-    for (j = 0; j < nCoeffs; j++){
-      T[j] += y * curveFitPower(x, j); //y * x^j iterated, S01 S11 S21 etc, x^0*y, x^1*y, x^2*y...
-    }
-  }
-
-  ld masterMat[nCoeffs*nCoeffs]; //Master matrix LHS of linear equation
-  for (i = 0; i < nCoeffs ;i++){//index by matrix row each time
-    for (j = 0; j < nCoeffs; j++){//index within each row
-      masterMat[i*nCoeffs+j] = S[i+j];
-    }
-  }
-  
-  ld mat[nCoeffs*nCoeffs]; //Temp matrix as det() method alters the matrix given
-  cpyArray(masterMat, mat, nCoeffs);
-  denom = det(mat, nCoeffs, CURVE_FIT_DEBUG);
-  cpyArray(masterMat, mat, nCoeffs);
-
-  //Generate cramers rule mats
-  for (i = 0; i < nCoeffs; i++){ //Temporary matrix to substitute RHS of linear equation as per Cramer's rule
-    subCol(mat, T, i, nCoeffs);
-    coeffs[nCoeffs-i-1] = det(mat, nCoeffs, CURVE_FIT_DEBUG)/denom; //Coefficients are det(M_i)/det(Master)
-    cpyArray(masterMat, mat, nCoeffs);
-  }
-  return 0;
-}
diff --git a/libraries/arduinoCurveFitting-master/src/curveFitting.h b/libraries/arduinoCurveFitting-master/src/curveFitting.h
deleted file mode 100644
index 7f718ba..0000000
--- a/libraries/arduinoCurveFitting-master/src/curveFitting.h
+++ /dev/null
@@ -1,42 +0,0 @@
-/*
-  curveFitting.h - Library for fitting curves to given
-  points using Least Squares method, with Cramer's rule
-  used to solve the linear equation. Max polynomial order 20.
-  Created by Rowan Easter-Robinson, August 23, 2018.
-  Released into the public domain.
-*/
-
-#ifndef curveFit_h
-#define curveFit_h
-
-#include <Arduino.h>
-#define MAX_ORDER 20
-
-typedef long double ld;
-
-#ifndef CURVE_FIT_DEBUG
-#define CURVE_FIT_DEBUG 0
-#endif
-
-/* Enum for error messages */
-enum curveFitERROR{
-	ORDER_AND_NCOEFFS_DO_NOT_MATCH = -1,
-	ORDER_INCORRECT = -2,
-	NPOINTS_INCORRECT = -3
-};
-
-/* Matrix Helper Functions */
-void printMat(const char *s, ld*m, int n);
-void showmat(const char *s, ld **m, int n);
-void cpyArray(ld *src, ld*dest, int n);
-void subCol(ld *mat, ld* sub, uint8_t coln, uint8_t n);
-ld curveFitPower(ld base, int exponent);
-
-/* Determinant matrix functions */
-int trianglize(ld **m, int n);
-ld det(ld *in, int n, uint8_t prnt);
-
-/* Curve fitting functions */
-int fitCurve (int order, int nPoints, ld py[], int nCoeffs, ld *coeffs);
-int fitCurve (int order, int nPoints, ld px[], ld py[], int nCoeffs, ld *coeffs);
-#endif
diff --git a/libraries/detectorBuilding/keywords.txt b/libraries/detectorBuilding/keywords.txt
deleted file mode 100644
index 894f3c0..0000000
--- a/libraries/detectorBuilding/keywords.txt
+++ /dev/null
@@ -1,10 +0,0 @@
-f2c	KEYWORD2
-c2f	KEYWORD2
-k2c	KEYWORD2
-c2k	KEYWORD2
-f2k	KEYWORD2
-k2f	KEYWORD2
-a2d	KEYWORD2
-d2a	KEYWORD2
-v2r	KEYWORD2
-sort	KEYWORD2
-\ No newline at end of file
diff --git a/libraries/detectorBuilding/library.properties b/libraries/detectorBuilding/library.properties
deleted file mode 100644
index 5b7c9af..0000000
--- a/libraries/detectorBuilding/library.properties
+++ /dev/null
@@ -1,10 +0,0 @@
-name=DetectorBuilding
-version=1.0
-author=unixkcd <unixkcd@gmail.com>
-maintainer=unixkcd <unixkcd@gmail.com>
-sentence=Detector building utility code
-paragraph=Some detector building utility code
-url=https://github.com/Ta180m/Detector-Building
-includes=detectorBuilding.h
-category=Data Processing
-architectures=*
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
diff --git a/libraries/detectorBuilding/src/detectorBuilding.h b/libraries/detectorBuilding/src/detectorBuilding.h
deleted file mode 100644
index cdb6890..0000000
--- a/libraries/detectorBuilding/src/detectorBuilding.h
+++ /dev/null
@@ -1,32 +0,0 @@
-/*
-  detectorBuilding.h - Library for Detector Building utility functions
-  Created by Anthony Wang, February 21, 2020.
-  Released into the public domain.
-*/
-
-#ifndef detectorBuilding_h
-#define detectorBuilding_h
-
-#include "Arduino.h"
-typedef long double ld;
-
-const int LED_R = 8, LED_G = 10, LED_B = 12, THERM = 0; // Device component pins
-const ld R_k = 10000, V_in = 5, analog_max = 1023; // Device constants
-
-ld f2c(ld f);
-ld c2f(ld c);
-ld k2c(ld k);
-ld c2k(ld c);
-ld f2k(ld f);
-ld k2f(ld k);
-
-ld a2d(int a);
-int d2a(ld d);
-
-ld v2r(ld V_out);
-
-void sort(ld a[], int n);
-
-//void calculate();
-
-#endif
-\ No newline at end of file
diff --git a/libraries/readme.txt b/libraries/readme.txt
deleted file mode 100644
index 96ce674..0000000
--- a/libraries/readme.txt
+++ /dev/null
@@ -1 +0,0 @@
-For information on installing libraries, see: http://www.arduino.cc/en/Guide/Libraries