Unbounded FIFO queue with replacement.

Question

A great many of the projects that I tend to work on in my industry involve producers (unbounded) queuing items to consumers with 2 additional constraints.

1) Newer items that are essentially updates of old items need to replace unconsumed old items in the queue.
2) The replacement needs to occur such that the new item assumes the replaced item's position in the queue.

To be clear, this does normally require a "key" to match the new item with the older instance of the item in the queue.

Can this behavior be modeled with Axum's channels?

Answer 1

Hi Jim,

Thanks for the great question -- and a great scenario to boot!  Out of the box, no, there won't be any support for these constraints.  This could be implemented easily as a custom interaction point though -- and the primary motivation for providing the IInteractionPoint interface. 

Just out of curiosity's sake, what's your industry?

Josh

Answer 2

Thanks for your response. I will read up on your suggestion.

To answer your question, I am involved in finance. Specifically, high-frequency algorithmic trading.

Jim