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)

Sets/Multisets

A set is an associative container just like a map, and, just like a map, every key is unique; it cannot have multiples of the same key. The difference with a set is that it is not a container for key-value pairs. It is essentially a container of unique keys, like a vector in which each element in the vector is unique. Once an element is added to a set, it cannot be modified; but it can be removed from the set. A multiset behaves just like a set except for allowing multiple non-unique keys.

Constructors

When constructing a set, we can also pass in the comparator used to sort the set. A comparator is a function that's used to decide how elements are to be ordered in the set. The following are a selection of constructors to use for sets and multisets (only sets are shown, for brevity):

  • set();: Default empty set
  • set(const key_compare& comp);: Empty set with the chosen comparison object
  • set(const set& x);: Copy constructor
  • template...