bxcodec/gotcha

gotcha: inmemory-cache in Go (Golang) with customizable algorithm

Iman Tumorang — @bxcodec

Hi! I'm Iman!

Welcome to my Github Profile!

🌱 My Contributions So Far!

📝 My Latest Blog Post in Medium

• 
• 
• 
  (Generated by Medium's Recent Article)

📮 Get In Touch!

• Contact me through Email, Twitter, Instagram, LinkedIn in https://imantumorang.com

gotcha's Issues

Add test coverage at least to be around 90%

TODO

• Add CI/CD to ensure this
• Add Linter

Add Expiry Management on Each Algorithm

TODO

Add expiry time management to each of this algorithm

• LFU (#17)
• LRU (#16)

Add Linter and Makefile

Add Maxmemory Management on each Algorithm

TODO

Add Maxmemory management for each of this algorithm

• LFU
• LRU

Refactor the Cache Interactor Interface for more friendly name

Introduce mutex

I’m pretty sure the internal maps require to be wrapped in sync.RWMutex read/write locks

LRU and LFU cache implementation

What a nice package you've been worked on! I learn how the algorithm behind the cache works through reading your implementation.

Btw, I have concerning something about the LRU and LFU cache implementation. I can't see the differences between both implementations in lfu.go and lru.go file. Is it better if we just merge them into one and let the Options decide its implementation by init the selected repository?

MaxMemory dangerous

Could you explain a reason to implement MaxMemory using a simple json/encoding to count the byte size? Because simple json/encoding using at least TWICE memory than actual objects!!! MaxMemory should keep memory usage in boundaries but instead it guarantee than memory boundaries would be breached. MaxMemory not just useless - it is dangerous in current implementation because actual memory usage 3 times more.

More proper Documentations

Update the documentation (including godoc) to be more proper and understandable