Home
My Books
Browse ▾
Recommendations
Choice Awards
Genres
Giveaways
New Releases
Lists
Explore
News & Interviews
Loading...
Community ▾
Groups
Quotes
Ask the Author
People
Sign in
Join
Jump to ratings and reviews
Want to Read
Shop this series
Rate this book
Advanced C++ Memory Techniques: Efficiency and Safety
David Spuler
0.00
0 ratings
0 reviews
Want to Read
Shop this series
Rate this book
Advanced coding techniques for memory efficiency with pointer safety. Optimize memory access patterns with cache locality and prefetching. Avoid insidious memory pitfalls with resilient coding practices and memory debug libraries.
Table of
Part Memory Optimization Techniques
1. C++ Memory Primitives
2. Cache Locality
3. Cache Warming
4. Branch Prediction
5. Contiguous Memory Blocks
6. Pointer Arithmetic
7. Memory Pools
8. Memory Reduction Optimizations
9. False Sharing
Part Memory-Efficient Data Structures
10. Arrays
11. String Optimizations
12. Order of Insertion
13. LRU Cache Data Structure
14. Fast Ring Buffers
15. Loop Optimizations
16. Vector Algorithms
17. Tensors
18. Lookup Tables & Precomputation
19. Matrix Multiplication
Part Memory Safety Techniques
20. Memory Safety Techniques
21. DIY Memory Safety
22. Intercepting Memory Primitives
23. Smart Pointers
24. Canaries and Redzones
25. Use-After-Free
26. Array Bounds Violations
27. Poisoning Memory Blocks
28. Uninitialized Memory Safety
29. Smart Stack Buffers
30. Safe Text Buffers
31. Preventive Memory Safety
Source Code
344 pages, Kindle Edition
Published June 25, 2025
Book details & editions
2 people are currently reading
About the author
David Spuler
20 books
7 followers
Follow
Follow
Ratings
&
Reviews
What do
you
think?
Rate this book
Write a Review
Friends
&
Following
Create a free account
to discover what your friends think of this book!
Community Reviews
0.00
0 ratings
0 reviews
5 stars
0 (0%)
4 stars
0 (0%)
3 stars
0 (0%)
2 stars
0 (0%)
1 star
0 (0%)
Search review text
Filters
No one has reviewed this book yet.
Join the discussion
Add
a quote
Start
a discussion
Ask
a question
Can't find what you're looking for?
Get help and learn more about the design.
Help center