"Go Programming" by John P. Baugh

Google's new programming language Go has caused a lot of excitement. As a modern systems programming language, Go offers significant advantages over older languages like C, C++, and Java. This book, "Go Programming" takes an example-based approach to teach the reader how to effectively get started with programming in Go.

From basic variable usage, to control structures, to File I/O, to basic network programming, this book has all you need to become confident with the basics of the language, and will prepare you to create basic programs, as well as to perform more research of the language.

TABLE OF CONTENTS
What is This Book About and Who is It For?
About the Author
1.1 Why a New Language?
1.2 How Does Go Compare with C++?
1.2.1 Functions
1.2.2 Is Go Object Oriented like C++?
1.2.3 How do I free memory in Go?
1.2.4 Other stuff to be aware of
1.3 Summary
2.1 What Platforms can I install Go on?
2.2 But what if I'm a Windows user?
2.2.1 Virtual Machine
2.2.2 Dual Booting with Ubuntu
2.3 Installing Go
2.3.1 Environment Variables
2.3.2 Installing Mercurial
2.3.3 Fetching the Go Repository
2.3.4 Installing Go
2.4 Compiling, Linking, and Running
2.4.1 What About gccgo?
2.5 Summary
3.1 Standard 1/0
3.1.1 The Obligatory "Hello World"
3.1.2 Retrieving Input from the User
3.2 File 1/0
3.2.1 Output to a File
3.2.2 Input from a File
3.2.3 A Short Summary of Permissions
3.3 Constants and Variables
3.3.1 Identifiers
3.3.2 Constants
3.3.3 Variables
3.3.4 Time Savers : Short Declarations and Distributing
3.4 Some Basic Data Types
3.4.1 Numeric Data Types
3.4.2 Character Data Type
3.4.3 Boolean Data Type
3.5 The String Data Type
3.5.1 The strings Package
Prefixes and Suffixes
Counting Occurrences of a Substring
Index and Lastindex
Repeat
ToUpper and ToLower
3.52 The strconv Package
3.6 Keywords and Operators
3.6.1 Keywords
3.6.2 Operators
3.7 Summary
4.1 Conditional Structures
4.1.1 Basics of Logic
Equality
AND operator
OR operator
NOT operator
4.1.2 The if Structure
4.1.3 The switch Structure
4.2 Iteration
4.3 break, continue, and Labels
4.3.1 continue
4.3.2 break
4.3.3 Labe1s
4.4 Functions
4.4.1 Single Return Value
4.4.2 Multiple Return Values
Result Parameters
Empty Return
4.4.3 The defer Keyword
4.4.4 The Blank Identifier
4.4.5 Example : Minimum I Maximum Function
4.4 Summary
5.1 Pointers and References
5.2 Arrays and Slices
5.2.1 Arrays
5.2.2 Slices
Basic Usage
Using make() to Create a Slice
Reslicing
5.3 Maps
Testing for Existence of an Element.
Deleting an Element.
5.4 Using range with for Loops
5.5 Simulating Enumerated Types with iota
5.6 Summary
6.1 Structured Types
6.1.1 Named Fields and Anonymous Fields
6.1.2 Methods
6.2 Custom Packages and Visibility
6.2.1 Visibility
6.3 Interfaces
6.4 Summary
7.1 Concurrency
71.1 Goroutines
7.2 Communication Channels
7.2.1 The Communication Operator, <-
72.2 Communicability and Select Statements
7.3 A Simple Client and Server
7.4 Summary



About the Author
John P. Baugh holds a Master of Science Degree in Computer Science from the University of Michigan - Dearborn. He works as a software engineer for Siemens PLM Software in Ann Arbor, Michigan. Prior to joining Siemens in 2007, he worked as a graduate student research assistant and helped to establish the Vehicular Networking Research Laboratory at the University of Michigan - Dearborn. He is an adjunct lecturer for the Department of Computer Science at the University of Michigan-Dearborn, as well as a part time instructor at Schoolcraft College in Livonia. He has taught courses ranging from beginning to intermediate computer science, C++, C#, Java, and also basic game design courses. His interests include game development, discrete mathematics, cryptography, and computer science education.