//.x C:/Code/MultiTreeDemo/ForumEntryTestFullWriteNoFriends.cpp
{
	string base_data_dir = "C:/Code/MultiTreeDemo/";	
	string file_name = base_data_dir + "ForestTest.root";	
	bool verbose_output = true;
	TFile * file = 0;	
	int n_branches = 53;	
	int n_total_branches = n_branches ;	
	
	/////Start of File Write Block
	//In this block we create the base file
	int n_trees = 10708;//Total number of trees.
	int n_entries_per_tree = 155;//number of branches per tree. Minimum is 1		
	file= new TFile(file_name.c_str(),"RECREATE");	
	TRandom r;
	vector<double> data;//create data buffer
	data.resize(n_branches);	
	double * data_root = &(data[0]);
	int j = 0, k =0;
	int write_frequency = 1000;
	try
	{	
		for(k=1;k<=n_trees;k++)
		{					
			stringstream tree_name_builder;
			tree_name_builder<<"Tree_"<<k;		
			string tree_name = tree_name_builder.str();				
			file->cd();//CD to the main file
			TTree * tree = new TTree(tree_name.c_str(), "Main tree");//create main tree 				
			for(int l=0;l<data.size();l++)
			{					 
				stringstream branch_name_builder;
				branch_name_builder<<"Branch_"<<l;
				tree->Branch(branch_name_builder.str().c_str(), l + data_root , "DataValue/D");			
			}			
			j =0;			
			for(j=1;j<=n_entries_per_tree;j++)
			{					 
				r.RndmArray(data.size(),data_root );//fill vector with random data					 				
				tree->Fill();				
			}				
			if(k%write_frequency ==0)//write every 1000 entries
			{
				int nbytes = file->Write();	
				cout <<"File Write out ["<<k<<"]["<<j<<"] == "<<nbytes<<endl;					
				file->Flush();
				file->Close();		
				file= new TFile(file_name.c_str(),"UPDATE");							
			}			
		}
	}		
	catch()
	{
		cout <<"Exception["<<k<<"]["<<j<<"] == "<<endl;			
	}	
	file->Write();			
	file->Flush();//close file
	file->Close();					
	/////End of File Write Block	
}