Skip to content

Commit

Permalink
Docu update
Browse files Browse the repository at this point in the history
  • Loading branch information
tboldagh committed Jan 14, 2022
1 parent 4fc5a47 commit cea4332
Show file tree
Hide file tree
Showing 2 changed files with 5 additions and 5 deletions.
6 changes: 3 additions & 3 deletions README.md
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
# FunRootAna

This is basic framework allowing to do [ROOT](https://root.cern.ch/) analysis in a more functional way.
This is a basic framework allowing to do [ROOT](https://root.cern.ch/) analysis in a more functional way.
In comparison to RDFrame it offers more functional feel for the data analysis (in particular histograms filling) and is overall a bit more holistic.
As consequence, typical a single line containing selection, data extraction & histogram definition is sufficient to obtain one unit of result.
As consequence, <span style="color:red">a single line</span> containing selection, data extraction & histogram definition is sufficient to obtain one unit of result (one histogram).

The promise is:

Expand Down Expand Up @@ -48,7 +48,7 @@ As a result of running that code over the TTree, histograms are made and saved i
# Grouping a related info
# Analysis objects
Now think that we would like to treat the `x,y,z` as a whole, in the end they represent one object, a point in 3D space. We need to do this with plain Ntuples but if the TTree contains object already then the functionality comes for free.
So let's make the points look like objects. For that we would need to create a structure to hold the three coordinates together (we can also use the class but we have no reason for it here).
Expand Down
4 changes: 2 additions & 2 deletions tests/test_lfv.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -251,7 +251,7 @@ void test_enumerate() {

// this is failing and needs upgrade of foreach
auto sen1 = en1.stage().sorted(F(_.second)).stage();

// TODO figure out why staging was needed after sort
VALUE( sen1.element_at(0).value().second) EXPECTED(-1);
VALUE( sen1.element_at(0).value().first) EXPECTED(5);
}
Expand All @@ -273,7 +273,7 @@ void test_reversal() {
auto s1 = r1.sorted();
VALUE(s1.element_at(0).value()) EXPECTED(-1);

// double reverse
// double reversescala
auto r2 = r1.reverse();
VALUE(r2.element_at(1).value()) EXPECTED(19);

Expand Down

0 comments on commit cea4332

Please sign in to comment.