![\"future\"](\"https:\/\/www.modernescpp.com\/wp-content\/uploads\/2018\/08\/future.jpg\")
<\/p>\nI this post I give an introduction to the rules for generic programming in C++. Generic programming is, from my point of view, the outstanding feature and the future of C++. Hence it follows that this and the upcoming posts are about the future of C++.<\/p>\n
<\/p>\n
<\/p>\n
<\/p>\n
First, I use the terms templates and generic programming, whatever fits best. Of course, I know that templates are just a way to write generic code. I assume you know what templates in C++ are, but you don’t know what generic programming means. Here is my favorite definition from Wikipedia.<\/a><\/p>\n The rules to templates are about the current C++17 and the upcoming C++20 standard. Of course, I assume that we will get concepts with C++20. In sum, there are 100 rules to concepts, template interfaces, template definitions, template hierarchies, variadic templates, and template metaprogramming. The first five rules are pretty general.<\/p>\n In the examples, concepts are often commented on. If you want to try them out, comment them in and use at least a GCC 6.1 compiler with the flag Concepts are predicates on templates that are evaluated at compile time. They should model semantic categories such as Maybe, you are puzzled by the difference between semantic categories and syntactic restrictions. The first rule helps to distinguish both terms.<\/p>\n Here is the example from the guidelines, but I called the second concept <\/p>\n What is wrong with both concepts? Both concepts are too specific. Both concepts are based on specific operations, such as the increment and the + operation. Let’s go one step further from the syntactic constraints to the semantic category <\/p>\n <\/p>\n Now, the algorithm has minimal requirements. Hold: the algorithm is better but not good. It only works on a <\/p>\n <\/p>\n Now, it’s fine. Maybe you prefer a more concise definition of the sum. Instead of the keyword typename, I use the concepts directly.<\/p>\n <\/p>\n<\/p>\n When you study the first overload of <\/p>\n The types of Iterators are encoded in their names: Let me use the iterator concept directly:<\/p>\n <\/p>\n Okay. It’s pretty obvious to make a container generic. For example, here is a <\/p>\n <\/p>\n Okay, fine, but when is a user-defined type The document states that a type T is called regular if it defines the following operations:<\/p>\n The equality, inequality, and ordering operation on T could be defined component-wise.<\/p>\n My original plan was to write about rule 5: T.5: Combine generic and OO techniques to amplify their strengths, not their costs.<\/a> I changed my plan because rule 5 is relatively short and mentioned type erasure as a use-case for this technique. Type erasure is a technique to represent various concrete types through a single interface. Type erasure with templates could not be explained in a few sentences; therefore, I will write in my next post<\/a> about this challenging technique.<\/p>\n <\/p><\/p>\n","protected":false},"excerpt":{"rendered":" I this post I give an introduction to the rules for generic programming in C++. Generic programming is, from my point of view, the outstanding feature and the future of C++. Hence it follows that this and the upcoming posts are about the future of C++.<\/p>\n","protected":false},"author":21,"featured_media":5494,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[372],"tags":[],"class_list":["post-5496","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-modern-c"],"_links":{"self":[{"href":"https:\/\/www.modernescpp.com\/index.php\/wp-json\/wp\/v2\/posts\/5496","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.modernescpp.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.modernescpp.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.modernescpp.com\/index.php\/wp-json\/wp\/v2\/users\/21"}],"replies":[{"embeddable":true,"href":"https:\/\/www.modernescpp.com\/index.php\/wp-json\/wp\/v2\/comments?post=5496"}],"version-history":[{"count":0,"href":"https:\/\/www.modernescpp.com\/index.php\/wp-json\/wp\/v2\/posts\/5496\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.modernescpp.com\/index.php\/wp-json\/wp\/v2\/media\/5494"}],"wp:attachment":[{"href":"https:\/\/www.modernescpp.com\/index.php\/wp-json\/wp\/v2\/media?parent=5496"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.modernescpp.com\/index.php\/wp-json\/wp\/v2\/categories?post=5496"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.modernescpp.com\/index.php\/wp-json\/wp\/v2\/tags?post=5496"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}\n
\n
-fconcepts<\/code> or an online compiler: constraints and concepts.<\/a><\/p>\nNumber, <\/code>Callable, Iterator<\/code> or Range<\/code> but not syntactic restrictions such as HasPlus,<\/code> or IsInvocable. <\/code>Here are more details of concepts.<\/a><\/p>\nT.1: Use templates to raise the level of abstraction of code<\/a><\/h2>\n
Addable. <\/code><\/p>\n\ntemplate<\/span><<\/span>typename<\/span> T><\/span>\r\n \/\/ requires Incrementable<T><\/span>\r\nT sum1(vector<<\/span>T>&<\/span> v, T s)\r\n{\r\n for<\/span> (auto<\/span> x :<\/span> v) s +=<\/span> x;\r\n return<\/span> s;\r\n}\r\n\r\ntemplate<\/span><<\/span>typename<\/span> T><\/span>\r\n \/\/ requires Addable<T><\/span>\r\nT sum2(vector<<\/span>T>&<\/span> v, T s)\r\n{\r\n for<\/span> (auto<\/span> x :<\/span> v) s =<\/span> s +<\/span> x;\r\n return<\/span> s;\r\n}\r\n<\/pre>\n<\/div>\nArithmetic.<\/code><\/p>\n\ntemplate<\/span><<\/span>typename<\/span> T><\/span>\r\n \/\/ requires Arithmetic<T><\/span>\r\nT sum(const vector<<\/span>T>&<\/span> v, T s)\r\n{\r\n for<\/span> (auto<\/span> x :<\/span> v) s +=<\/span> x;\r\n return<\/span> s;\r\n}\r\n<\/pre>\n<\/div>\nstd::vector<\/code>. It’s generic on the type of the container but not on the container. Let me generalize the sum algorithm once more.<\/p>\n\ntemplate<\/span><<\/span>typename<\/span> Cont, typename<\/span> T><\/span>\r\n \/\/ requires Container<Cont><\/span>\r\n \/\/ && Arithmetic<T><\/span>\r\nT sum(const Cont&<\/span> v, T s)\r\n{\r\n for<\/span> (auto<\/span> x :<\/span> v) s +=<\/span> x;\r\n return<\/span> s;\r\n}\r\n<\/pre>\n<\/div>\n\ntemplate<\/span><<\/span>Container Cont, Arithmetic T><\/span>\r\nT sum(const Cont&<\/span> cont, T s){\r\n for<\/span> (auto<\/span> x :<\/span> cont) s +=<\/span> x;\r\n return<\/span> s;\r\n}\r\n<\/pre>\n<\/div>\nT.2: Use templates to express algorithms that apply to many argument types<\/a><\/h2>\n
std::find<\/code> at cppreference.com,<\/a> it looks like this:<\/p>\n\ntemplate<\/span><<\/span> class<\/span> InputIt<\/span>, class<\/span> T<\/span> ><\/span>\r\nInputIt find( InputIt first, InputIt last, const<\/span> T&<\/span> value );\r\n<\/pre>\n<\/div>\nInputIt<\/code> stands for input iterator and means that the iterator can read from the pointed-to element. There are two issues with this declaration:<\/p>\n\n
\ntemplate<\/span><<\/span>Input_iterator Iter, typename<\/span> Val><\/span>\r\n \/\/ Equality_comparable<Value_type<Iter>, Val><\/span>\r\nIter find(Iter b, Iter e, Val v)\r\n{\r\n \/\/ ...<\/span>\r\n}\r\n<\/pre>\n<\/div>\nT.3: Use templates to express containers and ranges<\/a><\/h2>\n
Vector.<\/code><\/p>\n\ntemplate<\/span><<\/span>typename<\/span> T><\/span>\r\n \/\/ requires Regular<T><\/span>\r\nclass<\/span> Vector<\/span> {\r\n \/\/ ...<\/span>\r\n T*<\/span> elem; \/\/ points to sz Ts<\/span>\r\n int<\/span> sz;\r\n};\r\n\r\nVector<<\/span>double<\/span>><\/span> v(10<\/span>);\r\nv[7<\/span>] =<\/span> 9.9<\/span>;\r\n<\/pre>\n<\/div>\nT<\/code> regular? The document Fundamentals of Generic Programming defines a type T regular if it behaves like a built-in type such as bool,<\/code> int,<\/code> or double.<\/code> I should mention it. The paper Fundamentals of Generic Programming is from James C. Dehnert and Alexander Stepanow. I assume you already know Alexander Stephanow by name. He is the well-known father of the Standard Template Library.<\/p>\n![\"regular\"](\"https:\/\/www.modernescpp.com\/wp-content\/uploads\/2018\/08\/regular.png\")
<\/p>\nWhat’s next?<\/h2>\n