#include <iostream> 

class one{
	int a;
public:
	void set(); // give an integer number to a
	void show(); // show the integer
};

class two{
	float a; 
public:
	void set();//give a floating point number to b
	void show(); // show the float
};

union u{
	one a;
	two b;
};


class three{
    int kind;
    u object;
public:	
	//commands here
};


int main() { 

	
	
	return 0;

}

class Base {
   public:
      abstract void set() = 0;
      abstract void show() = 0;
};

class one : public Base {
   int a;
};

class two : public Base {
   float a;
};

class three{
    two a;
    one b;
public:
    void *ptr;
};

class three{
    two a;
    one b;
public:
    one *ptr;
    three()
     {
       ptr=&b;
       }
};

//This presents a class which holds an int.
//The class contains functions that will apply the
//int's binary objects into a vector, thus making it
//easy to apply bitwise operations to the int. After
//that, the int is updated to contain the vector's
//representation of an integer.

#include <iostream>
#include <vector>
#include <math.h>
using namespace std;

class int_bit{
	vector <int> v; // the vector to hold the bits of x
	unsigned long x;
public:
	void show();
	unsigned long int retInt(){return x;}
	int_bit(unsigned long a){x = a;}
	void updateVector(); //update the vector's contents
	void updateInt(); //update the integer's contents
	
	void EraseVector(){v.clear();} //erase the vector
	int retbit(int pos); //return the bit into the 'pos' position
	void changeBit(int pos); //change the bit into the 'pos' position
};

void int_bit::show(){
	int i=sizeof(long)*8-1;
	long maska;
	cout << "The integer bits are:\n";
	for(;i>=0;i--){
		maska=x & (1<<i);
		cout << ((maska > 0)? "1 ":"0 ");
	}
	cout << "\nAnd the vector [" << v.size() << "] bits are:\n";
	for(i=0; i<v.size(); i++){
		cout << v[i] << " ";
	}
	
}

//update the contents of the vector to match the
//bits of the integer in the class
void int_bit::updateVector(){
	int i=sizeof(long)*8-1;
	long maska;
	for(; i>=0; i--){
		maska = x & (1<<i);
		if(maska == 0)
			v.push_back(0);
		else
			v.push_back(1);
	}
}

//returns the bit into the desired location
int int_bit::retbit(int pos){
	return v[pos];
}

//**change the bit. If it's 1, make it 0. Otherwise, make it 1
void int_bit::changeBit(int pos){
	v[pos] = ((v[pos] > 0)? 0 : 1);
}

//**update the int in the class with the changes we have made in
//**the vector
void int_bit::updateInt(){
	vector<int> v2; //temporary vector
	int i;
	unsigned long int sum = 0;
	for(i=(v.size()-1); i>=0; i--){
		v2.push_back(v[i]);
	}
	for(i=0; i<v2.size(); i++){
		sum = sum + (v2[i] * pow(2,i));
	}
	x = sum;
}