Merge pull request kodecocodes#780 from SpacyRicochet/migration/swift4-2_red-black-tree

[Swift 4.2] Red-Black Sort

Author: richard-ash

Red-Black Tree/README.markdown

@@ -186,4 +186,4 @@ The overall runtime of delete is O(log n).
 ## Resources:
 [CLRS]  T. Cormen, C. Leiserson, R. Rivest, and C. Stein. "Introduction to Algorithms", Third Edition. 2009
 
-*Written for Swift Algorithm Club by Ute Schiehlen. Updated from Jaap Wijnen and Ashwin Raghuraman's contributions.*
+*Written for Swift Algorithm Club by Ute Schiehlen. Updated from Jaap Wijnen and Ashwin Raghuraman's contributions. Swift 4.2 check by Bruno Scheele.*

Red-Black Tree/RedBlackTree.playground/Contents.swift

@@ -2,11 +2,6 @@
 // Test for  the RedBlackTree implementation provided in the Source folder of this Playground
 import Foundation
 
-// last checked with Xcode 9.0b4
-#if swift(>=4.0)
-print("Hello, Swift 4!")
-#endif
-
 let redBlackTree = RedBlackTree<Double>()
 
 let randomMax = Double(0x10000000)

Red-Black Tree/RedBlackTree.playground/playground.xcworkspace/xcshareddata/IDEWorkspaceChecks.plist

@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>IDEDidComputeMac32BitWarning</key>
+	<true/>
+</dict>
+</plist>