From 853acbad4b047a5f9371aebef46bdbb3bd5781a9 Mon Sep 17 00:00:00 2001
From: Patrick Pelissier <patrick.pelissier@gmail.com>
Date: Mon, 21 Oct 2019 23:13:37 +0200
Subject: [PATCH] Update doc

---
 README.md | 9 ++++++++-
 1 file changed, 8 insertions(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 9aa8a200..6e45c791 100644
--- a/README.md
+++ b/README.md
@@ -1943,6 +1943,13 @@ A [dictionary](https://en.wikipedia.org/wiki/Associative_array) (or associative
 composed of a collection of (key, value) pairs,
 such that each possible key appears at most once in the collection.
 
+Several dictionnaries are proposed. The "best" to use depends on the data type
+and in particular:
+
+* the size of the data,
+* the inner cost of computing the hash.
+
+
 #### DICT\_DEF2(name, key\_type[, key\_oplist], value\_type[, value\_oplist])
 
 Define the dictionary 'name##\_t' and its associated methods as "static inline" functions.
@@ -1997,7 +2004,7 @@ The key_oplist shall also define the additional operators :
 HASH and EQUAL and **OOR\_EQUAL** and **OOR\_SET**
 
 This implementation is in general faster for small types of keys
-(like integer).
+(like integer) but slower for larger types.
 
 Example: