dungba88 commented on issue #12714:
URL: https://github.com/apache/lucene/issues/12714#issuecomment-1784418885
If we are to move to value-based LRU cache and no longer fall back to
reading FST when items are not in the map, I'm wondering why wouldn't we just
use LinkedHashMap (or any doubly-linked link based LRU map)? It sounds to me
that we could write through to such map (write to both the map and the main
FST), and evict the node of least-recently write or read?
Concretely, we could add a Node struct like
```
class CacheNode {
long address;
UnCompiledNode<T> node;
}
```
And then use `LinkedHashMap<CacheNode>`.
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org
For queries about this service, please contact Infrastructure at:
us...@infra.apache.org
---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org
For additional commands, e-mail: issues-h...@lucene.apache.org
