@@ -6940,17 +6940,17 @@ bool TTree::MemoryFull(Int_t nbytes)
69406940bool TTree::ImportBranches (TTree* tree)
69416941{
69426942 if (tree) {
6943- TObjArray* newbranches = tree->GetListOfBranches ();
6943+ TObjArray * newbranches = tree->GetListOfBranches ();
69446944 Int_t nbranches = newbranches->GetEntriesFast ();
69456945 const Long64_t nentries = GetEntries ();
6946- std::vector<TBranch*> importedCollection;
6946+ std::vector<TBranch *> importedCollection;
69476947 for (Int_t i = 0 ; i < nbranches; ++i) {
6948- TBranch* nbranch = ( TBranch*) newbranches->UncheckedAt (i);
6948+ TBranch * nbranch = static_cast < TBranch *>( newbranches->UncheckedAt (i) );
69496949 if (nbranch->TestBit (kDoNotProcess )) {
69506950 continue ;
69516951 }
69526952 if (!GetListOfBranches ()->FindObject (nbranch->GetName ())) {
6953- auto addbranch = ( TBranch*) nbranch->Clone ();
6953+ auto addbranch = static_cast < TBranch *>( nbranch->Clone () );
69546954 addbranch->ResetAddress ();
69556955 addbranch->Reset ();
69566956 addbranch->SetTree (this );
@@ -6960,8 +6960,8 @@ bool TTree::ImportBranches(TTree* tree)
69606960 }
69616961 // Backfill mechanism to realign with TTree
69626962 if (!importedCollection.empty ()) {
6963- for ( Long64_t e = 0 ; e < nentries; ++e ) {
6964- for (auto branch : importedCollection) {
6963+ for ( Long64_t e = 0 ; e < nentries; ++e) {
6964+ for (auto branch : importedCollection) {
69656965 branch->BackFill ();
69666966 }
69676967 }
0 commit comments