=f.compare$(a,b[c+h-p]);)g=p,p=(p<<1)+1,0>=p&&(p=j);p>j&&(p=j);
+j=g;g=h-p;p=h-j}rb(ya,this,function(){return-1<=g&&g>>1),0f.compare$(a,b[c+h])){for(var j=h+1;gf.compare$(a,b[c+h-g]);)p=g,g=(g<<1)+1,0>=g&&(g=j);g>j&&(g=j);j=p;p=h-g;g=h-j}else{for(j=d-h;g=g&&(g=
+j);g>j&&(g=j);p+=h;g+=h}rb(ya,this,function(){return-1<=p&&p>>1),0>f.compare$(a,b[c+j])?g=j:p=j+1;rb(ya,this,function(){return p==g});return g},1);b(ya,"mergeLo$I$I$I$I",function(a,b,c,d){rb(ya,this,function(){return 0l.compare$(h[p],s[j])){if(h[k++]=h[p++],q++,n=0,0==--d)break a}else if(h[k++]=s[j++],n++,q=0,1==--b)break a;while((n|q)=b))break a;h[k++]=h[p++];if(0==--d)break a;q=ya.gallopLeft$TT$TTA$I$I$I$java_util_Comparator(s[j],
+h,p,d,0,l);if(0!=q&&(System.arraycopy$O$I$O$I$I(h,p,h,k,q),k+=q,p+=q,d-=q,0==d))break a;h[k++]=s[j++];if(1==--b)break a;m--}while(7<=n|7<=q);0>m&&(m=0);m+=2}this.minGallop=1>m?1:m;if(1==b)rb(ya,this,function(){return 0