From 7395666458114eb65fd45adcedfff0bef5e8fd58 Mon Sep 17 00:00:00 2001 From: "hans.dembinski@gmail.com" Date: Tue, 14 Feb 2017 00:16:08 +0000 Subject: [PATCH] minor --- doc/benchmarks.qbk | 1 - doc/tutorial.qbk | 6 ++---- 2 files changed, 2 insertions(+), 5 deletions(-) diff --git a/doc/benchmarks.qbk b/doc/benchmarks.qbk index 5f29bf25..2014c5d6 100644 --- a/doc/benchmarks.qbk +++ b/doc/benchmarks.qbk @@ -14,7 +14,6 @@ The following plot shows results of a benchmark on a 9 GHz Macbook Pro. Random n [[hs_sd] [[classref boost::histogram::static_histogram static_histogram] with [classref boost::histogram::adaptive_storage adaptive_storage]]] [[hd_ss] [[classref boost::histogram::dynamic_histogram dynamic_histogram] with [classref boost::histogram::container_storage> container_storage>]]] [[hd_sd] [[classref boost::histogram::dynamic_histogram dynamic_histogram] with [classref boost::histogram::adaptive_storage adaptive_storage]]] - ] [classref boost::histogram::static_histogram static_histogram] is always faster than [classref boost::histogram::dynamic_histogram dynamic_histogram] and safer to use, as more checks are done at compile time. It is recommended when working in C++ only. [classref boost::histogram::adaptive_storage adaptive_storage] is faster than [classref boost::histogram::container_storage container_storage] for larger histograms, because it uses the cache more effectively due to its smaller memory consumption per bin. diff --git a/doc/tutorial.qbk b/doc/tutorial.qbk index a571b569..04431221 100644 --- a/doc/tutorial.qbk +++ b/doc/tutorial.qbk @@ -1,8 +1,6 @@ [section Tutorial] -[section Example 1: 1d-histogram in C++] - -How to make a 1d-histogram in C++ and to fill it: +Example 1: How to make a 1d-histogram in C++ and to fill it. [c++] ``` @@ -55,7 +53,7 @@ How to make a 1d-histogram in C++ and to fill it: } ``` -Example 2: Fill a 2d-histogram in Python with data in Numpy arrays +Example 2: How to make, fill, and use a 2d-histogram in Python. [python] ```