Dynamic Objects动态对象.pptVIP

Dynamic Objects Memory Management Static Memory Allocation Memory is allocated at compilation time Dynamic Memory Memory is allocated at running time Static vs. Dynamic Objects Static object Memory is acquired automatically Memory is returned automatically when object goes out of scope Dynamic object Memory is acquired by program with an allocation request new operation Dynamic objects can exist beyond the function in which they were allocated Object memory is returned by a deallocation request delete operation Object (variable) creation: New Syntax ptr = new SomeType; where ptr is a pointer of type SomeType Object (variable) destruction: Delete Syntax delete p; storage pointed to by p is returned to free store and p is now undefined Array of New: dynamic arrays Syntax P = new SomeType[Expression]; Where P is a pointer of type SomeType Expression is the number of objects to be constructed -- we are making an array Because of the flexible pointer syntax, P can be considered to be an array A Simple Dynamic List Example cout Enter list size: ; int n; cin n; int *A = new int[n]; if(n=0){ cout bad size endl; return 0; } initialize(A, n, 0); print(A, n); A = addElement(A,n,5); print(A, n); A = deleteFirst(A,n); print(A, n); selectionSort(A, n); print(A, n); delete [] A; Initialize void initialize(int list[], int size, int value){ for(int i=0; isize; i++) list[i] = value; } print() void print(int list[], int size) { cout [ ; for(int i=0; isize; i++) cout list[i] ; cout ] endl; } Delete the first element // for deleting the first element of the array int* deleteFirst(int list[], int size){ if(size = 1){ if(size==1) delete [] list; size = 0; return NULL; } int* newList = new int [size-1]; // make new array if(newList==0){ cout Memory allocation error for deleteFirst! endl; exit(0); } for(int i=0; isize-1; i++) // copy and delete old array newList[i] = list[i+1]; delete [] list; size--; return newL