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
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Learning Boost C++

You're reading from   Learning Boost C++ Solve practical programming problems using powerful, portable, and expressive libraries from Boost

Arrow left icon
Product type Paperback
Published in Jul 2015
Publisher
ISBN-13 9781783551217
Length 558 pages
Edition 1st Edition
Languages
Tools
Arrow right icon
Author (1):
Arrow left icon
Arindam Mukherjee Arindam Mukherjee
Author Profile Icon Arindam Mukherjee
Arindam Mukherjee
Arrow right icon
View More author details
Toc

Table of Contents (14) Chapters Close

Preface 1. Introducing Boost FREE CHAPTER 2. The First Brush with Boost's Utilities 3. Memory Management and Exception Safety 4. Working with Strings 5. Effective Data Structures beyond STL 6. Bimap and Multi-index Containers 7. Higher Order and Compile-time Programming 8. Date and Time Libraries 9. Files, Directories, and IOStreams 10. Concurrency with Boost 11. Network Programming Using Boost Asio A. C++11 Language Features Emulation Index

Domain Specific Embedded Languages


In the last third of this chapter, we look at the applications of higher order and compile-time programming mainly in the area Domain Specific Embedded Languages.

Lazy evaluation

In C++, when we see the following code:

z = x + y();

We know that the value of z is immediately computed when the control reaches past the statement z = x + y(). In fact, the act of computing the sum involves evaluating the expressions x and y() themselves. Here, y is presumably a function or a functor instance, so the call to y() will in turn trigger more evaluations. Irrespective of whether z is ever used for anything later, its value would still be computed. This is the model of eager evaluation that a lot of programming languages follow. The actual story is slightly more complex because compilers can reorder and optimize away computations but there is little control the programmer has on the process.

What if we could defer the evaluation of such expressions and any of their sub...

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