Smart indent headers.

src/arraylist.h

@@ -107,7 +107,7 @@ typedef int (*ArrayListEqualFunc)(ArrayListValue value1, ArrayListValue value2);
  */
 
 typedef int (*ArrayListCompareFunc)(ArrayListValue value1,
-				    ArrayListValue value2);
+                                    ArrayListValue value2);
 
 /**
  * Allocate a new ArrayList for use.

src/binary-heap.h

@@ -93,7 +93,7 @@ typedef void *BinaryHeapValue;
  */
 
 typedef int (*BinaryHeapCompareFunc)(BinaryHeapValue value1,
-				     BinaryHeapValue value2);
+                                     BinaryHeapValue value2);
 
 /** 
  * A binary heap data structure.
@@ -139,7 +139,7 @@ int binary_heap_insert(BinaryHeap *heap, BinaryHeapValue value);
  *
  * @param heap             The heap.
  * @return                 The first value in the heap, or 
- *			   @ref BINARY_HEAP_NULL if the heap is empty.
+ *                         @ref BINARY_HEAP_NULL if the heap is empty.
  */
 
 BinaryHeapValue binary_heap_pop(BinaryHeap *heap);

src/binomial-heap.h

@@ -139,7 +139,7 @@ int binomial_heap_insert(BinomialHeap *heap, BinomialHeapValue value);
  *
  * @param heap             The heap.
  * @return                 The first value in the heap, or 
- *			   @ref BINOMIAL_HEAP_NULL if the heap is empty.
+ *                         @ref BINOMIAL_HEAP_NULL if the heap is empty.
  */
 
 BinomialHeapValue binomial_heap_pop(BinomialHeap *heap);

src/list.h

@@ -153,7 +153,7 @@ ListEntry *list_prepend(ListEntry **list, ListValue data);
  * @param list         Pointer to the list to append to.
  * @param value        The value to append.
  * @return             The new entry in the list, or NULL if it was not
- *		       possible to allocate the memory for the new entry.
+ *                     possible to allocate the memory for the new entry.
  */
 
 ListEntry *list_append(ListEntry **list, ListValue data);
@@ -303,7 +303,7 @@ int list_iter_has_more(ListIterator *iterator);
  * @return               The next value from the list, or @ref LIST_NULL if 
  *                       there are no more values in the list.
  */
-        
+	
 ListValue list_iter_next(ListIterator *iterator);
 
 /** 

src/set.h

@@ -210,8 +210,8 @@ int set_num_entries(Set *set);
  *
  * @param set              The set.
  * @return                 An array containing all entries in the set,
- *			   or NULL if it was not possible to allocate
- *			   memory for the array.
+ *                         or NULL if it was not possible to allocate
+ *                         memory for the array.
  */
 
 SetValue *set_to_array(Set *set);

src/slist.h

@@ -201,7 +201,7 @@ SListEntry *slist_nth_entry(SListEntry *list, int n);
  * @param list       The list.
  * @param n          The index into the list.
  * @return           The value stored at the specified index, or
- *		     @ref SLIST_NULL if unsuccessful.
+ *                   @ref SLIST_NULL if unsuccessful.
  */
 
 SListValue slist_nth_data(SListEntry *list, int n);
@@ -249,8 +249,8 @@ int slist_remove_entry(SListEntry **list, SListEntry *entry);
  */
 
 int slist_remove_data(SListEntry **list,
-		      SListEqualFunc callback,
-		      SListValue data);
+                      SListEqualFunc callback,
+                      SListValue data);
 
 /**
  * Sort a list.
@@ -267,7 +267,7 @@ void slist_sort(SListEntry **list, SListCompareFunc compare_func);
  * @param list           The list to search.
  * @param callback       Callback function to be invoked to determine if
  *                       values in the list are equal to the value to be
- *			 searched for.
+ *                       searched for.
  * @param data           The value to search for.
  * @return               The list entry of the value being searched for, or
  *                       NULL if not found.
@@ -305,7 +305,7 @@ int slist_iter_has_more(SListIterator *iterator);
  * @return               The next value from the list, or SLIST_NULL if 
  *                       there are no more values in the list.
  */
-        
+	
 SListValue slist_iter_next(SListIterator *iterator);
 
 /**