Summary

In this chapter, we have learned about many of the basic constructs that are used for iterators and generators in Go. Understanding anonymous functions and closures helped us to build foundational knowledge about how these functions work. We then learned how goroutines and channels work, and how to implement them fruitfully. We also learned about semaphores and WaitGroups, as well as how they play into the language. Understanding these skills will help us to parse through information in our computer programs in a more effective manner, allowing for more concurrent data manipulation. In Chapter 4, STL Algorithm Equivalents in Go, we'll learn about practical implementations of the Standard Templating Library (STL) in Go.