|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r78487 - sandbox/monotonic/libs/monotonic/doc/html/monotonic_storage
From: christian.schladetsch_at_[hidden]
Date: 2012-05-16 04:09:24
Author: cschladetsch
Date: 2012-05-16 04:09:18 EDT (Wed, 16 May 2012)
New Revision: 78487
URL: http://svn.boost.org/trac/boost/changeset/78487
Log:
Added links to data
Text files modified:
sandbox/monotonic/libs/monotonic/doc/html/monotonic_storage/tutorial.html | 2 +-
1 files changed, 1 insertions(+), 1 deletions(-)
Modified: sandbox/monotonic/libs/monotonic/doc/html/monotonic_storage/tutorial.html
==============================================================================
--- sandbox/monotonic/libs/monotonic/doc/html/monotonic_storage/tutorial.html (original)
+++ sandbox/monotonic/libs/monotonic/doc/html/monotonic_storage/tutorial.html 2012-05-16 04:09:18 EDT (Wed, 16 May 2012)
@@ -80,7 +80,7 @@
<p>
While this example is trivial, if you were to benchmark it against using
a default <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">allocator</span></code> you will find that monotonic
- allocation is much faster[1].
+ allocation is much faster. In those tables, all factors are normalised. So a number less than one means this system is slower, and a number greater than one means this system is faster. The metric used for normalisation is in the data.
</p>
<p>
This is one of the main reasons for using this library; to provide efficient
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk