Skip to content
Snippets Groups Projects
Commit 6ac7b9bd authored by Olivier Couet's avatar Olivier Couet
Browse files

Add missing /

parent 29d26571
Branches
Tags
No related merge requests found
...@@ -3,8 +3,8 @@ ...@@ -3,8 +3,8 @@
/// Demonstrate how to activate and use the implicit parallelisation of TTree::GetEntry. /// Demonstrate how to activate and use the implicit parallelisation of TTree::GetEntry.
/// Such parallelisation creates one task per top-level branch of the tree being read. /// Such parallelisation creates one task per top-level branch of the tree being read.
/// In this example, most of the branches are floating point numbers, which are very fast to read. /// In this example, most of the branches are floating point numbers, which are very fast to read.
// This parallelisation can be used, though, on bigger trees with many (complex) branches, which /// This parallelisation can be used, though, on bigger trees with many (complex) branches, which
// are more likely to benefit from speedup gains. /// are more likely to benefit from speedup gains.
/// ///
/// \macro_code /// \macro_code
/// ///
...@@ -45,13 +45,13 @@ int imt001_parBranchProcessing() ...@@ -45,13 +45,13 @@ int imt001_parBranchProcessing()
// IMT can be also disabled globally. // IMT can be also disabled globally.
// As a result, no tree will run GetEntry in parallel // As a result, no tree will run GetEntry in parallel
ROOT::DisableImplicitMT(); ROOT::DisableImplicitMT();
// This is still sequential: the global flag is disabled, even if the // This is still sequential: the global flag is disabled, even if the
// flag for this particular tree is enabled // flag for this particular tree is enabled
for (Long64_t i = 0; i < tree->GetEntries(); ++i) { for (Long64_t i = 0; i < tree->GetEntries(); ++i) {
tree->GetEntry(i); // sequential read tree->GetEntry(i); // sequential read
} }
return 0; return 0;
} }
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment