Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases now! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
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
Learning Functional Data Structures and Algorithms

You're reading from   Learning Functional Data Structures and Algorithms Learn functional data structures and algorithms for your applications and bring their benefits to your work now

Arrow left icon
Product type Paperback
Published in Feb 2017
Publisher Packt
ISBN-13 9781785888731
Length 318 pages
Edition 1st Edition
Languages
Arrow right icon
Authors (2):
Arrow left icon
Raju Kumar Mishra Raju Kumar Mishra
Author Profile Icon Raju Kumar Mishra
Raju Kumar Mishra
Atul S. Khot Atul S. Khot
Author Profile Icon Atul S. Khot
Atul S. Khot
Arrow right icon
View More author details
Toc

Table of Contents (14) Chapters Close

Preface 1. Why Functional Programming? 2. Building Blocks FREE CHAPTER 3. Lists 4. Binary Trees 5. More List Algorithms 6. Graph Algorithms 7. Random Access Lists 8. Queues 9. Streams, Laziness, and Algorithms 10. Being Lazy - Queues and Deques 11. Red-Black Trees 12. Binomial Heaps 13. Sorting

Strict versus lazy


Consider the operation of zipping up two lists. The zip method pairs elements from the first list with the elements from the second list. Here is a sample run:

scala> List(1,2,3).zip(List(4,5,6,7)) 
res8: List[(Int, Int)] = List((1,4), (2,5), (3,6)) 
 
scala> List(1,2,3).zip(Nil) 
res9: List[(Int, Nothing)] = List() 

All the elements of both the lists are visited to create a zipped list. The following figure shows the zip operation in action:

As another example of strict evaluation, consider the reverse method of List:

scala> List(1,2,3).reverse 
res11: List[Int] = List(3, 2, 1) 

The reverse method also visits all the elements of the list. On the other hand, consider the following:

scala> val q = List.range(1, 1000000).view.reverse 
q: scala.collection.SeqView[Int,List[Int]] = SeqViewR(...) 
 
scala> (q take 10) foreach println 
999999 
999998 
999997 
... 

Only the first 10 elements of the lazy lists are computed on demand.

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