JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

line breaks

Browse Source
This commit is contained in:
Jidong Xiao
2024-02-06 13:34:13 -05:00
parent 22008723d5
commit 2f470b4771
1 changed files with 9 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
lectures/09_iterators_linked_lists/README.md
View File

@@ -98,17 +98,11 @@ sequential data that can shrink or grow.
- However, the use of memory is fundamentally different. Vectors are formed as a single contiguous array-like block of memory. Lists are formed as a sequentially linked structure instead. - However, the use of memory is fundamentally different. Vectors are formed as a single contiguous array-like block of memory. Lists are formed as a sequentially linked structure instead.
Although the interface (functions called) of lists and vectors and their iterators are quite similar, their implementations are VERY different. Clues to these differences can be seen in the operations that are NOT in common, Although the interface (functions called) of lists and vectors and their iterators are quite similar, their implementations are VERY different. Clues to these differences can be seen in the operations that are NOT in common,
such as: such as:
- STL vectors / arrays allow “random-access” / indexing / [] subscripting. We can immediately jump to - STL vectors / arrays allow “random-access” / indexing / [] subscripting. We can immediately jump to an arbitrary location within the vector / array.
an arbitrary location within the vector / array. - STL lists have no subscripting operation (we can’t use [] to access data). The only way to get to the middle of a list is to follow pointers one link at a time.
- STL lists have no subscripting operation (we can’t use [] to access data). The only way to get to the - Lists have push_front and pop_front functions in addition to the push_back and pop_back functions of vectors.
middle of a list is to follow pointers one link at a time. - erase and insert in the middle of the STL list is very efficient, independent of the size of the list. Both are implemented by rearranging pointers between the small blocks of memory. (We’ll see this when we discuss the implementation details next week).
- Lists have push_front and pop_front functions in addition to the push_back and pop_back functions of - We can’t use the same STL sort function we used for vector; we must use a special sort function defined by the STL list type.
vectors.
- erase and insert in the middle of the STL list is very efficient, independent of the size of the list. Both
are implemented by rearranging pointers between the small blocks of memory. (We’ll see this when we
discuss the implementation details next week).
- We can’t use the same STL sort function we used for vector; we must use a special sort function defined
by the STL list type.
```cpp ```cpp
std::vector<int> my_vec; std::vector<int> my_vec;
std::list<int> my_lst; std::list<int> my_lst;
@@ -136,10 +130,10 @@ std::list<int>::iterator q = s.erase(p);
``` ```
After the code above is executed: After the code above is executed:
– The integer stored in the second entry of the list has been removed. - The integer stored in the second entry of the list has been removed.
– The size of the list has shrunk by one. - The size of the list has shrunk by one.
– The iterator p does not refer to a valid entry. - The iterator p does not refer to a valid entry.
– The iterator q refers to the item that was the third entry and is now the second. - The iterator q refers to the item that was the third entry and is now the second.
To reuse the iterator p and make it a valid entry, you will often see the code written: To reuse the iterator p and make it a valid entry, you will often see the code written: