Finished Reduce

Author: Bob Lee

course/functional-programming/reduce.md

@@ -1,5 +1,6 @@
 # Reduce
 ## Introduction
+Welcome to Lesson 3 of Functional Programming. I don't think I have to talk too much. Let's get into the lesson right away.
 
 ## Problem
 Combine all into one
@@ -34,13 +35,90 @@ let added = Array(1...10).reduce(0) { $0 + $1 } // 55
 let subtracted = Array(1...10).reduce(0) { $0 - $1 } // -55
 ```
 
-You will discover how it works behind the scene by the end of this lesson. Let's get started.
+You will discover how the `reduce` function works behind the scene by the end of this lesson. Let's get started.
 
+```swift
+func myReduce(_ seed: Int, numbers: [Int], operation: (Int, Int) -> Int) {
+ var current = seed
+ for number in numbers {
+ current = operation(current, number)
+ }
+}
+```
 
+`seed` represents the initial value you wish to start off with.
 
-### Source Code
+```swift
+myReduce(0, numbers: Array(1...10)) { $0 + $1 }
+```
+
+### Ex) Finding the Max
+```swift
+let maxNumber = Array(1...10).reduce(0) { (total, number) in max(total, number) }
+let bigNumber = Array(1...10).reduce(0) { max($0, $1) }
+```
+
+So far, `myReduce` has not returned any. Let's create a function that returns the final value in `Int`.
+
+```swift
+func reduce(_ seed: Int, numbers: [Int], operation: (Int, Int) -> Int) -> Int {
+ var current = seed
+ for number in numbers {
+ current = operation(current, number)
+ }
+ return current
+}
+
+reduce(0, numbers: Array(1...10)) { $0 + $1 }
+```
+
+### Generic Reduce
+Again, creating a generic function is just a required for the sake of time and efficiency.
 
-### Resources
+```swift
+extension Array {
+ func myReduce<U>(_ seed: U, operation:(U, U) -> U) -> U {
+ var current = seed
+ for item in self {
+ current = operation(current, item as! U)
+ }
+ return current
+ }
+}
+```
+
+Currently, there is a force casting using `as! U`. It occurs since the type of `U` is not defined until you use the `myReduce` function.
+
+```swift
+let names = ["Bob", "Bobby", "Lee"]
+let description = names.myReduce("Names:") { "\($0) " + $1 }
+print(description) // "Names: Bob Bobby Lee"
+```
+
+Not only that, you may "chain" multiple functions.
 
+```swift
+let lowerNames = names.map { $0.lowercased() }.myReduce("Names:") { "\($0) " + $1 }
+print(lowerNames) // "Names: bob bobby lee"
+```
+
+### The Purest Form
+```swift
+//: The Purest Form
+extension Array {
+ func reduce(_ seed: Element, operation:(Element, Element) -> Element) -> Element {
+ var current = seed
+ for item in self {
+ current = operation(current, item)
+ }
+ return current
+ }
+}
+
+let hello = ["Bob", "Bobby", "Lee"].reduce("Names:") { "\($0) " + $1 }
+```
+### Source Code
+[6004_reduce.playground]()
 
 ## Conclusion
+I hope by now you are truly seeing the power of functions. Well, a functional paradigm is not specifically tied to iOS development. In fact, you've learned how to apply and utilize closure and generics in web development, server development, Android development, and other platforms. This course isn't just about learning Swift. It is about to learn how to code with beauty and class. Let's get to the final function of this chapter. 

source-code/6000_functional_programming/.DS_Store

@@ -1,7 +1,7 @@
 /*:
  ## Learn Swift with Bob
  ### Functional Programming
- ### Reduce
+ ### 6004_Reduce
 
  **Problem:** Combine all into one
 
@@ -30,32 +30,32 @@ let subtracted = Array(1...10).reduce(0) { $0 - $1 } // -55
 
 
 //: Let's Find Out
-func myReduce(seed: Int, numbers: [Int], operation: (Int, Int) -> Int) {
+func myReduce(_ seed: Int, numbers: [Int], operation: (Int, Int) -> Int) {
  var current = seed
  for number in numbers {
  current = operation(current, number)
  }
 }
 
-myReduce(seed: 0, numbers: Array(1...10)) { $0 + $1 }
+myReduce(0, numbers: Array(1...10)) { $0 + $1 }
 
 //: Max Number
-let maxNumber = Array(1...10).reduce(0) { (total, number) in max(total, number) }
-let bigNumber = Array(1...10).reduce(0) { max($0, $1) }
+let maxNumber = Array(1...10).myReduce(0) { (total, number) in max(total, number) }
+let bigNumber = Array(1...10).myReduce(0) { max($0, $1) }
 
 //: Create Function that Returns
-func reduce(seed: Int, numbers: [Int], operation: (Int, Int) -> Int) -> Int {
+func reduce(_ seed: Int, numbers: [Int], operation: (Int, Int) -> Int) -> Int {
  var current = seed
  for number in numbers {
  current = operation(current, number)
  }
  return current
 }
 
-reduce(seed: 0, numbers: Array(1...10)) { $0 + $1 }
+reduce(0, numbers: Array(1...10)) { $0 + $1 }
 //: Generic Reduce
 extension Array {
- func myReduce<U>(seed: U, operation:(U, U) -> U) -> U {
+ func myReduce<U>(_ seed: U, operation:(U, U) -> U) -> U {
  var current = seed
  for item in self {
  current = operation(current, item as! U)
@@ -64,16 +64,18 @@ extension Array {
  }
 }
 
+//: Example
 let names = ["Bob", "Bobby", "Lee"]
-let description = names.myReduce(seed: "Names:") { "\($0) " + $1 }
+let description = names.myReduce("Names:") { "\($0) " + $1 }
 print(description)
 
-//: Example
-let lowerNames = names.map { $0.lowercased() }.myReduce(seed: "Names:") { "\($0) " + $1 }
+//: Multiple Functions
+let lowerNames = names.map { $0.lowercased() }.myReduce("Names:") { "\($0) " + $1 }
 print(lowerNames)
+
 //: The Purest Form
 extension Array {
- func reduce(seed: Element, operation:(Element, Element) -> Element) -> Element {
+ func reduce(_ seed: Element, operation:(Element, Element) -> Element) -> Element {
  var current = seed
  for item in self {
  current = operation(current, item)
@@ -82,7 +84,7 @@ extension Array {
  }
 }
 
-let hello = ["Bob", "Bobby", "Lee"].reduce(seed: "Names:") { "\($0) " + $1 }
+let hello = ["Bob", "Bobby", "Lee"].reduce("Names:") { "\($0) " + $1 }