C / C++ / MFC

if(a==b)
    AfxMessageBox("Example of pre tag");

void Investors:: addInvestor(Investor& in)
{ 
    Investor* temp = new Investor[numOfInvestors+1];  //create a new investor array of size of prevArray+1
	if (investorsList == NULL)                        //check if there is something in the array	
	{
		investorsList = temp;                         //save temp in investorsList
		investorsList[0] = in;                        //fill the first element with the investor that you want to add 
	}                                                 //to your list
	else                                              //else if the investorsList is not NULL
	{
		for (int i = 0; i< numOfInvestors; i++)       //in this loop you start copying the elements of the prevlist in
		{                                             //the new temp list
			temp[i] = investorsList[i];	
			cout <<investorslist[i]<<endl;
 }
="" temp[numofinvestors]="in;" copy="" the="" new="" element="" in="" last="" position
="" numofinvestors++;="" increment="" numofinvestors
="" delete="" []="" investorslist;="" old="" list
="" for(="" i="0;" i<numofinvestors;="" i++)
="" {
="" investorslist[i]="temp[i];" 
="" insertionsort(investorslist,="" numofinvestors);
="" investorslist[numofinvestors];="" numofinvestors++;
}="" 
<\pre="">

//Tip: class members should be prefixed with m_ so others can tell what non locals are.
//NumOfInvestors, investorList i'll assume are class members

void Investors::addInvestor(Investor& in)
{     
	Notice your new is created
	Investor* temp = new Investor[numOfInvestors+1];  
	
	//create a new investor array of size prevArray+1	
	if (investorsList == NULL) 
	{		
		investorsList = temp;                         
		
		//save temp in investorsList		
		investorsList[0] = in;                        
	}   
	else   
	{		
		for (int i = 0; i< numOfInvestors; i++)  //in this loop you start copying the elements of the prevlist in		
		{                                             
			//the new temp list			
			temp[i] = investorsList[i];				
			cout <<investorsList[i]<<endl;		
		}        
			temp[numOfInvestors] = in;  //copy the new element in the last position    	
			numOfInvestors++;           //increment the numOfInvestors    	
			
			Notice your new is deleted, but what happens if else isn't executed
			delete [] investorsList;    //delete old list    	
		
			//This isn't going to make sense to the compiler
			
			for(i = 0; i				//Your syntax here was off a little
			{
				investorsList[i] = temp[i]; 		
			}	
			
			insertionSort(investorsList, numOfInvestors);	
			
			investorsList[numOfInvestors];               	
			numOfInvestors++;
	} 
	delete should go here unless your if constructs return early
}	

void Investors:: addInvestor(Investor& in)
{ 
    Investor* temp = new Investor[numOfInvestors+1];  //create a new investor array of size of prevArray+1
	if (investorsList == NULL)                        //check if there is something in the array	
	{
		investorsList = temp;                         //save temp in investorsList
		investorsList[0] = in;                        //fill the first element with the investor that you want to add 
	}                                                 //to your list
	else                                              //else if the investorsList is not NULL
	{
		for (int i = 0; i< numOfInvestors; i++)       //in this loop you start copying the elements of the prevlist in
		{                                             //the new temp list
			temp[i] = investorsList[i];	
			cout <<investorslist[i]<<endl;
 }
="" temp[numofinvestors]="in;" copy="" the="" new="" element="" in="" last="" position
="" numofinvestors++;="" increment="" numofinvestors
="" delete="" []="" investorslist;="" old="" list
="" for(="" i="0;" i<numofinvestors;="" i++)
="" {
="" investorslist[i]="temp[i];" 
="" insertionsort(investorslist,="" numofinvestors);
="" investorslist[numofinvestors];="" numofinvestors++;
}="" <\pre="">

void Investors:: addInvestor(Investor& in)
{ 
    Investor* temp = new Investor[numOfInvestors+1];  //create a new investor array of size of prevArray+1
	if (investorsList == NULL)                        //check if there is something in the array	
	{
		investorsList = temp;                         //save temp in investorsList
		investorsList[0] = in;                        //fill the first element with the investor that you want to add 
	}                                                 //to your list
	else                                              //else if the investorsList is not NULL
	{
		for (int i = 0; i< numOfInvestors; i++)       //in this loop you start copying the elements of the prevlist in
		{                                             //the new temp list
			temp[i] = investorsList[i];	
			cout <<investorslist[i]<<endl;
 }
="" temp[numofinvestors]="in;" copy="" the="" new="" element="" in="" last="" position
="" numofinvestors++;="" increment="" numofinvestors
="" delete="" []="" investorslist;="" old="" list
="" for(="" i="0;" i<="" numofinvestors;="" i++)
="" {
="" investorslist[i]="temp[i];" 
="" insertionsort(investorslist,="" numofinvestors);
="" investorslist[numofinvestors];="" numofinvestors++;
}="" <\pre="">

void Investors:: addInvestor(Investor& in)
{ 
    Investor* temp = new Investor[numOfInvestors+1];  //create a new investor array of size of prevArray+1
	if (investorsList == NULL)                        //check if there is something in the array	
	{
		investorsList = temp;                         //save temp in investorsList
		investorsList[0] = in;                        //fill the first element with the investor that you want to add 
	}                                                 //to your list
	else                                              //else if the investorsList is not NULL
	{
		for (int i = 0; i< numOfInvestors; i++)       //in this loop you start copying the elements of the prevlist in
		{                                             //the new temp list
			temp[i] = investorsList[i];	
			cout <<investorslist[i]<<endl;
 }
="" temp[numofinvestors]="in;" copy="" the="" new="" element="" in="" last="" position
="" numofinvestors++;="" increment="" numofinvestors
="" delete="" []="" investorslist;="" old="" list
="" for(="" i="0;" i<="" numofinvestors;="" i++)
="" {
="" investorslist[i]="temp[i];" 
="" insertionsort(investorslist,="" numofinvestors);
="" investorslist[numofinvestors];="" numofinvestors++;
}="" <\pre="">

//Construction
//Allocate array to hold n Number of elements

Investors::Investors(UINT nSize)
{
	investorsList = new Investor[nSize*sizeof(Investor)];
}


//Add investor item to array
void Investors::addInvestor(Investor& in)
{     
	investorsList[numOfInvestors] = in;     //Add newElement(in) to next available element of investor array

	insertionSort(investorsList, numOfInvestors);	
	
	numOfInvestors++;	//Increment number of available records
} 

//Destruction
Investors::~Investors()
{
	delete [] investorsList;
}

class CMyClass  
{
public:
  CMyClass() : m_nCount(0)
  { m_pBuff = malloc(sizeof(Investor)); }
  ~CMyClass(){ free(m_pBuff); }
  void AddInvestor(Investor& newItem)
  {
    //Add item to array
    *(m_pBuff+m_nCount) = newItem;   

    m_nCount++;  //Increment number of items in array

    //Reallocate room for another item
    m_pBuff = realloc(m_pBuff, sizeof(Investor)*(m_nCount+1)));

    
  }
private:
  UINT      m_nCount;  //Number of items in array
  Investor* m_pBuff;   //Pointer to buffer or list of investors
};

void Investors:: addInvestor(Investor& in)
{ 
	cout<< in<< endl;
	cout<< "numOfInvestors at the beginning: "<< numOfInvestors<< endl;
	numOfInvestors++;
    Investor* temp = new Investor[numOfInvestors+1];  //create a new investor array of size of prevArray+1
	if (investorsList == NULL)                        //check if there is something in the array	
	{
		investorsList = temp;                         //save temp in investorsList
		investorsList[0] = in;                        //fill the first element with the investor that you want to add 
	}                                                 //to your list
	else                                              //else if the investorsList is not NULL
	{
		for (int i = 0; i < (numOfInvestors - 1); i++)//in this loop you start copying the elements of the prevlist in
		{                                             //the new temp list
			cout << "I am inside the first for loop and i = "<< i<< endl;
			temp[i] = investorsList[i];	
			cout<< temp[i]<< endl;
		}
        delete [] investorsList;
		investorsList = new Investor[numOfInvestors];
        temp[numOfInvestors - 1] = in;                     //copy the new element in the last position
    	for( i = 0; i < numOfInvestors; i++)
		{
    	   investorsList[i] = temp[i]; 
		}
		insertionSort(investorsList, numOfInvestors);
	}
	delete [] temp;
	cout<<"numOfInvestors at the end: "<< numOfInvestors<< endl;
 
} 
<\pre> 

AGAIN THANK YOU:rose: :rose: :rose: :rose: :rose: :rose:

//customer.h
#ifndef _CUSTOMER_H_
#define _CUSTOMER_H_
//In the first pass of the preprocessor the symbol _CUSTOMER_H_ gets defined
//so if you have included this header again in some other file the
//preprocessor does not go into the if block again as _CUSTOMER_H_ is defined
.
.
.
.
#endif

1. points to pixels
   
   
   
   • 1pt = 1/72in
   • 1in = 2.54cm
   • 1cm = 1000 HIMETRIC units (HIMETRIC = .01mm)
   • convert HIMETRIC to pixels using pDC->HIMETRICtoDP()
   • so, the conversion would go like this:
     

     int px = pt*2540/72;
     CSize size(px,px);
     pDC->HIMETRICtoDP(&size);

2. cm to pixels (explained above already)

   int px = cm*1000;
   CSize size(px,px);
   pDC->HIMETRICtoDP(&size);