Cleaned code

Author: Hysperr

Torus Deque/deque.h

@@ -7,7 +7,7 @@
  * iterator support. It behaves as a normal deque should, but the
  * internal implementation is unique. Picture a torus-shaped array.
  * In the function \c push_front() the private data field \c first
- * is at index 0 and moves left after each insert at \c data[first].
+ * begins at index 0 and moves left after each insert at \c data[first].
  * In the function \c push_back() private data field \c last begins
  * at index 1 and moves right after each insert at \c data[last].
  * For users of the container, these implementation details need not be known.
@@ -64,9 +64,9 @@ class deque {
 
     size_type size() const { return count; }
 
-    bool empty() const { return count == 0; }       // or first + 1 % cap == last
+    bool empty() const { return count == 0; }           // or first + 1 % cap == last
 
-    bool full() const { return count == CAPACITY; } // or last == first
+    bool full() const { return count == CAPACITY; }     // or last == first
 
     size_type get_first() const { return first; }