diff --git a/README.md b/README.md
index cfbd9e8..4cb0d6e 100644
--- a/README.md
+++ b/README.md
@@ -38,7 +38,7 @@ echo queue.pop(queue.high())  # 2
 echo queue.pop(^1)            # 1
 
 # Pops element at position 2
-echo queue.pop(2)
+echo queue.pop(2)             # 0
 
 # Supports iteration
 for i, e in queue:
@@ -61,8 +61,8 @@ echo 0 in queue  # true
 # queue, the higher the time it takes to retrieve it. For
 # fast random access, seqs should be used instead
 echo queue[0]             # -1
-echo queue[^1]            # 2
-echo queue[queue.high()]  # 2
+echo queue[^1]            # 1 
+echo queue[queue.high()]  # 1
 
 
 # It's possible to extend a deque with other deques or with seqs
diff --git a/src/nimdeque.nim b/src/nimdeque.nim
index 9822a82..687ad41 100644
--- a/src/nimdeque.nim
+++ b/src/nimdeque.nim
@@ -15,26 +15,5 @@ import private/queues/linked
 
 
 # Exports linked queue stuff
-export newLinkedDeque
-export LinkedDeque
-export add
-export addLeft
-export contains
-export items
-export reversed
-export len
-export linked.high
-export pop
-export `[]`
-export `[]=`
-export `==`
-export pairs
-export linked.`$`
-export insert
-export extend
-export reversedPairs
-export clear
-export clearPop
-export extendLeft
-export maxSize
-export find
+export linked
+
diff --git a/src/private/queues/linked.nim b/src/private/queues/linked.nim
index a754411..769f565 100644
--- a/src/private/queues/linked.nim
+++ b/src/private/queues/linked.nim
@@ -170,7 +170,7 @@ proc clear*[T](self: LinkedDeque[T]) =
 
 proc clearPop*[T](self: LinkedDeque[T]) =
     ## Clears the deque by repeatedly
-    ## calling self.pop() in O(1) time,
+    ## calling self.pop() in O(n) time,
     ## slower than clear()
     while self.len() > 0:
         discard self.pop()