mirror of
https://github.com/Ed94/Odin.git
synced 2026-08-04 22:58:46 +00:00
+3
-3
@@ -15,7 +15,7 @@ static void *const MAP_TOMBSTONE = (void *)~(uintptr)0;
|
|||||||
template <typename K, typename V>
|
template <typename K, typename V>
|
||||||
struct PtrMapEntry {
|
struct PtrMapEntry {
|
||||||
static_assert(sizeof(K) == sizeof(void *), "Key size must be pointer size");
|
static_assert(sizeof(K) == sizeof(void *), "Key size must be pointer size");
|
||||||
|
|
||||||
K key;
|
K key;
|
||||||
V value;
|
V value;
|
||||||
};
|
};
|
||||||
@@ -374,7 +374,7 @@ struct PtrMapIterator {
|
|||||||
}
|
}
|
||||||
|
|
||||||
bool operator==(PtrMapIterator<K, V> const &other) const noexcept {
|
bool operator==(PtrMapIterator<K, V> const &other) const noexcept {
|
||||||
return this->map == other->map && this->index == other->index;
|
return this->map == other.map && this->index == other.index;
|
||||||
}
|
}
|
||||||
|
|
||||||
operator PtrMapEntry<K, V> *() const {
|
operator PtrMapEntry<K, V> *() const {
|
||||||
@@ -858,4 +858,4 @@ gb_internal OrderedInsertPtrMapEntry<K, V> *end(OrderedInsertPtrMap<K, V> &m) {
|
|||||||
template <typename K, typename V>
|
template <typename K, typename V>
|
||||||
gb_internal OrderedInsertPtrMapEntry<K, V> const *end(OrderedInsertPtrMap<K, V> const &m) {
|
gb_internal OrderedInsertPtrMapEntry<K, V> const *end(OrderedInsertPtrMap<K, V> const &m) {
|
||||||
return m.entries + m.count;
|
return m.entries + m.count;
|
||||||
}
|
}
|
||||||
|
|||||||
Reference in New Issue
Block a user