├── .editorconfig ├── .gitignore ├── ClassInClass └── ClassInClass.cpp ├── Factorial └── Factorial.cpp ├── Inheritance └── CheckInheritance.cpp ├── LICENSE ├── Matrix ├── BestMatrix.cpp ├── BetterVector.cpp └── SimpleVector.cpp ├── PowerSet ├── PowerSet.cpp └── RunTimePowerSet.cpp ├── Presentation.pdf ├── README.md ├── StaticAssert ├── BestSA.cpp ├── SimplestSA.cpp └── TrivialTemplateSA.cpp ├── TemplateSpecialization ├── FullTemplateSpec.cpp ├── IsPointer.cpp ├── PartialTemplateSpec.cpp └── Tuple.cpp ├── TypeList ├── BasicTypeList.cpp ├── TL_Append.cpp ├── TL_Index.cpp └── TypeList.cpp ├── TypeSelection └── Select.cpp └── index.html /.editorconfig: -------------------------------------------------------------------------------- 1 | [*] 2 | 3 | indent_style = tab 4 | indent_size = 4 5 | 6 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | # Compiled Object files 2 | *.slo 3 | *.lo 4 | *.o 5 | *.obj 6 | 7 | # Precompiled Headers 8 | *.gch 9 | *.pch 10 | 11 | # Compiled Dynamic libraries 12 | *.so 13 | *.dylib 14 | *.dll 15 | 16 | # Fortran module files 17 | *.mod 18 | *.smod 19 | 20 | # Compiled Static libraries 21 | *.lai 22 | *.la 23 | *.a 24 | *.lib 25 | 26 | # Executables 27 | *.exe 28 | *.out 29 | *.app 30 | -------------------------------------------------------------------------------- /ClassInClass/ClassInClass.cpp: -------------------------------------------------------------------------------- 1 | /* Compiled with: 2 | g++ ClassInClass.cpp -o ClassInClass.out 3 | */ 4 | 5 | #include 6 | #include 7 | 8 | //A class with a function that can print out 9 | //messages given to it by it's internal classes 10 | class Printer { 11 | private: 12 | 13 | //A class that has a function 14 | //that returns "Hello World!" 15 | class GetHi { 16 | public: std::string getHi() { return std::string("Hello World!"); } 17 | }; 18 | 19 | public: 20 | 21 | //Print "Hello World!" 22 | void pntMsg() { 23 | 24 | //Make a GetHi 25 | GetHi tmp; 26 | 27 | //Print "Hello World!" 28 | std::cout << tmp.getHi() << std::endl; 29 | } 30 | }; 31 | 32 | //Main function 33 | int main() { 34 | 35 | //Make a printer 36 | Printer p; 37 | 38 | //Print Hello World! 39 | p.pntMsg(); 40 | 41 | //Success 42 | return 0; 43 | } 44 | -------------------------------------------------------------------------------- /Factorial/Factorial.cpp: -------------------------------------------------------------------------------- 1 | /* Compiled with: 2 | g++ Factorial.cpp -Ofast -o Factorial.out 3 | */ 4 | 5 | 6 | #include 7 | 8 | // Template Meta, recursive function 9 | template struct _Factorial { 10 | enum { value = N * _Factorial::value }; 11 | }; 12 | 13 | //Base case 14 | template <> struct _Factorial<0> { 15 | enum { value = 1 }; 16 | }; 17 | 18 | 19 | // Factorial Wrapper 20 | #define factorial(x) _Factorial::value 21 | 22 | 23 | //Main function 24 | int main() { 25 | 26 | //Print out factorial examples 27 | std::cout << "Factorial(0) = " << factorial(0) << std::endl; 28 | std::cout << "Factorial(1) = " << factorial(1) << std::endl; 29 | std::cout << "Factorial(4) = " << factorial(4) << std::endl; 30 | std::cout << "Factorial(8) = " << factorial(8) << std::endl; 31 | 32 | //Success 33 | return 0; 34 | } 35 | -------------------------------------------------------------------------------- /Inheritance/CheckInheritance.cpp: -------------------------------------------------------------------------------- 1 | /* Compiled with 2 | g++ CheckInheritance.cpp -pedantic -Werror -std=c++11 -o CheckInheritance.out 3 | */ 4 | 5 | #include 6 | #include 7 | 8 | 9 | /****************************************************************/ 10 | /* */ 11 | /* Template Meta */ 12 | /* */ 13 | /****************************************************************/ 14 | 15 | 16 | // A macro wrapper 17 | #define is_subclass(x, y) ( (bool) CheckInheritance::result ) 18 | 19 | /* The CheckInheritance class works as follows: First off, let's begin 20 | * with static Testing MakeTesting(). The reason for this is simple. 21 | * We wish to call sizeof on a Testing. To do this, we could call 22 | * sizeof(Testing()). But we do not know if Testing has a default 23 | * constructor, so this could fail. However, since sizeof does not 24 | * evaluate (most) anything, we can call sizeof(MakeTesting()). sizeof 25 | * will notice that MakeTesting will return a Testing, and thus will 26 | * return the size of a Testing. Now, if Testing is a sub-class of 27 | * Super, then the function static IsConvertible Test( const Super& ) 28 | * can be used as it takes in a super. The return value of this function 29 | * is an IsConvertible. In the enum below, we compare the sizeof an 30 | * IsConvertible to the size of the result of our Test function. Thus, 31 | * if Testing is a subclass of Super, they shall match and result will 32 | * equal one. If however Testing is not a subclass of Super, the first 33 | * Test function will fail. Do to SFINAE, this is not an error, and so 34 | * our second, ellipsis, Test function will be used. This returns a 35 | * NotConvertible. You will note below that we defined IsConvertible 36 | * and NotConvertible specifically to be two different sizes. Thus, 37 | * the sizes of will not match in the comparison in the enum, and 38 | * result will be false. 39 | */ 40 | 41 | 42 | // A class used to check to see if Testing is a subclass of Super 43 | // This class makes the assumption that a class is its own subclass. 44 | template class CheckInheritance { 45 | 46 | // Two different sized classes 47 | typedef char IsConvertible; 48 | class NotConvertible { char IsConvertible[64]; }; 49 | 50 | // Two different test functions 51 | static IsConvertible Test( const Super & ); 52 | static NotConvertible Test( ... ); 53 | 54 | // Returns a Testing 55 | static Testing MakeTesting(); 56 | public: 57 | 58 | // Check to see if a Testing is a subclass of Super 59 | enum { result = ( sizeof( Test( MakeTesting() ) ) == sizeof(IsConvertible) ) }; 60 | }; 61 | 62 | 63 | /****************************************************************/ 64 | /* */ 65 | /* Test classes */ 66 | /* */ 67 | /****************************************************************/ 68 | 69 | 70 | // An extendable class 71 | class Mammal {}; 72 | 73 | // A subclass of Mammal 74 | class Human: public Mammal {}; 75 | 76 | // Not a subclass of Mammal 77 | class Guitar {}; 78 | 79 | 80 | /****************************************************************/ 81 | /* */ 82 | /* Main function */ 83 | /* */ 84 | /****************************************************************/ 85 | 86 | 87 | // Main function 88 | int main() { 89 | 90 | // Print booleans as strings 91 | std::cout << std::boolalpha; 92 | 93 | // Check to see if a human is a mammal 94 | std::cout << "It is " << is_subclass(Human, Mammal) 95 | << " that a human is a mammal" << std::endl; 96 | 97 | // Check to see if a guitar is a mammal 98 | std::cout << "It is " << is_subclass(Guitar, Mammal) 99 | << " that a guitar is a mammal" << std::endl; 100 | 101 | // Success 102 | return EXIT_SUCCESS; 103 | } 104 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | {project} Copyright (C) {year} {fullname} 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /Matrix/BestMatrix.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | 4 | /****************************************************************/ 5 | /* */ 6 | /* General */ 7 | /* */ 8 | /****************************************************************/ 9 | 10 | 11 | //Empty type 12 | class NullType {}; 13 | 14 | //A container that converts an int to a distinct type, with a value 15 | template struct intc { enum { value = N }; }; 16 | 17 | 18 | /****************************************************************/ 19 | /* */ 20 | /* List */ 21 | /* */ 22 | /****************************************************************/ 23 | 24 | 25 | //Macro wrapper around List, V is the name of the variable defines 26 | #define makeList(...) make_list<__VA_ARGS__>::result 27 | 28 | //Macro wrapper around ListGet 29 | #define get(T, N) ListGet::result 30 | 31 | 32 | //A list of types 33 | template struct List { 34 | typedef U Tail; 35 | typedef T Head; 36 | enum { size = Tail::size + 1 }; 37 | }; 38 | template struct List { 39 | typedef NullType Tail; 40 | typedef T Head; 41 | enum { size = 1 }; 42 | }; 43 | 44 | //Make a list of types 45 | template struct make_list { 46 | typedef List::result > result; 47 | }; 48 | template struct make_list { 49 | typedef List result; 50 | }; 51 | 52 | //Get the n'th item of the list 53 | template struct ListGet { 54 | typedef typename ListGet::result result; 55 | }; 56 | template struct ListGet { 57 | typedef typename T::Head result; 58 | }; 59 | 60 | 61 | /****************************************************************/ 62 | /* */ 63 | /* For Error Checking */ 64 | /* */ 65 | /****************************************************************/ 66 | 67 | 68 | #define CHECK_LEGAL(A, B) \ 69 | static_assert(A::size > 0, "Error, invalid type passed in"); \ 70 | static_assert(A::size == B::size, "Error, cannot take dot product " \ 71 | "of different sized vectors"); 72 | 73 | 74 | /****************************************************************/ 75 | /* */ 76 | /* Dot Product */ 77 | /* */ 78 | /****************************************************************/ 79 | 80 | 81 | //Dot product wrapper 82 | #define dotProd(A, B) dotProd::result 83 | 84 | 85 | //Dot product 86 | template struct dotProd { 87 | 88 | //Check for errors 89 | CHECK_LEGAL(A, B); 90 | 91 | //Multiply the heads then recurse with the tails. 92 | enum { result = A::Head::value * B::Head::value + dotProd::result }; 93 | }; 94 | 95 | //Called when the end of the lists have been hit 96 | template <> struct dotProd { enum { result = 0 }; }; 97 | 98 | 99 | /****************************************************************/ 100 | /* */ 101 | /* Vector Operations */ 102 | /* */ 103 | /****************************************************************/ 104 | 105 | 106 | //Wrapper around Add_vectors 107 | #define AddVectors(A, B) Add_vectors::result 108 | 109 | //Add vectors together 110 | template struct Add_vectors { 111 | 112 | //Check for errors 113 | CHECK_LEGAL(A, B); 114 | 115 | //Add the vectors together 116 | typedef List< intc, 117 | typename Add_vectors::result > result; 118 | }; 119 | template <> struct Add_vectors { 120 | typedef NullType result; 121 | }; 122 | 123 | 124 | /****************************************************************/ 125 | /* */ 126 | /* Matrix Operations */ 127 | /* */ 128 | /****************************************************************/ 129 | 130 | 131 | //Wrap add matrices 132 | #define AddMatrices(A, B) Add_matrices::result 133 | 134 | //Add two matrices 135 | template struct Add_matrices { 136 | 137 | //Check for errors 138 | CHECK_LEGAL(A, B); 139 | 140 | //Add the vectors 141 | typedef List< typename AddVectors(typename A::Head, typename B::Head), 142 | typename Add_matrices::result > result; 143 | }; 144 | template <> struct Add_matrices { 145 | typedef NullType result; 146 | }; 147 | 148 | 149 | /****************************************************************/ 150 | /* */ 151 | /* For vector printing */ 152 | /* */ 153 | /****************************************************************/ 154 | 155 | 156 | //Print wrapper 157 | #define pntV(V) { \ 158 | std::cout << #V << " = [ "; \ 159 | if (V::size) printVectorHelper(); \ 160 | std::cout << "]" << std::endl; \ 161 | } 162 | 163 | 164 | //Print a vector 165 | template void printVectorHelper() { 166 | std::cout << get(V, 0)::value << (V::size > 1 ? ", ":" "); 167 | printVectorHelper(); 168 | } 169 | 170 | //Called when there is nothing left to print 171 | template<> void printVectorHelper() {} 172 | 173 | 174 | /****************************************************************/ 175 | /* */ 176 | /* For matrix printing */ 177 | /* */ 178 | /****************************************************************/ 179 | 180 | 181 | //Print wrapper 182 | #define pntM(V) { \ 183 | std::cout << #V << ":\n"; \ 184 | if (V::size) printMatrixHelper(); \ 185 | std::cout << std::endl; \ 186 | } 187 | 188 | //Print a vector 189 | template void printMatrixHelper() { 190 | std::cout << " [ "; 191 | if (V::size) printVectorHelper(); 192 | std::cout << "]" << std::endl; 193 | printMatrixHelper(); 194 | } 195 | 196 | //Called when there is nothing left to print 197 | template<> void printMatrixHelper() {} 198 | 199 | 200 | /****************************************************************/ 201 | /* */ 202 | /* Main */ 203 | /* */ 204 | /****************************************************************/ 205 | 206 | 207 | //Main function 208 | int main() { 209 | 210 | // One could even make this better by using a templated function to return a variable 211 | // In C++11 using hte using A = B syntax would also work! 212 | 213 | //Make matrix A 214 | typedef makeList(intc<1>, intc<2>, intc<3>) A1; 215 | typedef makeList(intc<4>, intc<5>, intc<6>) A2; 216 | typedef makeList(intc<7>, intc<8>, intc<9>) A3; 217 | typedef makeList(A1, A2, A3) A; 218 | 219 | //Make matrix B 220 | typedef makeList(intc<1>, intc<2>, intc<3>) B1; 221 | typedef makeList(intc<4>, intc<5>, intc<6>) B2; 222 | typedef makeList(intc<7>, intc<8>, intc<9>) B3; 223 | typedef makeList(B1, B2, B3) B; 224 | 225 | //Print A and B 226 | pntM(A); pntM(B); 227 | 228 | //Add the two matrices 229 | typedef AddMatrices(A, B) C; 230 | 231 | //Print C 232 | std::cout << "A + B:\n"; 233 | pntM(C); 234 | 235 | //Success 236 | return 0; 237 | } 238 | -------------------------------------------------------------------------------- /Matrix/BetterVector.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | 4 | /****************************************************************/ 5 | /* */ 6 | /* General */ 7 | /* */ 8 | /****************************************************************/ 9 | 10 | 11 | //Empty type 12 | class NullType {}; 13 | 14 | //A container that converts an int to a distinct type, with a value 15 | template struct intc { enum { value = N }; }; 16 | 17 | 18 | /****************************************************************/ 19 | /* */ 20 | /* List */ 21 | /* */ 22 | /****************************************************************/ 23 | 24 | 25 | //Macro wrapper around List, V is the name of the variable defines 26 | #define makeList(V, ...) typedef List<__VA_ARGS__> V 27 | 28 | //Macro wrapper around ListGet 29 | #define get(T, N) ListGet::result 30 | 31 | 32 | //A list of types 33 | template struct List { 34 | typedef List Tail; 35 | typedef T Head; 36 | enum { size = Tail::size + 1 }; 37 | }; 38 | template struct List { 39 | typedef NullType Tail; 40 | typedef T Head; 41 | enum { size = 1 }; 42 | }; 43 | 44 | 45 | //Get the n'th item of the list 46 | template struct ListGet { 47 | typedef typename ListGet::result result; 48 | }; 49 | template struct ListGet { 50 | typedef typename T::Head result; 51 | }; 52 | 53 | 54 | /****************************************************************/ 55 | /* */ 56 | /* Dot Product */ 57 | /* */ 58 | /****************************************************************/ 59 | 60 | 61 | //Dot product wrapper 62 | #define dotProd(A, B) dotProd::result 63 | 64 | 65 | //Dot product 66 | template struct dotProd { 67 | 68 | //Check for errors 69 | static_assert(T1::size > 0, "Error, invalid type passed in"); 70 | static_assert(T1::size == T2::size, "Error, cannot take dot product " 71 | "of different sized vectors"); 72 | 73 | //Multiply the heads then recurse with the tails. 74 | enum { result = T1::Head::value * T2::Head::value + dotProd::result }; 75 | }; 76 | 77 | //Called when the end of the lists have been hit 78 | template <> struct dotProd { enum { result = 0 }; }; 79 | 80 | 81 | /****************************************************************/ 82 | /* */ 83 | /* For vector printing */ 84 | /* */ 85 | /****************************************************************/ 86 | 87 | 88 | //Print wrapper 89 | #define pntV(V) { \ 90 | std::cout << #V << " = [ "; \ 91 | if (V::size) printVectorHelper(); \ 92 | std::cout << "]" << std::endl; \ 93 | } 94 | 95 | 96 | //Print a vector 97 | template void printVectorHelper() { 98 | std::cout << get(V, 0)::value << (V::size > 1 ? ", ":" "); 99 | printVectorHelper(); 100 | } 101 | 102 | //Called when there is nothing left to print 103 | template<> void printVectorHelper() {} 104 | 105 | 106 | /****************************************************************/ 107 | /* */ 108 | /* For matrix printing */ 109 | /* */ 110 | /****************************************************************/ 111 | 112 | 113 | //Print wrapper 114 | #define pntM(V) { \ 115 | std::cout << #V << ":\n"; \ 116 | if (V::size) printMatrixHelper(); \ 117 | std::cout << std::endl; \ 118 | } 119 | 120 | //Print a vector 121 | template void printMatrixHelper() { 122 | std::cout << " [ "; 123 | if (V::size) printVectorHelper(); 124 | std::cout << "]" << std::endl; 125 | printMatrixHelper(); 126 | } 127 | 128 | //Called when there is nothing left to print 129 | template<> void printMatrixHelper() {} 130 | 131 | 132 | /****************************************************************/ 133 | /* */ 134 | /* Main */ 135 | /* */ 136 | /****************************************************************/ 137 | 138 | 139 | //Main function 140 | int main() { 141 | 142 | //Make matrix A 143 | makeList(A1, intc<1>, intc<2>, intc<3>); 144 | makeList(A2, intc<4>, intc<5>, intc<6>); 145 | makeList(A3, intc<7>, intc<8>, intc<9>); 146 | makeList(A, A1, A2, A3); 147 | 148 | //Print the rows of A 149 | pntV(A1); pntV(A2); pntV(A3); 150 | std::cout << std::endl; 151 | 152 | //Print A 153 | pntM(A); 154 | 155 | //Dot product of the first and second row of A 156 | std::cout << "A1 • A2 = " << dotProd(A1, A2) << std::endl; 157 | 158 | //Success 159 | return 0; 160 | } 161 | -------------------------------------------------------------------------------- /Matrix/SimpleVector.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | 4 | /****************************************************************/ 5 | /* */ 6 | /* General */ 7 | /* */ 8 | /****************************************************************/ 9 | 10 | 11 | //Empty type 12 | class NullType {}; 13 | 14 | 15 | /****************************************************************/ 16 | /* */ 17 | /* intList */ 18 | /* */ 19 | /****************************************************************/ 20 | 21 | 22 | //Macro wrapper around intList, V is the name of the variable defines 23 | #define makeIntList(V, ...) typedef intList<__VA_ARGS__> V 24 | 25 | //Macro wrapper around intListGet 26 | #define get(T, N) intListGet::result 27 | 28 | 29 | //A vector of numbers 30 | template struct intList { 31 | typedef intList Tail; 32 | enum { Head = T, size = Tail::size + 1 }; 33 | }; 34 | template struct intList { 35 | typedef NullType Tail; 36 | enum { Head = T, size = 1 }; 37 | }; 38 | 39 | 40 | //Get the n'th item of the list 41 | template struct intListGet { 42 | enum { result = intListGet::result }; 43 | }; 44 | template struct intListGet { 45 | enum { result = T::Head }; 46 | }; 47 | 48 | 49 | /****************************************************************/ 50 | /* */ 51 | /* Dot Product */ 52 | /* */ 53 | /****************************************************************/ 54 | 55 | 56 | //Dot product wrapper 57 | #define dotProd(A, B) intDotProd::result 58 | 59 | 60 | //Dot product 61 | template struct intDotProd { 62 | 63 | //Check for errors 64 | static_assert(T1::size > 0, "Error, invalid type passed in"); 65 | static_assert(T1::size == T2::size, "Error, cannot take dot product " 66 | "of different sized vectors"); 67 | 68 | //Multiply the heads then recurse with the tails. 69 | enum { result = T1::Head * T2::Head + intDotProd::result }; 70 | }; 71 | 72 | //Called when the end of the lists have been hit 73 | template <> struct intDotProd { enum { result = 0 }; }; 74 | 75 | 76 | /****************************************************************/ 77 | /* */ 78 | /* For printing */ 79 | /* */ 80 | /****************************************************************/ 81 | 82 | 83 | //Print wrapper 84 | #define pnt(V) { \ 85 | std::cout << #V << " = [ "; \ 86 | if (V::size) printVectorHelper(); \ 87 | std::cout << "]" << std::endl; \ 88 | } 89 | 90 | 91 | //Print a vector 92 | template void printVectorHelper() { 93 | std::cout << get(V, 0) << (V::size > 1 ? ", ":" "); 94 | printVectorHelper(); 95 | } 96 | 97 | //Called when there is nothing left to print 98 | template<> void printVectorHelper() {} 99 | 100 | 101 | /****************************************************************/ 102 | /* */ 103 | /* Main */ 104 | /* */ 105 | /****************************************************************/ 106 | 107 | 108 | //Main function 109 | int main() { 110 | 111 | //Initial vectors 112 | makeIntList(A, 1, 2, 3, 4, 5, 6); 113 | makeIntList(B, 6, 5, 4, 3, 2, 1); 114 | 115 | //Print the maticies 116 | pnt(A); pnt(B); 117 | 118 | //Dot product 119 | std::cout << "\nA • B = " << dotProd(A, B) << std::endl; 120 | 121 | //Success 122 | return 0; 123 | } 124 | -------------------------------------------------------------------------------- /PowerSet/PowerSet.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | #define BUILD_NUM_TIMES 1000 5 | 6 | 7 | /* Compile with: 8 | g++ PowerSet.cpp -Wall -Ofast -std=c++14 -Wno-enum-compare -ftemplate-depth=1000000 -frename-registers -march=native -fomit-frame-pointer -fmerge-all-constants -o PowerSet.out 9 | */ 10 | 11 | /****************************************************************/ 12 | /* */ 13 | /* General */ 14 | /* */ 15 | /****************************************************************/ 16 | 17 | 18 | //Null type 19 | class NullType {}; 20 | 21 | //A container that converts an int to a distinct type, with a value 22 | template struct intc { 23 | enum { value = N }; 24 | 25 | //For printing 26 | static void print() { std::cout << value; } 27 | }; 28 | 29 | //Checks to see if two types are the same 30 | template struct SameType { 31 | static const bool result = false; 32 | }; 33 | template struct SameType { 34 | static const bool result = true; 35 | }; 36 | 37 | //A TMP version of an if statement 38 | //Result = A if C, otherwise result = B 39 | template struct Select { 40 | typedef A result; 41 | }; 42 | template struct Select { 43 | typedef B result; 44 | }; 45 | 46 | /****************************************************************/ 47 | /* */ 48 | /* List */ 49 | /* */ 50 | /****************************************************************/ 51 | 52 | 53 | //Macro wrapper around List, V is the name of the variable defines 54 | #define makeList(...) make_list<__VA_ARGS__>::result 55 | 56 | //Macro wrapper around ListGet 57 | #define get(T, N) ListGet::result 58 | 59 | 60 | //A list of types 61 | template struct List { 62 | typedef U Tail; 63 | typedef T Head; 64 | enum { size = Tail::size + 1 }; 65 | }; 66 | template struct List { 67 | typedef NullType Tail; 68 | typedef T Head; 69 | enum { size = 1 }; 70 | }; 71 | 72 | //Make a list of types 73 | template struct make_list { 74 | typedef List::result > result; 75 | }; 76 | template struct make_list { 77 | typedef List result; 78 | }; 79 | 80 | //Get the n'th item of the list 81 | template struct ListGet { 82 | typedef typename ListGet::result result; 83 | }; 84 | template struct ListGet { 85 | typedef typename T::Head result; 86 | }; 87 | 88 | //Add list B to list A 89 | template struct AddList { 90 | typedef List::result > result; 91 | }; 92 | template struct AddList { 93 | typedef A result; 94 | }; 95 | template struct AddList { 96 | typedef B result; 97 | }; 98 | 99 | //Determiens if item A exists in list L 100 | template struct ItemExists { 101 | static const bool result = SameType::result || ItemExists::result; 102 | }; 103 | template struct ItemExists { 104 | static const bool result = false; 105 | }; 106 | 107 | //Remove duplicates 108 | template class RemoveDuplicates { 109 | typedef typename RemoveDuplicates::result NewT; 110 | public: 111 | typedef typename Select::result, 112 | NewT, List 113 | >::result result; 114 | }; 115 | template <> class RemoveDuplicates { 116 | public: typedef NullType result; 117 | }; 118 | 119 | 120 | 121 | /****************************************************************/ 122 | /* */ 123 | /* Power Set */ 124 | /* */ 125 | /****************************************************************/ 126 | 127 | 128 | //Make_power_set wrapper 129 | #define PowerSet(A) make_power_set::result 130 | 131 | //A struct representing an empty set 132 | struct EmptySet { 133 | static void print() {} 134 | }; 135 | 136 | //Prepend P to sublists of L 137 | template struct PrependToSublists { 138 | typedef List, typename PrependToSublists::result > result; 139 | }; 140 | template struct PrependToSublists { 141 | typedef NullType result; 142 | }; 143 | 144 | //Make the power set of T 145 | template class make_power_set { 146 | typedef typename make_power_set::result SubPower; 147 | public: 148 | typedef typename RemoveDuplicates< 149 | typename AddList< 150 | typename PrependToSublists::result, 151 | SubPower 152 | >::result 153 | >::result result; 154 | }; 155 | template <> class make_power_set { 156 | public: typedef List, NullType> result; 157 | }; 158 | 159 | 160 | /****************************************************************/ 161 | /* */ 162 | /* For vector printing */ 163 | /* */ 164 | /****************************************************************/ 165 | 166 | 167 | //Print wrapper 168 | #define pntV(V) { \ 169 | std::cout << #V << " = [ "; \ 170 | if (V::size) printVectorHelper(); \ 171 | std::cout << "]" << std::endl; \ 172 | } 173 | 174 | 175 | //Print a vector 176 | template void printVectorHelper() { 177 | get(V, 0)::print(); std::cout << (V::size > 1 ? ", ":" "); 178 | printVectorHelper(); 179 | } 180 | 181 | //Called when there is nothing left to print 182 | template<> void printVectorHelper() {} 183 | 184 | 185 | /****************************************************************/ 186 | /* */ 187 | /* For PowerSet printing */ 188 | /* */ 189 | /****************************************************************/ 190 | 191 | 192 | //Print wrapper 193 | #define pntM(V) { \ 194 | std::cout << #V << ":\n"; \ 195 | if (V::size) printMatrixHelper(); \ 196 | std::cout << std::endl; \ 197 | } 198 | 199 | //Print a vector 200 | template void printMatrixHelper() { 201 | std::cout << " [ "; 202 | if (V::size) printVectorHelper(); 203 | std::cout << "]\n"; 204 | printMatrixHelper(); 205 | } 206 | 207 | //Called when there is nothing left to print 208 | template<> void printMatrixHelper() {} 209 | 210 | 211 | /****************************************************************/ 212 | /* */ 213 | /* Run-Time */ 214 | /* */ 215 | /****************************************************************/ 216 | 217 | 218 | //Run the program 219 | inline void buildSet(const bool p) { 220 | 221 | //Make list A 222 | typedef makeList( intc<0>, intc<1>, intc<2>, intc<3>, intc<4>, 223 | intc<5>, intc<6>, intc<7>, intc<8>, intc<9>, intc<10> ) A; 224 | 225 | //Make the power set of A 226 | typedef PowerSet(A) B; 227 | 228 | //Print B if requested 229 | if (p) pntM(B); 230 | } 231 | 232 | //Get the current time 233 | static inline __attribute__((always_inline)) auto time() { 234 | return std::chrono::high_resolution_clock::now(); 235 | } 236 | 237 | //Print the current time 238 | static inline __attribute__((always_inline)) int getTime(auto t) { 239 | using namespace std; using namespace chrono; 240 | return duration_cast(t).count(); 241 | } 242 | 243 | //Main function 244 | int main() { 245 | 246 | //Create time variables 247 | auto s = time(), e = time(); 248 | int time1; 249 | 250 | //Create the set n times, and time it 251 | const int n = BUILD_NUM_TIMES; s = time(); 252 | for(int i = 0; i < n; ++i) buildSet(false); 253 | e = time(); time1 = getTime(e-s); 254 | 255 | //Build the set, print it, and time it 256 | s = time(); buildSet(true); e = time(); 257 | 258 | //Print out the time it took 259 | printf("Build it n times: \t%d us\n", time1); 260 | printf("Built and printed: \t%d us\n", getTime(e-s)); 261 | printf("Total elapsed time: \t%d us\n", time1 + getTime(e-s)); 262 | 263 | //Success 264 | return 0; 265 | } 266 | -------------------------------------------------------------------------------- /PowerSet/RunTimePowerSet.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | 7 | #define BUILD_NUM_TIMES 1000 8 | 9 | /* Compile with: 10 | g++ RunTimePowerSet.cpp -Wall -Ofast -std=c++14 -Wno-enum-compare -ftemplate-depth=1000000 -frename-registers -march=native -fomit-frame-pointer -fmerge-all-constants -o RunTimePowerSet.out 11 | 12 | computer_power_set by: Toshi Piazza 13 | 14 | */ 15 | 16 | //Computer the power set 17 | template std::vector compute_power_set(const T &power) 18 | { 19 | std::vector ret; 20 | unsigned long size = std::pow(2, power.size()); 21 | ret.reserve(size); 22 | for (unsigned long i = 0; i < size; ++i) { 23 | T tmp; 24 | for (unsigned long j = 0; j < power.size(); ++j) { 25 | if (i & (1 << j)) 26 | tmp.push_back(power[j]); 27 | } 28 | ret.push_back(tmp); 29 | } 30 | return ret; 31 | } 32 | 33 | //Print the matrix 34 | static inline void pntM(auto power) { 35 | for (auto &v : power) { 36 | std::cout << " [ "; 37 | for (auto &i : v) std::cout << i << ", "; 38 | std::cout << "]\n"; 39 | } 40 | std::cout << std::endl; 41 | } 42 | 43 | //Run the program 44 | inline void buildSet(const bool p) { 45 | 46 | //Make the set 47 | std::vector A = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 }; 48 | 49 | //Make the power set of A 50 | auto B = compute_power_set(A); 51 | 52 | //Print B if requested 53 | if (p) pntM(B); 54 | } 55 | 56 | //Get the current time 57 | static inline __attribute__((always_inline)) auto time() { 58 | return std::chrono::high_resolution_clock::now(); 59 | } 60 | 61 | //Print the current time 62 | static inline __attribute__((always_inline)) int getTime(auto t) { 63 | using namespace std; using namespace chrono; 64 | return duration_cast(t).count(); 65 | } 66 | 67 | //Main function 68 | int main() { 69 | 70 | //Create time variables 71 | auto s = time(), e = time(); 72 | int time1; 73 | 74 | //Create the set n times, and time it 75 | const int n = BUILD_NUM_TIMES; s = time(); 76 | for(int i = 0; i < n; ++i) buildSet(false); 77 | e = time(); time1 = getTime(e-s); 78 | 79 | //Build the set, print it, and time it 80 | s = time(); buildSet(true); e = time(); 81 | 82 | //Print out the time it took 83 | printf("Build it n times: \t%d us\n", time1); 84 | printf("Built and printed: \t%d us\n", getTime(e-s)); 85 | printf("Total elapsed time: \t%d us\n", time1 + getTime(e-s)); 86 | 87 | //Success 88 | return 0; 89 | } 90 | -------------------------------------------------------------------------------- /Presentation.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/zwimer/Template-Meta-Tutorial/88559d7ff84bc8cd56ea59955968cf32668137c3/Presentation.pdf -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # C++ Template Meta Tutorial 2 | This repository contains a presentation that is an introduction to C++ Template Meta Programming. All of the code in the presentation is in this repository. Much of what is shown in this presentation is no longer required to know with the increased support for template meta programming in C++11, C++14, and C++17. So why learn it? This presentation includes derivations of each of the techniques which will help get you into the mindset of template meta programming. Furthermore, while the actual code may be legacy, all of these techniques are still fundamentals and frequently used for template meta programming. 3 | 4 | ## Links 5 | A copy of the presentation is hosted [here](https://www.zwimer.com/Template-Meta-Tutorial/Presentation.pdf). The code repository is located on github [here](https://www.github.com/zwimer/Template-Meta-Tutorial/). 6 | 7 | ## Disclaimer 8 | C++ Template Meta is a huge and very diverse topic. It would be naive to say that this tutorial encompasses even a small portion of this topic. It is just a small introduction to some of techniques used in TMP. Furthermore, this presentation was designed to be given by someone who knows TMP. As such, while the presentation contains all necessary information, explanations may be in bullet points as it was written so that the instructor could explain each point. 9 | 10 | ## Texts 11 | This presentation _heavily_ utilizes the following text: [Modern C++ Design](https://www.mimuw.edu.pl/~mrp/cpp/SecretCPP/Addison-Wesley%20-%20Modern%20C++%20Design.%20Generic%20Programming%20and%20Design%20Patterns%20Applied.pdf) by Andrei Alexandrescu. If you are interested in TMP, I highly recommend this book. 12 | 13 | ## Requirements 14 | The code in this repository is compiled with clang++ version 7.0.2, and gcc 4.9.2. C++99 is required for most of the code, however some of the files require C++14. The reason different compilers and versions of C++ are used is to demonstrate examples where clarity of error messages is helpful and to demonstrate how C++ TMP has evolved from the primitive form you will learn to a more advanced and useful form which includes variadic templates among other amazing features. 15 | -------------------------------------------------------------------------------- /StaticAssert/BestSA.cpp: -------------------------------------------------------------------------------- 1 | /* Compile with 2 | clang++ BestSA.cpp -o BestSA.out -std=c++14 3 | 4 | Why Clang? 5 | - Clang gives nicer error messages than g++ for this 6 | */ 7 | 8 | //'Catch all' constructor, can take in ANY type 9 | template struct CompileTimeChecker { 10 | CompileTimeChecker(...); 11 | }; 12 | 13 | //Specialize definition for when bool = false 14 | //There is no (non-implicit) constructor here! Calling it illegal 15 | template <> struct CompileTimeChecker {}; 16 | 17 | // Macro Wrapper 18 | #define STATIC_CHECK(A, msg) { \ 19 | class ERROR_##msg{}; \ 20 | (void) sizeof( CompileTimeChecker{ ERROR_##msg() } ); \ 21 | } 22 | 23 | /* How it works: 24 | * 25 | * STATIC_CHECK wrapes everything in a new scope { } 26 | * It then declares a class called ERROR_ prepended by msg 27 | * If A is true, sizeof returns the size of CompileTimeChecker, 28 | * as the catch all constructor accepts the ERROR_##msg class. 29 | * If A is false, sizeof attempts to find the return type of 30 | * the CompileTimeChecker that accepts ERROR_##msg as an 31 | * argument. Since this constructor however is not defined, 32 | * The compiler will throw an error about how it cannot find 33 | * a matching constructor. With any luck, it will complain about 34 | * CompileTimeChecker not having a matching constructor for ERROR_##msg 35 | */ 36 | 37 | //Main function 38 | int main() { 39 | 40 | //Test if 1 + 1 = 20 41 | STATIC_CHECK(1 + 1 == 20, Math_Works); 42 | 43 | //Success 44 | return 0; 45 | } 46 | -------------------------------------------------------------------------------- /StaticAssert/SimplestSA.cpp: -------------------------------------------------------------------------------- 1 | /* Compiled with 2 | g++ SimplestSA.cpp -pedantic -Wno-unused-variable -Werror -o SimplestSA.out 3 | */ 4 | 5 | //If A is false, char[0] is called, which is illegal 6 | //If A is true, char[1] is called, then goes out of scope 7 | #define STATIC_CHECK(A) { \ 8 | char test[ (A) ? 1 : 0 ]; \ 9 | } 10 | 11 | //Main function 12 | int main() { 13 | 14 | //Test if 1 + 1 = 20 15 | STATIC_CHECK(1 + 1 == 20); 16 | 17 | //Success 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /StaticAssert/TrivialTemplateSA.cpp: -------------------------------------------------------------------------------- 1 | /* Compiled with: 2 | g++ TrivialTemplateSA.cpp -o TrivialTemplateSA.out 3 | */ 4 | 5 | //Declare the struct 6 | template struct CompileTimeError; 7 | 8 | //Define the struct for true 9 | template <> struct CompileTimeError {}; 10 | 11 | // Wrapper 12 | #define STATIC_CHECK(A) CompileTimeError() 13 | 14 | 15 | //Main function 16 | int main() { 17 | 18 | //Check to see if 1 + 1 == 20 19 | CompileTimeError< 1 + 1 == 20 >(); 20 | 21 | //Success 22 | return 0; 23 | } 24 | 25 | -------------------------------------------------------------------------------- /TemplateSpecialization/FullTemplateSpec.cpp: -------------------------------------------------------------------------------- 1 | /* Compiled with: 2 | g++ FullTemplateSpec.cpp -Ofast -o FullTemplateSpec.out 3 | */ 4 | 5 | #include 6 | 7 | 8 | //General template 9 | template struct _Factorial { 10 | enum { value = N * _Factorial::value }; 11 | }; 12 | 13 | //Note that here we have template <> 14 | //This is FULL template specialization 15 | //We then specify what arguments in the class name 16 | template <> struct _Factorial<0> { 17 | enum { value = 1 }; 18 | }; 19 | 20 | 21 | // Factorial Wrapper 22 | #define factorial(x) _Factorial::value 23 | 24 | 25 | //Main function 26 | int main() { 27 | 28 | //Print out factorial examples 29 | std::cout << "Factorial(8) = " << factorial(8) << std::endl; 30 | 31 | //Success 32 | return 0; 33 | } 34 | -------------------------------------------------------------------------------- /TemplateSpecialization/IsPointer.cpp: -------------------------------------------------------------------------------- 1 | /* Compiled with: 2 | g++ IsPointer.cpp -o IsPointer.out 3 | */ 4 | 5 | #include 6 | 7 | //Macro wrapper 8 | #define isPtr(T) ((bool) IsPointer::result) 9 | 10 | //General template 11 | template struct IsPointer{ 12 | enum { result = false }; 13 | }; 14 | 15 | //Specified template. You will notice that this 16 | //still takes in an argument T, but that the 17 | //specification is simply that T is a pointer! 18 | template struct IsPointer { 19 | enum { result = true }; 20 | }; 21 | 22 | 23 | 24 | //Main function 25 | int main() { 26 | 27 | //Setup 28 | std::cout << std::boolalpha; 29 | 30 | //Verify that int * is a pointer and that int is not 31 | std::cout << "It is " << isPtr(int) << " that int is a pointer.\n"; 32 | std::cout << "It is " << isPtr(int *) << " that int * is a pointer.\n"; 33 | 34 | //Success 35 | return 0; 36 | } 37 | -------------------------------------------------------------------------------- /TemplateSpecialization/PartialTemplateSpec.cpp: -------------------------------------------------------------------------------- 1 | /* Compiled with: 2 | g++ PartialTemplateSpec.cpp -o PartialTemplateSpec.out 3 | */ 4 | 5 | #include 6 | #include 7 | 8 | // Template Meta 9 | template struct Division { 10 | enum { value = N / N2 }; 11 | }; 12 | 13 | 14 | //Note that here we have only one int in our template 15 | //This is partial template specialization. 16 | //We then specify what the arguments are below 17 | template struct Division { 18 | enum { value = INT_MAX }; 19 | }; 20 | 21 | 22 | //Main function 23 | int main() { 24 | 25 | //Test division 26 | std::cout << "4/2 = " << Division<4,2>::value << std::endl; 27 | std::cout << "4/0 = " << Division<4,0>::value << std::endl; 28 | 29 | //Success 30 | return 0; 31 | } 32 | -------------------------------------------------------------------------------- /TemplateSpecialization/Tuple.cpp: -------------------------------------------------------------------------------- 1 | /* Compiled with: 2 | g++ Tuple.cpp -o Tuple.out 3 | */ 4 | 5 | #include 6 | 7 | //Macro wrapper 8 | #define isPtr(T) ((bool) IsPointer::result) 9 | 10 | //Simple Tuple class 11 | template struct Tuple { 12 | typedef T Head; 13 | typedef U Tail; 14 | }; 15 | 16 | //Declare a CopyTuple class 17 | template struct CopyTuple; 18 | 19 | //Add a template to this template specalization 20 | template<> template 21 | struct CopyTuple< Tuple > { 22 | typedef Tuple result; 23 | }; 24 | 25 | 26 | //Main function 27 | int main() { 28 | 29 | //Create a tuple of an int and char 30 | typedef Tuple A; 31 | 32 | //Copy A to B 33 | typedef CopyTuple< A >::result B; 34 | 35 | //Compare A and B 36 | std::cout << (typename A::Tail) 'A' << " = " << (typename B::Tail) 'A' << std::endl; 37 | std::cout << (typename A::Head) 'A' << " = " << (typename B::Head) 'A' << std::endl; 38 | 39 | //Success 40 | return 0; 41 | } 42 | -------------------------------------------------------------------------------- /TypeList/BasicTypeList.cpp: -------------------------------------------------------------------------------- 1 | /* Compiled with: 2 | g++ BasicTypeList.cpp -o BasicTypeList.cpp 3 | */ 4 | 5 | #include 6 | 7 | 8 | // A simple Type List 9 | template struct Typelist { 10 | typedef T Head; 11 | typedef U Tail; 12 | }; 13 | 14 | //Main function 15 | int main() { 16 | 17 | //Create a TL with a char and an int 18 | typedef Typelist TL; 19 | 20 | //Print 'A' as a character and number 21 | std::cout << (typename TL::Head) 'A' << std::endl; 22 | std::cout << (typename TL::Tail) 'A' << std::endl; 23 | 24 | //Success 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /TypeList/TL_Append.cpp: -------------------------------------------------------------------------------- 1 | /* Compiled with: 2 | g++ TL_Append.cpp -o TL_Append.out 3 | */ 4 | 5 | #include 6 | 7 | //A class that denotes the end of a TL 8 | class NullType {}; 9 | 10 | // A simple Type List 11 | template struct Typelist { 12 | typedef T Head; 13 | typedef U Tail; 14 | }; 15 | 16 | 17 | /* Note: The following is for C++98. 18 | * There is a better way to do this with C++11 ! 19 | * With variatic arguments, we will be able to 20 | * define a single function that does the job 21 | * of all of these macros! C++11 also allows for 22 | * default template arguments! 23 | */ 24 | 25 | // The C++98 Method ( C++11 is MUCH better for this ) 26 | #define TYPELIST_1(T1) Typelist 27 | #define TYPELIST_2(T1, T2) Typelist 28 | #define TYPELIST_3(T1, T2, T3) Typelist 29 | // ... 30 | // ... 31 | // ... 32 | 33 | // In C++11, none of this is needed, you can make a struct do it for you 34 | 35 | 36 | // Below assumes no errors. If you don't like this, feel free 37 | // to throw in some of the static asserts you learned below! 38 | 39 | //Declare the Append struct 40 | // U is what is being appended to the typelist T 41 | // If T is Null and U is Null, return Null 42 | // If T is Null and U is not, return a typelist containing only U 43 | // If T is Null and U is a typelist, then return U 44 | // If T is not null, append T::Head to Append 45 | template struct Append; 46 | 47 | //Append Null to an empty list 48 | template <> struct Append { 49 | typedef NullType Result; 50 | }; 51 | 52 | //Append U to an empty list 53 | template struct Append { 54 | typedef TYPELIST_1(U) result; 55 | }; 56 | 57 | //Append a typelist to a null list 58 | template <> template 59 | struct Append > { 60 | typedef Typelist result; 61 | }; 62 | 63 | // If T is not null, append T::Head to Append::result 64 | template<> template 65 | struct Append, U> { 66 | typedef Typelist::result> result; 67 | }; 68 | 69 | 70 | //Main function 71 | int main() { 72 | 73 | //Create a typelist of char 74 | typedef TYPELIST_2(char, bool) T2; 75 | 76 | //Append an int to the end of T1 77 | typedef Append::result T3; 78 | 79 | // Print out booleans as strings 80 | std::cout << std::boolalpha; 81 | 82 | //Print out 'A' as an int and a char 83 | std::cout << ( T3::Head ) 'A' << std::endl; 84 | std::cout << ( T3::Tail::Head ) 'A' << std::endl; 85 | std::cout << ( T3::Tail::Tail::Head ) 'A' << std::endl; 86 | 87 | //Success 88 | return 0; 89 | } 90 | -------------------------------------------------------------------------------- /TypeList/TL_Index.cpp: -------------------------------------------------------------------------------- 1 | /* Compiled with: 2 | g++ TL_Index.cpp -o TL_Index.out 3 | */ 4 | 5 | #include 6 | 7 | //A class that denotes the end of a TL 8 | class NullType {}; 9 | 10 | // A simple Type List 11 | template struct Typelist { 12 | typedef T Head; 13 | typedef U Tail; 14 | }; 15 | 16 | 17 | /* Note: The following is for C++98. 18 | * There is a better way to do this with C++11 ! 19 | * With variadic arguments, we will be able to 20 | * define a single function that does the job 21 | * of all of these macros! C++11 also allows for 22 | * default template arguments! 23 | */ 24 | 25 | // The C++98 Method ( C++11 is MUCH better for this ) 26 | #define TYPELIST_1(T1) Typelist 27 | #define TYPELIST_2(T1, T2) Typelist 28 | #define TYPELIST_3(T1, T2, T3) Typelist 29 | // ... 30 | // ... 31 | // ... 32 | 33 | // In C++11, none of this is needed, you can make a struct do it for you 34 | 35 | 36 | // Below assumes no errors. If you don't like this, feel free 37 | // to throw in some of the static asserts you learned below! 38 | 39 | //Declare the TypeAt struct 40 | template struct TypeAt; 41 | 42 | // Get the i'th index of a typelist: Base case, i = 0. 43 | template <> template 44 | struct TypeAt, 0> { 45 | typedef T result; 46 | }; 47 | 48 | // Get the (i-1)'th index of the typelist U 49 | template<> template 50 | struct TypeAt, i> { 51 | typedef typename TypeAt::result result; 52 | }; 53 | 54 | 55 | //Main function 56 | int main() { 57 | 58 | //Create a typelist of int, char 59 | typedef TYPELIST_2(int, char) TL; 60 | 61 | //Print out 'A' as an int and a char 62 | std::cout << ( TypeAt::result ) 'A' << std::endl; 63 | std::cout << ( TypeAt::result ) 'A' << std::endl; 64 | 65 | //Success 66 | return 0; 67 | } 68 | -------------------------------------------------------------------------------- /TypeList/TypeList.cpp: -------------------------------------------------------------------------------- 1 | /* Compiled with: 2 | g++ TypeList.cpp -o TypeList.cpp 3 | */ 4 | 5 | #include 6 | 7 | //A class that denotes the end of a TL 8 | class NullType {}; 9 | 10 | // A simple Type List 11 | template struct Typelist { 12 | typedef T Head; 13 | typedef U Tail; 14 | }; 15 | 16 | 17 | /* Note: The following is for C++98. 18 | * There is a better way to do this with C++11 ! 19 | * With variatic arguments, we will be able to 20 | * define a single function that does the job 21 | * of all of these macros! C++11 also allows for 22 | * default template arguments! 23 | */ 24 | 25 | // The C++98 Method ( C++11 is MUCH better for this ) 26 | #define TYPELIST_1(T1) Typelist 27 | #define TYPELIST_2(T1, T2) Typelist 28 | #define TYPELIST_3(T1, T2, T3) Typelist 29 | // ... 30 | // ... 31 | // ... 32 | 33 | // In C++11, none of this is needed, you can make a struct do it for you 34 | 35 | 36 | //Main function 37 | int main() { 38 | 39 | //Create a typelist of int and char 40 | typedef TYPELIST_2(int, char) TL; 41 | 42 | //Print out 'A' as an int and a char 43 | std::cout << (typename TL::Head) 'A' << std::endl; 44 | std::cout << (typename TL::Tail::Head) 'A' << std::endl; 45 | 46 | //Success 47 | return 0; 48 | } 49 | -------------------------------------------------------------------------------- /TypeSelection/Select.cpp: -------------------------------------------------------------------------------- 1 | /* Compiled with 2 | g++ Select.cpp -O3 -o Select.out 3 | */ 4 | 5 | #include 6 | 7 | //Converts an int to a type 8 | template struct Int2Type { enum { value = N }; }; 9 | 10 | 11 | //If B is true (general case), then result = T 12 | template struct Select { 13 | typedef T result; 14 | }; 15 | 16 | //If B is false, then result = U 17 | //Since this is specialized, it takes priority over the general case 18 | template struct Select { 19 | typedef U result; 20 | }; 21 | 22 | 23 | //Main function 24 | int main() { 25 | 26 | //Determine what to print 27 | const bool flag = true; 28 | 29 | //Set Num to Int2Type<100> if flag = true, Int2Type<0> if false 30 | typedef Select< flag, Int2Type<100>, Int2Type<0> >::result Num; 31 | 32 | //Print the result 33 | std::cout << "Flag = " << std::boolalpha << flag 34 | << ", thus Num::value = " << Num::value << std::endl; 35 | 36 | //Success 37 | return 0; 38 | } 39 | -------------------------------------------------------------------------------- /index.html: -------------------------------------------------------------------------------- 1 | 2 |

Redirect

3 | --------------------------------------------------------------------------------