Book Image

The C++ Workshop

By : Dale Green, Kurt Guntheroth, Shaun Ross Mitchell
Book Image

The C++ Workshop

By: Dale Green, Kurt Guntheroth, Shaun Ross Mitchell

Overview of this book

C++ is the backbone of many games, GUI-based applications, and operating systems. Learning C++ effectively is more than a matter of simply reading through theory, as the real challenge is understanding the fundamentals in depth and being able to use them in the real world. If you're looking to learn C++ programming efficiently, this Workshop is a comprehensive guide that covers all the core features of C++ and how to apply them. It will help you take the next big step toward writing efficient, reliable C++ programs. The C++ Workshop begins by explaining the basic structure of a C++ application, showing you how to write and run your first program to understand data types, operators, variables and the flow of control structures. You'll also see how to make smarter decisions when it comes to using storage space by declaring dynamic variables during program runtime. Moving ahead, you'll use object-oriented programming (OOP) techniques such as inheritance, polymorphism, and class hierarchies to make your code structure organized and efficient. Finally, you'll use the C++ standard library?s built-in functions and templates to speed up different programming tasks. By the end of this C++ book, you will have the knowledge and skills to confidently tackle your own ambitious projects and advance your career as a C++ developer.
Table of Contents (15 chapters)

Creating a Generic Queue

Armed with this new template knowledge, we can now attempt to create something practical. In coming chapters, we will cover the containers from the STL, but before that, it is useful to have an idea of how some of them may work on a simpler level. Then, if thesituation arises that one of them is not quite right for our needs, we can write something more suited to us that still gives us the nice-to-use interface of the STL.

What Is a Queue?

We can define a queue as a container with a first in, first out (FIFO) data structure. Elements are inserted at the back and deleted from the front. Queues are useful for many things, such as scheduling tasks that can be acted upon and then removed. Think of queues just like when you queue in a shop. If you are first in the queue, then you will be served first.

For our example, we will be basing our queue on the STL queue and trying to implement everything that it provides already. That being said, the STL queue...