hardcoresushi/libcryfs
1
0
Fork 0
Code Issues Pull Requests Releases Activity

TODOs

Browse Source
This commit is contained in:
Sebastian Messmer 2015-12-07 12:13:43 +01:00
parent 31d8dc04f4
commit 9d4165d2db
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
implementations/caching/cache/QueueMap.h vendored
View File

@ -12,7 +12,7 @@
namespace blockstore {
namespace caching {
//TODO FreeList for performance
//TODO FreeList for performance (malloc is expensive)
//TODO Single linked list with pointer to last element (for insertion) should be enough for a queue. No double linked list needed.
// But then, popping arbitrary elements needs to be rewritten so that _removeFromQueue() is _removeSuccessorFromQueue()
// and the map doesn't store the element itself, but its predecessor. That is, popping might be a bit slower. Test with experiments!