Merge pull request kodecocodes#230 from sendilkumarn/deque

deque update to swift 3

Author: kelvinlauKL

Deque/Deque-Optimized.swift

@@ -8,7 +8,7 @@ public struct Deque<T> {
   private var head: Int
   private var capacity: Int
 
-  public init(capacity: Int = 10) {
+  public init(_ capacity: Int = 10) {
     self.capacity = max(capacity, 1)
     array = .init(count: capacity, repeatedValue: nil)
     head = capacity
@@ -22,11 +22,11 @@ public struct Deque<T> {
     return array.count - head
   }
 
-  public mutating func enqueue(element: T) {
+  public mutating func enqueue(_ element: T) {
     array.append(element)
   }
 
-  public mutating func enqueueFront(element: T) {
+  public mutating func enqueueFront(_ element: T) {
     if head == 0 {
       capacity *= 2
       let emptySpace = [T?](count: capacity, repeatedValue: nil)

Deque/Deque-Simple.swift

@@ -16,11 +16,11 @@ public struct Deque<T> {
     return array.count
   }
 
-  public mutating func enqueue(element: T) {
+  public mutating func enqueue(_ element: T) {
     array.append(element)
   }
 
-  public mutating func enqueueFront(element: T) {
+  public mutating func enqueueFront(_ element: T) {
     array.insert(element, atIndex: 0)
   }
 

Deque/Deque.playground/Contents.swift

@@ -11,12 +11,12 @@ public struct Deque<T> {
     return array.count
   }
 
-  public mutating func enqueue(element: T) {
+  public mutating func enqueue(_ element: T) {
     array.append(element)
   }
 
-  public mutating func enqueueFront(element: T) {
-    array.insert(element, atIndex: 0)
+  public mutating func enqueueFront(_ element: T) {
+    array.insert(element, at: 0)
   }
 
   public mutating func dequeue() -> T? {

Deque/Deque.playground/timeline.xctimeline

@@ -18,11 +18,11 @@ public struct Deque<T> {
     return array.count
   }
 
-  public mutating func enqueue(element: T) {
+  public mutating func enqueue(_ element: T) {
     array.append(element)
   }
 
-  public mutating func enqueueFront(element: T) {
+  public mutating func enqueueFront(_ element: T) {
     array.insert(element, atIndex: 0)
   }
 
@@ -120,7 +120,7 @@ public struct Deque<T> {
   private var head: Int
   private var capacity: Int
 
-  public init(capacity: Int = 10) {
+  public init(_ capacity: Int = 10) {
     self.capacity = max(capacity, 1)
     array = .init(count: capacity, repeatedValue: nil)
     head = capacity
@@ -134,11 +134,11 @@ public struct Deque<T> {
     return array.count - head
   }
 
-  public mutating func enqueue(element: T) {
+  public mutating func enqueue(_ element: T) {
     array.append(element)
   }
 
-  public mutating func enqueueFront(element: T) {
+  public mutating func enqueueFront(_ element: T) {
     // this is explained below
   }