|
|
baa8cc351d
|
Simplified DualKeyHash
|
2026-01-30 16:27:03 +02:00 |
|
|
|
d21bc60024
|
Making use of std::stack instead of std::queue
|
2026-01-30 15:56:51 +02:00 |
|
|
|
4cc10ddc21
|
Added Scan() to go through the dualkey map
|
2026-01-28 14:22:04 +02:00 |
|
|
|
c1637a2a2e
|
Hashes on dualkey map need to be also const
|
2026-01-28 13:47:07 +02:00 |
|
|
|
6aaf0c6101
|
Added ::Entry for returning references upon insertion
Additionally fixed a minor mistake on hashable concept
|
2026-01-28 13:32:09 +02:00 |
|
|
|
c458062f72
|
Renamed resultpair to queryresult for clarity
|
2026-01-28 12:58:30 +02:00 |
|
|
|
ea83805f4b
|
Added count(), camelCase'd all the functions, and made the keys const
|
2026-01-28 12:31:30 +02:00 |
|
|
|
8887547fdc
|
Fully functioning graveyard TESTED
|
2026-01-28 04:11:51 +02:00 |
|
|
|
725430194d
|
Tombstoning finished UNTESTED
|
2026-01-28 02:49:03 +02:00 |
|
|
|
469ca57142
|
Tombstoning and Deletion UNTESTED
|
2026-01-28 02:35:26 +02:00 |
|
|
|
f8a5799327
|
Added nodiscard to dualkey map query
|
2026-01-28 01:13:53 +02:00 |
|
|
|
5846c5bf34
|
DKM 4th iteration (tested)
Added Insert and replaced operator[] with Query for clarity, still need to add a delete(and subsequently a tombstoning mechanism)
|
2026-01-27 21:08:23 +02:00 |
|
|
|
feb9beceb2
|
DKM operator[] (UNTESTED)
|
2026-01-25 02:22:14 +02:00 |
|
|
|
2556a473cc
|
Hashing concept on A and B key
|
2026-01-21 09:50:18 +02:00 |
|
|
|
492b1cf503
|
Second iteration of DKM
|
2026-01-21 09:33:36 +02:00 |
|
|
|
2d0118308f
|
First iteration of DKM
|
2026-01-21 08:12:32 +02:00 |
|
