Reimplemented the Dicache using dlib ADTs

For a long time it had a custom ADT with a list of nodes and each
node a linked list (with pointers). The last memory bug motivated me to
try to normalize it to use dlib. Now, it got simpler, shorter, and
possibly faster (although conversion wasn't a simple task).

PD: It also uses less memory now.

1 files changed, 1 insertions, 1 deletions

diff --git a/src/cache.c b/src/cache.c
index 6a7d2748..c4bc1f9b 100644
--- a/src/cache.c
+++ b/src/cache.c
@@ -110,7 +110,7 @@ static int Cache_entry_by_url_cmp(const void *v1, const void *v2)
 }
 
 /*
- * Initialize dicache data
+ * Initialize cache data
  */
 void a_Cache_init(void)
 {