Skip to content

Remove unused method TChain::Loop #20230

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Nov 2, 2025
Merged

Remove unused method TChain::Loop #20230

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 1 addition & 2 deletions tree/tree/inc/TChain.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -127,8 +127,7 @@ class TChain : public TTree {
bool InPlaceClone(TDirectory *newdirectory, const char *options = "") override;
Int_t LoadBaskets(Long64_t maxmemory) override;
Long64_t LoadTree(Long64_t entry) override;
void Lookup(bool force = false);
virtual void Loop(Option_t *option="", Long64_t nentries=kMaxEntries, Long64_t firstentry=0); // *MENU*
void Lookup(bool force = false);
void ls(Option_t *option="") const override;
virtual Long64_t Merge(const char *name, Option_t *option = "");
Long64_t Merge(TCollection *list, Option_t *option = "") override;
Expand Down
44 changes: 0 additions & 44 deletions tree/tree/src/TChain.cxx
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1804,50 +1804,6 @@ void TChain::Lookup(bool force)
SafeDelete(stg);
}

////////////////////////////////////////////////////////////////////////////////
/// Loop on nentries of this chain starting at firstentry. (NOT IMPLEMENTED)

void TChain::Loop(Option_t* option, Long64_t nentries, Long64_t firstentry)
{
Error("Loop", "Function not yet implemented");

if (option || nentries || firstentry) { } // keep warnings away

#if 0
if (LoadTree(firstentry) < 0) return;

if (firstentry < 0) firstentry = 0;
Long64_t lastentry = firstentry + nentries -1;
if (lastentry > fEntries-1) {
lastentry = fEntries -1;
}

GetPlayer();
GetSelector();
fSelector->Start(option);

Long64_t entry = firstentry;
Int_t tree,e0,en;
for (tree=0;tree<fNtrees;tree++) {
e0 = fTreeOffset[tree];
en = fTreeOffset[tree+1] - 1;
if (en > lastentry) en = lastentry;
if (entry > en) continue;

LoadTree(entry);
fSelector->BeginFile();

while (entry <= en) {
fSelector->Execute(fTree, entry - e0);
entry++;
}
fSelector->EndFile();
}

fSelector->Finish(option);
#endif
}

////////////////////////////////////////////////////////////////////////////////
/// List the chain.

Expand Down
Loading