update Array2D, Deque to swift3.0

update Array2D, Deque to swift3.0

Author: Joe

Array2D/README.markdown

@@ -30,14 +30,14 @@ let myCookie = cookies[3][6]
 Actually, you could create the array in a single line of code, like so:
 
 ```swift
-var cookies = [[Int]](count: 9, repeatedValue: [Int](count: 7, repeatedValue: 0))
+var cookies = [[Int]](repeating: [Int](repeating: 0, count: 7), count: 9)
 ```
 
 but that's just ugly. To be fair, you can hide the ugliness in a helper function:
 
 ```swift
 func dim<T>(count: Int, _ value: T) -> [T] {
-  return [T](count: count, repeatedValue: value)
+  return [T](repeating: value, count: count)
 }
 ```
 
@@ -72,7 +72,7 @@ public struct Array2D<T> {
   public init(columns: Int, rows: Int, initialValue: T) {
     self.columns = columns
     self.rows = rows
-    array = .init(count: rows*columns, repeatedValue: initialValue)
+    array = .init(repeating: initialValue, count: rows*columns)
   }
 
   public subscript(column: Int, row: Int) -> T {

Deque/Deque-Optimized.swift

@@ -10,7 +10,7 @@ public struct Deque<T> {
 
   public init(_ capacity: Int = 10) {
     self.capacity = max(capacity, 1)
-    array = .init(count: capacity, repeatedValue: nil)
+    array = [T?](repeating: nil, count: capacity)
     head = capacity
   }
 
@@ -29,7 +29,7 @@ public struct Deque<T> {
   public mutating func enqueueFront(_ element: T) {
     if head == 0 {
       capacity *= 2
-      let emptySpace = [T?](count: capacity, repeatedValue: nil)
+      let emptySpace = [T?](repeating: nil, count: capacity)
       array.insertContentsOf(emptySpace, at: 0)
       head = capacity
     }

Deque/README.markdown

@@ -122,7 +122,7 @@ public struct Deque<T> {
 
   public init(_ capacity: Int = 10) {
     self.capacity = max(capacity, 1)
-    array = .init(count: capacity, repeatedValue: nil)
+    array = [T?](repeating: nil, count: capacity)
     head = capacity
   }
 
@@ -238,8 +238,8 @@ There is one tiny problem... If you enqueue a lot of objects at the front, you'r
   public mutating func enqueueFront(element: T) {
     if head == 0 {
       capacity *= 2
-      let emptySpace = [T?](count: capacity, repeatedValue: nil)
-      array.insertContentsOf(emptySpace, at: 0)
+      let emptySpace = [T?](repeating: nil, count: capacity)
+      array.insert(contentsOf: emptySpace, at: 0)
       head = capacity
     }