Yes actually, I was thinking about simply fetching the current key (the whole list), and then updating it with by basically replacing it with a totally new list as the value that holds the new state (keywords).
Thanks for the instructions! I was also thinking about a callback approach but didn’t quite understand how to work it out. Just so I got this right;
- The callback itself would insert the new computed key
- The delete function would execute before the callback function inserts the new key-value, thus not deleting the newly computed & inserted key-value itself
Am I understanding the callback execution / new key-value insertion wrong here?
I was of course not suggesting you to extend con_cache to suit my domain specific needs, just trying to find a solution to my own problem, which you have been helping greatly with.
The keyword list itself is a list of tuples {keyword, timestmap}, I don’t know of a better way of organizing it. The size will be max 15 tuples in the list, typically I assume about 3-5 at any given time. For now, I was planning on always fetching the whole keyword list and sending it out to clients.
The rest of the values in the cache are very simple, usually a string or an atom as the value.
As for the message history, I built it as a topic specific dynamically spawned GenServer with Erlang’s :queue, which works spot on for that. Next I need to work out on how to supervise that.
@mgwidmann thanks for that blog post link, it’s really helpful as they explain everything in a very pragmatic way there! The way they optimize message passing between nodes is particularly interesting.
