path: root/CodingReadme
diff options
authorClifford Wolf <>2014-12-31 14:52:46 +0100
committerClifford Wolf <>2014-12-31 14:52:46 +0100
commit1e08621e7e2c219169b3b6c5fe1d581052e4d429 (patch)
treeb02812520effc8454740652f8ea5c5a89ad0127d /CodingReadme
parent539dd805f44ece3e39f4c68e4ea1bdc9b662e83f (diff)
Added hashlib .count(key, iterator) and it1 < it2
Diffstat (limited to 'CodingReadme')
1 files changed, 7 insertions, 1 deletions
diff --git a/CodingReadme b/CodingReadme
index 2349b2ee..92d54d28 100644
--- a/CodingReadme
+++ b/CodingReadme
@@ -63,8 +63,14 @@ replacement for std::unordered_set<T>. The main characteristics are:
begin(). i.e. only a new iterator that starts at begin() will see the
inserted elements.
+ - the method .count(key, iterator) is like .count(key) but only
+ considers elements that can be reached via the iterator.
+ - iterators can be compared. it1 < it2 means that the position of t2
+ can be reached via t1 but not vice versa.
- dict<K, T> and pool<T> will have the same order of iteration across
- all compilers and architectures.
+ all compilers, standard libraries and architectures.
2. Standard STL data types