development: minor updates

Author: Daniel Dahan

Sources/Algorithm+Array.swift

@@ -29,20 +29,23 @@
  */
 
 extension Array where Element: Equatable {
-	mutating func remove(object: Element) -> Element? {
+	@discardableResult
+    mutating func remove(object: Element) -> Element? {
 		if let v: Int = index(of: object) {
 			return remove(at: v)
 		}
 		return nil
 	}
 
+    @discardableResult
 	mutating func remove(objects: Element...) {
 		remove(objects: objects)
 	}
 
+    @discardableResult
 	mutating func remove(objects: [Element]) {
         for x in objects {
-            _ = remove(object: x)
+            remove(object: x)
         }
 	}
 }

Sources/Deque.swift

@@ -117,7 +117,7 @@ public class Deque<Element>: CustomStringConvertible, Sequence {
 		and remove it.
 		- returns:	Element?
 	*/
-	public func removeAtFront() -> Element? {
+    public func removeAtFront() -> Element? {
 		return list.removeAtFront()
 	}
 

Sources/RedBlackTree.swift

@@ -255,6 +255,7 @@ public class RedBlackTree<Key: Comparable, Value>: ProbableType, Collection, Cus
 		:description:	Insert a key / value pair.
 		- returns:	Bool
 	*/
+    @discardableResult
 	public func insert(_ key: Key, value: Value?) -> Bool {
 		return sentinel !== internalInsert(key, value: value)
 	}
@@ -275,7 +276,7 @@ public class RedBlackTree<Key: Comparable, Value>: ProbableType, Collection, Cus
 	*/
 	public func insert(_ nodes: Array<(Key, Value?)>) {
 		for (k, v) in nodes {
-			_ = insert(k, value: v)
+            insert(k, value: v)
 		}
 	}