Timeline for Simple LRU cache implementations in C++20
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 17 at 11:35 | comment | added | Toby Speight |
A further thought on this - when we pop_back() as part of update, perhaps we could re-use the list node for the new element? That would save the overhead of returning it to the allocator just to claim it again. I'm not able to test and show that right now; possibly around the end of this week.
|
|
| Mar 11 at 18:21 | history | edited | Toby Speight | CC BY-SA 4.0 |
added 41 characters in body
|
| Mar 11 at 18:14 | history | edited | Toby Speight | CC BY-SA 4.0 |
Add resize() and clear() members
|
| Mar 11 at 18:07 | history | edited | Toby Speight | CC BY-SA 4.0 |
Add copy/move operations
|
| Mar 11 at 18:01 | history | edited | Toby Speight | CC BY-SA 4.0 |
Add copy/move operations
|
| Mar 11 at 14:24 | comment | added | Toby Speight | Not sure why I got a downvote on this - if you think there's something wrong, I really would appreciate some words explaining what I could improve. | |
| Mar 11 at 13:36 | history | edited | Toby Speight | CC BY-SA 4.0 |
Exception safety improvement
|
| Mar 11 at 13:17 | history | edited | Toby Speight | CC BY-SA 4.0 |
added 97 characters in body
|
| Mar 11 at 13:06 | history | edited | Toby Speight | CC BY-SA 4.0 |
added 4 characters in body
|
| Mar 11 at 13:01 | history | answered | Toby Speight | CC BY-SA 4.0 |