From af91cc6d1ebe186075b65801b38e9fafc06eaa9f Mon Sep 17 00:00:00 2001 From: taehyounpark Date: Mon, 25 Mar 2024 17:02:44 -0400 Subject: [PATCH] Trying to fix images --- README.md | 2 +- docs/pages/conceptual.md | 12 ++++++------ docs/pages/example.md | 6 +++--- 3 files changed, 10 insertions(+), 10 deletions(-) diff --git a/README.md b/README.md index d47d0e6..1b7bed5 100644 --- a/README.md +++ b/README.md @@ -19,7 +19,7 @@ - **Lazy but efficient.** An action is performed for an entry only if needed. All actions are performed in one dataset traversal. Dataset traversal is multithreaded. - **Systematic variations.** Perform *automatic* sensitivity analysis by applying systematic variations on actions. -## Hello World +## At a glance ```cpp #include "queryosity/json.h" #include "queryosity/hist.h" diff --git a/docs/pages/conceptual.md b/docs/pages/conceptual.md index a433bc6..dc977ef 100644 --- a/docs/pages/conceptual.md +++ b/docs/pages/conceptual.md @@ -5,7 +5,7 @@ A `dataflow` consists of a directed, acyclic graph of tasks performed for each entry. -![dataflow](../images/dataflow.png) +![dataflow](./dataflow.png) An action falls into one of three types that reflect the nature of the task and are uniquely associated with a set of applicable methods. Each type forms a sub-graphs of tasks, which receive actions of the previous types as inputs: @@ -37,7 +37,7 @@ A `column` contains some data type `T` whose value changes, i.e. must be updated Columns that are read-in from a dataset or defined as constants are *independent*, i.e. their values do not depend on others. A tower of dependent columns evaluated out of others as inputs forms the computation graph: -![Example computation graph](../images/computation.png) +![Example computation graph](./computation.png) @paragraph conceptual-columns-lazy Lazy optimizations - If and when a column value is computed for an entry, it is cached and never re-computed. @@ -55,7 +55,7 @@ A `selection` is a specific type of scalar-valued columns representing a decisio A cutflow can have from the following types connections between nodes: -![cutflow](../images/cutflow.png) +![cutflow](./cutflow.png) - Applying a selection from an existing node, which determines the order in which they are compounded. - Branching selections by applying more than one selection from a common node. @@ -81,11 +81,11 @@ Two common workflows exist in associating queries with selections: - Running a single query at multiple selections: -![agg_book_sels](../images/query_1.png) +![agg_book_sels](./query_1.png) - Running multiple queries at a selection: -![sel_book_aggs](../images/query_2.png) +![sel_book_aggs](./query_2.png) @section conceptual-variations Systematic variations @@ -104,4 +104,4 @@ The propagation proceeds in the following fashion: - **Lockstep.** If two actions each have a variation of the same name, they are in effect together. - **Transparent.** If only one action has a given variation, then the nominal is in effect for the other. -![variation](../images/variation.png) +![variation](./variation.png) diff --git a/docs/pages/example.md b/docs/pages/example.md index ca726a7..f346d29 100644 --- a/docs/pages/example.md +++ b/docs/pages/example.md @@ -161,7 +161,7 @@ auto mll_vars = df.get>("mll",50,0,100).fill(mll).book(cut_2los); mll_vars.nominal()->Draw(); mll_vars["lp4_up"]->Draw("same"); ``` -![mll_varied](../images/mll_varied.png) +![mll_varied](.//mll_varied.png) @section example-phys DAOD_PHYS @@ -267,7 +267,7 @@ int main() { } @endcpp -![muons_pt](../images/muons_pt.png) +![muons_pt](.//muons_pt.png) @section example-task7 IRIS-HEP ADL benchmark @@ -412,4 +412,4 @@ int main(int argc, char **argv) { << std::endl; } @endcpp -![task_7](../images/task_7.png) \ No newline at end of file +![task_7](.//task_7.png) \ No newline at end of file