Commented by: @carlosga

could you explain a bit what is that sentinel trick ?? please :)

Commented by: @cincuranet

Well, I didn't looked, whether I will be possible (and if we do some changes, we can loose performace on other side).

But the idea is, that when looping thru collection you need to do n checks (in worst case), whether you're at the end. But when you add the searched item to the end, you cak skip these checks and run until you find one (either the right (=it's not the last) or the added one (=it's the last)). So you save some boolean evaluations (especially, when the item is near end and collection is huge).

I'll have to do some performace test with this and without.

Commented by: @cincuranet

I've done some tests and operations during prepare bring the small speed up benefit back down.