Home > Articles > Programming > C/C++

Efficient C++ Programming

Join Stan Lippman as he identifies efficient C++ programming idioms. Learn the reasons for prefering locality of declaration when using class objects refers, as well as why the initialization of a class object is generally less expensive than its assignment.
Like this article? We recommend

Like this article? We recommend

Given the following Point3D class (with a copy constructor, copy assignment operator, and destructor)

class Point3D {
public:
    Point3D( float=0.0f, float=0.0f, float=0.0f );
    Point3D( const Point3D& );
    ~Point3D();

    Point3D operator=( const Point3D& );
    Point3D operator+( const Point3D&, const Point3D& );
  // ...
};

and the following two Point3D class objects

Point3D pt1( 0.0f, 2.0f, -5.0f ), 
    pt2( 2.0f, 0.0f, -5.0f );

which is the more efficient: the initialization of new_origin with the return value of the overloaded addition operator:

Point3D new_origin = pt1 + pt2;

or its assignment:

new_origin = pt1 + pt2;

The initialization of new_origin is always more efficient than its assignment (we'll see why in the next section). In both cases, the final result is the same: new_origin holds the result of adding pt1 and pt2. The issue is one of performance, not correctness. The difference is in the amount of work it takes to get to the same result.

Is the difference in performance significant? That depends both on how often this particular form of initialization versus assignment occurs within the program, and the size and complexity of the class involved. In this case, the increased program efficiency comes largely for free after we recognize and internalize the assignment versus initialization idiom. One primary focus of this text is to identify efficient C++ programming idioms. Locality of declaration is as good a starting point as any.

Locality of Declaration

In the C language, within a block, all definitions must appear before any program statements. A C programmer, for example, writes

    void foo()
    {
   // In C, all objects within a block 
   //  must be declared before the first
   //  program statement
       int ival, ix;
       int *ptr;

       // ok: now begin programming ...   
    }

even if the variables ival, ix, and ptr are not used until 50 or 100 lines later. In C++, an object declaration, such as

int ival;

is itself a program statement, and may be placed anywhere within the program text.

Locality of declaration was the motivation for this difference between the C++ and C languages: to allow an object to be declared near its use rather than at the top of its containing block. For example,

// ptr only visible within body of if-statement
if ( int *ptr = retrieve_department_codes() )
  { /* ... ok: process array of codes ... */ }

// ix is only visible within body of for-loop
for ( int ix = 0; ix < vec.size(); ++ix )
  { /* ... iterate across the vector ... */ }

With regard to the built-in numeric data types (such as integer, double, char, and so on) or the compound data types such as arrays and pointers, locality of declaration is a matter of personal style. With non-trivial class objects, however—that is, class objects that have associated constructor(s) and a destructor—locality of declaration affects program efficiency.

For example, consider the following code fragment using the C language idiom of defining our objects at the beginning of the block. There is no harm in coding like this in C because the declaration of an object has no side effects. This is not true in C++, in which a default constructor and destructor are associated with the two Matrix objects m1 and m2.

// inefficient C idiom using C++
{
        Matrix m1, m2;
        
        if ( !arrayMat )
            return 0;
		
        if ( cacheItem( arrayMat )) {
            // check cache; if match, return 1;
        }
        
        // ok, do the real work here
}

Although this fragment executes correctly, it is inefficient whenever either of the conditional statements evaluates as true. This is because m1 and m2 must always be constructed and destructed even if the program returns prior to actually making use of the objects. For example, here is a likely compiler expansion of the code:

  // Pseudo C++ Code : likely compiler expansion
    {
        Matrix m1, m2;
		
        // invoke the default constructors ...
        m1.Matrix::Matrix();
        m2.Matrix::Matrix();

        if ( !arrayMat ) 
		{
           // ok: must destroy Matrix objects
           m1.Matrix::~Matrix();
           m2.Matrix::~Matrix();
           return 0;
        }
		
        if ( cacheItem( arrayMat )) 
        {
           // again: must destroy Matrix objects
           m1.Matrix::~Matrix();
           m2.Matrix::~Matrix();
           return 1;
        }
		
        // ok, do the real work here
 }

A typical response to this example is to ask why a sufficiently smart compiler could not suppress the construction and destruction of the objects in cases in which they are not explicitly used.

In general, the standard says that a compiler is allowed to remove an object only if the compiler is certain that the object is never used and its constructor and destructor do not have any side effects. In this example, the objects are used, but not until after the two conditional if-statements. So it is not an issue of removing the objects, but rather of moving their construction to after evaluation of the two conditional statements.

Couldn't the compiler then just simply delay the construction of the objects until after the conditional statements? No. The reason is that the compiler cannot know what the default constructor is actually doing and therefore whether it is safe to delay its invocation.

For example, a C++ design idiom is for a constructor to acquire a resource, perhaps a lock on shared memory, which is then freed within the destructor. Although the class object is never used explicitly, the program depends on the constructor side effects. Moreover, the construction needs to be timely; delaying it could be as problematic as not invoking the constructor at all.

Okay, you might argue. But why can't the compiler recognize that and only delay the construction in cases in which it is safe, such as with our Matrix objects? On a purely mechanical level, the problem is that the Matrix constructor is almost certainly going to be stored in a separate file. Moreover, it is likely to have been compiled long before our code fragment and stored in a shared library.

In general, this level of decision—when the constructor should be invoked—is best handled by the programmer. The idiom is that of locality of declaration:

// ok: use locality of declaration under C++
{
        if ( !arrayMat )
           return 0;
		
        if ( cacheItem( arrayMat )) {
           // check cache; if match, return 1;
        }
		
        // ok: only constructed and destructed
        //   if execution reaches here
        Matrix m1, m2;

        // ok, do the real work here
}

A second reason to prefer locality of declaration when using class objects refers back to our original observation; that is, that the initialization of a class object, such as

Matrix m1, m2;
// stuff using m1 and m2
Matrix composite = m1 + m2;

is more efficient than the semantically equivalent assignment

Matrix m1, m2, composite;
// same stuff using m1 and m2
composite = m1 + m2;

A reasonable question at this point is to ask why? Let's see what sense we can make of this in the following two sections.

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020