oh I see, so the only current option is to pull all of the keys and delete them?
oh I see, so the only current option is to pull all of the keys and delete them?
list and counting that way (which is error-prone).list calls use the cache, actually, and so won't be subject to the eventual consistency part.list multiple times in a row, if the calls all take then same time then they don't get cached, if the first is slower than the rest they do get cached.list operations do indeed get cached list has an upper limit somehow? After 7500 keys it won't return another , but I should have inserted more keys than that 

[M]ore popular values are cached in the data centers they are requested from.
ctx.kvlist()cursorHow KV works