Changes between Version 110 and Version 111 of LibrariesUnderConstruction

Timestamp:

Jun 19, 2010, 4:13:46 PM (12 years ago)

Author:

viboes

Comment:

Added Boost.Tokenmap

LibrariesUnderConstruction

@@ -1053 +1053 @@
  * '''Description:''' Threader/Joiner as proposed by Kevlin Henney `[http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1883.pdf Preliminary Threading Library Proposal for TR2]
 
+---------------------------------------------------------------------------------------------------
+== Boost.Tokenmap ==
+ * '''Author(s):'''  Slawomir Lisznianski 
+ * '''Version:''' 
+ * '''State:''' 
+ * '''Last upload:''' 2010 April 21
+ * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/tokenmap Boost Sandbox] [http://svn.boost.org/svn/boost/sandbox/tokenmap/libs/tokenmap/doc/html/index.html Boost Documentation]
+ * '''Categories:''' [#Containers Containers], [#DataStructures Data Structures] 
+ * '''Description:'''  A tokenmap  is a data structure that uniquely maps integer keys (called tokens) with values.
+
+Unlike typical dictionary-like containers such as std::map or boost_unordered, tokenmap generates the keys for stored values. The keys are random in appearance yet have the property of allowing the container to perform very efficient look-ups -- in the order of indexing within a C-array.
+
+tokenmaps have the following properties:
+
+ * No two tokens map to the same value; in essence, tokenmap is a perfect hash container.
+ * The returned tokens are stable (a token will always map to a corresponding value regardless of how the tokenmap was modified since the token was generated).
+ * Lookups are very efficient compared to std::map find. For example, when looking up a value in a 1,000,000-elements container, tokenamp outperforms std::map by about 30 times.
+
+
     
 ---------------------------------------------------------------------------------------------------
@@ -1549 +1568 @@
  * [#Boost.ITL Boost.ITL]
  * [#Boost.!LockFree Boost.LockFree]
- * [#Quartets Quartets]
  * [#Boost.Monotonic Boost.Monotonic]
  * [#Boost.Persistent Boost.Persistent]
+ * [#Quartets Quartets]
  * [#StableVector StableVector]
+ * [#Boost.Tokenmap Boost.Tokenmap]
  * [#Boost.Tree Boost.Tree]
 
@@ -1571 +1591 @@
  * [#Boost.Cloneable Boost.Cloneable] 
  * [#Boost.Cloner Boost.Cloner] 
+ * [#Boost.Enums Boost.Enums]
+ * [#Boost.EnumArray Boost.EnumArray]
+ * [#Boost.EnumSet Boost.EnumSet]
  * [#Boost.Fsm Boost.Fsm]
  * [#Boost.LUID Boost.LUID]
  * [#Boost.Msm Boost.Msm]
  * [#Quartets Quartets]
- * [#Boost.Enums Boost.Enums]
- * [#Boost.EnumArray Boost.EnumArray]
- * [#Boost.EnumSet Boost.EnumSet]
-
+ * [#Boost.Tokenmap Boost.Tokenmap]
 
 ---------------------------------------------------------------------------------------------------
@@ -1584 +1604 @@
  * [#RTL RTL]
  * [#Boost.RDB Boost.RDB]
-
 
 ---------------------------------------------------------------------------------------------------