Logo ROOT   6.30.04
Reference Guide
 All Namespaces Files Pages
InterfaceUtils.hxx
Go to the documentation of this file.
1 // Author: Enrico Guiraud, Danilo Piparo CERN 02/2018
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 
11 #ifndef ROOT_RDF_TINTERFACE_UTILS
12 #define ROOT_RDF_TINTERFACE_UTILS
13 
14 #include <ROOT/RDF/RAction.hxx>
15 #include <ROOT/RDF/ActionHelpers.hxx> // for BuildAction
18 #include <ROOT/RDF/RFilter.hxx>
19 #include <ROOT/RDF/Utils.hxx>
25 #include <ROOT/RMakeUnique.hxx>
26 #include <ROOT/RStringView.hxx>
27 #include <ROOT/TypeTraits.hxx>
28 #include <TError.h> // gErrorIgnoreLevel
29 #include <TH1.h>
30 
31 #include <deque>
32 #include <functional>
33 #include <map>
34 #include <memory>
35 #include <string>
36 #include <type_traits>
37 #include <typeinfo>
38 #include <vector>
39 
40 class TObjArray;
41 class TTree;
42 namespace ROOT {
43 namespace Detail {
44 namespace RDF {
45 class RNodeBase;
46 }
47 }
48 namespace RDF {
49 template <typename T>
50 class RResultPtr;
51 template<typename T, typename V>
52 class RInterface;
53 using RNode = RInterface<::ROOT::Detail::RDF::RNodeBase, void>;
54 class RDataSource;
55 } // namespace RDF
56 
57 } // namespace ROOT
58 
59 /// \cond HIDDEN_SYMBOLS
60 
61 namespace ROOT {
62 namespace Internal {
63 namespace RDF {
64 using namespace ROOT::Detail::RDF;
65 using namespace ROOT::RDF;
66 namespace TTraits = ROOT::TypeTraits;
67 namespace RDFInternal = ROOT::Internal::RDF;
68 
69 using HeadNode_t = ::ROOT::RDF::RResultPtr<RInterface<RLoopManager, void>>;
70 HeadNode_t CreateSnapshotRDF(const ColumnNames_t &validCols,
71  std::string_view treeName,
72  std::string_view fileName,
73  bool isLazy,
74  RLoopManager &loopManager,
75  std::unique_ptr<RDFInternal::RActionBase> actionPtr);
76 
77 std::string DemangleTypeIdName(const std::type_info &typeInfo);
78 
79 ColumnNames_t ConvertRegexToColumns(const RDFInternal::RBookedCustomColumns &customColumns, TTree *tree,
80  ROOT::RDF::RDataSource *dataSource, std::string_view columnNameRegexp,
81  std::string_view callerName);
82 
83 /// An helper object that sets and resets gErrorIgnoreLevel via RAII.
84 class RIgnoreErrorLevelRAII {
85 private:
86  int fCurIgnoreErrorLevel = gErrorIgnoreLevel;
87 
88 public:
89  RIgnoreErrorLevelRAII(int errorIgnoreLevel) { gErrorIgnoreLevel = errorIgnoreLevel; }
90  RIgnoreErrorLevelRAII() { gErrorIgnoreLevel = fCurIgnoreErrorLevel; }
91 };
92 
93 /****** BuildAction overloads *******/
94 
95 // clang-format off
96 /// This namespace defines types to be used for tag dispatching in RInterface.
97 namespace ActionTags {
98 struct Histo1D{};
99 struct Histo2D{};
100 struct Histo3D{};
101 struct Graph{};
102 struct Profile1D{};
103 struct Profile2D{};
104 struct Min{};
105 struct Max{};
106 struct Sum{};
107 struct Mean{};
108 struct Fill{};
109 struct StdDev{};
110 struct Display{};
111 }
112 // clang-format on
113 
114 template <typename T, bool ISV6HISTO = std::is_base_of<TH1, T>::value>
115 struct HistoUtils {
116  static void SetCanExtendAllAxes(T &h) { h.SetCanExtend(::TH1::kAllAxes); }
117  static bool HasAxisLimits(T &h)
118  {
119  auto xaxis = h.GetXaxis();
120  return !(xaxis->GetXmin() == 0. && xaxis->GetXmax() == 0.);
121  }
122 };
123 
124 template <typename T>
125 struct HistoUtils<T, false> {
126  static void SetCanExtendAllAxes(T &) {}
127  static bool HasAxisLimits(T &) { return true; }
128 };
129 
130 // Generic filling (covers Histo2D, Histo3D, Profile1D and Profile2D actions, with and without weights)
131 template <typename... BranchTypes, typename ActionTag, typename ActionResultType, typename PrevNodeType>
132 std::unique_ptr<RActionBase>
133 BuildAction(const ColumnNames_t &bl, const std::shared_ptr<ActionResultType> &h, const unsigned int nSlots,
134  std::shared_ptr<PrevNodeType> prevNode, ActionTag, RDFInternal::RBookedCustomColumns &&customColumns)
135 {
136  using Helper_t = FillParHelper<ActionResultType>;
137  using Action_t = RAction<Helper_t, PrevNodeType, TTraits::TypeList<BranchTypes...>>;
138  return std::make_unique<Action_t>(Helper_t(h, nSlots), bl, std::move(prevNode), std::move(customColumns));
139 }
140 
141 // Histo1D filling (must handle the special case of distinguishing FillParHelper and FillHelper
142 template <typename... BranchTypes, typename PrevNodeType>
143 std::unique_ptr<RActionBase> BuildAction(const ColumnNames_t &bl, const std::shared_ptr<::TH1D> &h,
144  const unsigned int nSlots, std::shared_ptr<PrevNodeType> prevNode,
145  ActionTags::Histo1D, RDFInternal::RBookedCustomColumns &&customColumns)
146 {
147  auto hasAxisLimits = HistoUtils<::TH1D>::HasAxisLimits(*h);
148 
149  if (hasAxisLimits) {
150  using Helper_t = FillParHelper<::TH1D>;
151  using Action_t = RAction<Helper_t, PrevNodeType, TTraits::TypeList<BranchTypes...>>;
152  return std::make_unique<Action_t>(Helper_t(h, nSlots), bl, std::move(prevNode), std::move(customColumns));
153  } else {
154  using Helper_t = FillHelper;
155  using Action_t = RAction<Helper_t, PrevNodeType, TTraits::TypeList<BranchTypes...>>;
156  return std::make_unique<Action_t>(Helper_t(h, nSlots), bl, std::move(prevNode), std::move(customColumns));
157  }
158 }
159 
160 template <typename... BranchTypes, typename PrevNodeType>
161 std::unique_ptr<RActionBase> BuildAction(const ColumnNames_t &bl, const std::shared_ptr<TGraph> &g,
162  const unsigned int nSlots, std::shared_ptr<PrevNodeType> prevNode,
163  ActionTags::Graph, RDFInternal::RBookedCustomColumns &&customColumns)
164 {
165  using Helper_t = FillTGraphHelper;
166  using Action_t = RAction<Helper_t, PrevNodeType, TTraits::TypeList<BranchTypes...>>;
167  return std::make_unique<Action_t>(Helper_t(g, nSlots), bl, std::move(prevNode), std::move(customColumns));
168 }
169 
170 // Min action
171 template <typename BranchType, typename PrevNodeType, typename ActionResultType>
172 std::unique_ptr<RActionBase> BuildAction(const ColumnNames_t &bl, const std::shared_ptr<ActionResultType> &minV,
173  const unsigned int nSlots, std::shared_ptr<PrevNodeType> prevNode,
174  ActionTags::Min, RDFInternal::RBookedCustomColumns &&customColumns)
175 {
176  using Helper_t = MinHelper<ActionResultType>;
177  using Action_t = RAction<Helper_t, PrevNodeType, TTraits::TypeList<BranchType>>;
178  return std::make_unique<Action_t>(Helper_t(minV, nSlots), bl, std::move(prevNode), std::move(customColumns));
179 }
180 
181 // Max action
182 template <typename BranchType, typename PrevNodeType, typename ActionResultType>
183 std::unique_ptr<RActionBase> BuildAction(const ColumnNames_t &bl, const std::shared_ptr<ActionResultType> &maxV,
184  const unsigned int nSlots, std::shared_ptr<PrevNodeType> prevNode,
185  ActionTags::Max, RDFInternal::RBookedCustomColumns &&customColumns)
186 {
187  using Helper_t = MaxHelper<ActionResultType>;
188  using Action_t = RAction<Helper_t, PrevNodeType, TTraits::TypeList<BranchType>>;
189  return std::make_unique<Action_t>(Helper_t(maxV, nSlots), bl, std::move(prevNode), std::move(customColumns));
190 }
191 
192 // Sum action
193 template <typename BranchType, typename PrevNodeType, typename ActionResultType>
194 std::unique_ptr<RActionBase> BuildAction(const ColumnNames_t &bl, const std::shared_ptr<ActionResultType> &sumV,
195  const unsigned int nSlots, std::shared_ptr<PrevNodeType> prevNode,
196  ActionTags::Sum, RDFInternal::RBookedCustomColumns &&customColumns)
197 {
198  using Helper_t = SumHelper<ActionResultType>;
199  using Action_t = RAction<Helper_t, PrevNodeType, TTraits::TypeList<BranchType>>;
200  return std::make_unique<Action_t>(Helper_t(sumV, nSlots), bl, std::move(prevNode), std::move(customColumns));
201 }
202 
203 // Mean action
204 template <typename BranchType, typename PrevNodeType>
205 std::unique_ptr<RActionBase> BuildAction(const ColumnNames_t &bl, const std::shared_ptr<double> &meanV,
206  const unsigned int nSlots, std::shared_ptr<PrevNodeType> prevNode,
207  ActionTags::Mean, RDFInternal::RBookedCustomColumns &&customColumns)
208 {
209  using Helper_t = MeanHelper;
210  using Action_t = RAction<Helper_t, PrevNodeType, TTraits::TypeList<BranchType>>;
211  return std::make_unique<Action_t>(Helper_t(meanV, nSlots), bl, std::move(prevNode), std::move(customColumns));
212 }
213 
214 // Standard Deviation action
215 template <typename BranchType, typename PrevNodeType>
216 std::unique_ptr<RActionBase> BuildAction(const ColumnNames_t &bl, const std::shared_ptr<double> &stdDeviationV,
217  const unsigned int nSlots, std::shared_ptr<PrevNodeType> prevNode,
218  ActionTags::StdDev, RDFInternal::RBookedCustomColumns &&customColumns)
219 {
220  using Helper_t = StdDevHelper;
221  using Action_t = RAction<Helper_t, PrevNodeType, TTraits::TypeList<BranchType>>;
222  return std::make_unique<Action_t>(Helper_t(stdDeviationV, nSlots), bl, prevNode, std::move(customColumns));
223 }
224 
225 // Display action
226 template <typename... BranchTypes, typename PrevNodeType>
227 std::unique_ptr<RActionBase> BuildAction(const ColumnNames_t &bl, const std::shared_ptr<RDisplay> &d,
228  const unsigned int, std::shared_ptr<PrevNodeType> prevNode,
229  ActionTags::Display, RDFInternal::RBookedCustomColumns &&customColumns)
230 {
231  using Helper_t = DisplayHelper<PrevNodeType>;
232  using Action_t = RAction<Helper_t, PrevNodeType, TTraits::TypeList<BranchTypes...>>;
233  return std::make_unique<Action_t>(Helper_t(d, prevNode), bl, prevNode, std::move(customColumns));
234 }
235 
236 /****** end BuildAndBook ******/
237 
238 template <typename Filter>
239 void CheckFilter(Filter &)
240 {
241  using FilterRet_t = typename RDF::CallableTraits<Filter>::ret_type;
242  static_assert(std::is_convertible<FilterRet_t, bool>::value,
243  "filter expression returns a type that is not convertible to bool");
244 }
245 
246 void CheckCustomColumn(std::string_view definedCol, TTree *treePtr, const ColumnNames_t &customCols,
247  const std::map<std::string, std::string> &aliasMap, const ColumnNames_t &dataSourceColumns);
248 
249 std::string PrettyPrintAddr(const void *const addr);
250 
251 void BookFilterJit(RJittedFilter *jittedFilter, void *prevNodeOnHeap, std::string_view name,
252  std::string_view expression, const std::map<std::string, std::string> &aliasMap,
253  const ColumnNames_t &branches, const RDFInternal::RBookedCustomColumns &customCols, TTree *tree,
254  RDataSource *ds, unsigned int namespaceID);
255 
256 void BookDefineJit(std::string_view name, std::string_view expression, RLoopManager &lm, RDataSource *ds,
257  const std::shared_ptr<RJittedCustomColumn> &jittedCustomColumn,
258  const RDFInternal::RBookedCustomColumns &customCols, const ColumnNames_t &branches);
259 
260 std::string JitBuildAction(const ColumnNames_t &bl, void *prevNode, const std::type_info &art, const std::type_info &at,
261  void *r, TTree *tree, const unsigned int nSlots,
262  const RDFInternal::RBookedCustomColumns &customColumns, RDataSource *ds,
263  std::shared_ptr<RJittedAction> *jittedActionOnHeap, unsigned int namespaceID);
264 
265 // allocate a shared_ptr on the heap, return a reference to it. the user is responsible of deleting the shared_ptr*.
266 // this function is meant to only be used by RInterface's action methods, and should be deprecated as soon as we find
267 // a better way to make jitting work: the problem it solves is that we need to pass the same shared_ptr to the Helper
268 // object of each action and to the RResultPtr returned by the action. While the former is only instantiated when
269 // the event loop is about to start, the latter has to be returned to the user as soon as the action is booked.
270 // a heap allocated shared_ptr will stay alive long enough that at jitting time its address is still valid.
271 template <typename T>
272 std::shared_ptr<T> *MakeSharedOnHeap(const std::shared_ptr<T> &shPtr)
273 {
274  return new std::shared_ptr<T>(shPtr);
275 }
276 
277 bool AtLeastOneEmptyString(const std::vector<std::string_view> strings);
278 
279 /// Take a shared_ptr<AnyNodeType> and return a shared_ptr<RNodeBase>.
280 /// This works for RLoopManager nodes as well as filters and ranges.
281 std::shared_ptr<RNodeBase> UpcastNode(std::shared_ptr<RNodeBase> ptr);
282 
283 ColumnNames_t GetValidatedColumnNames(RLoopManager &lm, const unsigned int nColumns, const ColumnNames_t &columns,
284  const ColumnNames_t &validCustomColumns, RDataSource *ds);
285 
286 std::vector<bool> FindUndefinedDSColumns(const ColumnNames_t &requestedCols, const ColumnNames_t &definedDSCols);
287 
288 using ColumnNames_t = ROOT::Detail::RDF::ColumnNames_t;
289 
290 template <typename T>
291 void AddDSColumnsHelper(RLoopManager &lm, std::string_view name, RDFInternal::RBookedCustomColumns &currentCols,
292  RDataSource &ds, unsigned int nSlots)
293 {
294  auto readers = ds.GetColumnReaders<T>(name);
295  auto getValue = [readers](unsigned int slot) { return *readers[slot]; };
296  using NewCol_t = RCustomColumn<decltype(getValue), CustomColExtraArgs::Slot>;
297 
298  auto newCol = std::make_shared<NewCol_t>(&lm, name, std::move(getValue), ColumnNames_t{}, nSlots, currentCols,
299  /*isDSColumn=*/true);
300 
301  lm.RegisterCustomColumn(newCol.get());
302  currentCols.AddName(name);
303  currentCols.AddColumn(newCol, name);
304 }
305 
306 /// Take list of column names that must be defined, current map of custom columns, current list of defined column names,
307 /// and return a new map of custom columns (with the new datasource columns added to it)
308 template <typename... ColumnTypes, std::size_t... S>
309 RDFInternal::RBookedCustomColumns
310 AddDSColumns(RLoopManager &lm, const std::vector<std::string> &requiredCols,
311  const RDFInternal::RBookedCustomColumns &currentCols, RDataSource &ds, unsigned int nSlots,
312  std::index_sequence<S...>, TTraits::TypeList<ColumnTypes...>)
313 {
314 
315  const auto mustBeDefined = FindUndefinedDSColumns(requiredCols, currentCols.GetNames());
316  if (std::none_of(mustBeDefined.begin(), mustBeDefined.end(), [](bool b) { return b; })) {
317  // no need to define any column
318  return currentCols;
319  } else {
320  auto newColumns(currentCols);
321 
322  // hack to expand a template parameter pack without c++17 fold expressions.
323  int expander[] = {(mustBeDefined[S] ? AddDSColumnsHelper<ColumnTypes>(lm, requiredCols[S], newColumns, ds, nSlots)
324  : /*no-op*/ ((void)0),
325  0)...,
326  0};
327  (void)expander; // avoid unused variable warnings
328  (void)nSlots; // avoid unused variable warnings
329  return newColumns;
330  }
331 }
332 
333 // this function is meant to be called by the jitted code generated by BookFilterJit
334 template <typename F, typename PrevNode>
335 void JitFilterHelper(F &&f, const ColumnNames_t &cols, std::string_view name, RJittedFilter *jittedFilter,
336  std::shared_ptr<PrevNode> *prevNodeOnHeap, RDFInternal::RBookedCustomColumns *customColumns)
337 {
338  // mock Filter logic -- validity checks and Define-ition of RDataSource columns
339  using F_t = RFilter<F, PrevNode>;
340  using ColTypes_t = typename TTraits::CallableTraits<F>::arg_types;
341  constexpr auto nColumns = ColTypes_t::list_size;
342  RDFInternal::CheckFilter(f);
343 
344  auto &lm = *jittedFilter->GetLoopManagerUnchecked(); // RLoopManager must exist at this time
345  auto ds = lm.GetDataSource();
346 
347  auto newColumns = ds ? RDFInternal::AddDSColumns(lm, cols, *customColumns, *ds, lm.GetNSlots(),
348  std::make_index_sequence<nColumns>(), ColTypes_t())
349  : *customColumns;
350 
351  // customColumns points to the columns structure in the heap, created before the jitted call so that the jitter can
352  // share data after it has lazily compiled the code. Here the data has been used and the memory can be freed.
353  delete customColumns;
354 
355  jittedFilter->SetFilter(std::make_unique<F_t>(std::move(f), cols, *prevNodeOnHeap, newColumns, name));
356  delete prevNodeOnHeap;
357 }
358 
359 template <typename F>
360 void JitDefineHelper(F &&f, const ColumnNames_t &cols, std::string_view name, RLoopManager *lm,
361  RJittedCustomColumn &jittedCustomCol, RDFInternal::RBookedCustomColumns *customColumns)
362 {
363  using NewCol_t = RCustomColumn<F, CustomColExtraArgs::None>;
364  using ColTypes_t = typename TTraits::CallableTraits<F>::arg_types;
365  constexpr auto nColumns = ColTypes_t::list_size;
366 
367  auto ds = lm->GetDataSource();
368  auto newColumns = ds ? RDFInternal::AddDSColumns(*lm, cols, *customColumns, *ds, lm->GetNSlots(),
369  std::make_index_sequence<nColumns>(), ColTypes_t())
370  : *customColumns;
371 
372  // customColumns points to the columns structure in the heap, created before the jitted call so that the jitter can
373  // share data after it has lazily compiled the code. Here the data has been used and the memory can be freed.
374  delete customColumns;
375 
376  jittedCustomCol.SetCustomColumn(
377  std::make_unique<NewCol_t>(lm, name, std::move(f), cols, lm->GetNSlots(), newColumns));
378 }
379 
380 /// Convenience function invoked by jitted code to build action nodes at runtime
381 template <typename ActionTag, typename... BranchTypes, typename PrevNodeType, typename ActionResultType>
382 void CallBuildAction(std::shared_ptr<PrevNodeType> *prevNodeOnHeap, const ColumnNames_t &bl, const unsigned int nSlots,
383  const std::shared_ptr<ActionResultType> *rOnHeap,
384  std::shared_ptr<RJittedAction> *jittedActionOnHeap,
385  RDFInternal::RBookedCustomColumns *customColumns)
386 {
387  // if we are here it means we are jitting, if we are jitting the loop manager must be alive
388  auto &prevNodePtr = *prevNodeOnHeap;
389  auto &loopManager = *prevNodePtr->GetLoopManagerUnchecked();
390  using ColTypes_t = TypeList<BranchTypes...>;
391  constexpr auto nColumns = ColTypes_t::list_size;
392  auto ds = loopManager.GetDataSource();
393  auto newColumns = ds ? RDFInternal::AddDSColumns(loopManager, bl, *customColumns, *ds, loopManager.GetNSlots(),
394  std::make_index_sequence<nColumns>(), ColTypes_t())
395  : *customColumns;
396 
397  auto actionPtr =
398  BuildAction<BranchTypes...>(bl, *rOnHeap, nSlots, std::move(prevNodePtr), ActionTag{}, std::move(newColumns));
399  (*jittedActionOnHeap)->SetAction(std::move(actionPtr));
400 
401  // customColumns points to the columns structure in the heap, created before the jitted call so that the jitter can
402  // share data after it has lazily compiled the code. Here the data has been used and the memory can be freed.
403  delete customColumns;
404 
405  delete rOnHeap;
406  delete prevNodeOnHeap;
407  delete jittedActionOnHeap;
408 }
409 
410 /// The contained `type` alias is `double` if `T == RInferredType`, `U` if `T == std::container<U>`, `T` otherwise.
411 template <typename T, bool Container = TTraits::IsContainer<T>::value && !std::is_same<T, std::string>::value>
412 struct TMinReturnType {
413  using type = T;
414 };
415 
416 template <>
417 struct TMinReturnType<RInferredType, false> {
418  using type = double;
419 };
420 
421 template <typename T>
422 struct TMinReturnType<T, true> {
423  using type = TTraits::TakeFirstParameter_t<T>;
424 };
425 
426 // return wrapper around f that prepends an `unsigned int slot` parameter
427 template <typename R, typename F, typename... Args>
428 std::function<R(unsigned int, Args...)> AddSlotParameter(F &f, TypeList<Args...>)
429 {
430  return [f](unsigned int, Args... a) -> R { return f(a...); };
431 }
432 
433 template <typename BranchType, typename... Rest>
434 struct TNeedJitting {
435  static constexpr bool value = TNeedJitting<Rest...>::value;
436 };
437 
438 template <typename... Rest>
439 struct TNeedJitting<RInferredType, Rest...> {
440  static constexpr bool value = true;
441 };
442 
443 template <typename T>
444 struct TNeedJitting<T> {
445  static constexpr bool value = false;
446 };
447 
448 template <>
449 struct TNeedJitting<RInferredType> {
450  static constexpr bool value = true;
451 };
452 
453 ColumnNames_t GetTopLevelBranchNames(TTree &t);
454 
455 ///////////////////////////////////////////////////////////////////////////////
456 /// Check preconditions for RInterface::Aggregate:
457 /// - the aggregator callable must have signature `U(U,T)` or `void(U&,T)`.
458 /// - the merge callable must have signature `U(U,U)` or `void(std::vector<U>&)`
459 template <typename R, typename Merge, typename U, typename T, typename decayedU = typename std::decay<U>::type,
460  typename mergeArgsNoDecay_t = typename CallableTraits<Merge>::arg_types_nodecay,
461  typename mergeArgs_t = typename CallableTraits<Merge>::arg_types,
462  typename mergeRet_t = typename CallableTraits<Merge>::ret_type>
463 void CheckAggregate(TypeList<U, T>)
464 {
465  constexpr bool isAggregatorOk =
466  (std::is_same<R, decayedU>::value) || (std::is_same<R, void>::value && std::is_lvalue_reference<U>::value);
467  static_assert(isAggregatorOk, "aggregator function must have signature `U(U,T)` or `void(U&,T)`");
468  constexpr bool isMergeOk =
469  (std::is_same<TypeList<decayedU, decayedU>, mergeArgs_t>::value && std::is_same<decayedU, mergeRet_t>::value) ||
470  (std::is_same<TypeList<std::vector<decayedU> &>, mergeArgsNoDecay_t>::value &&
471  std::is_same<void, mergeRet_t>::value);
472  static_assert(isMergeOk, "merge function must have signature `U(U,U)` or `void(std::vector<U>&)`");
473 }
474 
475 ///////////////////////////////////////////////////////////////////////////////
476 /// This overload of CheckAggregate is called when the aggregator takes more than two arguments
477 template <typename R, typename T>
478 void CheckAggregate(T)
479 {
480  static_assert(sizeof(T) == 0, "aggregator function must take exactly two arguments");
481 }
482 
483 ///////////////////////////////////////////////////////////////////////////////
484 /// Check as many template parameters were passed as the number of column names, throw if this is not the case.
485 void CheckTypesAndPars(unsigned int nTemplateParams, unsigned int nColumnNames);
486 
487 /// Return local BranchNames or default BranchNames according to which one should be used
488 const ColumnNames_t SelectColumns(unsigned int nArgs, const ColumnNames_t &bl, const ColumnNames_t &defBl);
489 
490 /// Check whether column names refer to a valid branch of a TTree or have been `Define`d. Return invalid column names.
491 ColumnNames_t FindUnknownColumns(const ColumnNames_t &requiredCols, const ColumnNames_t &datasetColumns,
492  const ColumnNames_t &definedCols, const ColumnNames_t &dataSourceColumns);
493 
494 bool IsInternalColumn(std::string_view colName);
495 
496 /// Returns the list of Filters defined in the whole graph
497 std::vector<std::string> GetFilterNames(const std::shared_ptr<RLoopManager> &loopManager);
498 
499 /// Returns the list of Filters defined in the branch
500 template <typename NodeType>
501 std::vector<std::string> GetFilterNames(const std::shared_ptr<NodeType> &node)
502 {
503  std::vector<std::string> filterNames;
504  node->AddFilterName(filterNames);
505  return filterNames;
506 }
507 
508 // Check if a condition is true for all types
509 template <bool...>
510 struct TBoolPack;
511 
512 template <bool... bs>
513 using IsTrueForAllImpl_t = typename std::is_same<TBoolPack<bs..., true>, TBoolPack<true, bs...>>;
514 
515 template <bool... Conditions>
516 struct TEvalAnd {
517  static constexpr bool value = IsTrueForAllImpl_t<Conditions...>::value;
518 };
519 
520 // Check if a class is a specialisation of stl containers templates
521 // clang-format off
522 
523 template <typename>
524 struct IsList_t : std::false_type {};
525 
526 template <typename T>
527 struct IsList_t<std::list<T>> : std::true_type {};
528 
529 template <typename>
530 struct IsDeque_t : std::false_type {};
531 
532 template <typename T>
533 struct IsDeque_t<std::deque<T>> : std::true_type {};
534 // clang-format on
535 
536 } // namespace RDF
537 } // namespace Internal
538 
539 namespace Detail {
540 namespace RDF {
541 
542 /// The aliased type is `double` if `T == RInferredType`, `U` if `T == container<U>`, `T` otherwise.
543 template <typename T>
544 using MinReturnType_t = typename RDFInternal::TMinReturnType<T>::type;
545 
546 template <typename T>
547 using MaxReturnType_t = MinReturnType_t<T>;
548 
549 template <typename T>
550 using SumReturnType_t = MinReturnType_t<T>;
551 
552 } // namespace RDF
553 } // namespace Detail
554 } // namespace ROOT
555 
556 /// \endcond
557 
558 #endif