2002-11

<body stylesrc="index.html" background="images/Bkgrnd02T2.gif"> <table border="0" cellpadding="6" cellspacing="0" width="955"> <tr> <td align="right" valign="top" height="1" width="165"> <p align="center"><img border="0" src="images/Accent03.gif" align="left" width="142" height="37"> </p> <p align="left"><b><font size="2">November 2002 - Vol. 3 No. 11</font></b></p> </td> <td height="1" width="762"> <p align="center">  <a href="index.html" target="_top">[Home]</a> <a href="Newsletters.html" target="_top">[Up]</a> <a href="2002-12.html" target="_top">[Next]</a> <a href="2002-10.html" target="_top">[Previous]</a></td> </tr> <tr> <td valign="top" height="529" bgcolor="#FFFFCC" width="165"> <font size="2"> <p><a href="#TechTalk"><b>Tech Talk</b></a><br> <a href="#C++ Standards Library Report">C++ Standards Library Report</a> </p> <p><a href="#Editorial"><b>Editorial</b></a><br> <a href="#Sea Change in C++">Sea Change in C++</a> </p> <p><a href="#Book Reviews"><b>Book Review</b></a><br> <a href="#The Power of Events">The Power of Events</a> </p> <p><a href="#Trends"><b>Trends</b></a><br> <a href="#Turnaround?">Turnaround?</a></font></p> </td> <td height="277" bgcolor="#FFCC99" width="762"> <b> <h1><a name="TechTalk"><font color="#000000">Tech Talk</font></a></h1> <i> <h2><font face="Arial"><a name="C++ Standards Library Report">C++ Standards Library Report</a></font></h2> </i> </b> <i> <p>by <a href="Author-RegCharney.html"> Reg. Charney</a></p> </i> <p>I have just returned from Santa Cruz where we held the semi-annual Standards meeting on C++. I spent most of my time in the Library Working Group discussing new features for the next Library Extensions Technical Report. I have reported on some of the main topics below.</p> <h3><b><font face="Arial">Move semantics</font></b></h3> <p>Move semantics promises to significantly increase run-time efficiency of many library elements — in some cases by a factor of 10+. The proposal has generated a lot of discussion been for years and is finally bearing fruit. It originates in the Core Working Group but mainly affects the Library. Changes are 100% compatible with existing code, while introducing a fundamental new concept into C++.</p> <p>This proposal augments copy semantics. A user might define a class as copyable and movable, either or neither. The difference between a copy and a move is that a copy leaves the source unchanged. A move on the other hand leaves the source in a state defined differently for each type. The state of the source may be unchanged, or it may be radically different. The only requirement is that the object remain in a self consistent state (all internal invariants are still intact). From a client code point of view, choosing move instead of copy means that you don't care what happens to the state of the source. For plain old data structures (PODs), move and copy are identical operations (right down to the machine instruction level).</p> <p>This paper proposes the introduction of a new type of reference that will bind to an rvalue:</p> <div align="center"> <center> <table border="1" width="356" bgcolor="#FFFFFF"> <tr> <td width="346"><font face="Courier New">struct A {/*...*/};<br> void foo(A&& i);    // new syntax</font></td> </tr> </table> </center> </div> <p>The && is the token which identifies the reference as an “rvalue reference” (bindable to an rvalue) and thus distinguishes it from our current reference syntax (using a single &).</p> <p>The rvalue reference is a new type, distinct from the current (lvalue) reference. Functions can be overloaded on A& and A&&, requiring such functions each to have distinct signatures.</p> <p>The most common overload set anticipated is:</p> <div align="center"> <center> <table border="1" width="346" bgcolor="#FFFFFF"> <tr> <td width="336"><font face="Courier New">void foo(const A& t); // #1<br> void foo(A&& t);      // #2</font></td> </tr> </table> </center> </div> <p>The rules for overload resolution are (in addition to the current rules):</p> <ul> <li>rvalues prefer rvalue references.</li> <li>lvalues prefer lvalue references.</li> <li>CV qualification conversions are considered secondary relative to r-/l-value conversions. rvalues can still bind to a const lvalue reference (const A&), but only if there is not a more attractive rvalue reference in the overload set. lvalues can bind to an rvalue reference, but will prefer an lvalue reference if it exists in the overload set. The rule that a more cv-qualified object can not bind to a less cv-qualified reference stands - both for lvalue and rvalue references.</li> </ul> <p><b>Examples:</b></p> <div align="center"> <center> <table border="1" width="372" bgcolor="#FFFFFF"> <tr> <td width="352"><font face="Courier New">struct A {};<br> A source();<br> const A const_source();<br> // . . .<br> A a;<br> const A ca;<br> foo(a);              // binds to #1<br> foo(ca);             // binds to #1<br> foo(source());       // binds to #2<br> foo(const_source()); // binds to #1</font></td> </tr> </table> </center> </div> <p>The first foo() call prefers the lvalue reference as (lvalue)a is a better match for const A& than for A&& (lvalue -> rvalue conversion is a poorer match than A& -> const A& conversion). The second foo() call is an exact match for #1. The third foo() call is an exact match for #2. The fourth foo() call can not bind to #2 because of the disallowed const A&& -> A&& conversion. But it will bind to #1 via an rvalue->lvalue conversion.</p> <p>Note that without the second foo() overload, the example code works with all calls going to #1. As move semantics are introduced, the author of foo knows that he will be attracting non-const rvalues by introducing the A&& overload and can act accordingly. Indeed, the only reason to introduce the overload is so that special action can be taken for non-const rvalues.</p> <h3><b><font face="Arial">Tuples</font></b></h3> <p>Tuples are fixed-size heterogeneous containers containing any number of elements. They are a generalized form of std::pair. The proposal originates in the Core Working Group from a Boost Library [1] implementation, but it will mainly affect in the Library.</p> <p>The proposed tuple types:</p> <ul> <li>Support a wider range of element types (e.g. reference types).</li> <li>Support input from and output to streams, customizable with specific manipulators.</li> <li>Provide a mechanism for ‘unpacking’ tuple elements into separate variables.</li> </ul> <p>The tuple template can be instantiated with any number of arguments from 0 to some predefined upper limit. In the Boost Tuple library, this limit is 10. The argument types can be any valid C++ types. For example:</p> <div align="center"> <center> <table border="1" width="652" bgcolor="#FFFFFF"> <tr> <td width="642"><font face="Courier New">typedef<br>   tuple< A, <br>          const B, <br>          volatile C, <br>          const volatile D <br>        > t1;</font></td> </tr> </table> </center> </div> <p>An n-element tuple has a default constructor, a constructor with n parameters, a copy constructor and a converting copy constructor. By converting copy constructor we refer to a constructor that can construct a tuple from another tuple, as long as the type of each element of the source tuple is convertible to the type of the corresponding element of the target tuple. The types of the elements restrict which constructors can be used:</p> <ul> <li>If an n-element tuple is constructed with a constructor taking 0 elements, all elements must be default constructible. For example:</li> </ul> <div align="center"> <center> <table border="1" width="636" bgcolor="#FFFFFF"> <tr> <td width="626"><font face="Courier New">class no_default_ctor { no_default_ctor(); };<br> tuple<no_default_ctor, float> b; // error - need default ctor<br> tuple<int&> c;                   // err no ref default ctor<br> tuple<int, float> a;             // ok</font></td> </tr> </table> </center> </div> <p>If an n-element tuple is constructed with a constructor taking n elements, all elements must be copy constructible and convertible (default initializable) from the corresponding argument. For example:</p> <div align="center"> <center> <table border="1" width="100%" bgcolor="#FFFFFF"> <tr> <td><font face="Courier New">tuple< int, const int, std::string >(1, ’a’, "Hi") // ok<br> tuple< int, std::string >(1, 2);                   // error</font></td> </tr> </table> </center> </div> <ul> <li>If an n-element tuple is constructed with the converting copy constructor, each element type of the constructed tuple type must be convertible from the corresponding element type of the argument.</li> </ul> <div align="center"> <center> <table border="1" width="100%" bgcolor="#FFFFFF"> <tr> <td><font face="Courier New">tuple< char, int, const char(&)[3] > t1(’a’, 1, "Hi");<br> tuple< int, float, std::string > t2 = t1;               // ok</font></td> </tr> </table> </center> </div> <p>The argument to this constructor does not actually have to be of the standard tuple type, but can be any tuple-like type that acts like the standard tuple type, in the sense of providing the same element access interface. For example, std::pair is such a tuple-like type. For example:</p> <div align="center"> <center> <table border="1" width="487" bgcolor="#FFFFFF"> <tr> <td width="477"><font face="Courier New">tuple< int, int > t3 = make_pair(’a’,1);// ok</font></td> </tr> </table> </center> </div> <p>The proposal includes tuple constructors, utility functions, and ways of testing for tuples. The I/O streams library will be updated to support input and output of tuples. For example,</p> <div align="center"> <center> <table border="1" width="311" bgcolor="#FFFFFF"> <tr> <td width="301"> <p align="center"><font face="Courier New">cout << make_tuple(1,"C++");</font></td> </tr> </table> </center> </div> <p>outputs</p> <div align="center"> <center> <table border="1" width="76" bgcolor="#FFFFFF"> <tr> <td width="66"> <p align="center">(1 C++)</td> </tr> </table> </center> </div> <h3><b><font face="Arial">Hash Tables</font></b></h3> <p>Hash tables almost made it into the first issue of the Standard, but our deadline precluded doing due diligence on the proposal at the time.</p> <p>The current proposal is what you would expect and is compatible with the three main library implementations for hash tables: SGI/STLport, Dinkumware, and Metrowerks. What is new is that things like max_factor, load_factor, and other constants are now treated as hints. Each implementation is free to deal with them as it sees fit. Also, most double values and parameters are going to be float. It was felt that only one or two significant digits were meaningful, so the extra space needed by double was wasted.</p> <p>There was one major outstanding issue. Since there are already widespread hash library implementations in use, how do we avoid breaking existing code. Proposals included making the new hash library names slightly different, or placing them in different namespaces, or usurping the current names because only the committee has the authority to place things in namespace std (any private implementation that placed their hash library into std was, by definition, in error.)</p> <h3><b><font face="Arial">Polymorphic Function Object Wrapper</font></b></h3> <p>This proposal is based on the Boost Function Template Library [1]. It was accepted in Santa Cruz for inclusion in the next TR of the standard. It introduces a class template that generalizes the notion of a function pointer to subsume function pointers, member function pointers, and arbitrary function objects while maintaining similar syntax and semantics to function pointers.</p> <p>This proposal defines a pure library extension, requiring no changes to the core C++ language. A new class template function is proposed to be added into the standard header <functional> along with supporting function overloads. A new class template reference_wrapper is proposed to be added to the standard header <utility> with two supporting functions. For example,</p> <div align="center"> <center> <table border="1" width="471" bgcolor="#FFFFFF"> <tr> <td width="461"><font face="Courier New">int add(int x, int y)<br> { return x+y; }</font> <p><font face="Courier New">bool adjacent(int x, int y)<br> { return x == y-1 || x == y+1;}</font></p> <p><font face="Courier New">struct compare_and_record<br> {<br>   std::vector< std::pair<int,int> > values;<br>   bool operator()(int x, int y)<br>   {<br>     values.push_back(<br>     std::make_pair(x,y));<br>     return x == y;<br>   }<br> };</font></p> <p><font face="Courier New">function< int (int, int) > f;</font></p> <p><font face="Courier New">f = &add;</font></p> <p><font face="Courier New">cout << f(2, 3) << endl; // outputs 5</font></p> <p><font face="Courier New">f = minus<int>();</font></p> <p><font face="Courier New">cout << f(2, 3) << endl; // outputs -1</font></td> </tr> </table> </center> </div> <p>The proposed function object wrapper supports only a subset of the operations supported by function pointers with slightly different syntax and semantics. The major differences are detailed below, but can be summarized as follows:</p> <ul> <li>Relaxation of target requirements to allow conversions in arguments and result type.</li> <li>Lack of comparison operators. However, checking if (f) and if (!f) is allowed.</li> <li>Lack of extraneous null-checking syntax.</li> </ul> <p>The function class template is always a function object.</p> <p><b><font face="Arial">Conclusions</font></b></p> <p>This short report did not touch on other exciting new features that will likely appear in the language, including the Regular Expression proposal, the use of static assertions to allow more extensive compile-time checking based on type information, and the auto expressions proposal to simplify template function definitions.</p> <p>As you can see from the wide range of topics we discussed in Santa Cruz, C++ is still an exciting language that is continuing to adapt to users needs.</p> <h3>References</h3> <p>The Boost Library (<a href="http://www.boost.org">www.boost.org</a>)</p> <b> <h1><font color="#000000"><a name="Editorial">Editorial</a></font></h1> </b> <i> <p>By <a href="Author-RegCharney.html">Reg. Charney</a></p> </i><b> <h2><font face="Arial"><a name="Sea Change in C++">Sea Change in C++</a></font></h2> </b> <p>At the C++ ANSI/ISO Standards Committee last month, Andy Koenig gave a technical presentation that I believe heralds a sea change in C++’s future.</p> <p>C++ is a spin-off of C and introduced classes back around 1983. C++ reflects the needs and environment of computing at that time. Things have changed significantly since then. We now have computers that are magnitudes faster, having thousands of times more memory and storage. The standard user and developer environment is no longer the command line, but is rich multimedia experience. Many of our newer applications run across networks that did not exist when C was first implemented.</p> <p>Under current and future environments, many of our old assumptions are no longer valid or significant. For example, writing small, fast programs was a point of pride from the original days of computing. Now, writing a C/C++ program of less than 100KB can be difficult, often due to the mandatory libraries that are included. In the past, we wrote programs to run in closed environments on isolated uniprocessors. Today, all that has changed. Now, security is a major concern, and by extension, so is reliability. Network considerations play into any design and newer languages are often better suited to particular applications.</p> <p>Also, the area served by C and C++ are diverging. C continues to serve its core user base, but C++ is now used more and more for large systems where its multi-paradigm, object oriented, and generic programming features are a real advantage. While source code compatibility is still a part of the C++ standardization effort, we are coming to a time when library and extension differences are going to force source incompatibility between the two languages. The silver lining is that we will still have binary compatibility when compiled under the same operating system.</p> <p>This isn’t your grandmother’s C/C++ world any more.</p> <h1><a name="Book Reviews"> <b> <font color="#000000">Book Reviews</font> </b> </a></h1> <p><i><b><font size="4"><a name="The Power of Events">The Power of Events</a>—An Introduction to Complex Event Processing In Distributed Systems</font></b></i> by David Luckham, Addison-Wesley, ISBN 0-201-72789-7</p> <p><b>Rating</b>: Very highly recommended!<br> <b>Reading Level</b>: Easy.</p> <p>I believe this book heralds the next step in system design, reliability, and effectiveness. On every page, new ideas jumped out at me.</p> <p>In today’s ever more complex world with computer systems trying to model this complexity, we often do not have the tools to understand what is happening. Because of this ignorance and lack of ability to effectively measure what is occurring, many of our major systems are failing and we are unable to choose effective and efficient ways of improving the process. This book shows how to master this and future complexity.</p> <p>The book comes in two parts, an introduction; and a more rigorous approach. The first part contains examples from a variety of distributed application fields: stock trading, protocol handling, order processing, etc. The problems are non-trivial. The central concept is an event. An event is an envelop that encloses a message, one or more time stamps and an indication of the cause of the event. From this starting point, we can track when something happened and why. For example, shipping a package involves receiving an order, doing a credit check, billing, and physically shipping the goods. Such an example shows a simple event pattern for shipping goods. Using this pattern, we can search for goods shipped and goods rejected. Where the event pattern match fails indicates why it failed to ship. Reporting on these patterns and the patterns themselves are views of interest to different groups — all based on the same set of events.</p> <p>(<i>Caveat—I am so taken with this book, that I have asked if I can co-author the next in the series of these texts. Thus, take my comments with a grain of salt, but my enthusiasm must indicate that this is something special.</i>)</p> <p><i>— Reg. Charney</i></p> <i> <b> <h1><font color="#000000"><a name="Trends">Trends</a></font></h1> </b> <p>By <a href="Author-RegCharney.html">Reg. Charney</a></p> </i> <h2><b><font face="Arial"><a name="Turnaround?">Turnaround</a></font></b><a name="Turnaround?">?</a></h2> <p>Things have been pretty gloomy recently, so the slight up-tick that is shown in this month’s graph is interesting. While there has been a slight downturn in the total number of IT jobs available, both in the U.S. and Silicon Valley (SV), the opening for software engineers seems to be bucking this trend. (see Figure #1).</p> <p align="center"><img border="0" src="images/2002-11-Fig01.gif" width="462" height="312"></p> <p>Least we get too excited, the graph shows that we are currently running at about 18% U.S.-wide and 5% of Silicon Valley of the job openings that we had in January 2000. </td> </tr> </table> </body>