On Oct 6, 2014, at 12:44, Tristan Tarrant ttarr...@redhat.com wrote:
I think we should provide correct implementations of size() (and others)
and provide shortcut implementations using our usual Flag API (e.g.
SKIP_REMOTE_LOOKUP).
for keySet and values, Will's distributed iteration is a
On Oct 8, 2014, at 15:11, Dan Berindei dan.berin...@gmail.com wrote:
On Wed, Oct 8, 2014 at 5:03 PM, Mircea Markus mmar...@redhat.com wrote:
On Oct 3, 2014, at 9:30, Radim Vansa rva...@redhat.com wrote:
Hi,
recently we had a discussion about what size() returns, but I've
realized
So it seems we would want to change this for 7.0 if possible since it
would be a bigger change for something like 7.1 and 8.0 would be even
further out. I should be able to put this together for CR2.
It seems that we want to implement keySet, values and entrySet methods
using the entry iterator
On Wed, Oct 8, 2014 at 5:42 PM, William Burns mudokon...@gmail.com wrote:
So it seems we would want to change this for 7.0 if possible since it
would be a bigger change for something like 7.1 and 8.0 would be even
further out. I should be able to put this together for CR2.
I'm not 100%
On Wed, Oct 8, 2014 at 10:57 AM, Dan Berindei dan.berin...@gmail.com wrote:
On Wed, Oct 8, 2014 at 5:42 PM, William Burns mudokon...@gmail.com wrote:
So it seems we would want to change this for 7.0 if possible since it
would be a bigger change for something like 7.1 and 8.0 would be even
On Wed, Oct 8, 2014 at 6:14 PM, William Burns mudokon...@gmail.com wrote:
On Wed, Oct 8, 2014 at 10:57 AM, Dan Berindei dan.berin...@gmail.com
wrote:
On Wed, Oct 8, 2014 at 5:42 PM, William Burns mudokon...@gmail.com
wrote:
So it seems we would want to change this for 7.0 if possible
On Wed, Oct 8, 2014 at 12:41 PM, Dan Berindei dan.berin...@gmail.com wrote:
On Wed, Oct 8, 2014 at 6:19 PM, Radim Vansa rva...@redhat.com wrote:
Users expect that size() will be constant-time (or linear to cluster
size), and generally fast operation. I'd prefer to keep it that way.
Though,
