c2nim compiles again

compiler/c2nim/cparse.nim

@@ -62,7 +62,7 @@ proc newParserOptions*(): PParserOptions =
   result.flags = {}
   result.dynlibSym = ""
   result.header = ""
-  result.toMangle = newStringTable()
+  result.toMangle = newStringTable(modeCaseSensitive)
 
 proc setOption*(parserOptions: PParserOptions, key: string, val=""): bool = 
   result = true

lib/pure/collections/hashtables.nim

@@ -126,7 +126,6 @@ proc `$`*[A, B](t: PHashTable[A, B]): string =
       result.add($val)
     result.add("}")
 
-
 # ------------------------------ count tables -------------------------------
 
 const

lib/pure/collections/lists.nim

@@ -12,16 +12,25 @@
 ## be manipulated directly for efficiency.
 
 type
-  TDoublyLinkedNode[T] {.pure, final.} = object
+  TDoublyLinkedNode*[T] {.pure, 
+      final.} = object ## a node a doubly linked list consists of
     next*, prev*: ref TDoublyLinkedNode[T]
     value*: T
   PDoublyLinkedNode*[T] = ref TDoublyLinkedNode[T]
 
-  TSinglyLinkedNode[T] {.pure, final.} = object
+  TSinglyLinkedNode*[T] {.pure, 
+      final.} = object ## a node a singly linked list consists of
     next*: ref TSinglyLinkedNode[T]
     value*: T
   PSinglyLinkedNode*[T] = ref TSinglyLinkedNode[T]
   
+  TRingNode[T] {.pure, 
+      final.} = object ## a node a ring list consists of
+    next*, prev*: ref TRingNode[T]
+    value*: T
+    
+  PRingNode*[T] = ref TRingNode[T]
+
 proc newDoublyLinkedNode*[T](value: T): PDoublyLinkedNode[T] =
   ## creates a new doubly linked node with the given `value`.
   new(result)