/* blockcodes.c  */

#include "def.h"
#include "macro.h"

static INT untersuchen();
static INT vergleich();
static INT herster_kandidat();
static INT neuer_vektor();
static INT hnext_kandidat();
static INT akt_perm_geord_vektor();
static INT int_in_string();
static INT itoa();
static INT reverse();
static INT next_kandidat_rec();
static INT untersuchen4();
static INT vergleich55();
static INT erster_kandidat_h();

main()
{
	OP a;
	anfang(); 
	a=callocobject();
	printeingabe("Choose one of the following tasks!");
	printeingabe("[1] Compute block codes recursively ");
	printeingabe("[2] Compute block codes from a previous computed list ");
	printeingabe("[3] Read computed list from file");
	scan(INTEGER,a);
	switch(S_I_I(a)) {
		case 1: transversal_blockcodes_rec();
			break;
		case 2: transversal_blockcodes_file();  
			break;
		case 3: read_blockcodes_file();
			break;
		default: printeingabe("No proper action was chosen!");
			 break;
	}
	print_time();
	return freeall(a);
	ende();
}

int transversal_blockcodes_rec()
{
	INT i,l,ibasis;
	OP a=callocobject();
	OP n=callocobject();
	OP adm=callocobject();
	OP b=callocobject();
	OP anz=callocobject();
	OP abbr=callocobject(); 
	OP basis=callocobject();
	OP v=callocobject();
	OP vv=callocobject();
	OP hi=callocobject();
	OP nv=callocobject(); 
	l=0L;
	printeingabe("Number of letters in the alphabet");
	scan(INTEGER,a);
	printeingabe("Length of the code words");
	scan(INTEGER,n);
	printeingabe("Number of code words in the code");
	scan(INTEGER,adm);
	co_sims_kette_fmon(a,n,b,anz,abbr,basis);
	ibasis=S_I_I(basis);
	m_il_v(ibasis+2L,vv);
	hoch(a,n,hi);
	m_l_nv(hi,nv);
	erster_kandidat_h(1L,v);
	for (i=0L;i<ibasis+2L;++i)
		m_l_v(hi,S_V_I(vv,i));
	do {
		copy(v,S_V_I(vv,0L));
		i=untersuchen4(0L,vv,ibasis,b,nv,anz);
		if (i==1L) {
			if (eq(S_V_L(v),adm)) ++l; 
			/*if (l%500L==0L) */ { 
				printf("%d  ",l);
				println(v); 
			}
		}
		i=next_kandidat_rec(i,hi,adm,v);
	} while (i==1L); 
	printf("Number of different codes = %d\n",l);
	freeall(a);
	freeall(b);
	freeall(n);
	freeall(v);
	freeall(vv);
	freeall(nv);
	freeall(hi);
	freeall(anz);
	freeall(adm);
	freeall(abbr);
	freeall(basis);
}

int transversal_blockcodes_file()
{
	INT i,l;
	FILE *fp1,*fp2,*anz1,*anz2;
	char name1[40],name2[40],name3[40],name4[40];
	OP a=callocobject();
	OP n=callocobject();
	OP adm=callocobject();
	OP b=callocobject();
	OP anz=callocobject();
	OP abbr=callocobject();
	OP basis=callocobject();
	OP v=callocobject();
	OP vv=callocobject();
	OP hi=callocobject();
	OP nv=callocobject();
	OP lesen=callocobject();
	OP maxlesen=callocobject();
	l=0L; 
	printeingabe("Number of letters in the alphabet");
	scan(INTEGER,a);
	printeingabe("Length of the code words");
	scan(INTEGER,n);
	printeingabe("Number of code words in the code");
	scan(INTEGER,adm);
	co_sims_kette_fmon(a,n,b,anz,abbr,basis);
	if (S_I_I(adm)==1L) {
		filename3(S_I_I(a),S_I_I(n),S_I_I(adm),"bc","_",".lst",name1);
		filename3(S_I_I(a),S_I_I(n),S_I_I(adm),"bc","_",".anz",name2);
		/*printf("folgende Files werden verwendet: %s %s\n",name1,name2);*/
		fp2=fopen(name1,"w");
		anz2=fopen(name2,"w");
		M_I_I(1L,anz);
		m_l_v(adm,v);
		M_I_I(1L,S_V_I(v,0L));
		objectwrite(fp2,v);
		objectwrite(anz2,anz);
		fclose(anz2);
		fclose(fp2);
		printf("fertig\n");
	}
	else {
		filename3(S_I_I(a),S_I_I(n),S_I_I(adm),"bc","_",".lst",name1);
		filename3(S_I_I(a),S_I_I(n),S_I_I(adm),"bc","_",".anz",name2);
		filename3(S_I_I(a),S_I_I(n),S_I_I(adm)-1L,"bc","_",".lst",name3);
		filename3(S_I_I(a),S_I_I(n),S_I_I(adm)-1L,"bc","_",".anz",name4);
		/*printf("folgende Files werden verwendet: "); printf("%s %s %s %s \n",name1,name2,name3,name4);*/
		fp1=fopen(name3,"r");
		anz1=fopen(name4,"r");
		objectread(anz1,maxlesen);
		fclose(anz1);
		fp2=fopen(name1,"w");
		anz2=fopen(name2,"w");
		m_l_v(adm,v);
		herster_kandidat(adm,v,lesen,fp1);
		hoch(a,n,hi);
		m_l_v(hi,nv);
		for (i=0L;i<S_V_LI(nv);++i)
			M_I_I(0L,S_V_I(nv,i));
		l=0L;
		m_il_v(S_I_I(basis)+2L,vv);
		for (i=0L;i<S_I_I(basis)+2L;++i)
			m_l_v(adm,S_V_I(vv,i));
		do {
			copy(v,S_V_I(vv,0L));
			i=untersuchen(0L,vv,basis,b,abbr,nv,anz);
			if (i==1L) {
				++l;
				printf("%d  ",l);
				println(v);
				objectwrite(fp2,v);
			}
			i=hnext_kandidat(adm,v,lesen,maxlesen,fp1,hi);
		} while (i==1L);
		printf("Number of different codes = %d\n",l);
		M_I_I(l,anz);
		objectwrite(anz2,anz);
		fclose(anz2);
		fclose(fp1);
		fclose(fp2);
	}
	freeall(a);
	freeall(b);
	freeall(n);
	freeall(v);
	freeall(vv);
	freeall(nv);
	freeall(hi);
	freeall(anz);
	freeall(adm);
	freeall(abbr);
	freeall(basis);
	freeall(lesen);
	freeall(maxlesen);
} 

int read_blockcodes_file()
{
	INT i,l;
	FILE *fp1,*fp2,*anz1,*anz2;
	char name1[40],name2[40],name3[40],name4[40];
	OP a=callocobject();
	OP n=callocobject();
	OP adm=callocobject();
	OP anz=callocobject();
	OP v=callocobject();
	printeingabe("Number of letters in the alphabet");
	scan(INTEGER,a);
	printeingabe("Length of the code words");
	scan(INTEGER,n);
	printeingabe("Number of code words in the code");
	scan(INTEGER,adm);
	filename3(S_I_I(a),S_I_I(n),S_I_I(adm),"bc","_",".lst",name1);
	filename3(S_I_I(a),S_I_I(n),S_I_I(adm),"bc","_",".anz",name2);
	/*printf("folgende Files werden verwendet: %s %s\n",name1,name2);*/
	fp2=fopen(name1,"r");
	anz2=fopen(name2,"r");
	objectread(anz2,anz);
	println(anz);
	fclose(anz2);
	for (M_I_I(1L,a);le(a,anz);inc(a)) {
		objectread(fp2,v);
		println(v);
	}
	fclose(fp2);
	freeall(a);
	freeall(n);
	freeall(v);
	freeall(anz);
} 

static INT untersuchen(i,vv,basis,b,abbr,nv,anz)
	int i;
	OP vv,basis,b,abbr,nv,anz;
{
	int j,k,l;
	for (j=i;j<i+S_V_II(anz,i);++j) {
		akt_perm_geord_vektor(S_M_IJ(b,i,j),S_V_I(vv,i),S_V_I(vv,i+1L),nv);
		k=vergleich(S_V_I(vv,0L),S_V_I(vv,i+1L),abbr,i);
		if (k==4L) return(0L);
		else if ((k==2L || (k==3L && j==i)) && (i < S_I_I(basis))) {
			l=untersuchen(i+1L,vv,basis,b,abbr,nv,anz);
			if (l==0L) return(0L); /* es gibt ein lexikogr. kleineres Element im Orbit  */ 
		}
	}
	return(1L);  /* noch kein lexikogr. kleineres Element gefunden   */
}

static INT vergleich(a,b,abbr,j)
	int j; 
	OP a,b,abbr;
{
	int i,k,hilf;
	hilf=comp(a,b);
	if (hilf>0L) return(4L); /* a > b   */ 
	if (hilf==0L) return(3L); /* a = b   */
	i=0L;
	while (S_V_II(a,i)==S_V_II(b,i)) ++i;
	if (S_V_II(a,i)<=S_V_II(abbr,j)) return(1L); 
	/* a < b  und sie unterscheiden sich an der j-ten Stelle   */
	else return(2L); /* a < b   */
}

static INT herster_kandidat(adm,v,gelesen,fp1)
	OP adm,v,gelesen; 
	FILE *fp1;
{
	INT hilf,i;
	M_I_I(1L,gelesen);
	objectread(fp1,v);
	inc(v);
	hilf=S_V_LI(v)-1L;
	M_I_I(S_V_II(v,hilf-1L)+1L,S_V_I(v,hilf)); 
}

static INT neuer_vektor(v,fp1)
	OP v;
	FILE *fp1; 
{
	INT hilf,i;
	freeself(v);
	objectread(fp1,v);
	inc(v);
	hilf=S_V_LI(v)-1L;
	M_I_I(S_V_II(v,hilf-1L),S_V_I(v,hilf));
}

static INT hnext_kandidat(adm,v,gelesen,maxgelesen,fp1,hi)
	OP adm,v,gelesen,maxgelesen,hi;
	FILE *fp1;
{
	INT hilf;
lab: hilf=S_V_II(v,S_V_LI(v)-1L)+1L; 
     if (hilf>S_I_I(hi)) {
	     if ((S_I_I(adm)==1L) || (eq(gelesen,maxgelesen))) {
		     printf("Alle Funktionen durchgetestet!\n");
		     return(2L);
		     /* kein Fehler aufgetreten, alle Kandidaten aufgelistet */
	     }
	     else {
		     neuer_vektor(v,fp1);
		     inc(gelesen);
		     goto lab;
	     }
     }
     else M_I_I(hilf,S_V_I(v,S_V_LI(v)-1L));
     return(1L);  /* kein Fehler aufgetreten  */
}

static INT next_kandidat_rec(i,n,m,v)
	OP n,m,v;
	INT i; 
{
	INT hilf;
	hilf=S_V_II(v,S_V_LI(v)-1L)+1L;
	if (hilf>S_I_I(n)) {
		if (S_V_LI(v)==1L)
			return(2L); /* kein Fehler aufgetreten, alle Kandidaten aufgelistet  */ 
		else {
			dec(v); 
			inc(S_V_I(v,S_V_LI(v)-1L));
			return (1L);
		}
	}
	else { 
		if ((i==1L) && (lt(S_V_L(v),m))) 
			inc(v); 
		M_I_I(hilf,S_V_I(v,S_V_LI(v)-1L));
		return(1L); /* kein Fehler aufgetreten  */
	}
}

static INT untersuchen4(i,vv,ibasis,b,nv,anz)
	int i,ibasis;
	OP vv,b,nv,anz;
{ 
	int j,k,l;
	for (j=i;j<i+S_V_II(anz,i);++j) {
		if (j==i) {
			copy(S_V_I(vv,i),S_V_I(vv,i+1L));
			if (i<ibasis) {
				k=untersuchen4(i+1L,vv,ibasis,b,nv,anz);
				if (k==0L) return(0L);
			}
		}
		else {
			akt_perm_geord_vektor(S_M_IJ(b,i,j),S_V_I(vv,i),S_V_I(vv,i+1L),nv);
			k=vergleich55(S_V_I(vv,0L),S_V_I(vv,i+1L),i);
			if (k==4L) return(0L);
			else if ((k==2L || (k==3L && j==i)) && (i < ibasis)) {
				l=untersuchen4(i+1L,vv,ibasis,b,nv,anz);
				if (l==0L) return(0L); 
				/* es gibt ein lexikogr. kleineres Element im Orbit  */
			}
		}
	}
	return(1L); /* noch kein lexikogr. kleineres Element gefunden   */
}

static INT vergleich55(a,b,j)
	int j;
	OP a,b; 
{
	int i,k,hilf;
	hilf=comp(a,b);
	if (hilf>0L) return(4L); /* a > b   */
	if (hilf==0L) return(3L); /* a = b   */
	i=0L;
	while (S_V_II(a,i)==S_V_II(b,i)) ++i;
	if (S_V_II(a,i)<=j+1L) return(1L);
	/* a < b  und sie unterscheiden sich an der j-ten Stelle   */
	else return(2L); /* a < b */
}

static INT akt_perm_geord_vektor(perm,vektor1,vektor2,nvektor)
	OP perm,vektor1,vektor2,nvektor;
{
	INT i,hilf;
	for (i=0L;i<S_V_LI(vektor1);++i)
		M_I_I(1L,S_V_I(nvektor,S_P_II(perm,S_V_II(vektor1,i)-1L)-1L));
	hilf=0L;
	for (i=0L;i<S_V_LI(nvektor);++i) {
		if (S_V_II(nvektor,i)==1L) {
			M_I_I(i+1L,S_V_I(vektor2,hilf));
			M_I_I(0L,S_V_I(nvektor,i));
			++hilf; 
		}
	}
}

static INT erster_kandidat_h(n,v)
	OP v;
	INT n;
{
	int i;
	m_il_v(n,v);
	for (i=0L;i<n;M_I_I(1L,S_V_I(v,i)),++i)
		;
	return(1L);
}