Before the initial standardization in 1998, C++ was developed by\u00a0Bjarne Stroustrup\u00a0at\u00a0Bell Labs\u00a0since 1979, as an extension of the\u00a0C language\u00a0as he wanted an efficient and flexible language similar to C<\/p>\n
In 1983, \u201cC with Classes\u201d was renamed to \u201cC++\u201d, adding new features that included\u00a0virtual functions, function name and\u00a0operator overloading, references, constants, type-safe free-store memory allocation (new\/delete), improved type checking.<\/span><\/p>\n Here\u2019s a snippet of the code from the first generation:<\/p>\n Here’s another code\u00a0snippet with \u201cMicrosoft Word 1.1\u201d\u00a0 released recently\u00a0 in the \u00a0Computer History Museum.<\/a><\/p>\n C++ second generation: OOP revolution<\/strong><\/p>\n In 1989, C++ 2.0 was released, followed by the updated second edition of\u00a0The C++ Programming Language<\/i>\u00a0in 1991.New features in 2.0 included multiple inheritance, abstract classes, static member functions,\u00a0const member functions, and protected members. In 1990,\u00a0The Annotated C++ Reference Manual<\/i>\u00a0was published. This work became the basis for the future standard.\u00a0 In the 1990s the OOP become very popular and many developers adopted this paradigm. Herb Sutter in his article<\/a>\u00a0considered the OOP adoption as a revolution :<\/p>\n Remember that people have been doing object-oriented programming since at least the days of Simula in the late 1960s. But OO didn\u2019t become a revolution, and dominant in the mainstream, until the 1990s. Why then? The reason the revolution happened was primarily that our industry was driven by requirements to write larger and larger systems that solved larger and larger problems and exploited the greater and greater CPU and storage resources that were becoming available. OOP\u2019s strengths in abstraction and dependency management made it a necessity for achieving large-scale software development that is economical, reliable, and repeatable.<\/em><\/p>\n C++ third generation: Generics and Meta Programming<\/strong><\/p>\n The templates were introduced in 1991 and at this time only a few C++ experts are interested in the generic programming paradigm and few publications talked about it.<\/p>\n Alexandre Stephanov was\u00a0a pioneer C++ expert who try to explore the generic programming possibilities to provide a modern approach to develop the\u00a0 C++ projects.<\/p>\n Here\u2019s an interesting\u00a0document<\/a>\u00a0entitled \u201cAlgorithm-Oriented Generic Libraries\u201d published in 1993 by Alexandre A Stepanov and David R Summer.<\/p>\n Here\u2019s the motivation from the document as explained by the authors:<\/p>\n The effort and amazing work of Alexandre Stephanove , David Musser,\u00a0Meng Lee and the\u00a0C++ standardization committee, a first release version of STL was released in 1994.<\/p>\n <\/p>\n The STL was\u00a0a breath of fresh air to the C++ developers, it provided many interesting features needed to modernize the C++ code which makes the C++ algorithms implementations different to the C\u00a0 implementations ones.<\/p>\nWriteFraction(n) long n;\r\n{\r\n unsigned short i, low, digit; unsigned long k;\r\n putchar(n < 0 ? '-' : ' '); n = abs(n);\r\n putchar((n>>fractionBits) + '0'); putchar('.');\r\n low = k = n << (longBits-fractionBits); \/* align octal point at left *\/\r\n k >>= 4; \/* shift to make room for a decimal digit *\/\r\n for (i=1; i<=8; ++i)\r\n {\r\n digit = (k *= 10L) >> (longBits-4);\r\n low = (low & 0xf) * 10;\r\n k += ((unsigned long) (low>>4)) - ((unsigned long) digit << (longBits-4));\r\n putchar(digit+'0');\r\n }\r\n}\r\n<\/pre>\n![\"c1\"](\"http:\/\/www.javadepend.com\/Blog\/wp-content\/uploads\/c11.png\")
<\/p>\nWe outline an approach to construction of software libraries in which generic algorithms (algorithmic abstractions) play a more central role than in conventional software library technology or in the object-oriented programming paradigm. Our approach is to consider algorithms first, decide what types and access operations they need for efficient execution, and regard the types and operations as formal parameters that can be instantiated in many different ways, as long as the actual parameters satisfy the assumptions on which the correctness and efficiency of the algorithms are based. The means by which instantiation is carried out is language dependent; in the C + + examples in this paper, we instantiate generic algorithms by constructing classes that define the needed types and access operations. By use of such compile-time techniques and careful attention to algorithmic issues, it is possible to construct software components of broad utility with no sacrifice of efficiency.<\/pre>\n
![\"c0\"](\"http:\/\/www.javadepend.com\/Blog\/wp-content\/uploads\/c0.png\")
<\/p>\n