Home > Store

Imperfect C++: Practical Solutions for Real-Life Programming

Register your product to gain access to bonus material or receive a coupon.

Imperfect C++: Practical Solutions for Real-Life Programming


  • Sorry, this book is no longer in print.
Not for Sale


  • Copyright 2005
  • Dimensions: 7-3/8" x 9-1/4"
  • Pages: 624
  • Edition: 1st
  • Book
  • ISBN-10: 0-321-22877-4
  • ISBN-13: 978-0-321-22877-2

C++ is one of the most important languages today, but, as with all languages, it is not perfect. Far from it. Hence the topic (and title) of this book: practical techniques for dealing with problems that arise in C++ programming not because the programmer is inexperienced or incompetent, but because this otherwise powerful language is itself deficient in some respect.This book reduces the frustration and indecision programmers experience everyday when using C++. Far from being stymied by a lack of expressiveness in the language, it is commonly the vast array of potential paradigms and techniques supported by C++ that causes the problems. Too many choices.Too much complexity. Where to begin? Where to go? The author, having himself experienced inherent C++ deficiencies for years, presents detailed solutions for dealing with the aggravating problems they cause programmers.

Sample Content

Online Sample Chapter

Imperfect C++: Functors and Ranges

Downloadable Sample Chapter

Untitled Document

Download the Sample Chapter related to this title.

*BONUS CHAPTER - Chapter 10

Table of Contents


1. Enforcing Design: Constraints, Contracts, and Assertions.

    Eggs and Ham.

    Compile-Time Contracts: Constraints.

    Runtime Contracts: Preconditions, Postconditions, and Invariants.


2. Object Lifetime.

    The Object Life Cycle.

    Controlling Your Clients.

    MILs and Boon.

3. Resource Encapsulation.

    A Taxonomy of Resource Encapsulation.

    POD Types.

    Wrapper Proxies.

    RRID Types.

    RAII Types.

    RAII Coda.

4. Data Encapsulation and Value Types.

    A Taxonomy of Data Encapsulation.

    Value Types and Entity Types.

    A Taxonomy of Value Types.

    Open Types.

    Encapsulated Types.

    Value Types.

    Arithmetic Value Types.

    Value Types Coda.

    Encapsulation Coda.

5. Object Access Models.

    Vouched Lifetimes.

    Copied for Caller.

    Given to Caller.

    Shared Objects.

6. Scoping Classes.



    APIs and Services.

    Language Features.


7. ABI.

    Sharing Code.

    C ABI Requirements.

    C++ ABI Requirements.

    I Can C Clearly Now.

8. Objects Across Borders.

    Mostly Portable vtables?

    Portable vtables.

    ABI/OAB Coda.

9. Dynamic Libraries.

    Calling Functions Explicitly.

    Indentity: Link Units and Link Space.



    Resource Ownership.

    Dynamic Libraries: Coda.

10. Threading.

     Synchronizing Integer Access.

    Synchronizing Block Access: Critical Regions.

    Atomic Integer Performance.

    Multithreading Extensions.

    Thread Specific Storage.

11. Statics.

    Nonlocal Static Objects: Globals.


    Function-Local Static Objects.

    Static Members.

    Statics Coda.

12. Optimization.

    Inline Functions.

    Return Value Optimization.

    Empty Base Optimization.

    Empty Derived Optimization.

    Preventing Optimization.


13. Fundamental Types.

    May I Have a byte?

    Fixed-Sized Integer Types.

    Large Integer Types.

    Dangerous Types.

14. Arrays and Pointers.

    Don't Repeat Yourself.

    Arrays Decay into Pointers.


    Cannot Pass Arrays to Functions.

    Arrays Are Always Passed by Address.

    Arrays of Inherited Types.

    Cannot Have Multidimensional Arrays.

15. Values.

    NULL-The Keyword That Wasn't.

    Down to Zero.

    Bending the Truth.



16. Keywords.







    Unsupported Keywords.

17. Syntax.

    Class Layout.

    Conditional Expressions.


    Variable Notation.

18. Typedefs.

    Pointer typedefs.

    What's in a Definition?


    True Typedefs.

    The Good, the Bad, and the Ugly.


19. Casts.

    Implicit Conversion.

    Casting in C++.

    The Case for C Casts.

    Casts on Steroids.






    Casts: Coda.

20. Shims.

    Embracing Change and Enhancing Flexibility.

    Attribute Shims.

    Logical Shims.

    Control Shims.

    Conversion Shims.

    Composite Shim Concepts.

    Namespaces and Koenig Lookup.

    Why Not Traits?

    Structural Conformance.

    Breaking Up the Monolith.

    Shims: Coda.

21. Veneers.

    Lightweight RAII.

    Binding Data and Operations.

    Rubbing Up to Concepts.

    Veneers: Coda.

22. Bolt-ins.

    Adding Functionality.

    Skin Selection.

    Nonvirtual Overriding.

    Leveraging Scope.

    Simulated Compile-Time Polymorphism: Reverse Bolt-ins.

    Parameterized Polymorphic Packaging.

    Bolt-ins: Coda.

23. Template Constructors.

    Hidden Costs.

    Dangling References.

    Template Constructor Specialization.

    Argument Proxies.

    Argument Targeting.

    Template Constructors: Coda.


24. operator bool().

    operator int() const.

    operator void () const.

    operator bool() const.

    operator !()-not!.

    operator boolean const () const.

    operator int boolean::() const.

    Operating in the Real World.


25. Fast, Non-intrusive String Concatenation.



    Working with Other String Classes.

    Concatenation Seeding.

    Pathological Bracing.


26. What's Your Address?

    Can't Get the Real Address.

    What Actions Are Carried Out during Conversion?

    What Do We Return?

    What's Your Address: Coda.

27. Subscript Operators.

    Pointer Conversion versus Subscript Operators.

    Handling Errors.

    Return Value.

28. Increment Operators.

    Missing Postfix Operators.


29. Arithmetic Types.

    Class Definition.

    Default Construction.

    Initialization (Value Construction).

    Copy Construction.


    Arithmetic Operators.

    Comparison Operators.

    Accessing the Value.


    Truncations, Promotions, and Tests.

    Arithmetic Types: Coda.

30. Short-circuit!


31. Return Value Lifetime.

    A Taxonomy of Return Value Lifetime Gotchas.

    Why Return-by-Reference?

    Solution 1-integer_to_string<>.

    Solution 2-TSS.

    Solution 3-Extending RVL.

    Solution 4-Static Array Size Determination.

    Solution 5-Conversion Shims.


    RVL: The Big Win for Garbage Collection.

    Potential Applications.

    Return Value Lifetime: Coda.

32. Memory.

    A Taxonomy of Memory.

    The Best of Both Worlds.


    Memory: Coda.

33. Multidimensional Arrays.

    Facilitating Subscript Syntax.

    Sized at Run Time.

    Sized at Compile Time.

    Block Access.


    Multidimensional Arrays: Coda.

34. Functors and Ranges.

    Syntactic Clutter.

    for_all() ?

    Local Functors.


    Functors and Ranges: Coda.

35. Properties.

    Compiler Extensions.

    Implementation Options.

    Field Properties.

    Method Properties.

    Static Properties.

    Virtual Properties.

    Property Uses.

    Properties: Coda.

Appendix A. Compilers and Libraries.



    Other Resources.

Appendix B. "Watch That Hubris!"

    Operator Overload.

    DRY Rued Yesterday.

    Paranoid Programming.

    To Insanity, and Beyond!

Appendix C. Arturius.

Appendix D. The CD.





Download the Index file related to this title.

More Information

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.


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.


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.


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.


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


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


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.


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.


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