Laziness in C++
Date
2015
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Producer
Director
Performer
Choreographer
Costume Designer
Music
Videographer
Lighting Designer
Set Designer
Crew Member
Funder
Rehearsal Director
Concert Coordinator
Advisor
Moderator
Panelist
Alternative Title
Department
Haverford College. Department of Computer Science
Type
Thesis
Original Format
Running Time
File Format
Place of Publication
Date Span
Copyright Date
Award
Language
eng
Note
Table of Contents
Terms of Use
Rights Holder
Access Restrictions
Dark Archive
Terms of Use
Tripod URL
Identifier
Abstract
The goal of this thesis is to create a suitable standard for evaluating lazy evaluation techniques, and to use this standard to compare existing methods of lazy evaluation in C++. For our standard we will create a rigorous definition of what lazy evaluation should entail, and a set of varied benchmarks to test the efficiency of these distinct approaches. The methods we will analyze will include techniques using template meta programming, operator overloading coupled with unique object creation, and C++ 11 lambda expressions. We will also take into account existing libraries such as Boost and FC++. Our thesis should be able to act as a resource to correctly select the optimal method for lazy evaluation in C++ given a specific problem. This paper will also make some comments on the evolution of lazy evaluation approaches in C++, and thus provide an appropriate segueway to it's sister paper, which tackles the best ways of implementing laziness in a language, and how C++ compares to other languages in this respect.