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

Speeding up SlowCode

For the last practical example, we can try speeding up Mr. Smith’s SlowCode from Chapter 1, About Performance. Here, we immediately ran into a problem. To fix or change an algorithm, we must understand what the code does. This happens a lot in practice, especially when you inherit some code. Reading and understanding code that you didn’t write is an important skill.

Let’s try to understand the first part of SlowCode. The for loop in SlowMethod starts counting with 2. Then, it calls ElementInDataDivides, which does nothing as the data list is empty. Next, SlowMethod adds 2 to the list.

Next, i takes the value of 3. ElementInDataDivides checks if 3 is divisible by 2. It is not, SlowMethod adds 3 to the list.

In the next step, i = 4, it is divisible by 2, and 4 is not added to the list. 5 is then added to the list (it is not divisible by 2 or 3), 6 is not (divisible by 2), 7 is added (not divisible by 2, 3, or 5), 8 is not (divisible...

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