Adapters
A 111
Container container adapter provides restricted interface to a container. In general container adapters do not provide iterators since the processing of elements in the container is restricted to a predefined set of operations. Example: Stacks, queues, sorted list etc.
112
Container Adapters(2)
A Sorted List is a linear list in which elements are arranged based on the order of their values. A Stack is a linear list in which insertions and deletions take place at the same (top) end (last-in-first-out). The other end of the list is called the bottom end The fundamental operations are: push is equivalent to an insert pop is the deletion of the most recently added element top is used to examine the top element prior to a pop Queue is a linear list in which insertions and deletions take place at different ends (first-in-first-out ). The end at which new elements are added is called the rear, and the end from which old elements are deleted is called the front The fundamental operations are: enqueue inserts the element at the rear dequeue deletes and returns the element at the front
113
A Sample Stack Implementation
using namespace std; class MyStack { private: vector<int> st; public: //constructor calls vector constructor explicit MyStack():st(vector<int>()){} //insert a copy of x void push(int x) { st.push_back(x);} //remove the top element; stack must be nonempty void pop(){st.pop_back();} //return the top element without removing it; //the stack must be nonempty int top() {return st[st.size()-1];}
114
A Sample Stack Implementation(contd.)
// return true if the stack is empty; otherwise // return false bool empty(){return st.empty();} // return the number of elements in the stack int size(){return st.size();} };
115
Polymorphism
In simple inheritance, if a member function is called through pointer a (or a reference), the function to be called is the one defined for the class of the pointer type. By default, the implementation of a function is chosen at the compile time ( static binding ) based on variable or pointer type. Dynamic (run-time) binding allows the implementation to be chosen at run time based on the class of the object type pointed at by the pointer (reference) Runtime-binding allows a class (hierarchy) to be extended after the program which uses it has been written! Polymorphism is the ability for objects of different class types related by inheritance to respond differently (based on the type of the object) to the same member function call C++ enables Polymorphism via virtual functions
116
Polymorphism(contd.)
Runtime-binding allows a class (hierarchy) to be extended after the program which uses it has been written!
1
Polymorphism is the ability for objects of different class types related by inheritance to respond differently (based on the type of the object) to the same member function call C++ enables Polymorphism via virtual functions
117
Virtual...