Timeline for Data structure to use for a consumable message queue where it's safe for messages to overwrite one another
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 13, 2013 at 17:06 | comment | added | rianjs | It should. Using a ConcurrentDictionary as a workqueue will be interesting, though. O_o | |
| Dec 13, 2013 at 16:59 | vote | accept | rianjs | ||
| Dec 13, 2013 at 16:36 | comment | added | D.W.♦ | @rianjs, OK, got it. Yup, a hashtable of messages sounds like a fine solution to your updated problem. So, problem solved? Does that meet your needs? | |
| Dec 13, 2013 at 15:48 | comment | added | rianjs | See Update 1. Your example is really close, except that my use case is simpler: instead of a HashTable of queues, it could be a HashTable of individual Messages. The most recent Message pertaining to File F always supercedes older Messages pertaining to File F that came before. | |
| Dec 12, 2013 at 20:05 | history | edited | D.W.♦ | CC BY-SA 3.0 |
added 1502 characters in body
|
| Dec 12, 2013 at 19:59 | history | answered | D.W.♦ | CC BY-SA 3.0 |