tree114_circular.C File Reference

Detailed Description

Example of a circular Tree

Circular Trees are interesting in online real time environments to store the results of the last maxEntries events. for more info, see TTree::SetCircular. Circular trees must be memory resident.

 
void tree114_circular()
{
   TRandom r;
   Float_t px,py,pz;
   Double_t randomNum;
   UShort_t i;
   auto T = new TTree("T", "test circular buffers");
   T->Branch("px", &px, "px/F");
   T->Branch("py", &py, "px/F");
   T->Branch("pz", &pz, "px/F");
   T->Branch("random", &randomNum, "random/D");
   T->Branch("i", &i, "i/s");
   T->SetCircular(20000); // keep a maximum of 20000 entries in memory
   for (i = 0; i < 65000; i++) {
      r.Rannor(px, py);
      pz = px * px + py * py;
      randomNum = r.Rndm();
      T->Fill();
   }
   T->Print();
}
 

Author

Rene Brun

Definition in file tree114_circular.C.