Home > Articles > Programming > C/C++

  • Print
  • + Share This
This chapter is from the book

Item 2: Predicates, Part 1: What remove() Removes (Difficulty: 4)

This Item lets you test your standard algorithm skills. What does the standard library algorithm remove() actually do, and how would you go about writing a generic function to remove only the third element in a container?

  1. What does the std::remove() algorithm do? Be specific.

  2. Write code that eliminates all values equal to 3 from a std::vector<int>.

  3. A programmer working on your team wrote the following alternative pieces of code to remove the nth element of a container.

    // Method 1: Write a special-purpose

    // remove_nth algorithm.

    //

    template<typename FwdIter>

    FwdIter remove_nth( FwdIter first, FwdIter last, size_t n )

    {

    /* ... */

    }

    // Method 2: Write a function object which returns

    // true the nth time it's applied, and use

    // that as a predicate for remove_if.

    //

    class FlagNth

    {

    public:

    FlagNth( size_t n ) : current_(0), n_(n) { }

    template<typename T>

    bool operator()( const T& ) { return ++current_ == n_; }

    private:

    size_t current_;

    const size_t n_;

    };

    // Example invocation

    ... remove_if( v.begin(), v.end(), FlagNth(3) ) ...

    1. Implement the missing part of Method 1.

    2. Which method is better? Why? Discuss anything that might be problematic about either solution.

Solution

  1. What does the std::remove() algorithm do? Be specific.

    The standard algorithm remove() does not physically remove objects from a container; the size of the container is unchanged after remove() has done its thing. Rather, remove() shuffles up the "unremoved" objects to fill in the gaps left by removed objects, leaving at the end one "dead" object for each removed object. Finally, remove() returns an iterator pointing at the first "dead" object, or, if no objects were removed, remove() returns the end() iterator.

    For example, consider a vector<int> v that contains the following nine elements:

    1 2 3 1 2 3 1 2 3

    Say that you used the following code to try to remove all 3's from the container:

    // Example 2-1
    //
    remove( v.begin(), v.end(), 3 ); // subtly wrong

    What would happen? The answer is something like this:

    1 2 1 2 1 2 ? ? ?
    
    unremoved  "dead"
           objects
           ^
           |
           |
           iterator returned by
           remove() points to
           the third-last object
           (because three were
           removed)

    Three objects had to be removed, and the rest were copied to fill in the gaps. The objects at the end of the container may have their original values (1 2 3), or they may not; don't rely on that. Again, note that the size of the container is left unchanged.

    If you're wondering why remove() works that way, the most basic reason is that remove() doesn't operate on a container, but rather on a range of iterators, and there's no such iterator operation as "remove the element this iterator points to from whatever container it's in." To do that, we have to actually get at the container directly. (For further information about remove(), see also Andrew Koenig's thorough treatment of this topic in Accelerated C++.)

  2. Write code that removes all values equal to 3 from a std::vector<int>.

    Here's a one-liner to do it, where v is a vector<int>:

    // Example 2-2: Removing 3's from a vector<int> v
    //
    v.erase( remove( v.begin(), v.end(), 3 ), v.end() );

    The call to remove( v.begin(), v.end(), 3 ) does the actual work, and returns an iterator pointing to the first "dead" element. The call to erase() from that point until v.end() gets rid of the dead elements so that the vector contains only the unremoved objects.

  3. A programmer working on your team wrote the following alternative pieces of code to remove the nth element of a container.

    // Example 2-3(a)
    //
    // Method 1: Write a special-purpose
    // remove_nth algorithm.
    //
    template<typename FwdIter>
    FwdIter remove_nth( FwdIter first, FwdIter last, size_t n )
    {
     /* ... */
    }
    // Example 2-3(b)
    //
    // Method 2: Write a function object which returns
    // true the nth time it's applied, and use
    // that as a predicate for remove_if.
    //
    class FlagNth
    {
    public:
     FlagNth( size_t n ) : current_(0), n_(n) { }
     template<typename T>
     bool operator()( const T& ) { return ++current_ == n_; }
    private:
     size_t    current_;
     const size_t n_;
    };
    // Example invocation
    ... remove_if( v.begin(), v.end(), FlagNth(3) ) ...
    1. Implement the missing part of Method 1.

People often propose implementations that have the same bug as the following code. Did you?

// Example 2-3(c): Can you see the problem(s)?
//
template<typename FwdIter>
FwdIter remove_nth( FwdIter first, FwdIter last, size_t n )
{
 for( ; n > 0; ++first, --n )
  ;
 if( first != last )
 {
  FwdIter dest = first;
  return copy( ++first, last, dest );
 }
 return last;
}

There is one problem in Example 2-3(c), and that one problem has two aspects:

  1. Correct preconditions: We don't require that n <= distance( first, last ), so the initial loop may move first past last, and then [first,last) is no longer a valid iterator range. If so, then in the remainder of the function, Bad Things will happen.

  2. Efficiency: Let's say we decided to document (and test!) a precondition that n be valid for the given range, as a way of addressing problem #1. Then we should still dispense with the iterator-advancing loop entirely and simply write advance( first, n). The standard advance() algorithm for iterators is already aware of iterator categories, and is automatically optimized for random-access iterators. In particular, it will take constant time for random-access iterators, instead of the linear time required for other iterators.

    Here is a reasonable implementation:

    // Example 2-3(d): Solving the problems
    //
    // Precondition:
    // - n must not exceed the size of the range
    //
    template<typename FwdIter>
    FwdIter remove_nth( FwdIter first, FwdIter last, size_t n )
    {
     // Check precondition. Incurs overhead in debug mode only.
     assert( distance( first, last ) >= n );
    
     // The real work.
     advance( first, n );
     if( first != last )
     {
      FwdIter dest = first;
      return copy( ++first, last, dest );
     }
     return last;
    }
    1. Which method is better? Why? Discuss anything that might be problematic about either solution.

Method 1 has two main advantages:

  1. It is correct.

  2. It can take advantage of iterator traits, specifically the iterator category, and so can perform better for random-access iterators.

Method 2 has corresponding disadvantages, which we'll analyze in detail in the second part of this miniseries.

  • + Share This
  • 🔖 Save To Your Account

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