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
Mastering Delphi Programming: A Complete Reference Guide

You're reading from   Mastering Delphi Programming: A Complete Reference Guide Learn all about building fast, scalable, and high performing applications with Delphi

Arrow left icon
Product type Course
Published in Nov 2019
Publisher Packt
ISBN-13 9781838989118
Length 674 pages
Edition 1st 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 (19) Chapters Close

Preface 1. About Performance FREE CHAPTER 2. Fixing the Algorithm 3. Fine-Tuning the Code 4. Memory Management 5. Getting Started with the Parallel World 6. Working with Parallel Tools 7. Exploring Parallel Practices 8. Using External Libraries 9. Introduction to Patterns 10. Singleton, Dependency Injection, Lazy Initialization, and Object Pool 11. Factory Method, Abstract Factory, Prototype, and Builder 12. Composite, Flyweight, Marker Interface, and Bridge 13. Adapter, Proxy, Decorator, and Facade 14. Nullable Value, Template Method, Command, and State 15. Iterator, Visitor, Observer, and Memento 16. Locking Patterns 17. Thread pool, Messaging, Future and Pipeline 18. Other Books You May Enjoy

Tasks

Let's get back to business, and in this chapter business means tasks. I don't want to spend all the time talking about the theory and classes and interfaces, so I will start by introducing some code. Actually, it is not my code—I got it from our good friend, Mr. Smith.

For the past few chapters, he was quite busy, working on things botanical, so I let him be. (He gave me a comprehensive overview of his activities, but I'm just a programmer, and I didn't really understand him.) Now he has more spare time, and he returned to his great love—prime numbers. He is no longer trying to improve SlowCode. Now he studies how the probability of finding a prime number changes when numbers become larger. To do so, he wrote two simple functions (shown as follows) that check a range of numbers and count how many prime numbers are in this range:

function...
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 £16.99/month. Cancel anytime