mirrors/yosys
3
0
Fork 0
mirror of https://github.com/YosysHQ/yosys synced 2025-04-26 02:25:35 +00:00
Code Activity

Added hashlib .count(key, iterator) and it1 < it2

Browse source
This commit is contained in:
Clifford Wolf 2014-12-31 14:52:46 +01:00
parent 539dd805f4
commit 1e08621e7e
2 changed files with 63 additions and 44 deletions
Download patch file Download diff file Expand all files Collapse all files

8
CodingReadme
View file

@ -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