[工学]数据结构第二章Chapter 2.ppt

Container Types Sequence Containers Associative Containers Associative containers store elements by key. Ex: name, social security number, or part number. A program accesses an element in an associative container by its key, which may bear no relationship to the location of the element in the container. Adapter Containers An adapter contains another container as its underlying storage structure. The programmer interface for an adapter provides only a restricted set of operations from the underlying storage structure. The List Container Stack Containers Queue Containers Priority Queue Containers Set Containers Map Containers Vectors Output with Vectors Declaring Vector Objects Adding and Removing Vector Elements Resizing a Vector Joining Sorted Sublists #include iostream #include vector #include d_random.h #include d_sort.h #include d_util.h using namespace std; template typename T void join (vectorT vA, const vectorT vB); int main() { vectorint vSmall, vMedium, vLarge; randomNumber rnd; int i, value; for (i = 0; i 12; i++) { value = rnd.random(900) + 100; if (value 400) vSmall.push_back(value); else if (value 700 ) vMedium.push_back(value); else vLarge.push_back(value); } insertionSort(vSmall); cout Small: ; writeVector(vSmall); insertionSort(vMedium); cout Medium: ; writeVector(vMedium); insertionSort(vLarge); cout Large: ; writeVector(vLarge); join(vSmall, vMedium); join(vSmall, vLarge); cout Sorted: ; writeVector(vSmall); return 0; } Joining Vectors template typename T void join (vectorT vA, const vectorT vB) { int i, sizeB = vB.size(); for (i = 0; i sizeB; i++) vA.push_back(vB[i]); } d_vector.h #ifndef MINI_VECTOR #define MINI_VECTOR #include d_except.h using namespace std; template typename T class miniVector { public: miniVector(int size = 0); miniVector(const miniVectorT obj); ~miniVector(); miniVector operator= (const miniVectorT rhs);