1 files changed, 22 insertions, 23 deletions

diff --git a/choices.c b/choices.c
index 2a27d10..455aacc 100644
--- a/choices.c
+++ b/choices.c
@@ -10,18 +10,18 @@ static int cmpchoice(const void *_idx1, const void *_idx2) {
 	const struct scored_result *a = _idx1;
 	const struct scored_result *b = _idx2;
 
-	if(a->score == b->score)
+	if (a->score == b->score)
 		return 0;
-	else if(a->score < b->score)
+	else if (a->score < b->score)
 		return 1;
 	else
 		return -1;
 }
 
-static void choices_resize(choices_t *c, int new_capacity){
+static void choices_resize(choices_t *c, int new_capacity) {
 	c->strings = realloc(c->strings, new_capacity * sizeof(const char *));
 
-	if(!c->strings){
+	if (!c->strings) {
 		fprintf(stderr, "Error: Can't allocate memory\n");
 		abort();
 	}
@@ -29,13 +29,13 @@ static void choices_resize(choices_t *c, int new_capacity){
 	c->capacity = new_capacity;
 }
 
-static void choices_reset_search(choices_t *c){
+static void choices_reset_search(choices_t *c) {
 	free(c->results);
 	c->selection = c->available = 0;
 	c->results = NULL;
 }
 
-void choices_init(choices_t *c){
+void choices_init(choices_t *c) {
 	c->strings = NULL;
 	c->results = NULL;
 	c->capacity = c->size = 0;
@@ -43,36 +43,36 @@ void choices_init(choices_t *c){
 	choices_resize(c, INITIAL_CAPACITY);
 }
 
-void choices_free(choices_t *c){
+void choices_free(choices_t *c) {
 	free(c->strings);
 	free(c->results);
 }
 
-void choices_add(choices_t *c, const char *choice){
+void choices_add(choices_t *c, const char *choice) {
 	/* Previous search is now invalid */
 	choices_reset_search(c);
 
-	if(c->size == c->capacity){
+	if (c->size == c->capacity) {
 		choices_resize(c, c->capacity * 2);
 	}
 	c->strings[c->size++] = choice;
 }
 
-size_t choices_available(choices_t *c){
+size_t choices_available(choices_t *c) {
 	return c->available;
 }
 
-void choices_search(choices_t *c, const char *search){
+void choices_search(choices_t *c, const char *search) {
 	choices_reset_search(c);
 
 	c->results = malloc(c->size * sizeof(struct scored_result));
-	if(!c->results){
+	if (!c->results) {
 		fprintf(stderr, "Error: Can't allocate memory\n");
 		abort();
 	}
 
-	for(size_t i = 0; i < c->size; i++){
-		if(has_match(search, c->strings[i])){
+	for (size_t i = 0; i < c->size; i++) {
+		if (has_match(search, c->strings[i])) {
 			c->results[c->available].str = c->strings[i];
 			c->results[c->available].score = match(search, c->strings[i]);
 			c->available++;
@@ -82,24 +82,23 @@ void choices_search(choices_t *c, const char *search){
 	qsort(c->results, c->available, sizeof(struct scored_result), cmpchoice);
 }
 
-const char *choices_get(choices_t *c, size_t n){
-	if(n < c->available){
+const char *choices_get(choices_t *c, size_t n) {
+	if (n < c->available) {
 		return c->results[n].str;
-	}else{
+	} else {
 		return NULL;
 	}
 }
-double choices_getscore(choices_t *c, size_t n){
+double choices_getscore(choices_t *c, size_t n) {
 	return c->results[n].score;
 }
 
-void choices_prev(choices_t *c){
-	if(c->available)
+void choices_prev(choices_t *c) {
+	if (c->available)
 		c->selection = (c->selection + c->available - 1) % c->available;
 }
 
-void choices_next(choices_t *c){
-	if(c->available)
+void choices_next(choices_t *c) {
+	if (c->available)
 		c->selection = (c->selection + 1) % c->available;
 }
-