![\"GeneralDev.jpg\"](\"http:\/\/bobbeaty.com\/wp\/wp-content\/uploads\/2008\/03\/generaldev.jpg\" "\\"GeneralDev.jpg\\"")
<\/p>\n<\/p>\n
This was actually the most fun part of my day. I was worried about how to allow the quick cache's clients to run iterators over the cache data and not<\/em> get nailed when the data in the cache is updated by the exchange feed. In general, it's hard to imagine. You have a cache that by design<\/em><\/strong> doesn't lock or notify anyone, and a reader that also by design<\/em> is going to be slower than the ticker feed and will, very likely, always be looking at the entire<\/em> cache and getting into a lot of trouble with it's iterators.<\/p>\n I was trying to think of a clever solution to the problem when I had another really nice eureka!<\/em> moment: What I'd have is a temporary \"trash can\", and when the client asks to keep things \"stable\", the cache tosses the old values into the \"trash\". When the client is done, it'll \"throw the trash away\", and the cost of the deletes will be on the client's thread.<\/p>\n If I built it with a simple STL __gnu_cxx::slist<\/tt>, then I'd have a very fast queue. I don't need to have any specific order, just a place to hold these guys until they are no longer needed. So rather than calling delete<\/tt> on the 'old' message, the put()<\/tt> method on the cache will instead do a push_front()<\/tt> to the 'trash' queue. It's fast, clean, and should work wonderfully.<\/p>\n I have two methods that control an atomic boolean. It's a little utility class I wrote that wraps an atomic uint8_t as a simple boolean so it can be toggled\/set\/read atomically:<\/p>\n And then in my put()<\/tt> method, when I'd normally have deleted the 'old' message from the cache, I simply:<\/p>\n I haven't had a real chance to test it, but I'm hoping that tomorrow morning when I get ticks from the exchanges, I'll be able to see that this is going to work. If not, then it's back to the drawing board and figure something else<\/em> out.<\/p>\n","protected":false},"excerpt":{"rendered":" This was actually the most fun part of my day. I was worried about how to allow the quick cache’s clients to run iterators over the cache data and not get nailed when the data in the cache is updated by the exchange feed. In general, it’s hard to imagine. You have a cache that […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3,6],"tags":[],"class_list":["post-4096","post","type-post","status-publish","format-standard","hentry","category-coding","category-cube-life"],"_links":{"self":[{"href":"https:\/\/bobbeaty.com\/wp\/wp-json\/wp\/v2\/posts\/4096","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/bobbeaty.com\/wp\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/bobbeaty.com\/wp\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/bobbeaty.com\/wp\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/bobbeaty.com\/wp\/wp-json\/wp\/v2\/comments?post=4096"}],"version-history":[{"count":3,"href":"https:\/\/bobbeaty.com\/wp\/wp-json\/wp\/v2\/posts\/4096\/revisions"}],"predecessor-version":[{"id":4101,"href":"https:\/\/bobbeaty.com\/wp\/wp-json\/wp\/v2\/posts\/4096\/revisions\/4101"}],"wp:attachment":[{"href":"https:\/\/bobbeaty.com\/wp\/wp-json\/wp\/v2\/media?parent=4096"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/bobbeaty.com\/wp\/wp-json\/wp\/v2\/categories?post=4096"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/bobbeaty.com\/wp\/wp-json\/wp\/v2\/tags?post=4096"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}} void<\/span> QuickCache::<\/span>saveToTrash<\/span>(<\/span>)<\/span>\n {<\/span>\n if<\/span> (<\/span>!<\/span>(<\/span>bool<\/span>)<\/span>mUsingTrash)<\/span> {<\/span>\n \/\/ first, clean out anything that might be lingering in the trash<\/span>\n Message *<\/span>m =<\/span> NULL<\/span>;<\/span>\n while<\/span> (<\/span>!<\/span>mTrash.empty<\/span>(<\/span>)<\/span>)<\/span> {<\/span>\n if<\/span> (<\/span>(<\/span>m =<\/span> mTrash.front<\/span>(<\/span>)<\/span>)<\/span> !<\/span>=<\/span> NULL<\/span>)<\/span> {<\/span>\n delete<\/span> m;<\/span>\n }<\/span>\n mTrash.pop_front<\/span>(<\/span>)<\/span>;<\/span>\n }<\/span>\n \/\/ now set the flag that indicates that the trash is ready to use<\/span>\n mUsingTrash =<\/span> true<\/span>;<\/span>\n }<\/span>\n }<\/span>\n \n \n void<\/span> QuickCache::<\/span>takeOutTrash<\/span>(<\/span>)<\/span>\n {<\/span>\n if<\/span> (<\/span>(<\/span>bool<\/span>)<\/span>mUsingTrash)<\/span> {<\/span>\n \/\/ first, set the flag that indicates that the trash is NOT in use<\/span>\n mUsingTrash =<\/span> false<\/span>;<\/span>\n \/\/ next, clean out anything that might be lingering in the trash now<\/span>\n Message *<\/span>m =<\/span> NULL<\/span>;<\/span>\n while<\/span> (<\/span>!<\/span>mTrash.empty<\/span>(<\/span>)<\/span>)<\/span> {<\/span>\n if<\/span> (<\/span>(<\/span>m =<\/span> mTrash.front<\/span>(<\/span>)<\/span>)<\/span> !<\/span>=<\/span> NULL<\/span>)<\/span> {<\/span>\n delete<\/span> m;<\/span>\n }<\/span>\n mTrash.pop_front<\/span>(<\/span>)<\/span>;<\/span>\n }<\/span>\n }<\/span>\n }<\/span><\/pre>\n \/\/ the new one is in the cache - let's dispose of the old one<\/span>\n if<\/span> (<\/span>oldMsg !<\/span>=<\/span> NULL<\/span>)<\/span> {<\/span>\n if<\/span> (<\/span>(<\/span>bool<\/span>)<\/span>mUsingTrash)<\/span> {<\/span>\n mTrash.push_front<\/span>(<\/span>oldMsg)<\/span>;<\/span>\n }<\/span> else<\/span> {<\/span>\n delete<\/span> oldMsg;<\/span>\n }<\/span>\n oldMsg =<\/span> NULL<\/span>;<\/span>\n }<\/span><\/pre>\n