Logo ROOT  
Reference Guide
 
Loading...
Searching...
No Matches
RDataFrame.cxx
Go to the documentation of this file.
1// Author: Enrico Guiraud, Danilo Piparo CERN 12/2016
2
3/*************************************************************************
4 * Copyright (C) 1995-2018, Rene Brun and Fons Rademakers. *
5 * All rights reserved. *
6 * *
7 * For the licensing terms see $ROOTSYS/LICENSE. *
8 * For the list of contributors see $ROOTSYS/README/CREDITS. *
9 *************************************************************************/
10
12#include "ROOT/RDataFrame.hxx"
13#include "ROOT/RDataSource.hxx"
14#include "ROOT/RTTreeDS.hxx"
18#include "ROOT/RDF/Utils.hxx"
19#include <string_view>
20#include "TChain.h"
21#include "TDirectory.h"
22#include "RtypesCore.h" // for ULong64_t
23#include "TTree.h"
24
25#include <fstream> // std::ifstream
26#include <nlohmann/json.hpp> // nlohmann::json::parse
27#include <memory> // for make_shared, allocator, shared_ptr
28#include <ostream> // ostringstream
29#include <stdexcept>
30#include <string>
31#include <vector>
32
33// clang-format off
34/**
35* \class ROOT::RDataFrame
36* \ingroup dataframe
37* \brief ROOT's RDataFrame offers a modern, high-level interface for analysis of data stored in TTree , CSV and other data formats, in C++ or Python.
38
39In addition, multi-threading and other low-level optimisations allow users to exploit all the resources available
40on their machines completely transparently.<br>
41Skip to the [class reference](#reference) or keep reading for the user guide.
42
43In a nutshell:
44~~~{.cpp}
45ROOT::EnableImplicitMT(); // Tell ROOT you want to go parallel
46ROOT::RDataFrame d("myTree", "file_*.root"); // Interface to TTree and TChain
47auto myHisto = d.Histo1D("Branch_A"); // This books the (lazy) filling of a histogram
48myHisto->Draw(); // Event loop is run here, upon first access to a result
49~~~
50
51Calculations are expressed in terms of a type-safe *functional chain of actions and transformations*, RDataFrame takes
52care of their execution. The implementation automatically puts in place several low level optimisations such as
53multi-thread parallelization and caching.
54
55\htmlonly
56<a href="https://doi.org/10.5281/zenodo.260230"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.260230.svg"
57alt="DOI"></a>
58\endhtmlonly
59
60## For the impatient user
61You can directly see RDataFrame in action in our [tutorials](https://root.cern/doc/master/group__tutorial__dataframe.html), in C++ or Python.
62
63## Table of Contents
64- [Cheat sheet](\ref cheatsheet)
65- [Introduction](\ref rdf_intro)
66- [Crash course](\ref crash-course)
67- [Working with collections](\ref working_with_collections)
68- [Transformations: manipulating data](\ref transformations)
69- [Actions: getting results](\ref actions)
70- [Distributed execution in Python](\ref rdf_distrdf)
71- [Performance tips and parallel execution](\ref parallel-execution)
72- [More features](\ref more-features)
73 - [Systematic variations](\ref systematics)
74 - [RDataFrame objects as function arguments and return values](\ref rnode)
75 - [Storing RDataFrame objects in collections](\ref RDFCollections)
76 - [Executing callbacks every N events](\ref callbacks)
77 - [Default column lists](\ref default-branches)
78 - [Special helper columns: `rdfentry_` and `rdfslot_`](\ref helper-cols)
79 - [Just-in-time compilation: column type inference and explicit declaration of column types](\ref jitting)
80 - [User-defined custom actions](\ref generic-actions)
81 - [Dataset joins with friend trees](\ref friends)
82 - [Reading data formats other than ROOT trees](\ref other-file-formats)
83 - [Computation graphs (storing and reusing sets of transformations)](\ref callgraphs)
84 - [Visualizing the computation graph](\ref representgraph)
85 - [Activating RDataFrame execution logs](\ref rdf-logging)
86 - [Creating an RDataFrame from a dataset specification file](\ref rdf-from-spec)
87 - [Adding a progress bar](\ref progressbar)
88 - [Working with missing values in the dataset](\ref missing-values)
89 - [Dealing with NaN or Inf values in the dataset](\ref special-values)
90- [Python interface](classROOT_1_1RDataFrame.html#python)
91- <a class="el" href="classROOT_1_1RDataFrame.html#reference" onclick="javascript:toggleInherit('pub_methods_classROOT_1_1RDF_1_1RInterface')">Class reference</a>
92
93\anchor cheatsheet
94## Cheat sheet
95These are the operations which can be performed with RDataFrame.
96
97### Transformations
98Transformations are a way to manipulate the data.
99
100| **Transformation** | **Description** |
101|------------------|--------------------|
102| Alias() | Introduce an alias for a particular column name. |
103| DefaultValueFor() | If the value of the input column is missing, provide a default value instead. |
104| Define() | Create a new column in the dataset. Example usages include adding a column that contains the invariant mass of a particle, or a selection of elements of an array (e.g. only the `pt`s of "good" muons). |
105| DefinePerSample() | Define a new column that is updated when the input sample changes, e.g. when switching tree being processed in a chain. |
106| DefineSlot() | Same as Define(), but the user-defined function must take an extra `unsigned int slot` as its first parameter. `slot` will take a different value, in the range [0, nThread-1], for each thread of execution. This is meant as a helper in writing thread-safe Define() transformations when using RDataFrame after ROOT::EnableImplicitMT(). DefineSlot() works just as well with single-thread execution: in that case `slot` will always be `0`. |
107| DefineSlotEntry() | Same as DefineSlot(), but the entry number is passed in addition to the slot number. This is meant as a helper in case the expression depends on the entry number. For details about entry numbers in multi-threaded runs, see [here](\ref helper-cols). |
108| Filter() | Filter rows based on user-defined conditions. |
109| FilterAvailable() | Specialized Filter. If the value of the input column is available, keep the entry, otherwise discard it. |
110| FilterMissing() | Specialized Filter. If the value of the input column is missing, keep the entry, otherwise discard it. |
111| Range() | Filter rows based on entry number (single-thread only). |
112| Redefine() | Overwrite the value and/or type of an existing column. See Define() for more information. |
113| RedefineSlot() | Overwrite the value and/or type of an existing column. See DefineSlot() for more information. |
114| RedefineSlotEntry() | Overwrite the value and/or type of an existing column. See DefineSlotEntry() for more information. |
115| Vary() | Register systematic variations for an existing column. Varied results are then extracted via VariationsFor(). |
116
117
118### Actions
119Actions aggregate data into a result. Each one is described in more detail in the reference guide.
120
121In the following, whenever we say an action "returns" something, we always mean it returns a smart pointer to it. Actions only act on events that pass all preceding filters.
122
123Lazy actions only trigger the event loop when one of the results is accessed for the first time, making it easy to
124produce many different results in one event loop. Instant actions trigger the event loop instantly.
125
126
127| **Lazy action** | **Description** |
128|------------------|-----------------|
129| Aggregate() | Execute a user-defined accumulation operation on the processed column values. |
130| Book() | Book execution of a custom action using a user-defined helper object. |
131| Cache() | Cache column values in memory. Custom columns can be cached as well, filtered entries are not cached. Users can specify which columns to save (default is all). |
132| Count() | Return the number of events processed. Useful e.g. to get a quick count of the number of events passing a Filter. |
133| Display() | Provides a printable representation of the dataset contents. The method returns a ROOT::RDF::RDisplay() instance which can print a tabular representation of the data or return it as a string. |
134| Fill() | Fill a user-defined object with the values of the specified columns, as if by calling `Obj.Fill(col1, col2, ...)`. |
135| Graph() | Fills a TGraph with the two columns provided. If multi-threading is enabled, the order of the points may not be the one expected, it is therefore suggested to sort if before drawing. |
136| GraphAsymmErrors() | Fills a TGraphAsymmErrors. Should be used for any type of graph with errors, including cases with errors on one of the axes only. If multi-threading is enabled, the order of the points may not be the one expected, it is therefore suggested to sort if before drawing. |
137| Histo1D(), Histo2D(), Histo3D() | Fill a one-, two-, three-dimensional histogram with the processed column values. |
138| HistoND() | Fill an N-dimensional histogram with the processed column values. |
139| Max() | Return the maximum of processed column values. If the type of the column is inferred, the return type is `double`, the type of the column otherwise.|
140| Mean() | Return the mean of processed column values.|
141| Min() | Return the minimum of processed column values. If the type of the column is inferred, the return type is `double`, the type of the column otherwise.|
142| Profile1D(), Profile2D() | Fill a one- or two-dimensional profile with the column values that passed all filters. |
143| Reduce() | Reduce (e.g. sum, merge) entries using the function (lambda, functor...) passed as argument. The function must have signature `T(T,T)` where `T` is the type of the column. Return the final result of the reduction operation. An optional parameter allows initialization of the result object to non-default values. |
144| Report() | Obtain statistics on how many entries have been accepted and rejected by the filters. See the section on [named filters](#named-filters-and-cutflow-reports) for a more detailed explanation. The method returns a ROOT::RDF::RCutFlowReport instance which can be queried programmatically to get information about the effects of the individual cuts. |
145| Stats() | Return a TStatistic object filled with the input columns. |
146| StdDev() | Return the unbiased standard deviation of the processed column values. |
147| Sum() | Return the sum of the values in the column. If the type of the column is inferred, the return type is `double`, the type of the column otherwise. |
148| Take() | Extract a column from the dataset as a collection of values, e.g. a `std::vector<float>` for a column of type `float`. |
149
150| **Instant action** | **Description** |
151|---------------------|-----------------|
152| Foreach() | Execute a user-defined function on each entry. Users are responsible for the thread-safety of this callable when executing with implicit multi-threading enabled. |
153| ForeachSlot() | Same as Foreach(), but the user-defined function must take an extra `unsigned int slot` as its first parameter. `slot` will take a different value, `0` to `nThreads - 1`, for each thread of execution. This is meant as a helper in writing thread-safe Foreach() actions when using RDataFrame after ROOT::EnableImplicitMT(). ForeachSlot() works just as well with single-thread execution: in that case `slot` will always be `0`. |
154| Snapshot() | Write the processed dataset to disk, in a new TTree or RNTuple and TFile. Custom columns can be saved as well, filtered entries are not saved. Users can specify which columns to save (default is all). Snapshot, by default, overwrites the output file if it already exists. Snapshot() can be made *lazy* setting the appropriate flag in the snapshot options.|
155
156
157### Queries
158
159These operations do not modify the dataframe or book computations but simply return information on the RDataFrame object.
160
161| **Operation** | **Description** |
162|---------------------|-----------------|
163| Describe() | Get useful information describing the dataframe, e.g. columns and their types. |
164| GetColumnNames() | Get the names of all the available columns of the dataset. |
165| GetColumnType() | Return the type of a given column as a string. |
166| GetColumnTypeNamesList() | Return the list of type names of columns in the dataset. |
167| GetDefinedColumnNames() | Get the names of all the defined columns. |
168| GetFilterNames() | Return the names of all filters in the computation graph. |
169| GetNRuns() | Return the number of event loops run by this RDataFrame instance so far. |
170| GetNSlots() | Return the number of processing slots that RDataFrame will use during the event loop (i.e. the concurrency level). |
171| SaveGraph() | Store the computation graph of an RDataFrame in [DOT format (graphviz)](https://en.wikipedia.org/wiki/DOT_(graph_description_language)) for easy inspection. See the [relevant section](\ref representgraph) for details. |
172
173\anchor rdf_intro
174## Introduction
175Users define their analysis as a sequence of operations to be performed on the dataframe object; the framework
176takes care of the management of the loop over entries as well as low-level details such as I/O and parallelization.
177RDataFrame provides methods to perform most common operations required by ROOT analyses;
178at the same time, users can just as easily specify custom code that will be executed in the event loop.
179
180RDataFrame is built with a *modular* and *flexible* workflow in mind, summarised as follows:
181
1821. Construct a dataframe object by specifying a dataset. RDataFrame supports TTree as well as TChain, [CSV files](https://root.cern/doc/master/df014__CSVDataSource_8C.html), [SQLite files](https://root.cern/doc/master/df027__SQliteDependencyOverVersion_8C.html), [RNTuples](https://root.cern/doc/master/structROOT_1_1Experimental_1_1RNTuple.html), and it can be extended to custom data formats. From Python, [NumPy arrays can be imported into RDataFrame](https://root.cern/doc/master/df032__MakeNumpyDataFrame_8py.html) as well.
183
1842. Transform the dataframe by:
185
186 - [Applying filters](https://root.cern/doc/master/classROOT_1_1RDataFrame.html#transformations). This selects only specific rows of the dataset.
187
188 - [Creating custom columns](https://root.cern/doc/master/classROOT_1_1RDataFrame.html#transformations). Custom columns can, for example, contain the results of a computation that must be performed for every row of the dataset.
189
1903. [Produce results](https://root.cern/doc/master/classROOT_1_1RDataFrame.html#actions). *Actions* are used to aggregate data into results. Most actions are *lazy*, i.e. they are not executed on the spot, but registered with RDataFrame and executed only when a result is accessed for the first time.
191
192Make sure to book all transformations and actions before you access the contents of any of the results. This lets RDataFrame accumulate work and then produce all results at the same time, upon first access to any of them.
193
194The following table shows how analyses based on TTreeReader and TTree::Draw() translate to RDataFrame. Follow the
195[crash course](#crash-course) to discover more idiomatic and flexible ways to express analyses with RDataFrame.
196<table>
197<tr>
198 <td>
199 <b>TTreeReader</b>
200 </td>
201 <td>
202 <b>ROOT::RDataFrame</b>
203 </td>
204</tr>
205<tr>
206 <td>
207~~~{.cpp}
208TTreeReader reader("myTree", file);
209TTreeReaderValue<A_t> a(reader, "A");
210TTreeReaderValue<B_t> b(reader, "B");
211TTreeReaderValue<C_t> c(reader, "C");
212while(reader.Next()) {
213 if(IsGoodEvent(*a, *b, *c))
214 DoStuff(*a, *b, *c);
215}
216~~~
217 </td>
218 <td>
219~~~{.cpp}
220ROOT::RDataFrame d("myTree", file, {"A", "B", "C"});
221d.Filter(IsGoodEvent).Foreach(DoStuff);
222~~~
223 </td>
224</tr>
225<tr>
226 <td>
227 <b>TTree::Draw</b>
228 </td>
229 <td>
230 <b>ROOT::RDataFrame</b>
231 </td>
232</tr>
233<tr>
234 <td>
235~~~{.cpp}
236auto *tree = file->Get<TTree>("myTree");
237tree->Draw("x", "y > 2");
238~~~
239 </td>
240 <td>
241~~~{.cpp}
242ROOT::RDataFrame df("myTree", file);
243auto h = df.Filter("y > 2").Histo1D("x");
244h->Draw()
245~~~
246 </td>
247</tr>
248<tr>
249 <td>
250~~~{.cpp}
251tree->Draw("jet_eta", "weight*(event == 1)");
252~~~
253 </td>
254 <td>
255~~~{.cpp}
256df.Filter("event == 1").Histo1D("jet_eta", "weight");
257// or the fully compiled version:
258df.Filter([] (ULong64_t e) { return e == 1; }, {"event"}).Histo1D<RVec<float>>("jet_eta", "weight");
259~~~
260 </td>
261</tr>
262<tr>
263 <td>
264~~~{cpp}
265// object selection: for each event, fill histogram with array of selected pts
266tree->Draw('Muon_pt', 'Muon_pt > 100')
267~~~
268 </td>
269 <td>
270~~~{cpp}
271// with RDF, arrays are read as ROOT::VecOps::RVec objects
272df.Define("good_pt", "Muon_pt[Muon_pt > 100]").Histo1D("good_pt")
273~~~
274 </td>
275</tr>
276</table>
277
278\anchor crash-course
279## Crash course
280All snippets of code presented in the crash course can be executed in the ROOT interpreter. Simply precede them with
281~~~{.cpp}
282using namespace ROOT; // RDataFrame's namespace
283~~~
284which is omitted for brevity. The terms "column" and "branch" are used interchangeably.
285
286### Creating an RDataFrame
287RDataFrame's constructor is where the user specifies the dataset and, optionally, a default set of columns that
288operations should work with. Here are the most common methods to construct an RDataFrame object:
289~~~{.cpp}
290// single file -- all constructors are equivalent
291TFile *f = TFile::Open("file.root");
292TTree *t = f.Get<TTree>("treeName");
293
294ROOT::RDataFrame d1("treeName", "file.root");
295ROOT::RDataFrame d2("treeName", f); // same as TTreeReader
296ROOT::RDataFrame d3(*t);
297
298// multiple files -- all constructors are equivalent
299TChain chain("myTree");
300chain.Add("file1.root");
301chain.Add("file2.root");
302
303ROOT::RDataFrame d4("myTree", {"file1.root", "file2.root"});
304std::vector<std::string> files = {"file1.root", "file2.root"};
305ROOT::RDataFrame d5("myTree", files);
306ROOT::RDataFrame d6("myTree", "file*.root"); // the glob is passed as-is to TChain's constructor
307ROOT::RDataFrame d7(chain);
308~~~
309Additionally, users can construct an RDataFrame with no data source by passing an integer number. This is the number of rows that
310will be generated by this RDataFrame.
311~~~{.cpp}
312ROOT::RDataFrame d(10); // a RDF with 10 entries (and no columns/branches, for now)
313d.Foreach([] { static int i = 0; std::cout << i++ << std::endl; }); // silly example usage: count to ten
314~~~
315This is useful to generate simple datasets on the fly: the contents of each event can be specified with Define() (explained below). For example, we have used this method to generate [Pythia](https://pythia.org/) events and write them to disk in parallel (with the Snapshot action).
316
317For data sources other than TTrees and TChains, RDataFrame objects are constructed using ad-hoc factory functions (see e.g. FromCSV(), FromSqlite(), FromArrow()):
318
319~~~{.cpp}
320auto df = ROOT::RDF::FromCSV("input.csv");
321// use df as usual
322~~~
323
324### Filling a histogram
325Let's now tackle a very common task, filling a histogram:
326~~~{.cpp}
327// Fill a TH1D with the "MET" branch
328ROOT::RDataFrame d("myTree", "file.root");
329auto h = d.Histo1D("MET");
330h->Draw();
331~~~
332The first line creates an RDataFrame associated to the TTree "myTree". This tree has a branch named "MET".
333
334Histo1D() is an *action*; it returns a smart pointer (a ROOT::RDF::RResultPtr, to be precise) to a TH1D histogram filled
335with the `MET` of all events. If the quantity stored in the column is a collection (e.g. a vector or an array), the
336histogram is filled with all vector elements for each event.
337
338You can use the objects returned by actions as if they were pointers to the desired results. There are many other
339possible [actions](\ref cheatsheet), and all their results are wrapped in smart pointers; we'll see why in a minute.
340
341### Applying a filter
342Let's say we want to cut over the value of branch "MET" and count how many events pass this cut. This is one way to do it:
343~~~{.cpp}
344ROOT::RDataFrame d("myTree", "file.root");
345auto c = d.Filter("MET > 4.").Count(); // computations booked, not run
346std::cout << *c << std::endl; // computations run here, upon first access to the result
347~~~
348The filter string (which must contain a valid C++ expression) is applied to the specified columns for each event;
349the name and types of the columns are inferred automatically. The string expression is required to return a `bool`
350which signals whether the event passes the filter (`true`) or not (`false`).
351
352You can think of your data as "flowing" through the chain of calls, being transformed, filtered and finally used to
353perform actions. Multiple Filter() calls can be chained one after another.
354
355Using string filters is nice for simple things, but they are limited to specifying the equivalent of a single return
356statement or the body of a lambda, so it's cumbersome to use strings with more complex filters. They also add a small
357runtime overhead, as ROOT needs to just-in-time compile the string into C++ code. When more freedom is required or
358runtime performance is very important, a C++ callable can be specified instead (a lambda in the following snippet,
359but it can be any kind of function or even a functor class), together with a list of column names.
360This snippet is analogous to the one above:
361~~~{.cpp}
362ROOT::RDataFrame d("myTree", "file.root");
363auto metCut = [](double x) { return x > 4.; }; // a C++11 lambda function checking "x > 4"
364auto c = d.Filter(metCut, {"MET"}).Count();
365std::cout << *c << std::endl;
366~~~
367
368An example of a more complex filter expressed as a string containing C++ code is shown below
369
370~~~{.cpp}
371ROOT::RDataFrame d("myTree", "file.root");
372auto df = d.Define("p", "std::array<double, 4> p{px, py, pz}; return p;")
373 .Filter("double p2 = 0.0; for (auto&& x : p) p2 += x*x; return sqrt(p2) < 10.0;");
374~~~
375
376The code snippet above defines a column `p` that is a fixed-size array using the component column names and then
377filters on its magnitude by looping over its elements. It must be noted that the usage of strings to define columns
378like the one above is currently the only possibility when using PyROOT. When writing expressions as such, only constants
379and data coming from other columns in the dataset can be involved in the code passed as a string. Local variables and
380functions cannot be used, since the interpreter will not know how to find them. When capturing local state is necessary,
381it must first be declared to the ROOT C++ interpreter.
382
383More information on filters and how to use them to automatically generate cutflow reports can be found [below](#Filters).
384
385### Defining custom columns
386Let's now consider the case in which "myTree" contains two quantities "x" and "y", but our analysis relies on a derived
387quantity `z = sqrt(x*x + y*y)`. Using the Define() transformation, we can create a new column in the dataset containing
388the variable "z":
389~~~{.cpp}
390ROOT::RDataFrame d("myTree", "file.root");
391auto sqrtSum = [](double x, double y) { return sqrt(x*x + y*y); };
392auto zMean = d.Define("z", sqrtSum, {"x","y"}).Mean("z");
393std::cout << *zMean << std::endl;
394~~~
395Define() creates the variable "z" by applying `sqrtSum` to "x" and "y". Later in the chain of calls we refer to
396variables created with Define() as if they were actual tree branches/columns, but they are evaluated on demand, at most
397once per event. As with filters, Define() calls can be chained with other transformations to create multiple custom
398columns. Define() and Filter() transformations can be concatenated and intermixed at will.
399
400As with filters, it is possible to specify new columns as string expressions. This snippet is analogous to the one above:
401~~~{.cpp}
402ROOT::RDataFrame d("myTree", "file.root");
403auto zMean = d.Define("z", "sqrt(x*x + y*y)").Mean("z");
404std::cout << *zMean << std::endl;
405~~~
406
407Again the names of the columns used in the expression and their types are inferred automatically. The string must be
408valid C++ and it is just-in-time compiled. The process has a small runtime overhead and like with filters it is currently the only possible approach when using PyROOT.
409
410Previously, when showing the different ways an RDataFrame can be created, we showed a constructor that takes a
411number of entries as a parameter. In the following example we show how to combine such an "empty" RDataFrame with Define()
412transformations to create a dataset on the fly. We then save the generated data on disk using the Snapshot() action.
413~~~{.cpp}
414ROOT::RDataFrame d(100); // an RDF that will generate 100 entries (currently empty)
415int x = -1;
416auto d_with_columns = d.Define("x", []()->int { return ++x; }).Define("xx", []()->int { return x*x; });
417d_with_columns.Snapshot("myNewTree", "newfile.root");
418~~~
419This example is slightly more advanced than what we have seen so far. First, it makes use of lambda captures (a
420simple way to make external variables available inside the body of C++ lambdas) to act on the same variable `x` from
421both Define() transformations. Second, we have *stored* the transformed dataframe in a variable. This is always
422possible, since at each point of the transformation chain users can store the status of the dataframe for further use (more
423on this [below](#callgraphs)).
424
425You can read more about defining new columns [here](#custom-columns).
426
427\image html RDF_Graph.png "A graph composed of two branches, one starting with a filter and one with a define. The end point of a branch is always an action."
428
429
430### Running on a range of entries
431It is sometimes necessary to limit the processing of the dataset to a range of entries. For this reason, the RDataFrame
432offers the concept of ranges as a node of the RDataFrame chain of transformations; this means that filters, columns and
433actions can be concatenated to and intermixed with Range()s. If a range is specified after a filter, the range will act
434exclusively on the entries passing the filter -- it will not even count the other entries! The same goes for a Range()
435hanging from another Range(). Here are some commented examples:
436~~~{.cpp}
437ROOT::RDataFrame d("myTree", "file.root");
438// Here we store a dataframe that loops over only the first 30 entries in a variable
439auto d30 = d.Range(30);
440// This is how you pick all entries from 15 onwards
441auto d15on = d.Range(15, 0);
442// We can specify a stride too, in this case we pick an event every 3
443auto d15each3 = d.Range(0, 15, 3);
444~~~
445Note that ranges are not available when multi-threading is enabled. More information on ranges is available
446[here](#ranges).
447
448### Executing multiple actions in the same event loop
449As a final example let us apply two different cuts on branch "MET" and fill two different histograms with the "pt_v" of
450the filtered events.
451By now, you should be able to easily understand what is happening:
452~~~{.cpp}
453RDataFrame d("treeName", "file.root");
454auto h1 = d.Filter("MET > 10").Histo1D("pt_v");
455auto h2 = d.Histo1D("pt_v");
456h1->Draw(); // event loop is run once here
457h2->Draw("SAME"); // no need to run the event loop again
458~~~
459RDataFrame executes all above actions by **running the event-loop only once**. The trick is that actions are not
460executed at the moment they are called, but they are **lazy**, i.e. delayed until the moment one of their results is
461accessed through the smart pointer. At that time, the event loop is triggered and *all* results are produced
462simultaneously.
463
464### Properly exploiting RDataFrame laziness
465
466For yet another example of the difference between the correct and incorrect running of the event-loop, see the following
467two code snippets. We assume our ROOT file has branches a, b and c.
468
469The correct way - the dataset is only processed once.
470~~~{.py}
471df_correct = ROOT.RDataFrame(treename, filename);
472
473h_a = df_correct.Histo1D("a")
474h_b = df_correct.Histo1D("b")
475h_c = df_correct.Histo1D("c")
476
477h_a_val = h_a.GetValue()
478h_b_val = h_b.GetValue()
479h_c_val = h_c.GetValue()
480
481print(f"How many times was the data set processed? {df_wrong.GetNRuns()} time.") # The answer will be 1 time.
482~~~
483
484An incorrect way - the dataset is processed three times.
485~~~{.py}
486df_incorrect = ROOT.RDataFrame(treename, filename);
487
488h_a = df_incorrect.Histo1D("a")
489h_a_val = h_a.GetValue()
490
491h_b = df_incorrect.Histo1D("b")
492h_b_val = h_b.GetValue()
493
494h_c = df_incorrect.Histo1D("c")
495h_c_val = h_c.GetValue()
496
497print(f"How many times was the data set processed? {df_wrong.GetNRuns()} times.") # The answer will be 3 times.
498~~~
499
500It is therefore good practice to declare all your transformations and actions *before* accessing their results, allowing
501RDataFrame to run the loop once and produce all results in one go.
502
503### Going parallel
504Let's say we would like to run the previous examples in parallel on several cores, dividing events fairly between cores.
505The only modification required to the snippets would be the addition of this line *before* constructing the main
506dataframe object:
507~~~{.cpp}
508ROOT::EnableImplicitMT();
509~~~
510Simple as that. More details are given [below](#parallel-execution).
511
512\anchor working_with_collections
513## Working with collections and object selections
514
515RDataFrame reads collections as the special type [ROOT::RVec](https://root.cern/doc/master/classROOT_1_1VecOps_1_1RVec.html): for example, a column containing an array of floating point numbers can be read as a ROOT::RVecF. C-style arrays (with variable or static size), STL vectors and most other collection types can be read this way.
516
517RVec is a container similar to std::vector (and can be used just like a std::vector) but it also offers a rich interface to operate on the array elements in a vectorised fashion, similarly to Python's NumPy arrays.
518
519For example, to fill a histogram with the "pt" of selected particles for each event, Define() can be used to create a column that contains the desired array elements as follows:
520
521~~~{.cpp}
522// h is filled with all the elements of `good_pts`, for each event
523auto h = df.Define("good_pts", [](const ROOT::RVecF &pt) { return pt[pt > 0]; })
524 .Histo1D("good_pts");
525~~~
526
527And in Python:
528
529~~~{.py}
530h = df.Define("good_pts", "pt[pt > 0]").Histo1D("good_pts")
531~~~
532
533Learn more at ROOT::VecOps::RVec.
534
535\anchor transformations
536## Transformations: manipulating data
537\anchor Filters
538### Filters
539A filter is created through a call to `Filter(f, columnList)` or `Filter(filterString)`. In the first overload, `f` can
540be a function, a lambda expression, a functor class, or any other callable object. It must return a `bool` signalling
541whether the event has passed the selection (`true`) or not (`false`). It should perform "read-only" operations on the
542columns, and should not have side-effects (e.g. modification of an external or static variable) to ensure correctness
543when implicit multi-threading is active. The second overload takes a string with a valid C++ expression in which column
544names are used as variable names (e.g. `Filter("x[0] + x[1] > 0")`). This is a convenience feature that comes with a
545certain runtime overhead: C++ code has to be generated on the fly from this expression before using it in the event
546loop. See the paragraph about "Just-in-time compilation" below for more information.
547
548RDataFrame only evaluates filters when necessary: if multiple filters are chained one after another, they are executed
549in order and the first one returning `false` causes the event to be discarded and triggers the processing of the next
550entry. If multiple actions or transformations depend on the same filter, that filter is not executed multiple times for
551each entry: after the first access it simply serves a cached result.
552
553\anchor named-filters-and-cutflow-reports
554#### Named filters and cutflow reports
555An optional string parameter `name` can be passed to the Filter() method to create a **named filter**. Named filters
556work as usual, but also keep track of how many entries they accept and reject.
557
558Statistics are retrieved through a call to the Report() method:
559
560- when Report() is called on the main RDataFrame object, it returns a ROOT::RDF::RResultPtr<RCutFlowReport> relative to all
561named filters declared up to that point
562- when called on a specific node (e.g. the result of a Define() or Filter()), it returns a ROOT::RDF::RResultPtr<RCutFlowReport>
563relative all named filters in the section of the chain between the main RDataFrame and that node (included).
564
565Stats are stored in the same order as named filters have been added to the graph, and *refer to the latest event-loop*
566that has been run using the relevant RDataFrame.
567
568\anchor ranges
569### Ranges
570When RDataFrame is not being used in a multi-thread environment (i.e. no call to EnableImplicitMT() was made),
571Range() transformations are available. These act very much like filters but instead of basing their decision on
572a filter expression, they rely on `begin`,`end` and `stride` parameters.
573
574- `begin`: initial entry number considered for this range.
575- `end`: final entry number (excluded) considered for this range. 0 means that the range goes until the end of the dataset.
576- `stride`: process one entry of the [begin, end) range every `stride` entries. Must be strictly greater than 0.
577
578The actual number of entries processed downstream of a Range() node will be `(end - begin)/stride` (or less if less
579entries than that are available).
580
581Note that ranges act "locally", not based on the global entry count: `Range(10,50)` means "skip the first 10 entries
582*that reach this node*, let the next 40 entries pass, then stop processing". If a range node hangs from a filter node,
583and the range has a `begin` parameter of 10, that means the range will skip the first 10 entries *that pass the
584preceding filter*.
585
586Ranges allow "early quitting": if all branches of execution of a functional graph reached their `end` value of
587processed entries, the event-loop is immediately interrupted. This is useful for debugging and quick data explorations.
588
589\anchor custom-columns
590### Custom columns
591Custom columns are created by invoking `Define(name, f, columnList)`. As usual, `f` can be any callable object
592(function, lambda expression, functor class...); it takes the values of the columns listed in `columnList` (a list of
593strings) as parameters, in the same order as they are listed in `columnList`. `f` must return the value that will be
594assigned to the temporary column.
595
596A new variable is created called `name`, accessible as if it was contained in the dataset from subsequent
597transformations/actions.
598
599Use cases include:
600- caching the results of complex calculations for easy and efficient multiple access
601- extraction of quantities of interest from complex objects
602- branch aliasing, i.e. changing the name of a branch
603
604An exception is thrown if the `name` of the new column/branch is already in use for another branch in the TTree.
605
606It is also possible to specify the quantity to be stored in the new temporary column as a C++ expression with the method
607`Define(name, expression)`. For example this invocation
608
609~~~{.cpp}
610df.Define("pt", "sqrt(px*px + py*py)");
611~~~
612
613will create a new column called "pt" the value of which is calculated starting from the columns px and py. The system
614builds a just-in-time compiled function starting from the expression after having deduced the list of necessary branches
615from the names of the variables specified by the user.
616
617#### Custom columns as function of slot and entry number
618
619It is possible to create custom columns also as a function of the processing slot and entry numbers. The methods that can
620be invoked are:
621- `DefineSlot(name, f, columnList)`. In this case the callable f has this signature `R(unsigned int, T1, T2, ...)`: the
622first parameter is the slot number which ranges from 0 to ROOT::GetThreadPoolSize() - 1.
623- `DefineSlotEntry(name, f, columnList)`. In this case the callable f has this signature `R(unsigned int, ULong64_t,
624T1, T2, ...)`: the first parameter is the slot number while the second one the number of the entry being processed.
625
626\anchor actions
627## Actions: getting results
628### Instant and lazy actions
629Actions can be **instant** or **lazy**. Instant actions are executed as soon as they are called, while lazy actions are
630executed whenever the object they return is accessed for the first time. As a rule of thumb, actions with a return value
631are lazy, the others are instant.
632
633### Return type of a lazy action
634
635When a lazy action is called, it returns a \link ROOT::RDF::RResultPtr ROOT::RDF::RResultPtr<T>\endlink, where T is the
636type of the result of the action. The final result will be stored in the `RResultPtr`, and can be retrieved by
637dereferencing it or via its `GetValue` method. Retrieving the result also starts the event loop if the result
638hasn't been produced yet.
639
640The RResultPtr shares ownership of the result object. To directly access result, use:
641~~~{.cpp}
642ROOT::RDF::RResultPtr<TH1D> histo = rdf.Histo1D(...);
643histo->Draw(); // Starts running the event loop
644~~~
645
646To return results from functions, a copy of the underlying shared_ptr can be obtained:
647~~~{.cpp}
648std::shared_ptr<TH1D> ProduceResult(const char *columnname) {
649 ROOT::RDF::RResultPtr<TH1D> histo = rdf.Histo1D(*h, columname);
650 return histo.GetSharedPtr(); // Runs the event loop
651}
652~~~
653If the result had been returned by reference or bare pointer, it would have gotten destroyed
654when the function exits.
655
656To share ownership but not produce the result ("keep it lazy"), copy the RResultPtr:
657~~~{.cpp}
658std::vector<RResultPtr<TH1D>> allHistograms;
659ROOT::RDF::RResultPtr<TH1D> BookHistogram(const char *columnname) {
660 ROOT::RDF::RResultPtr<TH1D> histo = rdf.Histo1D(*h, columname);
661 allHistograms.push_back(histo); // Will not produce the result yet
662 return histo;
663}
664~~~
665
666
667### Actions that return collections
668
669If the type of the return value of an action is a collection, e.g. `std::vector<int>`, you can iterate its elements
670directly through the wrapping `RResultPtr`:
671
672~~~{.cpp}
673ROOT::RDataFrame df{5};
674auto df1 = df.Define("x", []{ return 42; });
675for (const auto &el: df1.Take<int>("x")){
676 std::cout << "Element: " << el << "\n";
677}
678~~~
679
680~~~{.py}
681df = ROOT.RDataFrame(5).Define("x", "42")
682for el in df.Take[int]("x"):
683 print(f"Element: {el}")
684~~~
685
686### Actions and readers
687
688An action that needs values for its computations will request it from a reader, e.g. a column created via `Define` or
689available from the input dataset. The action will request values from each column of the list of input columns (either
690inferred or specified by the user), in order. For example:
691
692~~~{.cpp}
693ROOT::RDataFrame df{1};
694auto df1 = df.Define("x", []{ return 11; });
695auto df2 = df1.Define("y", []{ return 22; });
696auto graph = df2.Graph<int, int>("x","y");
697~~~
698
699The `Graph` action is going to request first the value from column "x", then that of column "y". Specifically, the order
700of execution of the operations of nodes in this branch of the computation graph is guaranteed to be top to bottom.
701
702\anchor rdf_distrdf
703## Distributed execution
704
705RDataFrame applications can be executed in parallel through distributed computing frameworks on a set of remote machines
706thanks to the Python package `ROOT.RDF.Distributed`. This **Python-only** package allows to scale the
707optimized performance RDataFrame can achieve on a single machine to multiple nodes at the same time. It is designed so
708that different backends can be easily plugged in, currently supporting [Apache Spark](http://spark.apache.org/) and
709[Dask](https://dask.org/). Here is a minimal example usage of distributed RDataFrame:
710
711~~~{.py}
712import ROOT
713from distributed import Client
714# It still accepts the same constructor arguments as traditional RDataFrame
715# but needs a client object which allows connecting to one of the supported
716# schedulers (read more info below)
717client = Client(...)
718df = ROOT.RDataFrame("mytree", "myfile.root", executor=client)
719
720# Continue the application with the traditional RDataFrame API
721sum = df.Filter("x > 10").Sum("y")
722h = df.Histo1D(("name", "title", 10, 0, 10), "x")
723
724print(sum.GetValue())
725h.Draw()
726~~~
727
728The main goal of this package is to support running any RDataFrame application distributedly. Nonetheless, not all
729parts of the RDataFrame API currently work with this package. The subset that is currently available is:
730- Alias
731- AsNumpy
732- Count
733- DefaultValueFor
734- Define
735- DefinePerSample
736- Filter
737- FilterAvailable
738- FilterMissing
739- Graph
740- Histo[1,2,3]D
741- HistoND
742- Max
743- Mean
744- Min
745- Profile[1,2,3]D
746- Redefine
747- Snapshot
748- Stats
749- StdDev
750- Sum
751- Systematic variations: Vary and [VariationsFor](\ref ROOT::RDF::Experimental::VariationsFor).
752- Parallel submission of distributed graphs: [RunGraphs](\ref ROOT::RDF::RunGraphs).
753- Information about the dataframe: GetColumnNames.
754
755with support for more operations coming in the future. Currently, to the supported data sources belong TTree, TChain, RNTuple and RDatasetSpec.
756
757### Connecting to a Spark cluster
758
759In order to distribute the RDataFrame workload, you can connect to a Spark cluster you have access to through the
760official [Spark API](https://spark.apache.org/docs/latest/rdd-programming-guide.html#initializing-spark), then hook the
761connection instance to the distributed `RDataFrame` object like so:
762
763~~~{.py}
764import pyspark
765import ROOT
766
767# Create a SparkContext object with the right configuration for your Spark cluster
768conf = SparkConf().setAppName(appName).setMaster(master)
769sc = SparkContext(conf=conf)
770
771# The Spark RDataFrame constructor accepts an optional "sparkcontext" parameter
772# and it will distribute the application to the connected cluster
773df = ROOT.RDataFrame("mytree", "myfile.root", executor = sc)
774~~~
775
776Note that with the usage above the case of `executor = None` is not supported. One
777can explicitly create a `ROOT.RDF.Distributed.Spark.RDataFrame` object
778in order to get a default instance of
779[SparkContext](https://spark.apache.org/docs/latest/api/python/reference/api/pyspark.SparkContext.html)
780in case it is not already provided as argument.
781
782### Connecting to a Dask cluster
783
784Similarly, you can connect to a Dask cluster by creating your own connection object which internally operates with one
785of the cluster schedulers supported by Dask (more information in the
786[Dask distributed docs](http://distributed.dask.org/en/stable/)):
787
788~~~{.py}
789import ROOT
790from dask.distributed import Client
791# In a Python script the Dask client needs to be initalized in a context
792# Jupyter notebooks / Python session don't need this
793if __name__ == "__main__":
794 # With an already setup cluster that exposes a Dask scheduler endpoint
795 client = Client("dask_scheduler.domain.com:8786")
796
797 # The Dask RDataFrame constructor accepts the Dask Client object as an optional argument
798 df = ROOT.RDataFrame("mytree","myfile.root", executor=client)
799 # Proceed as usual
800 df.Define("x","someoperation").Histo1D(("name", "title", 10, 0, 10), "x")
801~~~
802
803Note that with the usage above the case of `executor = None` is not supported. One
804can explicitly create a `ROOT.RDF.Distributed.Dask.RDataFrame` object
805in order to get a default instance of
806[distributed.Client](http://distributed.dask.org/en/stable/api.html#distributed.Client)
807in case it is not already provided as argument. This will run multiple processes
808on the local machine using all available cores.
809
810### Choosing the number of distributed tasks
811
812A distributed RDataFrame has internal logic to define in how many chunks the input dataset will be split before sending
813tasks to the distributed backend. Each task reads and processes one of said chunks. The logic is backend-dependent, but
814generically tries to infer how many cores are available in the cluster through the connection object. The number of
815tasks will be equal to the inferred number of cores. There are cases where the connection object of the chosen backend
816doesn't have information about the actual resources of the cluster. An example of this is when using Dask to connect to
817a batch system. The client object created at the beginning of the application does not automatically know how many cores
818will be available during distributed execution, since the jobs are submitted to the batch system after the creation of
819the connection. In such cases, the logic is to default to process the whole dataset in 2 tasks.
820
821The number of tasks submitted for distributed execution can be also set programmatically, by providing the optional
822keyword argument `npartitions` when creating the RDataFrame object. This parameter is accepted irrespectively of the
823backend used:
824
825~~~{.py}
826import ROOT
827
828if __name__ == "__main__":
829 # The `npartitions` optional argument tells the RDataFrame how many tasks are desired
830 df = ROOT.RDataFrame("mytree", "myfile.root", executor=SupportedExecutor(...), npartitions=NPARTITIONS)
831 # Proceed as usual
832 df.Define("x","someoperation").Histo1D(("name", "title", 10, 0, 10), "x")
833~~~
834
835Note that when processing a TTree or TChain dataset, the `npartitions` value should not exceed the number of clusters in
836the dataset. The number of clusters in a TTree can be retrieved by typing `rootls -lt myfile.root` at a command line.
837
838### Distributed FromSpec
839
840RDataFrame can be also built from a JSON sample specification file using the FromSpec function. In distributed mode, two arguments need to be provided: the path to the specification
841jsonFile (same as for local RDF case) and an additional executor argument - in the same manner as for the RDataFrame constructors above - an executor can either be a spark connection or a dask client.
842If no second argument is given, the local version of FromSpec will be run. Here is an example of FromSpec usage in distributed RDF using either spark or dask backends.
843For more information on FromSpec functionality itself please refer to [FromSpec](\ref rdf-from-spec) documentation. Note that adding metadata and friend information is supported,
844but adding the global range will not be respected in the distributed execution.
845
846Using spark:
847~~~{.py}
848import pyspark
849import ROOT
850
851conf = SparkConf().setAppName(appName).setMaster(master)
852sc = SparkContext(conf=conf)
853
854# The FromSpec function accepts an optional "sparkcontext" parameter
855# and it will distribute the application to the connected cluster
856df_fromspec = ROOT.RDF.Experimental.FromSpec("myspec.json", executor = sc)
857# Proceed as usual
858df_fromspec.Define("x","someoperation").Histo1D(("name", "title", 10, 0, 10), "x")
859~~~
860
861Using dask:
862~~~{.py}
863import ROOT
864from dask.distributed import Client
865
866if __name__ == "__main__":
867 client = Client("dask_scheduler.domain.com:8786")
868
869 # The FromSpec function accepts the Dask Client object as an optional argument
870 df_fromspec = ROOT.RDF.Experimental.FromSpec("myspec.json", executor=client)
871 # Proceed as usual
872 df_fromspec.Define("x","someoperation").Histo1D(("name", "title", 10, 0, 10), "x")
873~~~
874
875### Distributed Snapshot
876
877The Snapshot operation behaves slightly differently when executed distributedly. First off, it requires the path
878supplied to the Snapshot call to be accessible from any worker of the cluster and from the client machine (in general
879it should be provided as an absolute path). Another important difference is that `n` separate files will be produced,
880where `n` is the number of dataset partitions. As with local RDataFrame, the result of a Snapshot on a distributed
881RDataFrame is another distributed RDataFrame on which we can define a new computation graph and run more distributed
882computations.
883
884### Distributed RunGraphs
885
886Submitting multiple distributed RDataFrame executions is supported through the RunGraphs function. Similarly to its
887local counterpart, the function expects an iterable of objects representing an RDataFrame action. Each action will be
888triggered concurrently to send multiple computation graphs to a distributed cluster at the same time:
889
890~~~{.py}
891import ROOT
892
893# Create 3 different dataframes and book an histogram on each one
894histoproxies = [
895 ROOT.RDataFrame(100, executor=SupportedExecutor(...))
896 .Define("x", "rdfentry_")
897 .Histo1D(("name", "title", 10, 0, 100), "x")
898 for _ in range(4)
899]
900
901# Execute the 3 computation graphs
902ROOT.RDF.RunGraphs(histoproxies)
903# Retrieve all the histograms in one go
904histos = [histoproxy.GetValue() for histoproxy in histoproxies]
905~~~
906
907Every distributed backend supports this feature and graphs belonging to different backends can be still triggered with
908a single call to RunGraphs (e.g. it is possible to send a Spark job and a Dask job at the same time).
909
910### Histogram models in distributed mode
911
912When calling a Histo*D operation in distributed mode, remember to pass to the function the model of the histogram to be
913computed, e.g. the axis range and the number of bins:
914
915~~~{.py}
916import ROOT
917
918if __name__ == "__main__":
919 df = ROOT.RDataFrame("mytree","myfile.root",executor=SupportedExecutor(...)).Define("x","someoperation")
920 # The model can be passed either as a tuple with the arguments in the correct order
921 df.Histo1D(("name", "title", 10, 0, 10), "x")
922 # Or by creating the specific struct
923 model = ROOT.RDF.TH1DModel("name", "title", 10, 0, 10)
924 df.Histo1D(model, "x")
925~~~
926
927Without this, two partial histograms resulting from two distributed tasks would have incompatible binning, thus leading
928to errors when merging them. Failing to pass a histogram model will raise an error on the client side, before starting
929the distributed execution.
930
931### Live visualization in distributed mode with dask
932
933The live visualization feature allows real-time data representation of plots generated during the execution
934of a distributed RDataFrame application.
935It enables visualizing intermediate results as they are computed across multiple nodes of a Dask cluster
936by creating a canvas and continuously updating it as partial results become available.
937
938The LiveVisualize() function can be imported from the Python package **ROOT.RDF.Distributed**:
939
940~~~{.py}
941import ROOT
942
943LiveVisualize = ROOT.RDF.Distributed.LiveVisualize
944~~~
945
946The function takes drawable objects (e.g. histograms) and optional callback functions as argument, it accepts 4 different input formats:
947
948- Passing a list or tuple of drawables:
949You can pass a list or tuple containing the plots you want to visualize. For example:
950
951~~~{.py}
952LiveVisualize([h_gaus, h_exp, h_random])
953~~~
954
955- Passing a list or tuple of drawables with a global callback function:
956You can also include a global callback function that will be applied to all plots. For example:
957
958~~~{.py}
959def set_fill_color(hist):
960 hist.SetFillColor("kBlue")
961
962LiveVisualize([h_gaus, h_exp, h_random], set_fill_color)
963~~~
964
965- Passing a Dictionary of drawables and callback functions:
966For more control, you can create a dictionary where keys are plots and values are corresponding (optional) callback functions. For example:
967
968~~~{.py}
969plot_callback_dict = {
970 graph: set_marker,
971 h_exp: fit_exp,
972 tprofile_2d: None
973}
974
975LiveVisualize(plot_callback_dict)
976~~~
977
978- Passing a Dictionary of drawables and callback functions with a global callback function:
979You can also combine a dictionary of plots and callbacks with a global callback function:
980
981~~~{.py}
982LiveVisualize(plot_callback_dict, write_to_tfile)
983~~~
984
985\note The allowed operations to pass to LiveVisualize are:
986 - Histo1D(), Histo2D(), Histo3D()
987 - Graph()
988 - Profile1D(), Profile2D()
989
990\warning The Live Visualization feature is only supported for the Dask backend.
991
992### Injecting C++ code and using external files into distributed RDF script
993
994Distributed RDF provides an interface for the users who want to inject the C++ code (via header files, shared libraries or declare the code directly)
995into their distributed RDF application, or their application needs to use information from external files which should be distributed
996to the workers (for example, a JSON or a txt file with necessary parameters information).
997
998The examples below show the usage of these interface functions: firstly, how this is done in a local Python
999RDF application and secondly, how it is done distributedly.
1000
1001#### Include and distribute header files.
1002
1003~~~{.py}
1004# Local RDataFrame script
1005ROOT.gInterpreter.AddIncludePath("myheader.hxx")
1006df.Define(...)
1007
1008# Distributed RDF script
1009ROOT.RDF.Distributed.DistributeHeaders("myheader.hxx")
1010df.Define(...)
1011~~~
1012
1013#### Load and distribute shared libraries
1014
1015~~~{.py}
1016# Local RDataFrame script
1017ROOT.gSystem.Load("my_library.so")
1018df.Define(...)
1019
1020# Distributed RDF script
1021ROOT.RDF.Distributed.DistributeSharedLibs("my_library.so")
1022df.Define(...)
1023~~~
1024
1025#### Declare and distribute the cpp code
1026
1027The cpp code is always available to all dataframes.
1028
1029~~~{.py}
1030# Local RDataFrame script
1031ROOT.gInterpreter.Declare("my_code")
1032df.Define(...)
1033
1034# Distributed RDF script
1035ROOT.RDF.Distributed.DistributeCppCode("my_code")
1036df.Define(...)
1037~~~
1038
1039#### Distribute additional files (other than headers or shared libraries).
1040
1041~~~{.py}
1042# Local RDataFrame script is not applicable here as local RDF application can simply access the external files it needs.
1043
1044# Distributed RDF script
1045ROOT.RDF.Distributed.DistributeFiles("my_file")
1046df.Define(...)
1047~~~
1048
1049\anchor parallel-execution
1050## Performance tips and parallel execution
1051As pointed out before in this document, RDataFrame can transparently perform multi-threaded event loops to speed up
1052the execution of its actions. Users have to call ROOT::EnableImplicitMT() *before* constructing the RDataFrame
1053object to indicate that it should take advantage of a pool of worker threads. **Each worker thread processes a distinct
1054subset of entries**, and their partial results are merged before returning the final values to the user.
1055
1056By default, RDataFrame will use as many threads as the hardware supports, using up **all** the resources on
1057a machine. This might be undesirable on shared computing resources such as a batch cluster. Therefore, when running on shared computing resources, use
1058~~~{.cpp}
1059ROOT::EnableImplicitMT(numThreads)
1060~~~
1061or export an environment variable:
1062~~~{.sh}
1063export ROOT_MAX_THREADS=numThreads
1064root.exe rdfAnalysis.cxx
1065# or
1066ROOT_MAX_THREADS=4 python rdfAnalysis.py
1067~~~
1068replacing `numThreads` with the number of CPUs/slots that were allocated for this job.
1069
1070\warning There are no guarantees on the order in which threads will process the batches of
1071entries. In particular, note that this means that, for multi-thread event loops, there is no
1072guarantee on the order in which Snapshot() will _write_ entries: they could be scrambled with respect to the input
1073dataset. The values of the special `rdfentry_` column will also not correspond to the entry numbers in the input dataset (e.g. TChain) in multi-threaded
1074runs. Likewise, Take(), AsNumpy(), ... do not preserve the original ordering.
1075
1076### Thread-safety of user-defined expressions
1077RDataFrame operations such as Histo1D() or Snapshot() are guaranteed to work correctly in multi-thread event loops.
1078User-defined expressions, such as strings or lambdas passed to Filter(), Define(), Foreach(), Reduce() or Aggregate()
1079will have to be thread-safe, i.e. it should be possible to call them concurrently from different threads.
1080
1081Note that simple Filter() and Define() transformations will inherently satisfy this requirement: Filter() / Define()
1082expressions will often be *pure* in the functional programming sense (no side-effects, no dependency on external state),
1083which eliminates all risks of race conditions.
1084
1085In order to facilitate writing of thread-safe operations, some RDataFrame features such as Foreach(), Define() or \link ROOT::RDF::RResultPtr::OnPartialResult OnPartialResult()\endlink
1086offer thread-aware counterparts (ForeachSlot(), DefineSlot(), \link ROOT::RDF::RResultPtr::OnPartialResultSlot OnPartialResultSlot()\endlink): their only difference is that they
1087will pass an extra `slot` argument (an unsigned integer) to the user-defined expression. When calling user-defined code
1088concurrently, RDataFrame guarantees that different threads will see different values of the `slot` parameter,
1089where `slot` will be a number between 0 and `GetNSlots() - 1`. Note that not all slot numbers may be reached, or some slots may be reached more often depending on how computation tasks are scheduled.
1090In other words, within a slot, computations run sequentially, and events are processed sequentially.
1091Note that the same slot might be associated to different threads over the course of a single event loop, but two threads
1092will never receive the same slot at the same time.
1093This extra parameter might facilitate writing safe parallel code by having each thread write/modify a different
1094processing slot, e.g. a different element of a list. See [here](#generic-actions) for an example usage of ForeachSlot().
1095
1096### Parallel execution of multiple RDataFrame event loops
1097A complex analysis may require multiple separate RDataFrame computation graphs to produce all desired results. This poses the challenge that the
1098event loops of each computation graph can be parallelized, but the different loops run sequentially, one after the other.
1099On many-core architectures it might be desirable to run different event loops concurrently to improve resource usage.
1100ROOT::RDF::RunGraphs() allows running multiple RDataFrame event loops concurrently:
1101~~~{.cpp}
1102ROOT::EnableImplicitMT();
1103ROOT::RDataFrame df1("tree1", "f1.root");
1104ROOT::RDataFrame df2("tree2", "f2.root");
1105auto histo1 = df1.Histo1D("x");
1106auto histo2 = df2.Histo1D("y");
1107
1108// just accessing result pointers, the event loops of separate RDataFrames run one after the other
1109histo1->Draw(); // runs first multi-thread event loop
1110histo2->Draw(); // runs second multi-thread event loop
1111
1112// alternatively, with ROOT::RDF::RunGraphs, event loops for separate computation graphs can run concurrently
1113ROOT::RDF::RunGraphs({histo1, histo2});
1114histo1->Draw(); // results can then be used as usual
1115~~~
1116
1117### Performance considerations
1118
1119To obtain the maximum performance out of RDataFrame, make sure to avoid just-in-time compiled versions of transformations and actions if at all possible.
1120For instance, `Filter("x > 0")` requires just-in-time compilation of the corresponding C++ logic, while the equivalent `Filter([](float x) { return x > 0.; }, {"x"})` does not.
1121Similarly, `Histo1D("x")` requires just-in-time compilation after the type of `x` is retrieved from the dataset, while `Histo1D<float>("x")` does not; the latter spelling
1122should be preferred for performance-critical applications.
1123
1124Python applications cannot easily specify template parameters or pass C++ callables to RDataFrame.
1125See [Python interface](classROOT_1_1RDataFrame.html#python) for possible ways to speed up hot paths in this case.
1126
1127Just-in-time compilation happens once, right before starting an event loop. To reduce the runtime cost of this step, make sure to book all operations *for all RDataFrame computation graphs*
1128before the first event loop is triggered: just-in-time compilation will happen once for all code required to be generated up to that point, also across different computation graphs.
1129
1130Also make sure not to count the just-in-time compilation time (which happens once before the event loop and does not depend on the size of the dataset) as part of the event loop runtime (which scales with the size of the dataset). RDataFrame has an experimental logging feature that simplifies measuring the time spent in just-in-time compilation and in the event loop (as well as providing some more interesting information). See [Activating RDataFrame execution logs](\ref rdf-logging).
1131
1132### Memory usage
1133
1134There are two reasons why RDataFrame may consume more memory than expected.
1135
1136#### 1. Histograms in multi-threaded mode
1137In multithreaded runs, each worker thread will create a local copy of histograms, which e.g. in case of many (possibly multi-dimensional) histograms with fine binning can result in significant memory consumption during the event loop.
1138The thread-local copies of the results are destroyed when the final result is produced. Reducing the number of threads or using coarser binning will reduce the memory usage.
1139For three-dimensional histograms, the number of clones can be reduced using ROOT::RDF::Experimental::ThreadsPerTH3().
1140~~~{.cpp}
1141#include "ROOT/RDFHelpers.hxx"
1142
1143// Make four threads share a TH3 instance:
1144ROOT::RDF::Experimental::ThreadsPerTH3(4);
1145ROOT::RDataFrame rdf(...);
1146~~~
1147
1148When TH3s are shared among threads, TH3D will either be filled under lock (slowing down the execution) or using atomics if C++20 is available. The latter is significantly faster.
1149The best value for `ThreadsPerTH3` depends on the computation graph that runs. Use lower numbers such as 4 for speed and higher memory consumption, and higher numbers such as 16 for
1150slower execution and memory savings.
1151
1152#### 2. Just-in-time compilation
1153Secondly, just-in-time compilation of string expressions or non-templated actions (see the previous paragraph) causes Cling, ROOT's C++ interpreter, to allocate some memory for the generated code that is only released at the end of the application. This commonly results in memory usage creep in long-running applications that create many RDataFrames one after the other. Possible mitigations include creating and running each RDataFrame event loop in a sub-process, or booking all operations for all different RDataFrame computation graphs before the first event loop is triggered, so that the interpreter is invoked only once for all computation graphs:
1154
1155~~~{.cpp}
1156// assuming df1 and df2 are separate computation graphs, do:
1157auto h1 = df1.Histo1D("x");
1158auto h2 = df2.Histo1D("y");
1159h1->Draw(); // we just-in-time compile everything needed by df1 and df2 here
1160h2->Draw("SAME");
1161
1162// do not:
1163auto h1 = df1.Histo1D("x");
1164h1->Draw(); // we just-in-time compile here
1165auto h2 = df2.Histo1D("y");
1166h2->Draw("SAME"); // we just-in-time compile again here, as the second Histo1D call is new
1167~~~
1168
1169\anchor more-features
1170## More features
1171Here is a list of the most important features that have been omitted in the "Crash course" for brevity.
1172You don't need to read all these to start using RDataFrame, but they are useful to save typing time and runtime.
1173
1174\anchor systematics
1175### Systematic variations
1176
1177Starting from ROOT v6.26, RDataFrame provides a flexible syntax to define systematic variations.
1178This is done in two steps: a) register variations for one or more existing columns using Vary() and b) extract variations
1179of normal RDataFrame results using \ref ROOT::RDF::Experimental::VariationsFor "VariationsFor()". In between these steps, no other change
1180to the analysis code is required: the presence of systematic variations for certain columns is automatically propagated
1181through filters, defines and actions, and RDataFrame will take these dependencies into account when producing varied
1182results. \ref ROOT::RDF::Experimental::VariationsFor "VariationsFor()" is included in header `ROOT/RDFHelpers.hxx`. The compiled C++ programs must include this header
1183explicitly, this is not required for ROOT macros.
1184
1185An example usage of Vary() and \ref ROOT::RDF::Experimental::VariationsFor "VariationsFor()" in C++:
1186
1187~~~{.cpp}
1188auto nominal_hx =
1189 df.Vary("pt", "ROOT::RVecD{pt*0.9f, pt*1.1f}", {"down", "up"})
1190 .Filter("pt > pt_cut")
1191 .Define("x", someFunc, {"pt"})
1192 .Histo1D<float>("x");
1193
1194// request the generation of varied results from the nominal_hx
1195ROOT::RDF::Experimental::RResultMap<TH1D> hx = ROOT::RDF::Experimental::VariationsFor(nominal_hx);
1196
1197// the event loop runs here, upon first access to any of the results or varied results:
1198hx["nominal"].Draw(); // same effect as nominal_hx->Draw()
1199hx["pt:down"].Draw("SAME");
1200hx["pt:up"].Draw("SAME");
1201~~~
1202
1203A list of variation "tags" is passed as the last argument to Vary(). The tags give names to the varied values that are returned
1204as elements of an RVec of the appropriate C++ type. The number of variation tags must correspond to the number of elements of
1205this RVec (2 in the example above: the first element will correspond to the tag "down", the second
1206to the tag "up"). The _full_ variation name will be composed of the varied column name and the variation tags (e.g.
1207"pt:down", "pt:up" in this example). Python usage looks similar.
1208
1209Note how we use the "pt" column as usual in the Filter() and Define() calls and we simply use "x" as the value to fill
1210the resulting histogram. To produce the varied results, RDataFrame will automatically execute the Filter and Define
1211calls for each variation and fill the histogram with values and cuts that depend on the variation.
1212
1213There is no limitation to the complexity of a Vary() expression. Just like for the Define() and Filter() calls, users are
1214not limited to string expressions but they can also pass any valid C++ callable, including lambda functions and
1215complex functors. The callable can be applied to zero or more existing columns and it will always receive their
1216_nominal_ value in input.
1217
1218#### Varying multiple columns in lockstep
1219
1220In the following Python snippet we use the Vary() signature that allows varying multiple columns simultaneously or
1221"in lockstep":
1222
1223~~~{.python}
1224df.Vary(["pt", "eta"],
1225 "RVec<RVecF>{{pt*0.9, pt*1.1}, {eta*0.9, eta*1.1}}",
1226 variationTags=["down", "up"],
1227 variationName="ptAndEta")
1228~~~
1229
1230The expression returns an RVec of two RVecs: each inner vector contains the varied values for one column. The
1231inner vectors follow the same ordering as the column names that are passed as the first argument. Besides the variation tags, in
1232this case we also have to explicitly pass the variation name (here: "ptAndEta") as the default column name does not exist.
1233
1234The above call will produce variations "ptAndEta:down" and "ptAndEta:up".
1235
1236#### Combining multiple variations
1237
1238Even if a result depends on multiple variations, only one variation is applied at a time, i.e. there will be no result produced
1239by applying multiple systematic variations at the same time.
1240For example, in the following example snippet, the RResultMap instance `all_h` will contain keys "nominal", "pt:down",
1241"pt:up", "eta:0", "eta:1", but no "pt:up&&eta:0" or similar:
1242
1243~~~{.cpp}
1244auto df = _df.Vary("pt",
1245 "ROOT::RVecD{pt*0.9, pt*1.1}",
1246 {"down", "up"})
1247 .Vary("eta",
1248 [](float eta) { return RVecF{eta*0.9f, eta*1.1f}; },
1249 {"eta"},
1250 2);
1251
1252auto nom_h = df.Histo2D(histoModel, "pt", "eta");
1253auto all_hs = VariationsFor(nom_h);
1254all_hs.GetKeys(); // returns {"nominal", "pt:down", "pt:up", "eta:0", "eta:1"}
1255~~~
1256
1257Note how we passed the integer `2` instead of a list of variation tags to the second Vary() invocation: this is a
1258shorthand that automatically generates tags 0 to N-1 (in this case 0 and 1).
1259
1260\note Currently, VariationsFor() and RResultMap are in the `ROOT::RDF::Experimental` namespace, to indicate that these
1261 interfaces might still evolve and improve based on user feedback. We expect that some aspects of the related
1262 programming model will be streamlined in future versions.
1263
1264\note Currently, the results of a Snapshot() or Display() call cannot be varied (i.e. it is not possible to
1265 call \ref ROOT::RDF::Experimental::VariationsFor "VariationsFor()" on them. These limitations will be lifted in future releases.
1266
1267See the Vary() method for more information and [this tutorial](https://root.cern/doc/master/df106__HiggsToFourLeptons_8C.html)
1268for an example usage of Vary and \ref ROOT::RDF::Experimental::VariationsFor "VariationsFor()" in the analysis.
1269
1270\anchor rnode
1271### RDataFrame objects as function arguments and return values
1272RDataFrame variables/nodes are relatively cheap to copy and it's possible to both pass them to (or move them into)
1273functions and to return them from functions. However, in general each dataframe node will have a different C++ type,
1274which includes all available compile-time information about what that node does. One way to cope with this complication
1275is to use template functions and/or C++14 auto return types:
1276~~~{.cpp}
1277template <typename RDF>
1278auto ApplySomeFilters(RDF df)
1279{
1280 return df.Filter("x > 0").Filter([](int y) { return y < 0; }, {"y"});
1281}
1282~~~
1283
1284A possibly simpler, C++11-compatible alternative is to take advantage of the fact that any dataframe node can be
1285converted (implicitly or via an explicit cast) to the common type ROOT::RDF::RNode:
1286~~~{.cpp}
1287// a function that conditionally adds a Range to an RDataFrame node.
1288RNode MaybeAddRange(RNode df, bool mustAddRange)
1289{
1290 return mustAddRange ? df.Range(1) : df;
1291}
1292// use as :
1293ROOT::RDataFrame df(10);
1294auto maybeRangedDF = MaybeAddRange(df, true);
1295~~~
1296
1297The conversion to ROOT::RDF::RNode is cheap, but it will introduce an extra virtual call during the RDataFrame event
1298loop (in most cases, the resulting performance impact should be negligible). Python users can perform the conversion with the helper function `ROOT.RDF.AsRNode`.
1299
1300\anchor RDFCollections
1301### Storing RDataFrame objects in collections
1302
1303ROOT::RDF::RNode also makes it simple to store RDataFrame nodes in collections, e.g. a `std::vector<RNode>` or a `std::map<std::string, RNode>`:
1304
1305~~~{.cpp}
1306std::vector<ROOT::RDF::RNode> dfs;
1307dfs.emplace_back(ROOT::RDataFrame(10));
1308dfs.emplace_back(dfs[0].Define("x", "42.f"));
1309~~~
1310
1311\anchor callbacks
1312### Executing callbacks every N events
1313It's possible to schedule execution of arbitrary functions (callbacks) during the event loop.
1314Callbacks can be used e.g. to inspect partial results of the analysis while the event loop is running,
1315drawing a partially-filled histogram every time a certain number of new entries is processed, or
1316displaying a progress bar while the event loop runs.
1317
1318For example one can draw an up-to-date version of a result histogram every 100 entries like this:
1319~~~{.cpp}
1320auto h = df.Histo1D("x");
1321TCanvas c("c","x hist");
1322h.OnPartialResult(100, [&c](TH1D &h_) { c.cd(); h_.Draw(); c.Update(); });
1323// event loop runs here, this final `Draw` is executed after the event loop is finished
1324h->Draw();
1325~~~
1326
1327Callbacks are registered to a ROOT::RDF::RResultPtr and must be callables that takes a reference to the result type as argument
1328and return nothing. RDataFrame will invoke registered callbacks passing partial action results as arguments to them
1329(e.g. a histogram filled with a part of the selected events).
1330
1331Read more on ROOT::RDF::RResultPtr::OnPartialResult() and ROOT::RDF::RResultPtr::OnPartialResultSlot().
1332
1333\anchor default-branches
1334### Default column lists
1335When constructing an RDataFrame object, it is possible to specify a **default column list** for your analysis, in the
1336usual form of a list of strings representing branch/column names. The default column list will be used as a fallback
1337whenever a list specific to the transformation/action is not present. RDataFrame will take as many of these columns as
1338needed, ignoring trailing extra names if present.
1339~~~{.cpp}
1340// use "b1" and "b2" as default columns
1341ROOT::RDataFrame d1("myTree", "file.root", {"b1","b2"});
1342auto h = d1.Filter([](int b1, int b2) { return b1 > b2; }) // will act on "b1" and "b2"
1343 .Histo1D(); // will act on "b1"
1344
1345// just one default column this time
1346ROOT::RDataFrame d2("myTree", "file.root", {"b1"});
1347auto d2f = d2.Filter([](double b2) { return b2 > 0; }, {"b2"}) // we can still specify non-default column lists
1348auto min = d2f.Min(); // returns the minimum value of "b1" for the filtered entries
1349auto vals = d2f.Take<double>(); // return the values for all entries passing the selection as a vector
1350~~~
1351
1352\anchor helper-cols
1353### Special helper columns: rdfentry_ and rdfslot_
1354Every instance of RDataFrame is created with two special columns called `rdfentry_` and `rdfslot_`. The `rdfentry_`
1355column is of type `ULong64_t` and it holds the current entry number while `rdfslot_` is an `unsigned int`
1356holding the index of the current data processing slot.
1357For backwards compatibility reasons, the names `tdfentry_` and `tdfslot_` are also accepted.
1358These columns are ignored by operations such as [Cache](classROOT_1_1RDF_1_1RInterface.html#aaaa0a7bb8eb21315d8daa08c3e25f6c9)
1359or [Snapshot](classROOT_1_1RDF_1_1RInterface.html#a233b7723e498967f4340705d2c4db7f8).
1360
1361\warning Note that in multi-thread event loops the values of `rdfentry_` _do not_ correspond to what would be the entry numbers
1362of a TChain constructed over the same set of ROOT files, as the entries are processed in an unspecified order.
1363
1364\anchor jitting
1365### Just-in-time compilation: column type inference and explicit declaration of column types
1366C++ is a statically typed language: all types must be known at compile-time. This includes the types of the TTree
1367branches we want to work on. For filters, defined columns and some of the actions, **column types are deduced from the
1368signature** of the relevant filter function/temporary column expression/action function:
1369~~~{.cpp}
1370// here b1 is deduced to be `int` and b2 to be `double`
1371df.Filter([](int x, double y) { return x > 0 && y < 0.; }, {"b1", "b2"});
1372~~~
1373If we specify an incorrect type for one of the columns, an exception with an informative message will be thrown at
1374runtime, when the column value is actually read from the dataset: RDataFrame detects type mismatches. The same would
1375happen if we swapped the order of "b1" and "b2" in the column list passed to Filter().
1376
1377Certain actions, on the other hand, do not take a function as argument (e.g. Histo1D()), so we cannot deduce the type of
1378the column at compile-time. In this case **RDataFrame infers the type of the column** from the TTree itself. This
1379is why we never needed to specify the column types for all actions in the above snippets.
1380
1381When the column type is not a common one such as `int`, `double`, `char` or `float` it is nonetheless good practice to
1382specify it as a template parameter to the action itself, like this:
1383~~~{.cpp}
1384df.Histo1D("b1"); // OK, the type of "b1" is deduced at runtime
1385df.Min<MyNumber_t>("myObject"); // OK, "myObject" is deduced to be of type `MyNumber_t`
1386~~~
1387
1388Deducing types at runtime requires the just-in-time compilation of the relevant actions, which has a small runtime
1389overhead, so specifying the type of the columns as template parameters to the action is good practice when performance is a goal.
1390
1391When strings are passed as expressions to Filter() or Define(), fundamental types are passed as constants. This avoids certaincommon mistakes such as typing `x = 0` rather than `x == 0`:
1392
1393~~~{.cpp}
1394// this throws an error (note the typo)
1395df.Define("x", "0").Filter("x = 0");
1396~~~
1397
1398\anchor generic-actions
1399### User-defined custom actions
1400RDataFrame strives to offer a comprehensive set of standard actions that can be performed on each event. At the same
1401time, it allows users to inject their own action code to perform arbitrarily complex data reductions.
1402
1403#### Implementing custom actions with Book()
1404
1405Through the Book() method, users can implement a custom action and have access to the same features
1406that built-in RDataFrame actions have, e.g. hooks to events related to the start, end and execution of the
1407event loop, or the possibility to return a lazy RResultPtr to an arbitrary type of result:
1408
1409~~~{.cpp}
1410#include <ROOT/RDataFrame.hxx>
1411#include <memory>
1412
1413class MyCounter : public ROOT::Detail::RDF::RActionImpl<MyCounter> {
1414 std::shared_ptr<int> fFinalResult = std::make_shared<int>(0);
1415 std::vector<int> fPerThreadResults;
1416
1417public:
1418 // We use a public type alias to advertise the type of the result of this action
1419 using Result_t = int;
1420
1421 MyCounter(unsigned int nSlots) : fPerThreadResults(nSlots) {}
1422
1423 // Called before the event loop to retrieve the address of the result that will be filled/generated.
1424 std::shared_ptr<int> GetResultPtr() const { return fFinalResult; }
1425
1426 // Called at the beginning of the event loop.
1427 void Initialize() {}
1428
1429 // Called at the beginning of each processing task.
1430 void InitTask(TTreeReader *, int) {}
1431
1432 /// Called at every entry.
1433 void Exec(unsigned int slot)
1434 {
1435 fPerThreadResults[slot]++;
1436 }
1437
1438 // Called at the end of the event loop.
1439 void Finalize()
1440 {
1441 *fFinalResult = std::accumulate(fPerThreadResults.begin(), fPerThreadResults.end(), 0);
1442 }
1443
1444 // Called by RDataFrame to retrieve the name of this action.
1445 std::string GetActionName() const { return "MyCounter"; }
1446};
1447
1448int main() {
1449 ROOT::RDataFrame df(10);
1450 ROOT::RDF::RResultPtr<int> resultPtr = df.Book<>(MyCounter{df.GetNSlots()}, {});
1451 // The GetValue call triggers the event loop
1452 std::cout << "Number of processed entries: " << resultPtr.GetValue() << std::endl;
1453}
1454~~~
1455
1456See the Book() method for more information and [this tutorial](https://root.cern/doc/master/df018__customActions_8C.html)
1457for a more complete example.
1458
1459#### Injecting arbitrary code in the event loop with Foreach() and ForeachSlot()
1460
1461Foreach() takes a callable (lambda expression, free function, functor...) and a list of columns and
1462executes the callable on the values of those columns for each event that passes all upstream selections.
1463It can be used to perform actions that are not already available in the interface. For example, the following snippet
1464evaluates the root mean square of column "x":
1465~~~{.cpp}
1466// Single-thread evaluation of RMS of column "x" using Foreach
1467double sumSq = 0.;
1468unsigned int n = 0;
1469df.Foreach([&sumSq, &n](double x) { ++n; sumSq += x*x; }, {"x"});
1470std::cout << "rms of x: " << std::sqrt(sumSq / n) << std::endl;
1471~~~
1472In multi-thread runs, users are responsible for the thread-safety of the expression passed to Foreach():
1473thread will execute the expression concurrently.
1474The code above would need to employ some resource protection mechanism to ensure non-concurrent writing of `rms`; but
1475this is probably too much head-scratch for such a simple operation.
1476
1477ForeachSlot() can help in this situation. It is an alternative version of Foreach() for which the function takes an
1478additional "processing slot" parameter besides the columns it should be applied to. RDataFrame
1479guarantees that ForeachSlot() will invoke the user expression with different `slot` parameters for different concurrent
1480executions (see [Special helper columns: rdfentry_ and rdfslot_](\ref helper-cols) for more information on the slot parameter).
1481We can take advantage of ForeachSlot() to evaluate a thread-safe root mean square of column "x":
1482~~~{.cpp}
1483// Thread-safe evaluation of RMS of column "x" using ForeachSlot
1484ROOT::EnableImplicitMT();
1485const unsigned int nSlots = df.GetNSlots();
1486std::vector<double> sumSqs(nSlots, 0.);
1487std::vector<unsigned int> ns(nSlots, 0);
1488
1489df.ForeachSlot([&sumSqs, &ns](unsigned int slot, double x) { sumSqs[slot] += x*x; ns[slot] += 1; }, {"x"});
1490double sumSq = std::accumulate(sumSqs.begin(), sumSqs.end(), 0.); // sum all squares
1491unsigned int n = std::accumulate(ns.begin(), ns.end(), 0); // sum all counts
1492std::cout << "rms of x: " << std::sqrt(sumSq / n) << std::endl;
1493~~~
1494Notice how we created one `double` variable for each processing slot and later merged their results via `std::accumulate`.
1495
1496
1497\anchor friends
1498### Dataset joins with friend trees
1499
1500Vertically concatenating multiple trees that have the same columns (creating a logical dataset with the same columns and
1501more rows) is trivial in RDataFrame: just pass the tree name and a list of file names to RDataFrame's constructor, or create a TChain
1502out of the desired trees and pass that to RDataFrame.
1503
1504Horizontal concatenations of trees or chains (creating a logical dataset with the same number of rows and the union of the
1505columns of multiple trees) leverages TTree's "friend" mechanism.
1506
1507Simple joins of trees that do not have the same number of rows are also possible with indexed friend trees (see below).
1508
1509To use friend trees in RDataFrame, set up trees with the appropriate relationships and then instantiate an RDataFrame
1510with the main tree:
1511
1512~~~{.cpp}
1513TTree main([...]);
1514TTree friend([...]);
1515main.AddFriend(&friend, "myFriend");
1516
1517RDataFrame df(main);
1518auto df2 = df.Filter("myFriend.MyCol == 42");
1519~~~
1520
1521The same applies for TChains. Columns coming from the friend trees can be referred to by their full name, like in the example above,
1522or the friend tree name can be omitted in case the column name is not ambiguous (e.g. "MyCol" could be used instead of
1523"myFriend.MyCol" in the example above if there is no column "MyCol" in the main tree).
1524
1525\note A common source of confusion is that trees that are written out from a multi-thread Snapshot() call will have their
1526 entries (block-wise) shuffled with respect to the original tree. Such trees cannot be used as friends of the original
1527 one: rows will be mismatched.
1528
1529Indexed friend trees provide a way to perform simple joins of multiple trees over a common column.
1530When a certain entry in the main tree (or chain) is loaded, the friend trees (or chains) will then load an entry where the
1531"index" columns have a value identical to the one in the main one. For example, in Python:
1532
1533~~~{.py}
1534main_tree = ...
1535aux_tree = ...
1536
1537# If a friend tree has an index on `commonColumn`, when the main tree loads
1538# a given row, it also loads the row of the friend tree that has the same
1539# value of `commonColumn`
1540aux_tree.BuildIndex("commonColumn")
1541
1542mainTree.AddFriend(aux_tree)
1543
1544df = ROOT.RDataFrame(mainTree)
1545~~~
1546
1547RDataFrame supports indexed friend TTrees from ROOT v6.24 in single-thread mode and from v6.28/02 in multi-thread mode.
1548
1549\anchor other-file-formats
1550### Reading data formats other than ROOT trees
1551RDataFrame can be interfaced with RDataSources. The ROOT::RDF::RDataSource interface defines an API that RDataFrame can use to read arbitrary columnar data formats.
1552
1553RDataFrame calls into concrete RDataSource implementations to retrieve information about the data, retrieve (thread-local) readers or "cursors" for selected columns
1554and to advance the readers to the desired data entry.
1555Some predefined RDataSources are natively provided by ROOT such as the ROOT::RDF::RCsvDS which allows to read comma separated files:
1556~~~{.cpp}
1557auto tdf = ROOT::RDF::FromCSV("MuRun2010B.csv");
1558auto filteredEvents =
1559 tdf.Filter("Q1 * Q2 == -1")
1560 .Define("m", "sqrt(pow(E1 + E2, 2) - (pow(px1 + px2, 2) + pow(py1 + py2, 2) + pow(pz1 + pz2, 2)))");
1561auto h = filteredEvents.Histo1D("m");
1562h->Draw();
1563~~~
1564
1565See also FromNumpy (Python-only), FromRNTuple(), FromArrow(), FromSqlite().
1566
1567\anchor callgraphs
1568### Computation graphs (storing and reusing sets of transformations)
1569
1570As we saw, transformed dataframes can be stored as variables and reused multiple times to create modified versions of the dataset. This implicitly defines a **computation graph** in which
1571several paths of filtering/creation of columns are executed simultaneously, and finally aggregated results are produced.
1572
1573RDataFrame detects when several actions use the same filter or the same defined column, and **only evaluates each
1574filter or defined column once per event**, regardless of how many times that result is used down the computation graph.
1575Objects read from each column are **built once and never copied**, for maximum efficiency.
1576When "upstream" filters are not passed, subsequent filters, temporary column expressions and actions are not evaluated,
1577so it might be advisable to put the strictest filters first in the graph.
1578
1579\anchor representgraph
1580### Visualizing the computation graph
1581It is possible to print the computation graph from any node to obtain a [DOT (graphviz)](https://en.wikipedia.org/wiki/DOT_(graph_description_language)) representation either on the standard output
1582or in a file.
1583
1584Invoking the function ROOT::RDF::SaveGraph() on any node that is not the head node, the computation graph of the branch
1585the node belongs to is printed. By using the head node, the entire computation graph is printed.
1586
1587Following there is an example of usage:
1588~~~{.cpp}
1589// First, a sample computational graph is built
1590ROOT::RDataFrame df("tree", "f.root");
1591
1592auto df2 = df.Define("x", []() { return 1; })
1593 .Filter("col0 % 1 == col0")
1594 .Filter([](int b1) { return b1 <2; }, {"cut1"})
1595 .Define("y", []() { return 1; });
1596
1597auto count = df2.Count();
1598
1599// Prints the graph to the rd1.dot file in the current directory
1600ROOT::RDF::SaveGraph(df, "./mydot.dot");
1601// Prints the graph to standard output
1602ROOT::RDF::SaveGraph(df);
1603~~~
1604
1605The generated graph can be rendered using one of the graphviz filters, e.g. `dot`. For instance, the image below can be generated with the following command:
1606~~~{.sh}
1607$ dot -Tpng computation_graph.dot -ocomputation_graph.png
1608~~~
1609
1610\image html RDF_Graph2.png
1611
1612\anchor rdf-logging
1613### Activating RDataFrame execution logs
1614
1615RDataFrame has experimental support for verbose logging of the event loop runtimes and other interesting related information. It is activated as follows:
1616~~~{.cpp}
1617#include <ROOT/RLogger.hxx>
1618
1619// this increases RDF's verbosity level as long as the `verbosity` variable is in scope
1620auto verbosity = ROOT::RLogScopedVerbosity(ROOT::Detail::RDF::RDFLogChannel(), ROOT::ELogLevel::kInfo);
1621~~~
1622
1623or in Python:
1624~~~{.python}
1625import ROOT
1626
1627verbosity = ROOT.RLogScopedVerbosity(ROOT.Detail.RDF.RDFLogChannel(), ROOT.ELogLevel.kInfo)
1628~~~
1629
1630More information (e.g. start and end of each multi-thread task) is printed using `ELogLevel.kDebug` and even more
1631(e.g. a full dump of the generated code that RDataFrame just-in-time-compiles) using `ELogLevel.kDebug+10`.
1632
1633\anchor rdf-from-spec
1634### Creating an RDataFrame from a dataset specification file
1635
1636RDataFrame can be created using a dataset specification JSON file:
1637
1638~~~{.python}
1639import ROOT
1640
1641df = ROOT.RDF.Experimental.FromSpec("spec.json")
1642~~~
1643
1644The input dataset specification JSON file needs to be provided by the user and it describes all necessary samples and
1645their associated metadata information. The main required key is the "samples" (at least one sample is needed) and the
1646required sub-keys for each sample are "trees" and "files". Additionally, one can specify a metadata dictionary for each
1647sample in the "metadata" key.
1648
1649A simple example for the formatting of the specification in the JSON file is the following:
1650
1651~~~{.cpp}
1652{
1653 "samples": {
1654 "sampleA": {
1655 "trees": ["tree1", "tree2"],
1656 "files": ["file1.root", "file2.root"],
1657 "metadata": {
1658 "lumi": 10000.0,
1659 "xsec": 1.0,
1660 "sample_category" = "data"
1661 }
1662 },
1663 "sampleB": {
1664 "trees": ["tree3", "tree4"],
1665 "files": ["file3.root", "file4.root"],
1666 "metadata": {
1667 "lumi": 0.5,
1668 "xsec": 1.5,
1669 "sample_category" = "MC_background"
1670 }
1671 }
1672 }
1673}
1674~~~
1675
1676The metadata information from the specification file can be then accessed using the DefinePerSample function.
1677For example, to access luminosity information (stored as a double):
1678
1679~~~{.python}
1680df.DefinePerSample("lumi", 'rdfsampleinfo_.GetD("lumi")')
1681~~~
1682
1683or sample_category information (stored as a string):
1684
1685~~~{.python}
1686df.DefinePerSample("sample_category", 'rdfsampleinfo_.GetS("sample_category")')
1687~~~
1688
1689or directly the filename:
1690
1691~~~{.python}
1692df.DefinePerSample("name", "rdfsampleinfo_.GetSampleName()")
1693~~~
1694
1695An example implementation of the "FromSpec" method is available in tutorial: df106_HiggstoFourLeptons.py, which also
1696provides a corresponding exemplary JSON file for the dataset specification.
1697
1698\anchor progressbar
1699### Adding a progress bar
1700
1701A progress bar showing the processed event statistics can be added to any RDataFrame program.
1702The event statistics include elapsed time, currently processed file, currently processed events, the rate of event processing
1703and an estimated remaining time (per file being processed). It is recorded and printed in the terminal every m events and every
1704n seconds (by default m = 1000 and n = 1). The ProgressBar can be also added when the multithread (MT) mode is enabled.
1705
1706ProgressBar is added after creating the dataframe object (df):
1707~~~{.cpp}
1708ROOT::RDataFrame df("tree", "file.root");
1709ROOT::RDF::Experimental::AddProgressBar(df);
1710~~~
1711
1712Alternatively, RDataFrame can be cast to an RNode first, giving the user more flexibility
1713For example, it can be called at any computational node, such as Filter or Define, not only the head node,
1714with no change to the ProgressBar function itself (please see the [Python interface](classROOT_1_1RDataFrame.html#python)
1715section for appropriate usage in Python):
1716~~~{.cpp}
1717ROOT::RDataFrame df("tree", "file.root");
1718auto df_1 = ROOT::RDF::RNode(df.Filter("x>1"));
1719ROOT::RDF::Experimental::AddProgressBar(df_1);
1720~~~
1721Examples of implemented progress bars can be seen by running [Higgs to Four Lepton tutorial](https://root.cern/doc/master/df106__HiggsToFourLeptons_8py_source.html) and [Dimuon tutorial](https://root.cern/doc/master/df102__NanoAODDimuonAnalysis_8C.html).
1722
1723\anchor missing-values
1724### Working with missing values in the dataset
1725
1726In certain situations a dataset might be missing one or more values at one or
1727more of its entries. For example:
1728
1729- If the dataset is composed of multiple files and one or more files is
1730 missing one or more columns required by the analysis.
1731- When joining different datasets horizontally according to some index value
1732 (e.g. the event number), if the index does not find a match in one or more
1733 other datasets for a certain entry.
1734
1735For example, suppose that column "y" does not have a value for entry 42:
1736
1737\code{.unparsed}
1738+-------+---+---+
1739| Entry | x | y |
1740+-------+---+---+
1741| 42 | 1 | |
1742+-------+---+---+
1743\endcode
1744
1745If the RDataFrame application reads that column, for example if a Take() action
1746was requested, the default behaviour is to throw an exception indicating
1747that that column is missing an entry.
1748
1749The following paragraphs discuss the functionalities provided by RDataFrame to
1750work with missing values in the dataset.
1751
1752#### FilterAvailable and FilterMissing
1753
1754FilterAvailable and FilterMissing are specialized RDataFrame Filter operations.
1755They take as input argument the name of a column of the dataset to watch for
1756missing values. Like Filter, they will either keep or discard an entire entry
1757based on whether a condition returns true or false. Specifically:
1758
1759- FilterAvailable: the condition is whether the value of the column is present.
1760 If so, the entry is kept. Otherwise if the value is missing the entry is
1761 discarded.
1762- FilterMissing: the condition is whether the value of the column is missing. If
1763 so, the entry is kept. Otherwise if the value is present the entry is
1764 discarded.
1765
1766\code{.py}
1767df = ROOT.RDataFrame(dataset)
1768
1769# Anytime an entry from "col" is missing, the entire entry will be filtered out
1770df_available = df.FilterAvailable("col")
1771df_available = df_available.Define("twice", "col * 2")
1772
1773# Conversely, if we want to select the entries for which the column has missing
1774# values, we do the following
1775df_missingcol = df.FilterMissing("col")
1776# Following operations in the same branch of the computation graph clearly
1777# cannot access that same column, since there would be no value to read
1778df_missingcol = df_missingcol.Define("observable", "othercolumn * 2")
1779\endcode
1780
1781\code{.cpp}
1782ROOT::RDataFrame df{dataset};
1783
1784// Anytime an entry from "col" is missing, the entire entry will be filtered out
1785auto df_available = df.FilterAvailable("col");
1786auto df_twicecol = df_available.Define("twice", "col * 2");
1787
1788// Conversely, if we want to select the entries for which the column has missing
1789// values, we do the following
1790auto df_missingcol = df.FilterMissing("col");
1791// Following operations in the same branch of the computation graph clearly
1792// cannot access that same column, since there would be no value to read
1793auto df_observable = df_missingcol.Define("observable", "othercolumn * 2");
1794\endcode
1795
1796#### DefaultValueFor
1797
1798DefaultValueFor creates a node of the computation graph which just forwards the
1799values of the columns necessary for other downstream nodes, when they are
1800available. In case a value of the input column passed to this function is not
1801available, the node will provide the default value passed to this function call
1802instead. Example:
1803
1804\code{.py}
1805df = ROOT.RDataFrame(dataset)
1806# Anytime an entry from "col" is missing, the value will be the default one
1807default_value = ... # Some sensible default value here
1808df = df.DefaultValueFor("col", default_value)
1809df = df.Define("twice", "col * 2")
1810\endcode
1811
1812\code{.cpp}
1813ROOT::RDataFrame df{dataset};
1814// Anytime an entry from "col" is missing, the value will be the default one
1815constexpr auto default_value = ... // Some sensible default value here
1816auto df_default = df.DefaultValueFor("col", default_value);
1817auto df_col = df_default.Define("twice", "col * 2");
1818\endcode
1819
1820#### Mixing different strategies to work with missing values in the same RDataFrame
1821
1822All the operations presented above only act on the particular branch of the
1823computation graph where they are called, so that different results can be
1824obtained by mixing and matching the filtering or providing a default value
1825strategies:
1826
1827\code{.py}
1828df = ROOT.RDataFrame(dataset)
1829# Anytime an entry from "col" is missing, the value will be the default one
1830default_value = ... # Some sensible default value here
1831df_default = df.DefaultValueFor("col", default_value).Define("twice", "col * 2")
1832df_filtered = df.FilterAvailable("col").Define("twice", "col * 2")
1833
1834# Same number of total entries as the input dataset, with defaulted values
1835df_default.Display(["twice"]).Print()
1836# Only keep the entries where "col" has values
1837df_filtered.Display(["twice"]).Print()
1838\endcode
1839
1840\code{.cpp}
1841ROOT::RDataFrame df{dataset};
1842
1843// Anytime an entry from "col" is missing, the value will be the default one
1844constexpr auto default_value = ... // Some sensible default value here
1845auto df_default = df.DefaultValueFor("col", default_value).Define("twice", "col * 2");
1846auto df_filtered = df.FilterAvailable("col").Define("twice", "col * 2");
1847
1848// Same number of total entries as the input dataset, with defaulted values
1849df_default.Display({"twice"})->Print();
1850// Only keep the entries where "col" has values
1851df_filtered.Display({"twice"})->Print();
1852\endcode
1853
1854#### Further considerations
1855
1856Note that working with missing values is currently supported with a TTree-based
1857data source. Support of this functionality for other data sources may come in
1858the future.
1859
1860\anchor special-values
1861### Dealing with NaN or Inf values in the dataset
1862
1863RDataFrame does not treat NaNs or infinities beyond what the floating-point standards require, i.e. they will
1864propagate to the final result.
1865Non-finite numbers can be suppressed using Filter(), e.g.:
1866
1867\code{.py}
1868df.Filter("std::isfinite(x)").Mean("x")
1869\endcode
1870
1871*/
1872// clang-format on
1873
1874namespace ROOT {
1875
1877using ColumnNamesPtr_t = std::shared_ptr<const ColumnNames_t>;
1878
1879////////////////////////////////////////////////////////////////////////////
1880/// \brief Build the dataframe.
1881/// \param[in] treeName Name of the tree contained in the directory
1882/// \param[in] dirPtr TDirectory where the tree is stored, e.g. a TFile.
1883/// \param[in] defaultColumns Collection of default columns.
1884///
1885/// The default columns are looked at in case no column is specified in the
1886/// booking of actions or transformations.
1887/// \note see ROOT::RDF::RInterface for the documentation of the methods available.
1888RDataFrame::RDataFrame(std::string_view treeName, TDirectory *dirPtr, const ColumnNames_t &defaultColumns)
1889 : RInterface(std::make_shared<RDFDetail::RLoopManager>(
1890 std::make_unique<ROOT::Internal::RDF::RTTreeDS>(treeName, dirPtr), defaultColumns))
1891{
1892}
1893
1894////////////////////////////////////////////////////////////////////////////
1895/// \brief Build the dataframe.
1896/// \param[in] treeName Name of the tree contained in the directory
1897/// \param[in] fileNameGlob TDirectory where the tree is stored, e.g. a TFile.
1898/// \param[in] defaultColumns Collection of default columns.
1899///
1900/// The filename glob supports the same type of expressions as TChain::Add(), and it is passed as-is to TChain's
1901/// constructor.
1902///
1903/// The default columns are looked at in case no column is specified in the
1904/// booking of actions or transformations.
1905/// \note see ROOT::RDF::RInterface for the documentation of the methods available.
1906RDataFrame::RDataFrame(std::string_view treeName, std::string_view fileNameGlob, const ColumnNames_t &defaultColumns)
1907 : RInterface(ROOT::Detail::RDF::CreateLMFromFile(treeName, fileNameGlob, defaultColumns))
1908{
1909}
1910
1911////////////////////////////////////////////////////////////////////////////
1912/// \brief Build the dataframe.
1913/// \param[in] datasetName Name of the dataset contained in the directory
1914/// \param[in] fileNameGlobs Collection of file names of filename globs
1915/// \param[in] defaultColumns Collection of default columns.
1916///
1917/// The filename globs support the same type of expressions as TChain::Add(), and each glob is passed as-is
1918/// to TChain's constructor.
1919///
1920/// The default columns are looked at in case no column is specified in the booking of actions or transformations.
1921/// \note see ROOT::RDF::RInterface for the documentation of the methods available.
1922RDataFrame::RDataFrame(std::string_view datasetName, const std::vector<std::string> &fileNameGlobs,
1924 : RInterface(ROOT::Detail::RDF::CreateLMFromFile(datasetName, fileNameGlobs, defaultColumns))
1925{
1926}
1927
1928////////////////////////////////////////////////////////////////////////////
1929/// \brief Build the dataframe.
1930/// \param[in] tree The tree or chain to be studied.
1931/// \param[in] defaultColumns Collection of default column names to fall back to when none is specified.
1932///
1933/// The default columns are looked at in case no column is specified in the
1934/// booking of actions or transformations.
1935/// \note see ROOT::RDF::RInterface for the documentation of the methods available.
1940
1941//////////////////////////////////////////////////////////////////////////
1942/// \brief Build a dataframe that generates numEntries entries.
1943/// \param[in] numEntries The number of entries to generate.
1944///
1945/// An empty-source dataframe constructed with a number of entries will
1946/// generate those entries on the fly when some action is triggered,
1947/// and it will do so for all the previously-defined columns.
1948/// \note see ROOT::RDF::RInterface for the documentation of the methods available.
1950 : RInterface(std::make_shared<RDFDetail::RLoopManager>(numEntries))
1951
1952{
1953}
1954
1955//////////////////////////////////////////////////////////////////////////
1956/// \brief Build dataframe associated to data source.
1957/// \param[in] ds The data source object.
1958/// \param[in] defaultColumns Collection of default column names to fall back to when none is specified.
1959///
1960/// A dataframe associated to a data source will query it to access column values.
1961/// \note see ROOT::RDF::RInterface for the documentation of the methods available.
1962RDataFrame::RDataFrame(std::unique_ptr<ROOT::RDF::RDataSource> ds, const ColumnNames_t &defaultColumns)
1963 : RInterface(std::make_shared<RDFDetail::RLoopManager>(std::move(ds), defaultColumns))
1964{
1965}
1966
1967//////////////////////////////////////////////////////////////////////////
1968/// \brief Build dataframe from an RDatasetSpec object.
1969/// \param[in] spec The dataset specification object.
1970///
1971/// A dataset specification includes trees and file names,
1972/// as well as an optional friend list and/or entry range.
1973///
1974/// ### Example usage from Python:
1975/// ~~~{.py}
1976/// spec = (
1977/// ROOT.RDF.Experimental.RDatasetSpec()
1978/// .AddSample(("data", "tree", "file.root"))
1979/// .WithGlobalFriends("friendTree", "friend.root", "alias")
1980/// .WithGlobalRange((100, 200))
1981/// )
1982/// df = ROOT.RDataFrame(spec)
1983/// ~~~
1984///
1985/// See also ROOT::RDataFrame::FromSpec().
1990
1992{
1993 // If any node of the computation graph associated with this RDataFrame
1994 // declared code to jit, we need to make sure the compilation actually
1995 // happens. For example, a jitted Define could have been booked but
1996 // if the computation graph is not actually run then the code of the
1997 // Define node is not jitted. This in turn would cause memory leaks.
1998 // See https://github.com/root-project/root/issues/15399
1999 fLoopManager->Jit();
2000}
2001
2002namespace RDF {
2003namespace Experimental {
2004
2005////////////////////////////////////////////////////////////////////////////
2006/// \brief Create the RDataFrame from the dataset specification file.
2007/// \param[in] jsonFile Path to the dataset specification JSON file.
2008///
2009/// The input dataset specification JSON file must include a number of keys that
2010/// describe all the necessary samples and their associated metadata information.
2011/// The main key, "samples", is required and at least one sample is needed. Each
2012/// sample must have at least one key "trees" and at least one key "files" from
2013/// which the data is read. Optionally, one or more metadata information can be
2014/// added, as well as the friend list information.
2015///
2016/// ### Example specification file JSON:
2017/// The following is an example of the dataset specification JSON file formatting:
2018///~~~{.cpp}
2019/// {
2020/// "samples": {
2021/// "sampleA": {
2022/// "trees": ["tree1", "tree2"],
2023/// "files": ["file1.root", "file2.root"],
2024/// "metadata": {"lumi": 1.0, }
2025/// },
2026/// "sampleB": {
2027/// "trees": ["tree3", "tree4"],
2028/// "files": ["file3.root", "file4.root"],
2029/// "metadata": {"lumi": 0.5, }
2030/// },
2031/// ...
2032/// },
2033/// }
2034///~~~
2039
2040} // namespace Experimental
2041} // namespace RDF
2042
2043} // namespace ROOT
2044
2045namespace cling {
2046//////////////////////////////////////////////////////////////////////////
2047/// Print an RDataFrame at the prompt
2048std::string printValue(ROOT::RDataFrame *df)
2049{
2050 // The loop manager is never null, except when its construction failed.
2051 // This can happen e.g. if the constructor of RLoopManager that expects
2052 // a file name is used and that file doesn't exist. This point is usually
2053 // not even reached in that situation, since the exception thrown by the
2054 // constructor will also stop execution of the program. But it can still
2055 // be reached at the prompt, if the user tries to print the RDataFrame
2056 // variable after an incomplete initialization.
2057 auto *lm = df->GetLoopManager();
2058 if (!lm) {
2059 throw std::runtime_error("Cannot print information about this RDataFrame, "
2060 "it was not properly created. It must be discarded.");
2061 }
2062 auto defCols = lm->GetDefaultColumnNames();
2063
2064 std::ostringstream ret;
2065 if (auto ds = df->GetDataSource()) {
2066 ret << "A data frame associated to the data source \"" << cling::printValue(ds) << "\"";
2067 } else {
2068 ret << "An empty data frame that will create " << lm->GetNEmptyEntries() << " entries\n";
2069 }
2070
2071 return ret.str();
2072}
2073} // namespace cling
Basic types used by ROOT and required by TInterpreter.
unsigned long long ULong64_t
Portable unsigned long integer 8 bytes.
Definition RtypesCore.h:84
ROOT::Detail::TRangeCast< T, true > TRangeDynCast
TRangeDynCast is an adapter class that allows the typed iteration through a TCollection.
The head node of a RDF computation graph.
The dataset specification for RDataFrame.
std::shared_ptr< ROOT::Detail::RDF::RLoopManager > fLoopManager
< The RLoopManager at the root of this computation graph. Never null.
ROOT's RDataFrame offers a modern, high-level interface for analysis of data stored in TTree ,...
RDataFrame(std::string_view treeName, std::string_view filenameglob, const ColumnNames_t &defaultColumns={})
Build the dataframe.
ROOT::RDF::ColumnNames_t ColumnNames_t
Describe directory structure in memory.
Definition TDirectory.h:45
A TTree represents a columnar dataset.
Definition TTree.h:89
ROOT::RDF::Experimental::RDatasetSpec RetrieveSpecFromJson(const std::string &jsonFile)
Function to retrieve RDatasetSpec from JSON file provided.
Definition RDFUtils.cxx:545
ROOT::RDataFrame FromSpec(const std::string &jsonFile)
Factory method to create an RDataFrame from a JSON specification file.
std::vector< std::string > ColumnNames_t
std::shared_ptr< const ColumnNames_t > ColumnNamesPtr_t