Home > Articles > Programming > C/C++

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

This chapter is from the book

Using the Sequential Containers

A sequential container holds an ordered collection of elements of a single type. There is a first element, a second element, and so on, until the last element. The vector and the list are the two primary sequential containers. A vector holds its elements in a contiguous area of memory. Random access—for example, accessing element 5, then 17, and then 9—is efficient; each element is a fixed offset from the beginning of the vector. Insertion of an element at any position other than the end of the vector, however, is inefficient; each element to the right of the inserted element must be shifted one by copying the value of each element in turn. Similarly, the deletion of any element other than the last element of a vector is inefficient.

A list represents noncontiguous memory double-linked to allow both forward and backward traversal. Each element of a list contains three fields: the value, a back pointer to the preceding element of the list, and a front pointer to the next element of the list. Insertion and deletion of elements at any position within the list is efficient. The list must simply set the appropriate back and front pointers. Random access, on the other hand, is less efficiently supported. Accessing element 5, then 17, and then 9 requires traversal of the intervening elements. (Think of the difference between a CD and a cassette tape in going from one track to another.)

To represent the elements of a numeric sequence, a vector is the more appropriate container. Why? There is a great deal of random access of the elements. fibon_elem(), for example, indexes into the container based on the position passed to it by the user. Moreover, we never delete elements, and the elements are always inserted at the end of the vector.

When is a list more appropriate? If we were reading test scores from a file and wanted to store each score in ascending order, we likely would be randomly inserting into the container with each score we read. In this case, the list container is preferred.

A third sequential container is a deque (pronounced deck). A deque behaves pretty much like a vector—the elements are stored contiguously. Unlike a vector, however, a deque supports efficient insertion and deletion of its front element (as well as its back element). If, for example, we need to insert elements at the front of the container and delete them from the back, a deque is the most appropriate container type. (The standard library queue class is implemented using a deque to hold the queue's elements.)

To use a sequential container, we must include its associated header file, one of the following:

#include <vector>
#include <list>
#include <deque>

There are five ways to define a sequential container object:

  1. Create an empty container:

  2. list< string > slist;
    vector< int > ivec;
    1. Create a container of some size. Each element is initialized to its default value. (Recall that the default value for the built-in arithmetic types such as int and double is 0.)

    2. list< int >   ilist( 1024 );
      vector< string > svec( 32 );
      1. 3 each element:

      2. vector< int > ivec( 10, -1 );
        list< string > slist( 16, "unassigned" );
        1. Create a container, providing an iterator pair marking a range of elements with which to initialize the container:

        2. int ia[ 8 ] = 
            { 1, 1, 2, 3, 5, 8, 13, 21 };
          
          vector< int > fib( ia, ia+8 );
          1. Create a container, providing a second container object. The new container is initialized by copying the second:

          2. list< string > slist; // empty
            // fill slist ...
            list< string > slist2( slist ); // copy of slist ...

          Two special operations support insertion and deletion at the back of the container: push_back() and pop_back(). push_back() inserts an element at the back. pop_back() deletes the element. In addition, the list and deque containers (but not the vector) support push_front() and pop_front(). The pop_back() and pop_front() operations do not return the deleted value. To read the front value, we use front(); to read the back value, we use back(). For example,

          #include <deque>
          deque<int> a_line;
          int ival;
          while ( cin >> ival )
          {
              // insert ival at back of a_line
              a_line.push_back( ival );
          
              // ok: read the value at front of a_line
              int curr_value = a_line.front();
          
              // ... do something ...
          
              // delete the value at front of a_line
              a_line.pop_front();
          }

          push_front() and push_back() are specialized insertion operations. There are four variations of the more general insert() operation supported by each of the containers:

          • iterator insert( iterator position, elemType value ) inserts value before position. It returns an iterator addressing the inserted element. For example, the following inserts ival in sorted order within ilist:

          •   list<int> ilist;
              // ... fill up ilist 
            
              list<int>::iterator it = ilist.begin();
              while ( it != ilist.end() )
               if ( *it >= ival )
               {
                  ilist.insert( it, ival );
                  break; // exit loop
               }
            
               if ( it == ilist.end() )
                ilist.push_back( ival );
            • void insert( iterator position, int count, elemType value ) inserts count elements of value before position. For example,

            •   string sval( "Part Two" ); 
                list<string> slist;
                // ... fill slist ...
              
                list<string>::iterator 
                   it = find( slist.begin(), slist.end(), sval );
              
                slist.insert( it, 8, string( "dummy" ));
              • void insert( iterator1 position, iterator2 first, iterator2 last ) inserts the range of elements marked by first,last before position:

              •   int ia1[7] = { 1, 1, 2, 3, 5, 55, 89 };
                  int ia2[4] = { 8, 13, 21, 34 };
                  list<int> elems( ia1, ia1+7 ); 
                
                  list<int>::iterator 
                    it = find( elems.begin(), elems.end(), 55 );
                
                  elems.insert( it, ia2, ia2+4 ); 
              • iterator insert( iterator position ) inserts an element before position. The element is initialized to the default value of its type.

              pop_front() and pop_back() are specialized element-erase operations. There are two versions of the more general erase() operation:

              • iterator erase( iterator posit ) erases the element addressed by posit. For example, using the slist defined earlier, let's erase() the first instance of str:

              •   list<string>::iterator 
                    it = find( slist.begin(), slist.end(), str );
                
                  slist.erase( it );
                • iterator erase( iterator first, iterator last ) erases the elements starting with first, up to but not including last. For example, again using the slist defined earlier, let's erase() the num_times instances of str:

                •   list<string>::iterator 
                      first = slist.begin(),
                      last = slist.end();
                  
                    // it1: first element to erase,
                    // it2: first element beyond elements to erase 
                    list<string>::iterator it1 = find( first, last, str );  
                    list<string>::iterator it2 = find( first, last, sval );
                  
                    slist.erase( it1, it2 );

                The returned iterator in both instances of erase() addresses the element following the element or element range deleted.

                The list class does not support offset arithmetic of its iterators. This is why we do not write

                  // error: offset arithmetic is not 
                  // supported for list class
                  slist.erase( it1, it1+num_tries ); 

                but instead provide erase() with both it1 and it2.

  • + 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