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
Hands-On Design Patterns with Delphi

You're reading from   Hands-On Design Patterns with Delphi Build applications using idiomatic, extensible, and concurrent design patterns in Delphi

Arrow left icon
Product type Paperback
Published in Feb 2019
Publisher Packt
ISBN-13 9781789343243
Length 476 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. Section 1: Design Pattern Essentials FREE CHAPTER
2. Introduction to patterns 3. Section 2: Creational Patterns
4. Singleton, Dependency Injection, Lazy Initialization, and Object Pool 5. Factory Method, Abstract Factory, Prototype, and Builder 6. Section 3: Structural Patterns
7. Composite, Flyweight, Marker Interface, and Bridge 8. Adapter, Proxy, Decorator, and Facade 9. Section 4: Behavioral Patterns
10. Nullable Value, Template Method, Command, and State 11. Iterator, Visitor, Observer, and Memento 12. Section 5: Concurrency Patterns
13. Locking patterns 14. Thread pool, Messaging, Future and Pipeline 15. Section 6: Miscellaneous Patterns
16. Designing Delphi Programs 17. Other Kinds of Patterns 18. Other Books You May Enjoy

Patterns are useful

This is not a book about the theory behind patterns; rather, this book focuses on the aspects of their implementation. Before I scare you all off with all this talk about design patterns, their history, modern advances, anti-patterns, and so on, I have decided to present a very simple pattern using an example. A few lines of code should explain why a pattern—based approach to problem solving can be a good thing.

In the code archive for this chapter, you'll find a simple console application called DesignPatternExample. Inside, you'll find an implementation of a sparse array, as shown in the following code fragment:

type
TSparseRec = record
IsEmpty: boolean;
Value : integer;
end;

TSparseArray = TArray<TSparseRec>;

Each array index can either be empty (in which case IsEmpty will be set to True), or it can contain a value (in which case...

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