mirror of
https://github.com/koreader/koreader.git
synced 2025-08-10 00:52:38 +00:00
21b067792d
Ought to be faster than our naive array-based approach. Especially for the glyph cache, which has a solid amount of elements, and is mostly cache hits. (There are few things worse for performance in Lua than table.remove @ !tail and table.insert @ !tail, which this was full of :/). DocCache: New module that's now an actual Cache instance instead of a weird hack. Replaces "Cache" (the instance) as used across Document & co. Only Cache instance with on-disk persistence. ImageCache: Update to new Cache. GlyphCache: Update to new Cache. Also, actually free glyph bbs on eviction.
26 lines
848 B
Lua
26 lines
848 B
Lua
--[[
|
|
Inheritable abstraction for cache items
|
|
--]]
|
|
|
|
local CacheItem = {
|
|
size = 128, -- some reasonable default for a small table.
|
|
}
|
|
--- NOTE: As far as size estimations go, the assumption is that a key, value pair should roughly take two words,
|
|
--- and the most common items we cache are Geom-like tables (i.e., 4 key-value pairs).
|
|
--- That's generally a low estimation, especially for larger tables, where memory allocation trickery may be happening.
|
|
|
|
function CacheItem:new(o)
|
|
o = o or {}
|
|
setmetatable(o, self)
|
|
self.__index = self
|
|
return o
|
|
end
|
|
|
|
-- Called on eviction.
|
|
-- We generally use it to free C/FFI ressources *immediately* (as opposed to relying on our Userdata/FFI finalizers to do it "later" on GC).
|
|
-- c.f., TileCacheItem, GlyphCacheItem & ImageCacheItem
|
|
function CacheItem:onFree()
|
|
end
|
|
|
|
return CacheItem
|