Index: uspace/lib/c/include/adt/hash_table.h
===================================================================
--- uspace/lib/c/include/adt/hash_table.h	(revision 1b20da07baaa3e3c424f62c927274e676e4295cd)
+++ uspace/lib/c/include/adt/hash_table.h	(revision 50dd8544f601ebd5a6afcaa9c1a1b0dadbe951be)
@@ -51,8 +51,8 @@
 	/** Returns the hash of the key stored in the item (ie its lookup key). */
 	size_t (*hash)(const ht_link_t *item);
-	
+
 	/** Returns the hash of the key. */
 	size_t (*key_hash)(void *key);
-	
+
 	/** True if the items are equal (have the same lookup keys). */
 	bool (*equal)(const ht_link_t *item1, const ht_link_t *item2);
Index: uspace/lib/c/include/adt/list.h
===================================================================
--- uspace/lib/c/include/adt/list.h	(revision 1b20da07baaa3e3c424f62c927274e676e4295cd)
+++ uspace/lib/c/include/adt/list.h	(revision 50dd8544f601ebd5a6afcaa9c1a1b0dadbe951be)
@@ -231,5 +231,5 @@
 		link->prev->next = link->next;
 	}
-	
+
 	link_initialize(link);
 }
@@ -314,7 +314,7 @@
 	part1->prev->next = part2;
 	part2->prev->next = part1;
-	
+
 	link_t *hlp = part1->prev;
-	
+
 	part1->prev = part2->prev;
 	part2->prev = hlp;
@@ -378,14 +378,14 @@
 {
 	unsigned long cnt = 0;
-	
+
 	link_t *link = list_first(list);
 	while (link != NULL) {
 		if (cnt == n)
 			return link;
-		
+
 		cnt++;
 		link = list_next(link, list);
 	}
-	
+
 	return NULL;
 }