summaryrefslogtreecommitdiffstats
path: root/raul/Table.hpp
diff options
context:
space:
mode:
authorDavid Robillard <d@drobilla.net>2007-09-12 03:20:16 +0000
committerDavid Robillard <d@drobilla.net>2007-09-12 03:20:16 +0000
commitfda877003a1843ed53257f6e85123b0ef15b8f4f (patch)
tree0bbbd9124483185594969b6d507be351d5beffc6 /raul/Table.hpp
parentb1d0c86db891dabb77fbc9655e7e5d5740ccf701 (diff)
downloadraul-fda877003a1843ed53257f6e85123b0ef15b8f4f.tar.gz
raul-fda877003a1843ed53257f6e85123b0ef15b8f4f.tar.bz2
raul-fda877003a1843ed53257f6e85123b0ef15b8f4f.zip
Const-correctness for Raul::RDF::Node type conversion functions.
git-svn-id: http://svn.drobilla.net/lad/raul@702 a436a847-0d15-0410-975c-d299462d15a1
Diffstat (limited to 'raul/Table.hpp')
-rw-r--r--raul/Table.hpp2
1 files changed, 1 insertions, 1 deletions
diff --git a/raul/Table.hpp b/raul/Table.hpp
index 9fd672a..1d20a9c 100644
--- a/raul/Table.hpp
+++ b/raul/Table.hpp
@@ -29,7 +29,7 @@ namespace Raul {
/** Slow insertion, fast lookup, cache optimized, super fast sorted iteration.
*
* This has the advantage over std::map that iterating over the collection
- * is super fast, and iteration is sorted. Probably also faster due to all
+ * is fast and sorted. Possibly also faster in some situations due to all
* data being in a single chunk of memory, cache optimized, etc.
*/
template <typename K, typename T>