A while back I wrote an article on CodeProject about a bi-partite circular buffer algorithm I came up with to handle asynchronous network IO. (It’s also useful for other things – pretty much any scenario where you have to pass data in contiguous blocks to other APIs, yet you don’t know exactly how much data you’re going to be passing at any time).
Well.. I just came across this blog post from someone:
A Pure Programmer
I read an article about circular buffer and related code, which written by Simon Cooke. It’s very good. I never heard of Simon Cooke before. I was moved by the last words in his article: “If you do find it (the code he write) useful, or use it in any of your code, all that I ask in return is that you drop me an email and let me know how the code is being used. It’s nice to know that it’s out there, alive, and doing cool things.”
Oh,what a pure programmer!
Awww… bless. It warms my heart that someone appreciates my work, it really does.
I must admit, I was rather proud of that little piece of code. It worked out to be pretty fast too – the only way to do anything faster would have been to use the virtual memory mirroring technique I laid out in the article – but unfortunately, that doesn’t work on some architectures. (I’m looking at YOU, XBOX 360). Not sure if it’s multiproc safe on other systems too. Damn cache coherency, I stab at thee.
So I got a bit narcissistic and did a Google search on the Bip Buffer… and lo and behold, people are using it. One guy’s looking at it as a way of performing least-wear writing to flash memory (now that’s a cool application I never even thought of!). So glad this code’s getting some use!!!