Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Delphi High Performance

You're reading from   Delphi High Performance Master the art of concurrency, parallel programming, and memory management to build fast Delphi apps

Arrow left icon
Product type Paperback
Published in Jun 2023
Publisher Packt
ISBN-13 9781805125877
Length 452 pages
Edition 2nd Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Primož Gabrijelčič Primož Gabrijelčič
Author Profile Icon Primož Gabrijelčič
Primož Gabrijelčič
Arrow right icon
View More author details
Toc

Table of Contents (15) Chapters Close

Preface 1. Chapter 1: About Performance 2. Chapter 2: Profiling the Code FREE CHAPTER 3. Chapter 3: Fixing the Algorithm 4. Chapter 4: Don’t Reinvent, Reuse 5. Chapter 5: Fine-Tuning the Code 6. Chapter 6: Memory Management 7. Chapter 7: Getting Started with the Parallel World 8. Chapter 8: Working with Parallel Tools 9. Chapter 9: Exploring Parallel Practices 10. Chapter 10: More Parallel Patterns 11. Chapter 11: Using External Libraries 12. Chapter 12: Best Practices 13. Index 14. Other Books You May Enjoy

Optimizing strings and array allocations

When you create a string, the code allocates memory for its content, copies the content into that memory, and stores the address of this memory in the string variable. Of course, you all know that by now as this was the topic of the previous chapter.

If you append a character to this string, it must be stored somewhere in that memory. However, there is no place to store the string. The original memory block was just big enough to store the original content. The code must therefore enlarge that memory block, and only then can the appended character be stored in the newly acquired space.

As we’ll see further on in the chapter, FastMM4 tries to make sure that the memory can be expanded in place—that is, without copying the original data into a new, larger block of memory. Still, this is not always possible, and sometimes data must be copied around.

A very similar scenario plays out when you extend a dynamic array. Memory...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at €18.99/month. Cancel anytime