From 31f4244352b5e68eed770090419541d469f7f999 Mon Sep 17 00:00:00 2001
From: Jaron Kent-Dobias <jaron@kent-dobias.com>
Date: Fri, 6 Jul 2018 14:51:29 -0400
Subject: split up some files

---
 lib/orthogonal.c | 99 --------------------------------------------------------
 1 file changed, 99 deletions(-)
 delete mode 100644 lib/orthogonal.c

(limited to 'lib/orthogonal.c')

diff --git a/lib/orthogonal.c b/lib/orthogonal.c
deleted file mode 100644
index 87569ae..0000000
--- a/lib/orthogonal.c
+++ /dev/null
@@ -1,99 +0,0 @@
-
-#include "orthogonal.h"
-
-void vector_replace(q_t n, double *v1, const double *v2) {
-  // writes vector v2 of length n to memory located at v1
-  for (q_t i = 0; i < n; i++) {
-    v1[i] = v2[i];
-  }
-}
-
-void vector_add(q_t n, double *v1, const double *v2) {
-  // adds vector v2 of length n to vector v1
-  for (q_t i = 0; i < n; i++) {
-    v1[i] += v2[i];
-  }
-}
-
-void vector_subtract(q_t n, double *v1, const double *v2) {
-  // subtracts vector v2 of length n from vector v1
-  for (q_t i = 0; i < n; i++) {
-    v1[i] -= v2[i];
-  }
-}
-
-double *vector_rotate(q_t n, const double *rot, const double *vec) {
-  // multiplies n by n rotation matrix rot to vector vec
-  double *rot_vec = (double *)malloc(n * sizeof(double));
-
-  double prod = 0.0;
-  for (q_t i = 0; i < n; i++) {
-    prod += rot[i] * vec[i];
-  }
-
-  for (q_t i = 0; i < n; i++) {
-    rot_vec[i] = vec[i] - 2 * prod * rot[i];
-  }
-
-  return rot_vec;
-}
-
-double *vector_rotate_inverse(q_t n, const double *rot, const double *vec) {
-  double *rot_vec = (double *)calloc(n, sizeof(double));
-
-  for (q_t i = 0; i < n; i++) {
-    for (q_t j = 0; j < n; j++) {
-      rot_vec[i] += rot[n * j + i] * vec[j];
-    }
-  }
-
-  return rot_vec;
-}
-
-double vector_dot(q_t n, const double *v1, const double *v2) {
-  double dot = 0;
-
-  for (q_t i = 0; i < n; i++) {
-    dot += v1[i] * v2[i];
-  }
-
-  return dot;
-}
-
-double *orthogonal_rotate(q_t n, const double *r, const double *m) {
-  double *mul = (double *)calloc(n * n, sizeof(double));
-
-  for (q_t i = 0; i < n; i++) {
-    double akOki = 0;
-
-    for (q_t k = 0; k < n; k++) {
-      akOki += r[k] * m[n * k + i];
-    }
-
-    for (q_t j = 0; j < n; j++) {
-      mul[n * j + i] = m[n * j + i] - 2 * akOki * r[j];
-    }
-  }
-
-  return mul;
-}
-
-double *gen_rot(gsl_rng *r, q_t n) {
-  double *v = (double *)malloc(n * sizeof(double));
-
-  double v2 = 0;
-
-  for (q_t i = 0; i < n; i++) {
-    v[i] = gsl_ran_ugaussian(r);
-    v2 += v[i] * v[i];
-  }
-
-  double magv = sqrt(v2);
-
-  for (q_t i = 0; i < n; i++) {
-    v[i] /= magv;
-  }
-
-  return v;
-}
-
-- 
cgit v1.2.3-70-g09d2