--- a/th_datastruct.c	Fri Sep 15 04:49:57 2017 +0300
+++ b/th_datastruct.c	Thu Oct 12 17:12:50 2017 +0300
@@ -152,8 +152,8 @@
 4) Remove last
 
     list <- list -> NULL
-    
-    
+
+
 */
 void th_llist_delete_node_fast(th_llist_t **list, th_llist_t *node)
 {
@@ -181,7 +181,7 @@
 
         (*list)->num--;
     }
-    
+
     node->next = node->prev = NULL;
 }
 
@@ -253,7 +253,7 @@
 
         curr = curr->next;
     }
-    
+
     return -1;
 }
 
@@ -284,7 +284,7 @@
         }
         curr = curr->next;
     }
-    
+
     return 0;
 }
 
@@ -325,12 +325,12 @@
 th_ringbuf_t * th_ringbuf_new(const size_t size, void (*mdeallocator)(void *data))
 {
     th_ringbuf_t *res = th_malloc0(sizeof(th_ringbuf_t));
-    
+
     res->data = (char **) th_calloc(size, sizeof(char *));
     res->size = size;
     res->n = 0;
     res->deallocator = mdeallocator;
-    
+
     return res;
 }
 
@@ -351,13 +351,13 @@
 void th_ringbuf_free(th_ringbuf_t *buf)
 {
     int i;
-    
+
     for (i = 0; i < buf->size; i++)
     {
         if (buf->data[i] != NULL)
             buf->deallocator(buf->data[i]);
     }
-    
+
     th_free(buf->data);
     th_free(buf);
 }