From 70be17107dc505e76e252aa9059a0ab653135a04 Mon Sep 17 00:00:00 2001
From: Tom Ryder <tom@sanctum.geek.nz>
Date: Tue, 10 Dec 2019 15:31:44 +1300
Subject: Switch to tabs

---
 btree-int.c | 110 +++++++++++++++++++++++++++---------------------------
 btree-str.c | 122 ++++++++++++++++++++++++++++++------------------------------
 2 files changed, 116 insertions(+), 116 deletions(-)

diff --git a/btree-int.c b/btree-int.c
index 7394b92..3622ffb 100644
--- a/btree-int.c
+++ b/btree-int.c
@@ -2,9 +2,9 @@
 #include <stdlib.h>
 
 struct node {
-    long v;
-    struct node *l;
-    struct node *r;
+	long v;
+	struct node *l;
+	struct node *r;
 };
 
 struct node *cn(long);
@@ -13,73 +13,73 @@ void pn(struct node *);
 void fn(struct node *);
 
 struct node *cn(long v) {
-    struct node *n;
+	struct node *n;
 
-    n = malloc(sizeof *n);
-    if (!n)
-        return NULL;
-    n->v = v;
-    n->l = n->r = NULL;
-    return n;
+	n = malloc(sizeof *n);
+	if (!n)
+		return NULL;
+	n->v = v;
+	n->l = n->r = NULL;
+	return n;
 }
 
 void an(struct node *r, struct node *n) {
-    if (!r || !n)
-        return;
-    if (n->v > r->v) {
-        if (r->r)
-            an(r->r, n);
-        else
-            r->r = n;
-    }
-    else {
-        if (r->l)
-            an(r->l, n);
-        else
-            r->l = n;
-    }
-    return;
+	if (!r || !n)
+		return;
+	if (n->v > r->v) {
+		if (r->r)
+			an(r->r, n);
+		else
+			r->r = n;
+	}
+	else {
+		if (r->l)
+			an(r->l, n);
+		else
+			r->l = n;
+	}
+	return;
 }
 
 void pn(struct node *n) {
-    if (!n)
-        return;
-    if (n->l)
-        pn(n->l);
-    fprintf(stdout, "%ld\n", n->v);
-    if (n->r)
-        pn(n->r);
-    return;
+	if (!n)
+		return;
+	if (n->l)
+		pn(n->l);
+	fprintf(stdout, "%ld\n", n->v);
+	if (n->r)
+		pn(n->r);
+	return;
 }
 
 void fn(struct node *n) {
-    if (!n)
-        return;
-    if (n->l)
-        fn(n->l);
-    if (n->r)
-        fn(n->r);
-    free(n);
-    return;
+	if (!n)
+		return;
+	if (n->l)
+		fn(n->l);
+	if (n->r)
+		fn(n->r);
+	free(n);
+	return;
 }
 
 int main(int argc, char **argv) {
-    struct node *r, *n;
+	struct node *r, *n;
 
-    r = NULL;
-    for (argv++; *argv; argv++) {
-        n = cn(atoi(*argv));
-        if (!n)
-            break;
-        if (r)
-            an(r, n);
-        else
-            r = n;
-    }
+	r = NULL;
+	for (argv++; *argv; argv++) {
+		n = cn(atoi(*argv));
+		if (!n)
+			break;
+		if (r)
+			an(r, n);
+		else
+			r = n;
+	}
 
-    pn(r);
+	pn(r);
 
-    fn(r);
+	fn(r);
 
-    exit(EXIT_SUCCESS);
+	exit(EXIT_SUCCESS);
 }
diff --git a/btree-str.c b/btree-str.c
index 8ba42a5..c3c0ad3 100644
--- a/btree-str.c
+++ b/btree-str.c
@@ -3,9 +3,9 @@
 #include <string.h>
 
 struct node {
-    char *v;
-    struct node *l;
-    struct node *r;
+	char *v;
+	struct node *l;
+	struct node *r;
 };
 
 struct node *cn(char *);
@@ -14,79 +14,79 @@ void pn(struct node *);
 void fn(struct node *);
 
 struct node *cn(char *s) {
-    struct node *n;
-    char *d;
+	struct node *n;
+	char *d;
 
-    n = malloc(sizeof *n);
-    if (!n)
-        return NULL;
-    d = malloc(strlen(s) + 1);
-    if (!d)
-        return NULL;
-    strcpy(d, s);
-    n->v = d;
-    n->l = n->r = NULL;
-    return n;
+	n = malloc(sizeof *n);
+	if (!n)
+		return NULL;
+	d = malloc(strlen(s) + 1);
+	if (!d)
+		return NULL;
+	strcpy(d, s);
+	n->v = d;
+	n->l = n->r = NULL;
+	return n;
 }
 
 void an(struct node *r, struct node *n) {
-    if (!r || !n)
-        return;
-    if (strcmp(n->v, r->v) > 0) {
-        if (r->r)
-            an(r->r, n);
-        else
-            r->r = n;
-    }
-    else {
-        if (r->l)
-            an(r->l, n);
-        else
-            r->l = n;
-    }
-    return;
+	if (!r || !n)
+		return;
+	if (strcmp(n->v, r->v) > 0) {
+		if (r->r)
+			an(r->r, n);
+		else
+			r->r = n;
+	}
+	else {
+		if (r->l)
+			an(r->l, n);
+		else
+			r->l = n;
+	}
+	return;
 }
 
 void pn(struct node *n) {
-    if (!n)
-        return;
-    if (n->l)
-        pn(n->l);
-    fprintf(stdout, "%s\n", n->v);
-    if (n->r)
-        pn(n->r);
-    return;
+	if (!n)
+		return;
+	if (n->l)
+		pn(n->l);
+	fprintf(stdout, "%s\n", n->v);
+	if (n->r)
+		pn(n->r);
+	return;
 }
 
 void fn(struct node *n) {
-    if (!n)
-        return;
-    if (n->l)
-        fn(n->l);
-    if (n->r)
-        fn(n->r);
-    free(n->v);
-    free(n);
-    return;
+	if (!n)
+		return;
+	if (n->l)
+		fn(n->l);
+	if (n->r)
+		fn(n->r);
+	free(n->v);
+	free(n);
+	return;
 }
 
 int main(int argc, char **argv) {
-    struct node *r, *n;
+	struct node *r, *n;
 
-    r = NULL;
-    for (argv++; *argv; argv++) {
-        n = cn(*argv);
-        if (!n)
-            break;
-        if (r)
-            an(r, n);
-        else
-            r = n;
-    }
+	r = NULL;
+	for (argv++; *argv; argv++) {
+		n = cn(*argv);
+		if (!n)
+			break;
+		if (r)
+			an(r, n);
+		else
+			r = n;
+	}
 
-    pn(r);
+	pn(r);
 
-    fn(r);
+	fn(r);
 
-    exit(EXIT_SUCCESS);
+	exit(EXIT_SUCCESS);
 }
-- 
cgit v1.2.3