mirrors/yosys
3
0
Fork 0
mirror of https://github.com/YosysHQ/yosys synced 2025-06-28 17:08:46 +00:00
Code Activity

hashlib: break dict by reversing the iterator order

Browse source
This commit is contained in:
Emil J. Tywoniak 2025-05-30 16:43:55 +02:00
parent d96d1e3630
commit 6cd5921c2e
1 changed files with 12 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

24
kernel/hashlib.h
View file

@ -526,9 +526,9 @@ public:
typedef std::pair<K, T>* pointer;
typedef std::pair<K, T>& reference;
const_iterator() { }
const_iterator operator++() { index--; return *this; }
const_iterator operator+=(int amt) { index -= amt; return *this; }
bool operator<(const const_iterator &other) const { return index > other.index; }
const_iterator operator++() { index++; return *this; }
const_iterator operator+=(int amt) { index += amt; return *this; }
bool operator<(const const_iterator &other) const { return index < other.index; }
bool operator==(const const_iterator &other) const { return index == other.index; }
bool operator!=(const const_iterator &other) const { return index != other.index; }
const std::pair<K, T> &operator*() const { return ptr->entries[index].udata; }
@ -549,9 +549,9 @@ public:
typedef std::pair<K, T>* pointer;
typedef std::pair<K, T>& reference;
iterator() { }
iterator operator++() { index--; return *this; }
iterator operator+=(int amt) { index -= amt; return *this; }
bool operator<(const iterator &other) const { return index > other.index; }
iterator operator++() { index++; return *this; }
iterator operator+=(int amt) { index += amt; return *this; }
bool operator<(const iterator &other) const { return index < other.index; }
bool operator==(const iterator &other) const { return index == other.index; }
bool operator!=(const iterator &other) const { return index != other.index; }
std::pair<K, T> &operator*() { return ptr->entries[index].udata; }
@ -803,13 +803,13 @@ public:
bool empty() const { return entries.empty(); }
void clear() { hashtable.clear(); entries.clear(); }
iterator begin() { return iterator(this, int(entries.size())-1); }
iterator element(int n) { return iterator(this, int(entries.size())-1-n); }
iterator end() { return iterator(nullptr, -1); }
iterator begin() { return iterator(this, 0); }
iterator element(int n) { return iterator(this, n); }
iterator end() { return iterator(this, int(entries.size())-1); }
const_iterator begin() const { return const_iterator(this, int(entries.size())-1); }
const_iterator element(int n) const { return const_iterator(this, int(entries.size())-1-n); }
const_iterator end() const { return const_iterator(nullptr, -1); }
const_iterator begin() const { return const_iterator(this, 0); }
const_iterator element(int n) const { return const_iterator(this, n); }
const_iterator end() const { return const_iterator(this, int(entries.size())-1); }
};
template<typename K, typename OPS>