TABs > SPACEs

dvorka · Oct 29, 2014 · ba5ba43 · ba5ba43
1 parent d28d9fb
commit ba5ba43
Show file tree

Hide file tree

Showing 21 changed files with 956 additions and 956 deletions.
diff --git a/src/hashset.c b/src/hashset.c
@@ -46,7 +46,7 @@ void *hashset_get(const HashSet * hs, const char *key)
 
 int hashset_contains(const HashSet * hs, const char *key)
 {
-	return (hashset_get(hs, key) != NULL);
+    return (hashset_get(hs, key) != NULL);
 }
 
 int hashset_put(HashSet *hs, const char *key, void *value)
@@ -74,7 +74,7 @@ int hashset_put(HashSet *hs, const char *key, void *value)
 
 int hashset_add(HashSet * hs, const char *key)
 {
-	return hashset_put(hs, key, "nil");
+    return hashset_put(hs, key, "nil");
 }
 
 int hashset_size(const HashSet *hs)
@@ -95,48 +95,48 @@ void hashset_stat(const HashSet *hs)
 
 char** hashset_keys(const HashSet *hs)
 {
-	if(hs->currentSize) {
-	    char **result=malloc(sizeof(char*) * hs->currentSize);
-		int i=0, j=0;
-		struct HashSetNode *p;
-		for(i=0; i<HASH_MAP_SIZE; i++) {
-	    	p=hs->lists[i];
-	    	while(p && p->next) {
-	    		result[j++]=hstr_strdup(p->key);
-	    		p=p->next;
-	    	}
-	    	if(p) {
-		    	result[j++]=hstr_strdup(p->key);
-	    	}
-	    }
-		return result;
-	} else {
-		return NULL;
-	}
+    if(hs->currentSize) {
+        char **result=malloc(sizeof(char*) * hs->currentSize);
+        int i=0, j=0;
+        struct HashSetNode *p;
+        for(i=0; i<HASH_MAP_SIZE; i++) {
+            p=hs->lists[i];
+            while(p && p->next) {
+                result[j++]=hstr_strdup(p->key);
+                p=p->next;
+            }
+            if(p) {
+                result[j++]=hstr_strdup(p->key);
+            }
+        }
+        return result;
+    } else {
+        return NULL;
+    }
 }
 
 void hashset_destroy(HashSet *hs, const bool freeValues)
 {
-	// only hashset keys (and possibly values) are freed - caller must free hashset itself
-	if(hs && hs->currentSize) {
-		int i=0;
-		struct HashSetNode *p, *pp;
-		for(i=0; i<HASH_MAP_SIZE; i++) {
-			p=hs->lists[i];
-			while(p && p->next) {
-				if(p->key) {
-					free(p->key);
-					if(freeValues && p->value) free(p->value);
-				}
-				pp=p;
-				p=p->next;
-				free(pp);
-			}
-			if(p && p->key) {
-				free(p->key);
-				if(freeValues && p->value) free(p->value);
-				free(p);
-			}
-		}
-	}
+    // only hashset keys (and possibly values) are freed - caller must free hashset itself
+    if(hs && hs->currentSize) {
+        int i=0;
+        struct HashSetNode *p, *pp;
+        for(i=0; i<HASH_MAP_SIZE; i++) {
+            p=hs->lists[i];
+            while(p && p->next) {
+                if(p->key) {
+                    free(p->key);
+                    if(freeValues && p->value) free(p->value);
+                }
+                pp=p;
+                p=p->next;
+                free(pp);
+            }
+            if(p && p->key) {
+                free(p->key);
+                if(freeValues && p->value) free(p->value);
+                free(p);
+            }
+        }
+    }
 }
diff --git a/src/hstr_curses.c b/src/hstr_curses.c
@@ -14,18 +14,18 @@ static bool terminalHasColors=FALSE;
 
 void hstr_curses_start()
 {
-	initscr();
-	keypad(stdscr, TRUE);
-	noecho();
-	terminalHasColors=has_colors();
-	if(terminalHasColors) {
-		start_color();
-		use_default_colors();
-	}
+    initscr();
+    keypad(stdscr, TRUE);
+    noecho();
+    terminalHasColors=has_colors();
+    if(terminalHasColors) {
+        start_color();
+        use_default_colors();
+    }
 }
 
 bool terminal_has_colors() {
-	return terminalHasColors;
+    return terminalHasColors;
 }
 
 void hstr_curses_stop() {