So the speed of a failed add should be the same as a set operation ?
On 7/31/07, Jehiah Czebotar <[EMAIL PROTECTED]> wrote: > If you have an item with key K in the cache already, then an ADD > operation on K will fail because it's already there. (an add operation > only succeeds when that key does not already exist). A set operation > will always succeed overwriting the existing value if any. > > The speed of both should be the same. > > -- > Jehiah > > On 7/31/07, Hanson Char <[EMAIL PROTECTED]> wrote: > > If an item with key K already exists in memcached, would an add > > operation of the same key K be faster than a set operation in general > > ? > > > > Hanson > > >
