├── .gitignore ├── LICENSE ├── README.md └── src ├── 000_intro └── main.cpp ├── 002_variables └── variables.cpp ├── 003_conditional_statements └── condition.cpp ├── 004_std_array └── array.cpp ├── 005_for_loops ├── for.cpp └── ranged_for.cpp ├── 006_while_loops ├── do_while.cpp └── while.cpp ├── 007_functions ├── functions.cpp └── return_value.cpp ├── 008_function_overloading └── overloading.cpp ├── 009_function_templates └── function_templates.cpp ├── 010_template_specialization └── template_specialization.cpp ├── 011_iterators └── iterator.cpp ├── 012_std_sort └── sort.cpp ├── 013_std_vector └── vector.cpp ├── 014_references └── references.cpp ├── 015_pass_by_ref └── pass_by_ref.cpp ├── 016_pointers └── pointers.cpp ├── 017_dynamic_alloc └── new.cpp ├── 018_unique_ptr └── unique_ptr.cpp ├── 019_shared_ptr └── shared_ptr.cpp ├── 020_span └── span.cpp ├── 021_structs └── structs.cpp ├── 022_classes └── classes.cpp ├── 023_constructors └── constructors.cpp ├── 024_destructors └── destructors.cpp ├── 025_copy_constructors └── copy_constructors.cpp ├── 026_operator_overloading └── operators.cpp ├── 027_std_move └── move.cpp ├── 028_move_constructor └── move_constructors.cpp ├── 029_push_vs_emplace └── push_vs_emplace.cpp ├── 030_inheritance └── inheritance.cpp ├── 031_polymorphism └── polymorphism.cpp ├── 032_virtual_functions └── virtual_functions.cpp ├── 033_abstract_class └── abstract_class.cpp ├── 034_class_templates └── class_templates.cpp ├── 035_default_comparison └── default_compare.cpp ├── 036_virtual_inheritance └── virtual_inheritance.cpp ├── 037_function_objects └── function_objects.cpp ├── 038_lambdas └── lambdas.cpp ├── 040_threads └── threads.cpp ├── 041_mutex └── mutex.cpp ├── 042_atomic └── atomic.cpp ├── 043_namespace └── namespaces.cpp ├── 044_random └── random.cpp ├── 045_file_io ├── ifstream.cpp └── ofstream.cpp ├── 046_constexpr └── constexpr.cpp └── 047_concepts └── concepts.cpp /.gitignore: -------------------------------------------------------------------------------- 1 | # Prerequisites 2 | *.d 3 | 4 | # Compiled Object files 5 | *.slo 6 | *.lo 7 | *.o 8 | *.obj 9 | 10 | # Precompiled Headers 11 | *.gch 12 | *.pch 13 | 14 | # Compiled Dynamic libraries 15 | *.so 16 | *.dylib 17 | *.dll 18 | 19 | # Fortran module files 20 | *.mod 21 | *.smod 22 | 23 | # Compiled Static libraries 24 | *.lai 25 | *.la 26 | *.a 27 | *.lib 28 | 29 | # Executables 30 | *.exe 31 | *.out 32 | *.app 33 | -------------------------------------------------------------------------------- /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 | 635 | Copyright (C) 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 | Copyright (C) 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 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # C++ From Scratch 2 | 3 | "C++ From Scratch" is an introductory course on programming with C++. It covers the essential parts of C++ without becomming an exhaustive references on every operator, algorithm, and data structure available in C++ and through the standard library. 4 | 5 | ## Audience 6 | 7 | This course is suitable for both self-motivated new programmers, and experienced programmers that want to learn about modern C++. 8 | 9 | The course should provide new programmers with an entry-point to C++, and give this a guide of where to learn about the different parts of the language in a logical order. 10 | 11 | The course should provide experienced programmers with a clear and concise overview of the language, with pointers to the reference material where they can learn more about the topics they are interested in. 12 | 13 | # Contents 14 | 15 | ## Introduction 16 | 17 | 0. Introduction and The Main Function 18 | 1. Printing 19 | 2. Variables 20 | 3. Conditional Statements 21 | 22 | ## Containers and Loops 23 | 24 | 4. std::array 25 | 5. For Loops 26 | 6. While Loops 27 | 28 | ## Functions 29 | 30 | 7. Functions 31 | 8. Function Overloading 32 | 9. Function Templates 33 | 10. Template Specialization 34 | 35 | ## Iterators and Algorithms 36 | 37 | 11. Iterators 38 | 12. std::sort 39 | 40 | ## Memory 41 | 42 | 13. std::vector 43 | 14. References 44 | 15. Pass by Reference 45 | 16. Pointers 46 | 17. Dynamic Allocation 47 | 18. std::unique_ptr 48 | 19. std::shared_ptr 49 | 20. std::span 50 | 51 | ## Objects 52 | 53 | 21. Structs 54 | 22. Classes 55 | 23. Constructors 56 | 24. Destructors 57 | 25. Copy Constructors 58 | 26. Operator Overloading 59 | 27. std::move 60 | 28. Move Constructors 61 | 29. push_back vs. emplace_back 62 | 30. Inheritance 63 | 31. Polymorphism 64 | 32. Virtual Functions 65 | 33. Abstract Classes 66 | 34. Class Templates 67 | 35. Default Comparisons 68 | 36. Virtual Inheritance 69 | 37. Function Objects 70 | 38. Lambdas 71 | 72 | ## Parallel Programming 73 | 74 | 39. Parallel STL Algorithms 75 | 40. Threads (std::thread/std::jthread) 76 | 41. std::mutex 77 | 42. std::atomic 78 | 79 | ## Special Topics 80 | 81 | 43. Namespaces 82 | 44. Pseudo-Random Numbers 83 | 45. File I/O 84 | 46. Constexpr 85 | 47. Concepts 86 | 87 | -------------------------------------------------------------------------------- /src/000_intro/main.cpp: -------------------------------------------------------------------------------- 1 | int main() { 2 | return 12; 3 | } 4 | -------------------------------------------------------------------------------- /src/002_variables/variables.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | auto var; 5 | auto var1 = 10; 6 | auto var2 = 20; 7 | auto var3 = var1 + var2; 8 | 9 | std::cout << var3 << '\n'; 10 | return 0; 11 | } 12 | -------------------------------------------------------------------------------- /src/003_conditional_statements/condition.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int a = 15; 5 | int b = 10; 6 | 7 | if (a < b) { 8 | std::cout << "a is less than b!\n"; 9 | } else if (a == b) { 10 | std::cout << "a is equal to b!\n"; 11 | } else { 12 | std::cout << "a is greater than b!\n"; 13 | if (a == 15) { 14 | std::cout << "a is equal to 15!\n"; 15 | } 16 | } 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /src/004_std_array/array.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() { 5 | std::array my_array = {45, 23, 3, 10, 40}; 6 | std::cout << my_array.size() << '\n'; 7 | return 0; 8 | } 9 | -------------------------------------------------------------------------------- /src/005_for_loops/for.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | for (int i = 0; i < 5; i += 1) { 5 | std::cout << "Iteration: " << i << '\n'; 6 | } 7 | return 0; 8 | } 9 | -------------------------------------------------------------------------------- /src/005_for_loops/ranged_for.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() { 5 | std::array my_array = {42, 12, 63, 1, 3}; 6 | for (int value : my_array) { 7 | std::cout << value << '\n'; 8 | } 9 | return 0; 10 | } 11 | -------------------------------------------------------------------------------- /src/006_while_loops/do_while.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int work_items = 0; 5 | do { 6 | std::cout << "Work items " << work_items << '\n'; 7 | work_items -= 1; 8 | } while (work_items > 0); 9 | return 0; 10 | } 11 | -------------------------------------------------------------------------------- /src/006_while_loops/while.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int work_items = 10; 5 | while (work_items > 0) { 6 | std::cout << "Work items: " << work_items << '\n'; 7 | work_items -= 1; 8 | } 9 | return 0; 10 | } 11 | -------------------------------------------------------------------------------- /src/007_functions/functions.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | void print_array(std::array array) { 5 | for(int value : array) { 6 | std::cout << value << ' '; 7 | } 8 | std::cout << '\n'; 9 | } 10 | 11 | int main() { 12 | std::array my_array_1 = {1, 2, 3}; 13 | print_array(my_array_1); 14 | 15 | std::array my_array_2 = {4, 5, 6}; 16 | print_array(my_array_2); 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /src/007_functions/return_value.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int sum(std::array array) { 5 | int sum = 0; 6 | for(int value : array) { 7 | sum += value; 8 | } 9 | return sum; 10 | } 11 | 12 | int main() { 13 | std::array my_array = {1, 2, 3}; 14 | int result = sum(my_array); 15 | std::cout << "The sum of our array is: " << result << '\n'; 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /src/008_function_overloading/overloading.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | void print_array(std::array array) { 5 | for (auto value : array) { 6 | std::cout << value << ' '; 7 | } 8 | std::cout << '\n'; 9 | } 10 | 11 | void print_array(std::array array) { 12 | for (auto value : array) { 13 | std::cout << value << ' '; 14 | } 15 | std::cout << '\n'; 16 | } 17 | 18 | int main() { 19 | std::array my_int_array = {1, 2, 3}; 20 | print_array(my_int_array); 21 | 22 | std::array my_float_array = {1.1f, 2.2f, 3.3f}; 23 | print_array(my_float_array); 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /src/009_function_templates/function_templates.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | void print_array(auto array) { 5 | for (auto value : array) { 6 | std::cout << value << ' '; 7 | } 8 | std::cout << '\n'; 9 | } 10 | 11 | int main() { 12 | std::array my_int_array = {1, 2, 3}; 13 | print_array(my_int_array); 14 | 15 | std::array my_float_array = {1.1f, 2.2f, 3.3f}; 16 | print_array(my_float_array); 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /src/010_template_specialization/template_specialization.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | void print_array(auto array) { 5 | for (auto value : array) { 6 | std::cout << value << ' '; 7 | } 8 | std::cout << '\n'; 9 | } 10 | 11 | template<> 12 | void print_array(std::array array) { 13 | std::cout << "Printing from our specialization!\n"; 14 | } 15 | 16 | int main() { 17 | std::array my_int_array = {1, 2, 3}; 18 | print_array(my_int_array); 19 | 20 | std::array my_float_array = {1.1f, 2.2f, 3.3f}; 21 | print_array(my_float_array); 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /src/011_iterators/iterator.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() { 5 | std::array my_array = {1, 2, 3, 4, 5}; 6 | for(auto itr = my_array.begin() + 1; itr < my_array.end(); itr += 1) { 7 | std::cout << *itr << ' '; 8 | } 9 | std::cout << '\n'; 10 | 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /src/012_std_sort/sort.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | void print(auto array) { 6 | for(auto value : array) { 7 | std::cout << value << ' '; 8 | } 9 | std::cout << '\n'; 10 | } 11 | 12 | int main() { 13 | std::array my_array = {53, 21, 2, 85, 2}; 14 | print(my_array); 15 | 16 | std::ranges::sort(my_array); 17 | 18 | print(my_array); 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /src/013_std_vector/vector.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | void print(std::vector vector) { 5 | for(auto value : vector) { 6 | std::cout << value << ' '; 7 | } 8 | std::cout << '\n'; 9 | } 10 | 11 | int main() { 12 | std::vector my_vector; 13 | my_vector.reserve(10); 14 | for(int i = 0; i < 10; i+=1) { 15 | std::cout << "Size: " << my_vector.size() << '\n'; 16 | std::cout << "Capacity: " << my_vector.capacity() << '\n'; 17 | my_vector.push_back(i); 18 | } 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /src/014_references/references.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int a = 5; 5 | int b = a; 6 | b += 1; 7 | 8 | std::cout << "a = " << &a << '\n'; 9 | std::cout << "b = " << &b << '\n'; 10 | return 0; 11 | } 12 | -------------------------------------------------------------------------------- /src/015_pass_by_ref/pass_by_ref.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | void add_elements(std::vector &vector, int N) { 5 | for(int i = 0; i < N; i += 1) { 6 | vector.push_back(i); 7 | } 8 | } 9 | 10 | int main() { 11 | std::vector my_vector; 12 | add_elements(my_vector, 10); 13 | 14 | for(auto value : my_vector) { 15 | std::cout << value << ' '; 16 | } 17 | std::cout << '\n'; 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /src/016_pointers/pointers.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int a = 5; 5 | int *b = &a; 6 | *b += 1; 7 | 8 | std::cout << "a = " << a << '\n'; 9 | std::cout << "b = " << b << '\n'; 10 | 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /src/017_dynamic_alloc/new.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int *int_ptr = new int[10]; 5 | int_ptr[5] = 241; 6 | std::cout << "Value " << int_ptr[5] << '\n'; 7 | std::cout << "Address " << &int_ptr[5] << '\n'; 8 | delete[] int_ptr; 9 | return 0; 10 | } 11 | -------------------------------------------------------------------------------- /src/018_unique_ptr/unique_ptr.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() { 5 | auto ptr = std::make_unique(10); 6 | for(int i = 0; i < 10; i += 1) { 7 | ptr[i] = i * i; 8 | } 9 | std::cout << ptr[5] << '\n'; 10 | std::cout << ptr[9] << '\n'; 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /src/019_shared_ptr/shared_ptr.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() { 5 | auto ptr1 = std::make_shared(10); 6 | auto ptr2 = ptr1; 7 | std::cout << "Reference count: " << ptr1.use_count() << '\n'; 8 | return 0; 9 | } 10 | -------------------------------------------------------------------------------- /src/020_span/span.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | void print_subvector(std::span span) { 6 | for(auto value : span) { 7 | std::cout << value << ' '; 8 | } 9 | std::cout << '\n'; 10 | } 11 | 12 | int main() { 13 | std::vector my_vector = {1, 2, 3, 4, 5}; 14 | print_subvector(std::span(my_vector.begin() + 1, 3)); 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /src/021_structs/structs.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | struct Point { 4 | int x; 5 | int y; 6 | 7 | void print() { 8 | std::cout << "x = " << x << '\n'; 9 | std::cout << "y = " << y << '\n'; 10 | } 11 | }; 12 | 13 | int main() { 14 | Point p1; 15 | p1.x = 10; 16 | p1.y = 20; 17 | p1.print(); 18 | 19 | Point p2; 20 | p2.x = 5; 21 | p2.y = -5; 22 | p2.print(); 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /src/022_classes/classes.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | class Point { 4 | int x; 5 | int y; 6 | 7 | public: 8 | void set_x_y(int new_x, int new_y) { 9 | x = new_x; 10 | y = new_y; 11 | } 12 | void print() { 13 | std::cout << "x = " << x << '\n'; 14 | std::cout << "y = " << y << '\n'; 15 | } 16 | }; 17 | 18 | int main() { 19 | Point p1; 20 | p1.set_x_y(10, 20); 21 | p1.print(); 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /src/023_constructors/constructors.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | struct Point { 4 | int x; 5 | int y; 6 | 7 | Point() = default; 8 | Point(int new_x, int new_y) : x(new_x), y(new_y) {} 9 | void print() { 10 | std::cout << "x = " << x << '\n'; 11 | std::cout << "y = " << y << '\n'; 12 | } 13 | }; 14 | 15 | int main() { 16 | Point p; 17 | p.print(); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /src/024_destructors/destructors.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | struct IntArray { 4 | int *array; 5 | IntArray(int size) { 6 | array = new int[size]; 7 | } 8 | ~IntArray() { 9 | std::cout << "Running our destructor!\n"; 10 | delete[] array; 11 | } 12 | }; 13 | 14 | int main() { 15 | IntArray a(10); 16 | a.array[0] = 10; 17 | std::cout << a.array[0] << '\n'; 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /src/025_copy_constructors/copy_constructors.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | struct Point { 4 | int x; 5 | int y; 6 | 7 | Point(int new_x, int new_y) : x(new_x), y(new_y) {} 8 | Point(const Point &p) = delete; 9 | void print() { 10 | std::cout << "x = " << x << '\n'; 11 | std::cout << "y = " << y << '\n'; 12 | } 13 | }; 14 | 15 | int main() { 16 | Point p1(10, 20); 17 | p1.print(); 18 | 19 | Point p2 = p1; 20 | p2.print(); 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /src/026_operator_overloading/operators.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | struct Point { 4 | int x; 5 | int y; 6 | 7 | Point(int new_x, int new_y) : x(new_x), y(new_y) {} 8 | 9 | Point operator+(const Point &rhs) { 10 | return Point(x + rhs.x, y + rhs.y); 11 | } 12 | Point& operator+=(const Point &rhs) { 13 | x += rhs.x; 14 | y += rhs.y; 15 | return *this; 16 | } 17 | 18 | void print() { 19 | std::cout << "x = " << x << '\n'; 20 | std::cout << "y = " << y << '\n'; 21 | } 22 | }; 23 | 24 | int main() { 25 | Point p1(10, 20); 26 | Point p2(30, 40); 27 | p1 += p2; 28 | p1.print(); 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /src/027_std_move/move.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() { 6 | auto ptr1 = std::make_unique(10); 7 | std::cout << "ptr1 before move: " << ptr1.get() << '\n'; 8 | auto ptr2 = std::move(ptr1); 9 | std::cout << "ptr1 after move: " << ptr1.get() << '\n'; 10 | std::cout << "ptr2 after move: " << ptr2.get() << '\n'; 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /src/028_move_constructor/move_constructors.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | struct S { 6 | S() { 7 | std::cout << "Constructor!\n"; 8 | } 9 | S(const S &s) { 10 | std::cout << "Copy Constructor!\n"; 11 | } 12 | S(S &&s) { 13 | std::cout << "Move Constructor!\n"; 14 | } 15 | }; 16 | 17 | int main() { 18 | std::vector my_vector; 19 | my_vector.push_back(S()); 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /src/029_push_vs_emplace/push_vs_emplace.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | struct S { 6 | int x; 7 | 8 | S(int new_x) : x(new_x) { 9 | std::cout << "Constructor!\n"; 10 | } 11 | S(const S &s) : x(s.x) { 12 | std::cout << "Copy Constructor!\n"; 13 | } 14 | S(S &&s) : x(s.x) { 15 | std::cout << "Move Constructor!\n"; 16 | } 17 | }; 18 | 19 | int main() { 20 | std::vector my_vector; 21 | my_vector.emplace_back(10); 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /src/030_inheritance/inheritance.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | struct Base { 4 | int x; 5 | int y; 6 | 7 | Base(int new_x, int new_y) : x(new_x), y(new_y) {} 8 | 9 | void print_x_y() { 10 | std::cout << "x = " << x << '\n'; 11 | std::cout << "y = " << y << '\n'; 12 | } 13 | }; 14 | 15 | struct Derived1 : Base { 16 | int z; 17 | 18 | Derived1(int new_x, int new_y, int new_z) : Base(new_x, new_y), z(new_z) {} 19 | 20 | void print_z() { 21 | std::cout << "z = " << z << '\n'; 22 | } 23 | }; 24 | 25 | int main() { 26 | Derived1 d1(1, 2, 3); 27 | d1.print_x_y(); 28 | d1.print_z(); 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /src/031_polymorphism/polymorphism.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | struct Animal { 4 | void speak() { 5 | std::cout << "Default speak function!\n"; 6 | } 7 | }; 8 | 9 | struct Dog : Animal { 10 | void speak() { 11 | std::cout << "Woof!\n"; 12 | } 13 | }; 14 | 15 | struct Cat : Animal { 16 | void speak() { 17 | std::cout << "Meow!\n"; 18 | } 19 | }; 20 | 21 | int main() { 22 | Dog d; 23 | d.speak(); 24 | Cat c; 25 | c.speak(); 26 | 27 | Animal &a1 = d; 28 | a1.speak(); 29 | Animal &a2 = c; 30 | a2.speak(); 31 | return 0; 32 | } 33 | -------------------------------------------------------------------------------- /src/032_virtual_functions/virtual_functions.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | struct Animal { 4 | virtual void speak() { 5 | std::cout << "Default speak function!\n"; 6 | } 7 | }; 8 | 9 | struct Dog : Animal { 10 | void speak() override { 11 | std::cout << "Woof!\n"; 12 | } 13 | }; 14 | 15 | struct Cat : Animal { 16 | void speak() override { 17 | std::cout << "Meow!\n"; 18 | } 19 | }; 20 | 21 | int main() { 22 | Dog d; 23 | d.speak(); 24 | Cat c; 25 | c.speak(); 26 | 27 | Animal &a1 = d; 28 | a1.speak(); 29 | Animal &a2 = c; 30 | a2.speak(); 31 | return 0; 32 | } 33 | -------------------------------------------------------------------------------- /src/033_abstract_class/abstract_class.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | struct Animal { 4 | virtual void speak() = 0; 5 | }; 6 | 7 | struct Dog : Animal { 8 | void speak() override { 9 | std::cout << "Woof!\n"; 10 | } 11 | }; 12 | 13 | struct Cat : Animal { 14 | void speak() override { 15 | std::cout << "Meow!\n"; 16 | } 17 | }; 18 | 19 | int main() { 20 | Dog d; 21 | d.speak(); 22 | Cat c; 23 | c.speak(); 24 | 25 | Animal &a1 = d; 26 | a1.speak(); 27 | Animal &a2 = c; 28 | a2.speak(); 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /src/034_class_templates/class_templates.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | template 5 | struct DynamicArray { 6 | int size; 7 | std::unique_ptr ptr; 8 | 9 | DynamicArray(int new_size) : size(new_size), ptr(new T[new_size]) {} 10 | 11 | void fill(T value) { 12 | for(int i = 0; i < size; i += 1) { 13 | ptr[i] = value; 14 | } 15 | } 16 | 17 | void print() { 18 | for(int i = 0; i < size; i++) { 19 | std::cout << ptr[i] << ' '; 20 | } 21 | std::cout << '\n'; 22 | } 23 | }; 24 | 25 | int main() { 26 | DynamicArray int_array(10); 27 | int_array.fill(5); 28 | int_array.print(); 29 | 30 | DynamicArray double_array(10); 31 | double_array.fill(1.23); 32 | double_array.print(); 33 | return 0; 34 | } 35 | -------------------------------------------------------------------------------- /src/035_default_comparison/default_compare.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | struct S { 4 | int a; 5 | int b; 6 | auto operator<=>(const S &s) const = default; 7 | }; 8 | 9 | int main() { 10 | S s1 {10, 20}; 11 | S s2 {1, 3}; 12 | std::cout << (s1 > s2) << '\n'; 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /src/036_virtual_inheritance/virtual_inheritance.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | struct A { 4 | A() { 5 | std::cout << "Constructing A!\n"; 6 | } 7 | }; 8 | 9 | struct B : virtual A { 10 | B() { 11 | std::cout << "Constructing B!\n"; 12 | } 13 | }; 14 | 15 | struct C : virtual A { 16 | C() { 17 | std::cout << "Constructing C!\n"; 18 | } 19 | }; 20 | 21 | struct D : B, C { 22 | D() { 23 | std::cout << "Constructing D!\n"; 24 | } 25 | }; 26 | 27 | int main() { 28 | D d; 29 | A &a = d; 30 | return 0; 31 | } 32 | -------------------------------------------------------------------------------- /src/037_function_objects/function_objects.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | struct IsDivisable { 6 | int divisor; 7 | IsDivisable(int new_divisor) : divisor(new_divisor) {} 8 | bool operator()(int dividend) { 9 | return dividend % divisor == 0; 10 | } 11 | }; 12 | 13 | int main() { 14 | IsDivisable is_divisable_by_10(10); 15 | std::vector my_vector = {41, 20, 84, 94, 23}; 16 | auto itr = std::ranges::find_if(my_vector, is_divisable_by_10); 17 | std::cout << *itr << '\n'; 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /src/038_lambdas/lambdas.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() { 6 | auto is_divisable_by_10 = [divisor=10](int dividend) { 7 | return dividend % divisor == 0; 8 | }; 9 | std::vector my_vector = {41, 20, 84, 94, 23}; 10 | auto itr = std::ranges::find_if(my_vector, is_divisable_by_10); 11 | std::cout << *itr << '\n'; 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /src/040_threads/threads.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | void print_thread_id(int id) { 6 | std::cout << "Printing from thread: " << id << '\n'; 7 | } 8 | 9 | int main() { 10 | std::vector my_threads; 11 | for(int i = 0; i < 3; i+=1) { 12 | my_threads.emplace_back(print_thread_id, i); 13 | } 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /src/041_mutex/mutex.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int main() { 7 | std::mutex m; 8 | auto print_thread_id = [&m](int id) { 9 | std::lock_guard lg(m); 10 | std::cout << "Printing from thread: " << id << '\n'; 11 | }; 12 | 13 | std::vector my_threads; 14 | for(int i = 0; i < 3; i+=1) { 15 | my_threads.emplace_back(print_thread_id, i); 16 | } 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /src/042_atomic/atomic.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() { 6 | std::atomic counter = 0; 7 | auto work = [&counter](){ 8 | for(int i = 0; i < 10000; i += 1) { 9 | counter += 1; 10 | } 11 | }; 12 | 13 | std::thread t1(work); 14 | std::thread t2(work); 15 | t1.join(); 16 | t2.join(); 17 | 18 | std::cout << counter << '\n'; 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /src/043_namespace/namespaces.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | namespace A { 4 | void print() { 5 | std::cout << "Printing from function 1!\n"; 6 | } 7 | } 8 | 9 | void print() { 10 | std::cout << "Printing from function 2!\n"; 11 | } 12 | 13 | int main() { 14 | ::print(); 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /src/044_random/random.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() { 5 | std::random_device rd; 6 | std::mt19937 mt(rd()); 7 | std::uniform_int_distribution uniform(1, 6); 8 | for(int i = 0; i < 10; i += 1) { 9 | std::cout << uniform(mt) << ' '; 10 | } 11 | std::cout << '\n'; 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /src/045_file_io/ifstream.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() { 5 | std::ifstream input("data.txt"); 6 | int data; 7 | while(input >> data) { 8 | std::cout << data << ' '; 9 | } 10 | std::cout << '\n'; 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /src/045_file_io/ofstream.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | std::ofstream output("data.txt"); 5 | for(int i = 0; i < 10; i++) { 6 | output << i * i << ' '; 7 | } 8 | output << '\n'; 9 | return 0; 10 | } 11 | -------------------------------------------------------------------------------- /src/046_constexpr/constexpr.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | constexpr int factorial(int n) { 5 | if(n <= 1) { 6 | return 1; 7 | } else { 8 | return n * factorial(n - 1); 9 | } 10 | } 11 | 12 | int main() { 13 | std::random_device rd; 14 | int result = factorial(rd() % 6); 15 | std::cout << result << '\n'; 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /src/047_concepts/concepts.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | void print(std::integral auto value) { 5 | std::cout << "Printing integral value: " << value << '\n'; 6 | } 7 | 8 | int main() { 9 | print(10.352); 10 | return 0; 11 | } 12 | --------------------------------------------------------------------------------