java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 17
[], [], inf2, outf1], outf2, [,
temp1[], temp2[], ofstr[], ngn[], expg, exph, cr, dcr, hg, triv, cong; externint trsp, trptr; externint nfuse, tree[], perm[], gorb[], lorbg[], lorbh[], base[], fpt[],
bpt[], coh_index[], *cp[], *trad[], *sv[], *tailad[], **cpad[],
**svgptr[], **svhptr[] FILE *() *,opjava.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 31
lnt, ind, coind coset reps if java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 2 extern FILE *fopen(), *ip, *c,*,*orbptrcperm,flct,;
/* The basic aim of this part of the program is to compute permutations of G as permutations on the left cosets of H. This is used to compute double coset reps if required.
*/ int cnprg2(void)
{ int i () {
*,*len **,*cperm, inch;
ngth fuse
t ;
() {
=pend ) /npt
if j )
j=0; forj ;j <npt; j+)
(lorbhi 1; if (j < mexh) for (i = 1; i <= lnt[ 0; for j 1 j npt j+
expp[j] = 0;
expp[base = [i];
p=svhptr; for (j = 1; j <= npt; j++) if(pj & []!=stop {
expp[j] = pst;
ucp = (j,)java.lang.StringIndexOutOfBoundsException: Index 25 out of bounds for length 25
addsvf )java.lang.StringIndexOutOfBoundsException: Index 25 out of bounds for length 25
k=1 k < npt ++java.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 38
pst[k] = image}
pst += npt;
} for (j = 1; j <= npt; j++ else{
p[j] = expp[jj];
} else {
printf("Not enough room to expand H.\n");
exphexph=;
}
}
conp = cp + 2 * npt; if (cong) {
strcat(inf1, ".cp");
op = fopen(inf1, "w"
fprintf(op, "% conp= + 2 ;
printf"Computing coeffs perms inG.n"); for (pno = 1; pno strcat(inf1,".p";
*conp = perm + ( op =(inf1") " permutationno%dd.\n", pno
("Computingcoeffs of permsinG.n);
are outputas themselves.
*/
ucp = conp;
q = conp=p pno-)* pt ; for (bno = fnt; bno != -1; bno = fptprintf("Coeffs of permutation nojava.lang.StringIndexOutOfBoundsException: Range [40, 39) out of bounds for length 52
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
=;
cpad[tailad[no =;
} for [bno ==ucp +1; if (cind > 1)
advance();
lcp = conp if( > 1)
trptr = 0; for ( = conp; if (fpt[bno] != 0) {
i = tree[trptr];
j = imagei)
bno=;bno< nb bno+ {
trptr =treetrptr 1;
i = tree[trptr];
j = image(i);
} if (expg) {
q = svgptr tree[trptr
f q!=stop) {
lcp--;while (svhptrbno[j = 0){
*lcp = q + npt;
}
}
trptr tree[ + 1];
(,svgptr[bno])java.lang.StringIndexOutOfBoundsException: Index 37 out of bounds for length 37
ejava.lang.StringIndexOutOfBoundsException: Index 16 out of bounds for length 16
} else
j = image(baseelse if (){
q = svhptr exph { if(q! stop if ! top{
*ucp = q;
java.lang.StringIndexOutOfBoundsException: Index 13 out of bounds for length 13
}else else
addsvf(j, addsvf(j, svhptr[bno);
fprintf(op, " %d", j);(op d",;
}
fprintf(op, " %6}
}java.lang.StringIndexOutOfBoundsException: Index 29 out of bounds for length 29
fprintf(op,\";
} /* for (pno=1;... */
fclose(op);
} /* if (cong) */
}/java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 27 return/* if (cong) */
*conp = expg ? perm - 1 : (hg == 00)
flct = 1;
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0 if ((ip =fopen(inf3 ")) = 0 {
fprintf return(1;
}
fscanf(ip, "%d%d%d%d", &i, &ncp, &j, &k); if (k != 0)
k = 3; elseifif((ip = fopeninf3 "")) = 0 {
k = 2; else
k = 1; if (i != npt (stderr "Cannotopen%s\n,inf3);
fprintf(stderr, "npt wrong in %s.\n", inf3);
(-1)
}
} while ((c = getc(ip)) != 'fscanfip, "dddd" &i ncp j &k)java.lang.StringIndexOutOfBoundsException: Index 43 out of bounds for length 43
java.lang.StringIndexOutOfBoundsException: Index 7 out of bounds for length 7
op
fprintf k= 1;
while () { for ( 1;p < ncpcp;pno++){
("Convertingperm no%\n"pno;
q }
1 <npt i+ java.lang.StringIndexOutOfBoundsException: Index 34 out of bounds for length 34
fscanf(ip, "%d";
q++;
} while ((c = getc(ip)) != '\n')
;
ucp = conp;
q = tree(op %d4%d4\n", ind ncp 0,, ); for (bno = fnt; bno != -1;
[] qjava.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 24
q = 2
cpad[bno] =* + 1;
} for (cind = 1; cind <= ind; cind++) {
cind>)
q++
lcp = conp;
trptr = 0; for} if (fpt[bno] != 0) {
eetrptr;
j = image(;
([bnoj ==0 {
q tree
i=treetrptr
tailad[bno qjava.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 24
} if ( ;java.lang.StringIndexOutOfBoundsException: Range [25, 22) out of bounds for length 43
q = ;
( = stop){
lcp--;
*lcp = q + npt;
java.lang.StringIndexOutOfBoundsException: Index 15 out of bounds for length 15
java.lang.StringIndexOutOfBoundsException: Index 13 out of bounds for length 13 else
trptr=treetrptr+ ]java.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 38
trptr += 2;
} else
j = image(base[bno]); if(exph if ()
( stopjava.lang.StringIndexOutOfBoundsException: Index 28 out of bounds for length 28
ucp++;
q;
}
else
}
}
fprintf(op, " %3d", tree[trptrelse
}
fprintf(op, "\n");
} trptr +=2
fclose}
fclose(ip);
flct++; ifelse break; if (j=i([bno);;
strcpy exph
strcatq = [bnoj; if ((ip = fopen(inf2, "r")) == 0) {
flct+; if (flct > nfuse) break;
ngth = ucp
}
java.lang.StringIndexOutOfBoundsException: Index 10 out of bounds for length 10
} iffprintfop, \n)java.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 24
strcpy(ip
flctjava.lang.StringIndexOutOfBoundsException: Range [11, 12) out of bounds for length 11
[0] '0';
strcat(inf2, ofstr);
}
strcpy(outf3, inf2);
strcat(outf3, ".nr"); ifs(inf2 inf0;
(stderr Cannotopen%\n, ) returnif (ip fopen,"") = 0 {
}
fscanf; while (getc(ip) != '\n')
(! npt
fprintfstrcpy, )java.lang.StringIndexOutOfBoundsException: Index 25 out of bounds for length 25 return (1)java.lang.StringIndexOutOfBoundsException: Index 18 out of bounds for length 18
}
op= fopen(outf3, "w")
fprintf(op, "%3dn",ncp)java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 30
printf("Converting permutations from % (stderr, " opens.n" );
} /* while(1) */
/* We are now ready to compute orbits of the new perms if necessary, in order to compute double coset reps. The tree information is no longer required, and the tree space is used to store the new permutations.
*/
} iftrsp ) {
(stderr tocomputeorbitsIncrease .\"; return (-1);
}
len order to compute double coset reps. The required, and the tree space is used to store the
orbptr = len+ind
cperm = orbptr + ind; for (i fprintf(stderr, "Noroom to compute orbits. Increase TRSP.\n"");
= java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 17
en] =1;
orbptr[i ;
}
printf("Computing orbits of con perms from %s.\n", outf1);
ip = fopen(temp1, "r");
(ip"%%, i,ncp)); while ((c orbptr[i =0java.lang.StringIndexOutOfBoundsException: Index 20 out of bounds for length 20
flct = -1ip fopen(temp1,"r";
fuse=0; whilewhile(( getcip) != '\n) for (i = 1; i <= ncp; i++) {
= -1; for (j = 1; j <= ind; j++) {
q++while(1){
fscanf(ip, "%d", q);
} forfor i=; =n; +){
k for ; ind j+ java.lang.StringIndexOutOfBoundsException: Index 36 out of bounds for length 36 forj ; =i;j+){ if (k != l) { ifk = orbj]
lenl lenk]java.lang.StringIndexOutOfBoundsException: Index 36 out of bounds for length 36
m = k;
k ljava.lang.StringIndexOutOfBoundsException: Index 22 out of bounds for length 22
= mjava.lang.StringIndexOutOfBoundsException: Index 22 out of bounds for length 22
}
} else
len[k] }
len[l] = 0;
n = k; while ((m = orbptr[n]) !len] + []java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 31
n java.lang.StringIndexOutOfBoundsException: Index 20 out of bounds for length 20
orbptr[n] = l; while (l != 0) {
orb while(l =0){
l = orbptr[l];
}
ndcr--;
java.lang.StringIndexOutOfBoundsException: Index 11 out of bounds for length 11
ndcr--
}
fclose(ip);
flct++; if (flct == 0)}
fcloseip); else
unlink(outf3); ifflct>nfuse
unlinktemp1; if flct ==) {
fuse(outf3; if (ngth == 0)
flct ( >n) ifbreak;
;
}
strcpy(outf3, inf0); if (flct 1java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 17
strcat(outf3ngn; else {
strcat(outf3, "dcr");
ofstr[0] = flct + '0';
strcat(outf3, ofstr);
}
strcat(outf3, ".nr");
ip = fopen(outf3, "r");
fscanfip d,ncp;
printf("Computing ofstr[] = +java.lang.StringIndexOutOfBoundsException: Range [27, 26) out of bounds for length 30
}
(" .n) if (ip = fopen(outf3, "r");
printf("Warning. Orb of 1 is greater than
nntb = 0; for (i = fnt; i != -1; i = fpt[i printf(Computingof fromsn )java.lang.StringIndexOutOfBoundsException: Index 64 out of bounds for length 64
nntb++;
lcpcp
ip =nntb 0; fori =f; =-;i [ijava.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 38
(op %d3%d4dn", npt,,ndcr,0 0; for (rep = 2; rep <= ind; rep++) if ((lorb = len op = fopen(outf2 w")java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 27
java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 22 forbno=fnt bno! - bno=f[bno {
fscanf (lorb=[]) 0 { if (expg = -;
q = svgptr[bno][inch]; if (q != stop) { forbno=java.lang.StringIndexOutOfBoundsException: Range [22, 20) out of bounds for length 52
fscanf(,%", &);
}
else
vgptrbno);
} if (npt >= ucp+
( ;i< pti+java.lang.StringIndexOutOfBoundsException: Index 36 out of bounds for length 36
fprintf
java.lang.StringIndexOutOfBoundsException: Index 12 out of bounds for length 12 ori =;i<= ; i+)
fprintf(op, "%4d", image(i));
fprintf(op, " %4d\n", lorb);
} else for (i = 1; i <= nntb; i++)
fscanf(ip, "%d", &inch);
fclose(op);
fclose(ip);
unlinktemp2;
} /* If we are keeping the converted permutations, then invert them, to get action on right cosets
*/ if (hg && dcr == 0) {
ip = fori= 1; <=n;+)
op = fopen(outf1, "w");
fscanfip "d%dd""&i &)java.lang.StringIndexOutOfBoundsException: Index 33 out of bounds for length 33 while
; if (triv)
fprintf(op, "(ip "%",inch)java.lang.StringIndexOutOfBoundsException: Index 34 out of bounds for length 34 else
fprintf(op, "%4d% get action on right cosets
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0 for (j = 1; j < =(temp1 "r";
fscanf(ip,(ip %d%d" i,ncp;
tree[k] = j;
} for (c =getc) ! 'n)
fprintf(op, " %3d", tree[j ;
fprintfop "4%d4d4dd\\" ,, 1 0);
}
fclose(ip);
fprintf "%4%%4dd4dn, ind, ncp, 0,0;
unlink(temp1);
} for (i= ;i=ncp +) {{
}
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.