Sequence containers store data elements of a specific type. There are five current implementations of sequence containers: array, vector, deque, list, and forward_list. These sequence containers make it easy to reference data in a sequential manner. Being able to utilize these sequence containers is a great shortcut to writing effective code and reusing modular bits of the standard library. We will explore these in the following subsections.
- Title Page
- Copyright and Credits
- Dedication
- About Packt
- Contributors
- Preface
- Section 1: Learning about Performance in Go
- Introduction to Performance in Go
- Data Structures and Algorithms
- Understanding Concurrency
- STL Algorithm Equivalents in Go
- Matrix and Vector Computation in Go
- Section 2: Applying Performance Concepts in Go
- Composing Readable Go Code
- Template Programming in Go
- Memory Management in Go
- GPU Parallelization in Go
- Compile Time Evaluations in Go
- Section 3: Deploying, Monitoring, and Iterating on Go Programs with Performance in Mind
- Building and Deploying Go Code
- Building Go binaries
- Go build – building your Go code
- Go clean – cleaning your build directory
- Retrieving package dependencies with go get and go mod
- Go list
- Go run – executing your packages
- Go install – installing your binaries
- Building Go binaries with Docker
- Summary
- Profiling Go Code
- Tracing Go Code
- Clusters and Job Queues
- Comparing Code Quality Across Versions
- Other Books You May Enjoy
Sequence containers
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.