#include <iostream> 
 #include <string> 
  
 using namespace std; 
  
 template< class T > 
 class Set{ 
 private: 
 	T *type; 
 	int size; 
 	int current; 
 public: 
 	Set(); 
 	Set(int); 
  
 	void add(T object); 
 	bool remove( T object ); 
  
 	class iterator; 
 	friend class iterator; 
  
 	class iterator{ 
 		Set & set; 
 		int index; 
  
 		iterator( Set & s ) : set(s) , index(0){} 
 		//To create the " end sentinel " iterator: 
 		iterator( Set & s, bool ): set(s), index( s.current ){} 
  
 		iterator begin(){ return iterator(*this); } 
 		//To create the "end sentinel" iterator: 
 	}; 
 }; 
  
 template< class T > 
 Set<T>::Set(){ 
 	size = 5;//default size for set 
 	current = 0; 
 	type = new T[size]; 
 } 
  
 template< class T > 
 Set<T>::Set( int s ){ 
 	size = s;//default size for set 
 	current = 0; 
 	type = new T[size]; 
 } 
  
 template< class T > 
 void Set<T>::add( T object ){ 
 	//should check duplication before adding new item to set 
  
 	//if newitem without causing duplication , add into type 
 	//possible try to check type as well. if different type, raise exception error 
 	if( current < size ) 
 		type[current++] = object; 
 	else 
 		cout << "List is full...." << endl; 
 } 
  
 template< class T > 
 bool remove( T object ){ 
  
 	bool isDeleted = false; 
 	 
 	//loop through the list to search the object 
  
 	//if found then remove the item and reduce current value 
 	//possible try to shift the 
  
 	return isDeleted; 
 } 
  
 int main(){ 
  
 	string list[] = {"Lim" , "Tan" , "Lee" , "Thor" , "Adrian" ,"Henry" , "Zachary" , "Michael" , "Ryan" , "Michelle"}; 
  
 	Set<string>names(10); 
  
 	for( int i = 0 ; i < 10 ; i++ ){ 
 		names.add("Lee"); 
 	} 
 	//Set::iterator 
  
 	for( int i = 0 ; i < 10 ; i++ ){ 
 		cout << list << endl; 
 	} 
  
 	system( "pause" ); 
 	return 0; 
 }

#include <iostream> 
  
 struct A 
 { 
       A() : A( DEFAULT_SIZE ) {} 
       A( int i ) : x( i ) {}    
       int x; 
 private: 
       static const int DEFAULT_SIZE = 5; 
 }; 
  
  
  
 int main() 
 { 
       A a1; 
       A a2( 10 ); 
        
       std::cout << "a1.x = " << a1.x << std::endl; 
       std::cout << "a2.x = " << a2.x << std::endl; 
 }

const int N = 10; 
  
 int a[N] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }; 
  
 int *p = std::find( a, a + N, 6 ); 
  
 if ( p != a + N ) std::cout << "There is " << *p << " element at " << p - a << " position\n";