We do not fully understand the scope of human freedom, until we learn to let go.
User login
Templates
Generic Function Example
#include ≤iostream≥
using namespace std;
int min(int a, int b)
{
return(a≤b)?a:b;
}
int main()
{
int a=10, b=5;
cout ≤≤ min(a,b) ≤≤ '\n';
char p='A', q='Z';
cout ≤≤ min(p,q) ≤≤ '\n';
float z=1.91f, x=3.98f;
cout ≤≤ min(z,x) ≤≤ '\n';
return 0;
}
5 A 1.91
#includeusing namespace std; template ≤class T≥ T min (T a, T b) { return (a ≤ b)?a:b; } int main() { in a=10, b=5; cout ≤≤ min(a,b) ≤≤ '\n'; char p='A', q='Z'; cout ≤≤ min(p,q) ≤≤ '\n'; float z=1.91, x=3.98; cout ≤≤ min(z,x) ≤≤ '\n'; return 0; }
// This function demonstrates a generic stack
#include≤class StackType≥ class stack {
StackType stck[SIZE]; //holds the stack
int tos; // index of top-of-stack
public:
stack() { tos = 0; } // stack initialization
void push(StackType ob); // push object on stack
StackType pop(); // pop object from stack
};
// Push an object
template ≤class StackType≥ void stack≤StackType≥::push(StackType ob) {
if(tos == SIZE) {
cout ≤≤ "Stack is full.\n";
return;
}
stck[tos] = ob;
tos++;
}
// Pop and object
template ≤class StackType≥StackType stack ≤StackType≥::pop() {
if(tos==0) {
cout ≤≤ "Stack underflow.\n";
return 0;
}
tos--;
return stck[tos];
}
int main()
{
//Demonstrates character stacks
stack≤char≥ stack1, stack2; //create two character stacks
stack1.push('x');
stack1.push('y');
stack2.push('a');
stack2.push('b');
cout ≤≤ stack1.pop() ≤≤ " "
cout ≤≤ stack2.pop() ≤≤ " "
stack≤double≥ dstack1, dstack2; //create two double stacks
dstack1.push(1.1);
dstack1.push(2.2);
dstack2.push(3.3);
dstack2.push(4.4);
cout ≤≤ dstack1.pop() ≤≤ " ";
cout ≤≤ dstack2.pop() ≤≤ "\n";
return 0;
}
- Log in to post comments