Add reference grailsort implementation

1 files changed, 514 insertions, 0 deletions

diff --git a/grailsort_ref.c b/grailsort_ref.c
new file mode 100644
index 0000000..0a95076
--- /dev/null
+++ b/grailsort_ref.c
@@ -0,0 +1,514 @@
+/********* Grail sorting *********************************/
+/*                                                       */
+/* (c) 2013 by Andrey Astrelin                           */
+/*                                                       */
+/*                                                       */
+/* Stable sorting that works in O(N*log(N)) worst time   */
+/* and uses O(1) extra memory                            */
+/*                                                       */
+/* Define SORT_TYPE and SORT_CMP                         */
+/* and then call GrailSort() function                    */
+/*                                                       */
+/*********************************************************/
+
+#include <stdbool.h>
+#include <string.h>
+
+#include "sorters.h"
+
+#define SORT_TYPE int
+static cmpfun SORT_CMP;
+
+#define GRAIL_EXT_BUFFER_LENGTH 512
+
+static inline void grail_swap1(SORT_TYPE *a,SORT_TYPE *b){
+	SORT_TYPE c=*a;
+	*a=*b;
+	*b=c;
+}
+
+static inline void grail_swapN(SORT_TYPE *a,SORT_TYPE *b,int n){
+	while(n--) grail_swap1(a++,b++);
+}
+static void grail_rotate(SORT_TYPE *a,int l1,int l2){
+	while(l1 && l2){
+		if(l1<=l2){
+			grail_swapN(a,a+l1,l1);
+			a+=l1; l2-=l1;
+		} else{
+			grail_swapN(a+(l1-l2),a+l1,l2);
+			l1-=l2;
+		}
+	}
+}
+
+static int grail_BinSearchLeft(SORT_TYPE *arr,int len,SORT_TYPE *key){
+	int a=-1,b=len,c;
+	while(a<b-1){
+		c=a+((b-a)>>1);
+		if(SORT_CMP(arr+c,key)>=0) b=c;
+		else a=c;
+	}
+	return b;
+}
+static int grail_BinSearchRight(SORT_TYPE *arr,int len,SORT_TYPE *key){
+	int a=-1,b=len,c;
+	while(a<b-1){
+		c=a+((b-a)>>1);
+		if(SORT_CMP(arr+c,key)>0) b=c;
+		else a=c;
+	}
+	return b;
+}
+
+// cost: 2*len+nk^2/2
+static int grail_FindKeys(SORT_TYPE *arr,int len,int nkeys){
+	int h=1,h0=0;  // first key is always here
+	int u=1,r;
+	while(u<len && h<nkeys){
+		r=grail_BinSearchLeft(arr+h0,h,arr+u);
+		if(r==h || SORT_CMP(arr+u,arr+(h0+r))!=0){
+			grail_rotate(arr+h0,h,u-(h0+h));
+			h0=u-h;
+			grail_rotate(arr+(h0+r),h-r,1);
+			h++;
+		}
+		u++;
+	}
+	grail_rotate(arr,h0,h);
+	return h;
+}
+
+// cost: min(L1,L2)^2+max(L1,L2)
+static void grail_MergeWithoutBuffer(SORT_TYPE *arr,int len1,int len2){
+	int h;
+	if(len1<len2){
+		while(len1){
+			h=grail_BinSearchLeft(arr+len1,len2,arr);
+			if(h!=0){
+				grail_rotate(arr,len1,h);
+				arr+=h;
+				len2-=h;
+			}
+			if(len2==0) break;
+			do{
+				arr++; len1--;
+			} while(len1 && SORT_CMP(arr,arr+len1)<=0);
+		}
+	} else{
+		while(len2){
+			h=grail_BinSearchRight(arr,len1,arr+(len1+len2-1));
+			if(h!=len1){
+				grail_rotate(arr+h,len1-h,len2);
+				len1=h;
+			}
+			if(len1==0) break;
+			do{
+				len2--;
+			} while(len2 && SORT_CMP(arr+len1-1,arr+len1+len2-1)<=0);
+		}
+	}
+}
+
+// arr[M..-1] - buffer, arr[0,L1-1]++arr[L1,L1+L2-1] -> arr[M,M+L1+L2-1]
+static void grail_MergeLeft(SORT_TYPE *arr,int L1,int L2,int M){
+	int p0=0,p1=L1; L2+=L1;
+	while(p1<L2){
+		if(p0==L1 || SORT_CMP(arr+p0,arr+p1)>0){
+			grail_swap1(arr+(M++),arr+(p1++));
+		} else{
+			grail_swap1(arr+(M++),arr+(p0++));
+		}
+	}
+	if(M!=p0) grail_swapN(arr+M,arr+p0,L1-p0);
+}
+static void grail_MergeRight(SORT_TYPE *arr,int L1,int L2,int M){
+	int p0=L1+L2+M-1,p2=L1+L2-1,p1=L1-1;
+
+	while(p1>=0){
+		if(p2<L1 || SORT_CMP(arr+p1,arr+p2)>0){
+			grail_swap1(arr+(p0--),arr+(p1--));
+		} else{
+			grail_swap1(arr+(p0--),arr+(p2--));
+		}
+	}
+	if(p2!=p0) while(p2>=L1) grail_swap1(arr+(p0--),arr+(p2--));
+}
+
+static void grail_SmartMergeWithBuffer(SORT_TYPE *arr,int *alen1,int *atype,int len2,int lkeys){
+	int p0=-lkeys,p1=0,p2=*alen1,q1=p2,q2=p2+len2;
+	int ftype=1-*atype;  // 1 if inverted
+	while(p1<q1 && p2<q2){
+		if(SORT_CMP(arr+p1,arr+p2)-ftype<0) grail_swap1(arr+(p0++),arr+(p1++));
+		else grail_swap1(arr+(p0++),arr+(p2++));
+	}
+	if(p1<q1){
+		*alen1=q1-p1;
+		while(p1<q1) grail_swap1(arr+(--q1),arr+(--q2));
+	} else{
+		*alen1=q2-p2;
+		*atype=ftype;
+	}
+}
+static void grail_SmartMergeWithoutBuffer(SORT_TYPE *arr,int *alen1,int *atype,int _len2){
+	int len1,len2,ftype,h;
+
+	if(!_len2) return;
+	len1=*alen1;
+	len2=_len2;
+	ftype=1-*atype;
+	if(len1 && SORT_CMP(arr+(len1-1),arr+len1)-ftype>=0){
+		while(len1){
+			h=ftype ? grail_BinSearchLeft(arr+len1,len2,arr) : grail_BinSearchRight(arr+len1,len2,arr);
+			if(h!=0){
+				grail_rotate(arr,len1,h);
+				arr+=h;
+				len2-=h;
+			}
+			if(len2==0){
+				*alen1=len1;
+				return;
+			}
+			do{
+				arr++; len1--;
+			} while(len1 && SORT_CMP(arr,arr+len1)-ftype<0);
+		}
+	}
+	*alen1=len2; *atype=ftype;
+}
+
+/***** Sort With Extra Buffer *****/
+
+// arr[M..-1] - free, arr[0,L1-1]++arr[L1,L1+L2-1] -> arr[M,M+L1+L2-1]
+static void grail_MergeLeftWithXBuf(SORT_TYPE *arr,int L1,int L2,int M){
+	int p0=0,p1=L1; L2+=L1;
+	while(p1<L2){
+		if(p0==L1 || SORT_CMP(arr+p0,arr+p1)>0) arr[M++]=arr[p1++];
+		else arr[M++]=arr[p0++];
+	}
+	if(M!=p0) while(p0<L1) arr[M++]=arr[p0++];
+}
+
+static void grail_SmartMergeWithXBuf(SORT_TYPE *arr,int *alen1,int *atype,int len2,int lkeys){
+	int p0=-lkeys,p1=0,p2=*alen1,q1=p2,q2=p2+len2;
+	int ftype=1-*atype;  // 1 if inverted
+	while(p1<q1 && p2<q2){
+		if(SORT_CMP(arr+p1,arr+p2)-ftype<0) arr[p0++]=arr[p1++];
+		else arr[p0++]=arr[p2++];
+	}
+	if(p1<q1){
+		*alen1=q1-p1;
+		while(p1<q1) arr[--q2]=arr[--q1];
+	} else{
+		*alen1=q2-p2;
+		*atype=ftype;
+	}
+}
+
+// arr - starting array. arr[-lblock..-1] - buffer (if havebuf).
+// lblock - length of regular blocks. First nblocks are stable sorted by 1st elements and key-coded
+// keys - arrays of keys, in same order as blocks. key<midkey means stream A
+// nblock2 are regular blocks from stream A. llast is length of last (irregular) block from stream B, that should go before nblock2 blocks.
+// llast=0 requires nblock2=0 (no irregular blocks). llast>0, nblock2=0 is possible.
+static void grail_MergeBuffersLeftWithXBuf(SORT_TYPE *keys,SORT_TYPE *midkey,SORT_TYPE *arr,int nblock,int lblock,int nblock2,int llast){
+	int l,prest,lrest,frest,pidx,cidx,fnext,plast;
+
+	if(nblock==0){
+		l=nblock2*lblock;
+		grail_MergeLeftWithXBuf(arr,l,llast,-lblock);
+		return;
+	}
+
+	lrest=lblock;
+	frest=SORT_CMP(keys,midkey)<0 ? 0 : 1;
+	pidx=lblock;
+	for(cidx=1;cidx<nblock;cidx++,pidx+=lblock){
+		prest=pidx-lrest;
+		fnext=SORT_CMP(keys+cidx,midkey)<0 ? 0 : 1;
+		if(fnext==frest){
+			memcpy(arr+prest-lblock,arr+prest,lrest*sizeof(SORT_TYPE));
+			prest=pidx;
+			lrest=lblock;
+		} else{
+			grail_SmartMergeWithXBuf(arr+prest,&lrest,&frest,lblock,lblock);
+		}
+	}
+	prest=pidx-lrest;
+	if(llast){
+		plast=pidx+lblock*nblock2;
+		if(frest){
+			memcpy(arr+prest-lblock,arr+prest,lrest*sizeof(SORT_TYPE));
+			prest=pidx;
+			lrest=lblock*nblock2;
+			frest=0;
+		} else{
+			lrest+=lblock*nblock2;
+		}
+		grail_MergeLeftWithXBuf(arr+prest,lrest,llast,-lblock);
+	} else{
+		memcpy(arr+prest-lblock,arr+prest,lrest*sizeof(SORT_TYPE));
+	}
+}
+
+/***** End Sort With Extra Buffer *****/
+
+// build blocks of length K
+// input: [-K,-1] elements are buffer
+// output: first K elements are buffer, blocks 2*K and last subblock sorted
+static void grail_BuildBlocks(SORT_TYPE *arr,int L,int K,SORT_TYPE *extbuf,int LExtBuf){
+	int m,u,h,p0,p1,rest,restk,p,kbuf;
+	kbuf=K<LExtBuf ? K : LExtBuf;
+	while(kbuf&(kbuf-1)) kbuf&=kbuf-1;  // max power or 2 - just in case
+
+	if(kbuf){
+		memcpy(extbuf,arr-kbuf,kbuf*sizeof(SORT_TYPE));
+		for(m=1;m<L;m+=2){
+			u=0;
+			if(SORT_CMP(arr+(m-1),arr+m)>0) u=1;
+			arr[m-3]=arr[m-1+u];
+			arr[m-2]=arr[m-u];
+		}
+		if(L%2) arr[L-3]=arr[L-1];
+		arr-=2;
+		for(h=2;h<kbuf;h*=2){
+			p0=0;
+			p1=L-2*h;
+			while(p0<=p1){
+				grail_MergeLeftWithXBuf(arr+p0,h,h,-h);
+				p0+=2*h;
+			}
+			rest=L-p0;
+			if(rest>h){
+				grail_MergeLeftWithXBuf(arr+p0,h,rest-h,-h);
+			} else {
+				for(;p0<L;p0++)	arr[p0-h]=arr[p0];
+			}
+			arr-=h;
+		}
+		memcpy(arr+L,extbuf,kbuf*sizeof(SORT_TYPE));
+	} else{
+		for(m=1;m<L;m+=2){
+			u=0;
+			if(SORT_CMP(arr+(m-1),arr+m)>0) u=1;
+			grail_swap1(arr+(m-3),arr+(m-1+u));
+			grail_swap1(arr+(m-2),arr+(m-u));
+		}
+		if(L%2) grail_swap1(arr+(L-1),arr+(L-3));
+		arr-=2;
+		h=2;
+	}
+	for(;h<K;h*=2){
+		p0=0;
+		p1=L-2*h;
+		while(p0<=p1){
+			grail_MergeLeft(arr+p0,h,h,-h);
+			p0+=2*h;
+		}
+		rest=L-p0;
+		if(rest>h){
+			grail_MergeLeft(arr+p0,h,rest-h,-h);
+		} else grail_rotate(arr+p0-h,h,rest);
+		arr-=h;
+	}
+	restk=L%(2*K);
+	p=L-restk;
+	if(restk<=K) grail_rotate(arr+p,restk,K);
+	else grail_MergeRight(arr+p,K,restk-K,K);
+	while(p>0){
+		p-=2*K;
+		grail_MergeRight(arr+p,K,K,K);
+	}
+}
+
+// arr - starting array. arr[-lblock..-1] - buffer (if havebuf).
+// lblock - length of regular blocks. First nblocks are stable sorted by 1st elements and key-coded
+// keys - arrays of keys, in same order as blocks. key<midkey means stream A
+// nblock2 are regular blocks from stream A. llast is length of last (irregular) block from stream B, that should go before nblock2 blocks.
+// llast=0 requires nblock2=0 (no irregular blocks). llast>0, nblock2=0 is possible.
+static void grail_MergeBuffersLeft(SORT_TYPE *keys,SORT_TYPE *midkey,SORT_TYPE *arr,int nblock,int lblock,bool havebuf,int nblock2,int llast){
+	int l,prest,lrest,frest,pidx,cidx,fnext,plast;
+
+	if(nblock==0){
+		l=nblock2*lblock;
+		if(havebuf) grail_MergeLeft(arr,l,llast,-lblock);
+		else grail_MergeWithoutBuffer(arr,l,llast);
+		return;
+	}
+
+	lrest=lblock;
+	frest=SORT_CMP(keys,midkey)<0 ? 0 : 1;
+	pidx=lblock;
+	for(cidx=1;cidx<nblock;cidx++,pidx+=lblock){
+		prest=pidx-lrest;
+		fnext=SORT_CMP(keys+cidx,midkey)<0 ? 0 : 1;
+		if(fnext==frest){
+			if(havebuf) grail_swapN(arr+prest-lblock,arr+prest,lrest);
+			prest=pidx;
+			lrest=lblock;
+		} else{
+			if(havebuf){
+				grail_SmartMergeWithBuffer(arr+prest,&lrest,&frest,lblock,lblock);
+			} else{
+				grail_SmartMergeWithoutBuffer(arr+prest,&lrest,&frest,lblock);
+			}
+
+		}
+	}
+	prest=pidx-lrest;
+	if(llast){
+		plast=pidx+lblock*nblock2;
+		if(frest){
+			if(havebuf) grail_swapN(arr+prest-lblock,arr+prest,lrest);
+			prest=pidx;
+			lrest=lblock*nblock2;
+			frest=0;
+		} else{
+			lrest+=lblock*nblock2;
+		}
+		if(havebuf) grail_MergeLeft(arr+prest,lrest,llast,-lblock);
+		else grail_MergeWithoutBuffer(arr+prest,lrest,llast);
+	} else{
+		if(havebuf) grail_swapN(arr+prest,arr+(prest-lblock),lrest);
+	}
+}
+
+static void grail_SortIns(SORT_TYPE *arr,int len){
+	int i,j;
+	for(i=1;i<len;i++){
+		for(j=i-1;j>=0 && SORT_CMP(arr+(j+1),arr+j)<0;j--) grail_swap1(arr+j,arr+(j+1));
+	}
+}
+
+static void grail_LazyStableSort(SORT_TYPE *arr,int L){
+	int m,u,h,p0,p1,rest;
+	for(m=1;m<L;m+=2){
+		u=0;
+		if(SORT_CMP(arr+m-1,arr+m)>0) grail_swap1(arr+(m-1),arr+m);
+	}
+	for(h=2;h<L;h*=2){
+		p0=0;
+		p1=L-2*h;
+		while(p0<=p1){
+			grail_MergeWithoutBuffer(arr+p0,h,h);
+			p0+=2*h;
+		}
+		rest=L-p0;
+		if(rest>h) grail_MergeWithoutBuffer(arr+p0,h,rest-h);
+	}
+}
+
+// keys are on the left of arr. Blocks of length LL combined. We'll combine them in pairs
+// LL and nkeys are powers of 2. (2*LL/lblock) keys are guarantied
+static void grail_CombineBlocks(SORT_TYPE *keys,SORT_TYPE *arr,int len,int LL,int lblock,bool havebuf,SORT_TYPE *xbuf){
+	int M,nkeys,b,NBlk,midkey,lrest,u,p,v,kc,nbl2,llast;
+	SORT_TYPE *arr1;
+
+	M=len/(2*LL);
+	lrest=len%(2*LL);
+	nkeys=(2*LL)/lblock;
+	if(lrest<=LL){
+		len-=lrest;
+		lrest=0;
+	}
+	if(xbuf) memcpy(xbuf,arr-lblock,lblock*sizeof(SORT_TYPE));
+	for(b=0;b<=M;b++){
+		if(b==M && lrest==0) break;
+		arr1=arr+b*2*LL;
+		NBlk=(b==M ? lrest : 2*LL)/lblock;
+		grail_SortIns(keys,NBlk+(b==M ? 1 : 0));
+		midkey=LL/lblock;
+		for(u=1;u<NBlk;u++){
+			p=u-1;
+			for(v=u;v<NBlk;v++){
+				kc=SORT_CMP(arr1+p*lblock,arr1+v*lblock);
+				if(kc>0 || (kc==0 && SORT_CMP(keys+p,keys+v)>0)) p=v;
+			}
+			if(p!=u-1){
+				grail_swapN(arr1+(u-1)*lblock,arr1+p*lblock,lblock);
+				grail_swap1(keys+(u-1),keys+p);
+				if(midkey==u-1 || midkey==p) midkey^=(u-1)^p;
+			}
+		}
+		nbl2=llast=0;
+		if(b==M) llast=lrest%lblock;
+		if(llast!=0){
+			while(nbl2<NBlk && SORT_CMP(arr1+NBlk*lblock,arr1+(NBlk-nbl2-1)*lblock)<0) nbl2++;
+		}
+		if(xbuf) grail_MergeBuffersLeftWithXBuf(keys,keys+midkey,arr1,NBlk-nbl2,lblock,nbl2,llast);
+		else grail_MergeBuffersLeft(keys,keys+midkey,arr1,NBlk-nbl2,lblock,havebuf,nbl2,llast);
+	}
+	if(xbuf){
+		for(p=len;--p>=0;) arr[p]=arr[p-lblock];
+		memcpy(arr-lblock,xbuf,lblock*sizeof(SORT_TYPE));
+	}else if(havebuf) while(--len>=0) grail_swap1(arr+len,arr+len-lblock);
+}
+
+
+static void grail_commonSort(SORT_TYPE *arr,int Len,SORT_TYPE *extbuf,int LExtBuf){
+	int lblock,nkeys,findkeys,ptr,cbuf,lb,nk;
+	bool havebuf,chavebuf;
+	long long s;
+
+	if(Len<16){
+		grail_SortIns(arr,Len);
+		return;
+	}
+
+	lblock=1;
+	while(lblock*lblock<Len) lblock*=2;
+	nkeys=(Len-1)/lblock+1;
+	findkeys=grail_FindKeys(arr,Len,nkeys+lblock);
+	havebuf=true;
+	if(findkeys<nkeys+lblock){
+		if(findkeys<4){
+			grail_LazyStableSort(arr,Len);
+			return;
+		}
+		nkeys=lblock;
+		while(nkeys>findkeys) nkeys/=2;
+		havebuf=false;
+		lblock=0;
+	}
+	ptr=lblock+nkeys;
+	cbuf=havebuf ? lblock : nkeys;
+	if(havebuf) grail_BuildBlocks(arr+ptr,Len-ptr,cbuf,extbuf,LExtBuf);
+	else grail_BuildBlocks(arr+ptr,Len-ptr,cbuf,NULL,0);
+
+	// 2*cbuf are built
+	while(Len-ptr>(cbuf*=2)){
+		lb=lblock;
+		chavebuf=havebuf;
+		if(!havebuf){
+			if(nkeys>4 && nkeys/8*nkeys>=cbuf){
+				lb=nkeys/2;
+				chavebuf=true;
+			} else{
+				nk=1;
+				s=(long long)cbuf*findkeys/2;
+				while(nk<nkeys && s!=0){
+					nk*=2; s/=8;
+				}
+				lb=(2*cbuf)/nk;
+			}
+		} else{
+#if 0
+			if(LExtBuf!=0){
+				while(lb>LExtBuf && lb*lb>2*cbuf) lb/=2;  // set size of block close to sqrt(new_block_length)
+			}
+#endif
+		}
+		grail_CombineBlocks(arr,arr+ptr,Len-ptr,cbuf,lb,chavebuf,chavebuf && lb<=LExtBuf ? extbuf : NULL);
+	}
+	grail_SortIns(arr,ptr);
+	grail_MergeWithoutBuffer(arr,ptr,Len-ptr);
+}
+
+static void GrailSort(SORT_TYPE *arr,int Len){
+	grail_commonSort(arr,Len,NULL,0);
+}
+
+void grailsort_ref(void *base, size_t nmel, size_t width, cmpfun cmp)
+{
+	SORT_CMP = cmp;
+	GrailSort(base, nmel);
+}