<div dir="ltr"><br><div class="gmail_extra"><br><div class="gmail_quote">On Fri, Oct 10, 2014 at 9:01 PM, Mircea Markus <span dir="ltr"><<a href="mailto:mmarkus@redhat.com" target="_blank">mmarkus@redhat.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div><div><br>
On Oct 10, 2014, at 17:30, William Burns <<a href="mailto:mudokonman@gmail.com" target="_blank">mudokonman@gmail.com</a>> wrote:<br>
<br>
>>>>> Also we didn't really talk about the fact that these methods would<br>
>>>>> ignore ongoing transactions and if that is a concern or not.<br>
>>>>><br>
>>>><br>
>>>> It might be a concern for the Hibernate 2LC impl, it was their TCK that<br>
>>>> prompted the last round of discussions about clear().<br>
>>><br>
>>> Although I wonder how much these methods are even used since they only<br>
>>> work for Local, Replication or Invalidation caches in their current<br>
>>> state (and didn't even use loaders until 6.0).<br>
>><br>
>><br>
>> There is some more information about the test in the mailing list discussion<br>
>> [1]<br>
>> There's also a JIRA for clear() [2]<br>
>><br>
>> I think 2LC almost never uses distribution, so size() being local-only<br>
>> didn't matter, but making it non-tx could cause problems - at least for that<br>
>> particular test.<br>
><br>
> I had toyed around with the following idea before, but I never thought<br>
> of it in the scope of the size method solely, but I have a solution<br>
> that would work mostly for transactional caches. Essentially the size<br>
> method would always operate in a READ_COMMITTED like state, using<br>
> REPEATABLE_READ doesn't seem feasible since we can't keep all the<br>
> contents in memory. Essentially the iterator would be ran and for<br>
> each key that is found it checks the context to see if it is there.<br>
> If the context entry is marked as removed it doesn't count the key, if<br>
> the key is there it marks the key as found and counts it, and if it is<br>
> not found it counts it. Then after iteration it finds all the keys in<br>
> the context that were not found and also adds them to the count. This<br>
> way it doesn't need to store additional memory (besides iteration<br>
> costs) as all the context information is in memory.<br>
<br>
</div></div>sounds good to me.<br></blockquote><div><br></div><div>Mircea, you have to decide whether you want the precise estimation using the entry iterator or the loose estimation using dataContainer.size() :)</div><div><br></div><div>I guess we can't make size() read everything into the invocation context, so READ_COMMITTED is all we can provide if we want to keep size() transactional. Maybe we don't really need it though... Will, could you investigate the failing test that started the clear() thread [1] to see if it really needs size() to be transactional?</div><div><br></div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<span><br>
><br>
> My original thought was to also make the EntryIterator transactional<br>
> in the same way which also means the keySet, entrySet and values<br>
> methods could do the same things. The main reason stumbling block I<br>
> had was the fact that the iterator and various collections returned<br>
> could be used outside of the ongoing transaction which didn't seem to<br>
> make much sense to me. But maybe these should be changed to be more<br>
> like backing maps which HashMap, ConcurrentHashMap etc use for their<br>
> methods, where instead it would pick up the transaction if there is<br>
> one in the current thread and if there is no transaction just start an<br>
> implicit one.<br>
<br>
</span>or if they are outside of a transaction to deny progress<br></blockquote><div><br></div><div>I don't think it's fair to require an explicit transaction for every entrySet(). It should be possible to start an iteration without a transaction, and only to invalidate an iteration started from an explicit transaction the moment the transaction is committed/rolled back (although it would complicate rules a bit).</div><div><br></div><div>And what happens if the user writes to the cache while it's iterating through the cache-backed collection? Should the user see the new entry in the iteration, or not? I don't think you can figure out at the end of the iteration which keys were included without keeping all the keys on the originator.</div><div> <br></div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<span><br>
> This however was a big change from how these<br>
> collections work currently in that they are in memory copies only.<br>
><br>
> What do you guys think?<br>
<br>
</span>I think that keeping track of the context entries is a better way of iterating so +1. As you mentioned, we should also make it clear that RC semantic applies.<br>
<div><div><br>
Cheers,<br>
--<br>
Mircea Markus<br>
Infinispan lead (<a href="http://www.infinispan.org" target="_blank">www.infinispan.org</a>)<br>
<br>
<br>
<br>
<br>
<br>
_______________________________________________<br>
infinispan-dev mailing list<br>
<a href="mailto:infinispan-dev@lists.jboss.org" target="_blank">infinispan-dev@lists.jboss.org</a><br>
<a href="https://lists.jboss.org/mailman/listinfo/infinispan-dev" target="_blank">https://lists.jboss.org/mailman/listinfo/infinispan-dev</a><br>
</div></div></blockquote></div><br></div></div>