Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Swift High Performance

You're reading from   Swift High Performance Leverage Swift and enhance your code to take your applications to the next level

Arrow left icon
Product type Paperback
Published in Nov 2015
Publisher Packt
ISBN-13 9781785282201
Length 212 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Kostiantyn Koval Kostiantyn Koval
Author Profile Icon Kostiantyn Koval
Kostiantyn Koval
Arrow right icon
View More author details
Toc

Table of Contents (10) Chapters Close

Preface 1. Exploring Swift's Power and Performance FREE CHAPTER 2. Making a Good Application Architecture in Swift 3. Testing and Identifying Slow Code with the Swift Toolkit 4. Improving Code Performance 5. Choosing the Correct Data Structure 6. Architecting Applications for High Performance 7. The Importance of Being Lazy 8. Discovering All the Underlying Swift Power Index

Lazy collections and evaluation


Another very interesting place where we could perform work lazily is collections and sequences. We store many elements in them, and sometimes, performing an operation such as filter or map would take a lot of time and may be unnecessary.

Before we dig into the details, let's first check out a small example to see why working lazily with a collection is so useful. We have a collection. We want to perform an operation such as mapping on it, and get one or a few elements from the result. Here is how we would implement it using an array:

let numbers = Array(1...1_000_000) 
let doubledNumbers = numbers.map { $0 * 2 }
doubledNumbers.last

When we call the map method on the numbers array, it applies it to every element in the array and returns the new mapped array. As a result, we get a new doubledNumbers array. Our map { $0 * 2 } closure is called as many times as there are elements in the array; in our case, it is 1,000,000 times. But we need only the last element...

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 $19.99/month. Cancel anytime
Banner background image