Data Structures with C++ using STL 2E Chapter 6.ppt

1、1,Shifting blocks of elements Model of a list object Sample list The list ADT CLASS list Constructors CLASS list Operations (7 slides) CLASS list:iterator Operations Inserting an element into a list Removing an element from a list Ordered lists Splicing two lists Summary Slides (5 slides),Chapter 6

2、The List Container and Iterators,2,Shifting blocks of elements to insert or delete a vector item,3,Model of a list object with links to next and previous element,4,Sample list,5,The List ADT,The list API documents the member function prototype as well as pre- and postconditions. provides three const

3、ructors to declare a list object.,6,7,8,9,10,11,12,13,iterator insert(iterator pos, const T Insert value before pos, and return an iterator pointing to the position of the new value in the list. The operation does not affect any existing iterators. Postcondition:The list has a new element.,14,15,Ins

4、erting an element into a list,16,Removing an element from a list,17,Ordered lists,Position the iterator curr at the front of the list. Insert 50 in the list:,18,Splicing two lists,19,Summary Slide 1,-list -A Sequence of elements stored by position. -Index access is not available -to access the value

5、 of an element, must pass through its preceding elements. -list iterator -A generalized pointer that moves through a list element by element forward or backward -At any point, the * operator accesses the value of a list item.,20,Summary Slide 2,-The list class has two iterator types: 1)iterator: A g

6、eneralized list traversal pointer. 2)const _ iterator: must be used with a constant list object. Each type is a nested class of list and must be accessed by using the scope operator :,21,Summary Slide 3,-the list member function begin() -Gives an iterator an initial value that points to the first el

7、ement. -the list member function end() -Returns an iterator pointing just past the last element of the list.,22,Summary Slide 4,-The sequential search of a list object -implemented by using an iterator range first, last). -It returns an iterator that points at the target value or has value last if the target is not in the list.,23,Summary Slide 5,-list class member fns insert() and erase() -Both use an iterator argument to modify a list. insert(): places value in t