Although rule T.11 states: Whenever possible, use standard concepts you sometimes have to define your concepts. This post gives you rules to do it.
The C++ core guidelines have nine rules for defining concepts. Seven of them have content. Here are the first four for today.
- T.20: Avoid “concepts” without meaningful semantics
- T.21: Require a complete set of operations for a concept
- T.22: Specify axioms for concepts
- T.23: Differentiate a refined concept from its more general case by adding new use patterns
Let’s see how to define concepts
This rule is quite obvious, but what does meaningful semantic mean? Meaningful semantics are not just simple constraints such as
has_plus but concepts such as
For example, the following concept
has_plus and is, therefore, also fulfilled by a string.
I assume this was not your intention because the function template
algo should accept arguments that model numbers and not just Addable. The solution is quite simple. Define and use a concept
Number with a meaningful semantic.
Now the invocation of
algo with a string would give an error. The next rule is a particular case of this rule.
First of all, what is a complete set of operations? Here are two complete sets for
+, -, *, /, +=, -=, *=, /=
<, >, <=, >=, ==, !=
Do you want to know what the acronym POLA stands for? It stands for Principle Of Least Astonishment. You can easily break this principle of good software design if you implement just a partial set of operations.
Here is an auspicious example from the guidelines. The concept
Minimal in this case, supports
==, < and
First of all: What is an axiom? Here is my definition from Wikipedia:
- An axiom or postulate is a statement that is taken to be true, to serve as a premise or starting point for further reasoning and arguments.
Because C++ does not support axioms, you must express them with comments. If C++ does support them in the future, you can remove the comment symbol
// in front of the axiom in the following example.
The axiom means, in this case, that the number follows the mathematical rules. In contrast, the concept requires that a Number has to support the binary operations
+, -, *, and
/ and that the result is convertible to
T. T is the type of argument.
If two concepts have the same requirements, they are logically equivalent. This means the compiler can’t distinguish them and may not automatically choose the correct one during overload resolution.
To make the rule clear, here is a simplified version of the concept
BidirectionalIterator and the refined concept
std::advance(i, n) increments a given iterator i by n elements. Depending on the value of
n, the iterator is
incremented or decremented. When the iterator
i is bidirectional iterator
, std::advance has to step
n times one element forward or backward. But when the iterator i is a random access iterator, just
n is added to the iterator.
In the case of the
std::vector<int>, vec.begin() returns a random access iterator and, therefore, the fast variant of
std::advance is used.
Each container of the STL creates an iterator specific to its structure. Here is the overview:
Three rules to the definition of concepts are left. In particular, the following rule, “T.24: Use tag classes or traits to differentiate concepts that differ only in semantics.” sounds pretty attractive. Let’s see in the next post what a tag class or traits class is.
Thanks a lot to my Patreon Supporters: Matt Braun, Roman Postanciuc, Tobias Zindl, G Prvulovic, Reinhold Dröge, Abernitzke, Frank Grimm, Sakib, Broeserl, António Pina, Sergey Agafyin, Андрей Бурмистров, Jake, GS, Lawton Shoemake, Jozo Leko, John Breland, Venkat Nandam, Jose Francisco, Douglas Tinkham, Kuchlong Kuchlong, Robert Blanch, Truels Wissneth, Kris Kafka, Mario Luoni, Friedrich Huber, lennonli, Pramod Tikare Muralidhara, Peter Ware, Daniel Hufschläger, Alessandro Pezzato, Bob Perry, Satish Vangipuram, Andi Ireland, Richard Ohnemus, Michael Dunsky, Leo Goodstadt, John Wiederhirn, Yacob Cohen-Arazi, Florian Tischler, Robin Furness, Michael Young, Holger Detering, Bernd Mühlhaus, Matthieu Bolt, Stephen Kelley, Kyle Dean, Tusar Palauri, Dmitry Farberov, Juan Dent, George Liao, Daniel Ceperley, Jon T Hess, Stephen Totten, Wolfgang Fütterer, Matthias Grün, Phillip Diekmann, Ben Atakora, Ann Shatoff, Rob North, Bhavith C Achar, Marco Parri Empoli, moon, and Philipp Lenk.
Thanks, in particular, to Jon Hess, Lakshman, Christian Wittenhorst, Sherhy Pyton, Dendi Suhubdy, Sudhakar Belagurusamy, Richard Sargeant, Rusty Fleming, John Nebel, Mipko, Alicja Kaminska, Slavko Radman, and David Poole.
|My special thanks to Embarcadero|
|My special thanks to PVS-Studio|
|My special thanks to Tipi.build|
|My special thanks to Take Up Code|
|My special thanks to SHAVEDYAKS|
I’m happy to give online seminars or face-to-face seminars worldwide. Please call me if you have any questions.
- Embedded Programmierung mit modernem C++ 12.12.2023 – 14.12.2023 (Präsenzschulung, Termingarantie)
Standard Seminars (English/German)
Here is a compilation of my standard seminars. These seminars are only meant to give you a first orientation.
- C++ – The Core Language
- C++ – The Standard Library
- C++ – Compact
- C++11 and C++14
- Concurrency with Modern C++
- Design Pattern and Architectural Pattern with C++
- Embedded Programming with Modern C++
- Generic Programming (Templates) with C++
- Clean Code with Modern C++
- Phone: +49 7472 917441
- Mobil:: +49 176 5506 5086
- Mail: schulung@ModernesCpp.de
- German Seminar Page: www.ModernesCpp.de
- Mentoring Page: www.ModernesCpp.org
Modernes C++ Mentoring,