I set up debugging and am rethrowing the exception. What's strange is it
appears that despite the iterator instance being properly set to
iterator.Counter (my implementation), my breakpoints aren't being hit, only
in the parent classes (Wrapping Iterator) and (SortedKeyValueIterator).
I have two
Herp... serves me right for not setting up a proper test case.
I think you need to override seek as well:
@Override
public void seek(...) throws IOException {
super.seek(...);
next();
}
I think I just realized the wrapping iterator could use some clean up,
because this isn't obvious.
That worked ;) - Thanks!
What a journey...
I like Accumulo's architecture and promise, but the difficulty in querying
it (lack of documentation, conventions) is a major concern and I'd imagine
has to have an impact on adoption. I'm curious if there have been any
conversations around changing the
There's been some mention about a desire to rethink the Iterator
interface as it has some deficiencies (notably the lack of a cleanup
before the iterators are torn down), but no one has stated that they're
actively working on this.
Getting better documentation wrt to convetions: let us know
Yes, any individual scan should be able to calculate an accurate average
based on the entries present at the time of the scan. You just can't
pre-compute an average, but you can pre-compute the sum and count and do
the division on the fly. For averaging, finishing up the calculation is
trivial,
Thanks, Billie, that clears things up.
-Russ
On Tue, Jul 15, 2014 at 11:44 AM, Billie Rinaldi billie.rina...@gmail.com
wrote:
Yes, any individual scan should be able to calculate an accurate average
based on the entries present at the time of the scan. You just can't
pre-compute an average,
