From 5d3642b8ef920316693031d2ea34b9def0b1abc5 Mon Sep 17 00:00:00 2001
From: Nicholas Noll <nbnoll@eml.cc>
Date: Thu, 22 Apr 2021 08:55:35 -0700
Subject: chore: rm unfinished projects

---
 sys/libbio/align.c | 24 ++++++++++++------------
 1 file changed, 12 insertions(+), 12 deletions(-)

(limited to 'sys/libbio/align.c')

diff --git a/sys/libbio/align.c b/sys/libbio/align.c
index 0f00fce..20a57df 100644
--- a/sys/libbio/align.c
+++ b/sys/libbio/align.c
@@ -4,13 +4,13 @@
 #include <libbio.h>
 
 // -----------------------------------------------------------------------
-// Temporary globals
+// globals
 
 uint64 aln·shft = (2ULL * (aln·K - 1ULL));
 uint64 aln·mask = (1ULL << (2*aln·K)) - 1ULL;
 
 // -----------------------------------------------------------------------
-// Static data
+// static data
 
 static uint64 nuctab[256] = {
 	4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
@@ -32,7 +32,7 @@ static uint64 nuctab[256] = {
 };
 
 // -----------------------------------------------------------------------
-// Hash functions
+// hash functions
 
 enum
 {
@@ -69,7 +69,7 @@ murmurhash(uint64 x, uint64 mask)
 }
 
 // -----------------------------------------------------------------------
-// Locality sensitive hashing (with spatial extent)
+// locality sensitive hashing (with spatial extent)
 
 static
 void
@@ -102,20 +102,20 @@ aln·sketch(byte *seq, int len, uint64 *vals[aln·N], int *locs[aln·N])
     int    tmpi[2];
     uint64 tmpu[2];
 
-    for (n = 0; n < aln·N; n++) {
-        for (l = 0; l < len; l++) {
+    for(n = 0; n < aln·N; n++) {
+        for(l = 0; l < len; l++) {
             vals[n][l] = UINT64_MAX;
         }
     }
 
     kmer = UINT64_MAX;
-    for (l = 0; *seq != '\0'; seq++, l++) {
+    for(l = 0; *seq != '\0'; seq++, l++) {
         kmer = ((kmer << 2) | nuctab[*seq]) & aln·mask;
 
         h[0] = minihash(kmer, aln·mask);
         h[1] = murmurhash(kmer, aln·mask);
 
-        for (n = 0; n < aln·N; n++) {
+        for(n = 0; n < aln·N; n++) {
             val = vals[n];
             loc = locs[n];
 
@@ -126,14 +126,14 @@ aln·sketch(byte *seq, int len, uint64 *vals[aln·N], int *locs[aln·N])
 
             tmpu[1] = h[2];
             tmpi[1] = l;
-            for (i -= 1; i >= 0; i--) {
+            for(i -= 1; i >= 0; i--) {
                 tmpu[0] = tmpu[1], tmpu[1] = val[i], val[i] = tmpu[0];
                 tmpi[0] = tmpi[1], tmpi[1] = loc[i], loc[i] = tmpi[0];
             }
         }
     }
 
-    for (n = 0; n < aln·N; n++) {
+    for(n = 0; n < aln·N; n++) {
         sortpos(len, vals[n], locs[n]);
     }
     
@@ -146,7 +146,7 @@ lessarrs(int len, uint64 a[], uint64 b[])
 {
     int l;
 
-    for (l = 0; l < len; l++) {
+    for(l = 0; l < len; l++) {
         if (a[l] < b[l]) return 1;
         if (a[l] > b[l]) return 0;
     }
@@ -161,7 +161,7 @@ swaparrs(int len, uint64 a[], uint64 b[])
     int l;
     uint64 tmp;
 
-    for (l = 0; l < len; l++) {
+    for(l = 0; l < len; l++) {
         tmp = a[l], a[l] = b[l], b[l] = tmp;
     }
 }
-- 
cgit v1.2.1