Yeah, I agree that memcache itself is fast.
I'm trying to avoid waiting for the pickling of my data :-)
Agreed that if a set fails it should just mean that you get it from
the datastore next time you try to retrieve it. But if there was a
previous set, would that older version still exist in which case I'd
be seeing bad data. Hmmm.
I can see delete being a problem. In my case I'm using memcache as a
cache and I'm simply trying to clean it up. But since I don't need to
worry about pickling in the delete case (or so I think) then that
isn't a problem.
Perhaps an asynchronous set could have the semantics of set or delete
if error?
(Getting too complicated most likely...)