File size: 267,816 Bytes
803451e | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 | {"text": "Class(Dot_X, BaseOperation, rec(\n __call__ := (self, sr, x_n, s1, s2, range) >> SPL(WithBases(self, rec(\n sr := Checked(IsSemiring(sr), sr),\n start1 := s1,\n start2 := s2,\n range := range,\n x_n := x_n,\n _children := [range]\n ))),\n dims := self >> [self.x_n, V(1)],\n from_rChildren := (self, rch) >> CopyFields(self, rec(_children := rch)),\n doNotMarkBB := true,\n print := (self, i, is) >> Print(\n self.name, \"(\", self.sr, \", \", self.start1, \", \", self.start2, \", \", self.range, \")\"\n )\n));\n\nClass(Accum_X, BaseOperation, rec(\n __call__ := (self, sr, x_n, var, st, range, func) >> SPL(WithBases(self, rec(\n sr := Checked(IsSemiring(sr), sr),\n var := var,\n start := st,\n range := range,\n func := self >> self._children[1],\n x_n := x_n,\n _children := [func, range]\n ))),\n dims := self >> [self.x_n, V(1)],\n from_rChildren := (self, rch) >> CopyFields(self, rec(_children := rch)),\n doNotMarkBB := true,\n print := (self, i, is) >> Print(\n self.name, \"(\", self.sr, \", \", self.var, \", \", self.start, \", \", self.range, \",\\n\",\n Blanks(i+is), self.func().print(i+is, is), \"\\n\",\n Blanks(i), \")\"\n\t)\n));\n\nClass(Scat_E, BaseOperation, rec(\n __call__ := (self, sr, x_n, v1, v2, range, svar, func) >> SPL(WithBases(self, rec(\n sr := Checked(IsSemiring(sr), sr),\n v1 := v1,\n v2 := v2,\n range := range,\n svar := svar,\n func := self >> self._children[1],\n x_n := x_n,\n _children := [func, range]\n ))),\n dims := self >> [self.x_n, V(1)],\n from_rChildren := (self, rch) >> CopyFields(self, rec(_children := rch)),\n doNotMarkBB := true,\n print := (self, i, is) >> Print(\n self.name, \"(\", self.sr, \", \", self.v1, \", \", self.v2, \", \", self.range, \", \", self.svar, \",\\n\",\n Blanks(i+is), self.func().print(i+is, is), \"\\n\",\n Blanks(i), \")\"\n )\n));\n\nClass(SMP_Scat_E, BaseOperation, rec(\n __call__ := (self, sr, x_n, v1, v2, range, svar, func, nthreads) >> SPL(WithBases(self, rec(\n sr := Checked(IsSemiring(sr), sr),\n v1 := v1,\n v2 := v2,\n range := range,\n svar := svar,\n func := self >> self._children[1],\n x_n := x_n,\n nthreads := nthreads,\n _children := [func, range]\n ))),\n dims := self >> [self.x_n, V(1)],\n from_rChildren := (self, rch) >> CopyFields(self, rec(_children := rch)),\n doNotMarkBB := true,\n print := (self, i, is) >> Print(\n self.name, \"(\", self.sr, \", \", self.v1, \", \", self.v2, \", \", self.range, \", \", self.svar, \",\\n\",\n Blanks(i+is), self.func().print(i+is, is), \"\\n\",\n Blanks(i), \")\"\n )\n));\n\nClass(CheckEdgesUpdate, BaseOperation, rec(\n __call__ := (self, edges, var, func) >> SPL(WithBases(self, rec(\n edges := edges,\n var := var,\n func := self >> self._children[1],\n _children := [func]\n ))),\n dims := self >> [self.edges, V(1)],\n from_rChildren := (self, rch) >> CopyFields(self, rec(_children := rch)),\n doNotMarkBB := true,\n print := (self, i, is) >> Print(\n self.name, \"(\", self.edges, \", \", self.var, \",\\n\",\n Blanks(i+is), self.func().print(i+is, is), \"\\n\",\n Blanks(i), \")\"\n )\n));\n\nClass(PruneEdges, BaseOperation, rec(\n __call__ := (self, idx, range, var, x_n, s, k) >> SPL(WithBases(self, rec(\n idx := idx,\n range := range,\n var := var,\n x_n := x_n,\n s := s,\n k := k,\n _children := [range, k]\n ))),\n dims := self >> [self.x_n, V(1)],\n from_rChildren := (self, rch) >> CopyFields(self, rec(_children := rch)),\n doNotMarkBB := true,\n print := (self, i, is) >> Print(\n self.name, \"(\", self.idx, \", \", self.range, \", \", self.var, \", \", self.s, \", \", self.k, \")\"\n )\n));\n\nClass(Accum, BaseOperation, rec(\n __call__ := (self, sr, var, range_min, range_max, func) >> SPL(WithBases(self, rec(\n sr := Checked(IsSemiring(sr), sr),\n var := var,\n range_min := range_min,\n range_max := range_max,\n func := self >> self._children[1],\n _children := [func, range_min, range_max]\n ))),\n dims := self >> self._children[1].dims(),\n from_rChildren := (self, rch) >> CopyFields(self, rec(_children := rch)),\n doNotMarkBB := true,\n print := (self, i, is) >> Print(\n self.name, \"(\", self.sr, \", \", self.var, \", \", self.range_min, \", \", self.range_max, \",\\n\",\n Blanks(i+is), self.func().print(i+is, is), \"\\n\",\n Blanks(i), \")\"\n )\n));\n\nClass(SMP_Accum, BaseOperation, rec(\n __call__ := (self, sr, var, range_min, range_max, func, nthreads) >> SPL(WithBases(self, rec(\n sr := Checked(IsSemiring(sr), sr),\n var := var,\n range_min := range_min,\n range_max := range_max,\n func := self >> self._children[1],\n nthreads := nthreads,\n _children := [func, range_min, range_max]\n ))),\n dims := self >> self._children[1].dims(),\n from_rChildren := (self, rch) >> CopyFields(self, rec(_children := rch)),\n doNotMarkBB := true,\n print := (self, i, is) >> Print(\n self.name, \"(\", self.sr, \", \", self.var, \", \", self.range_min, \", \", self.range_max, \",\\n\",\n Blanks(i+is), self.func().print(i+is, is), \"\\n\",\n Blanks(i), \")\"\n )\n));\n\nClass(Assign_Ptr, BaseOperation, rec(\n __call__ := (self, func) >> SPL(WithBases(self, rec(\n func := self >> self._children[1],\n _children := [func]\n ))),\n dims := self >> self._children[1].dims(),\n from_rChildren := (self, rch) >> CopyFields(self, rec(_children := rch)),\n doNotMarkBB := true,\n print := (self, i, is) >> Print(\n self.name, \"(\\n\",\n Blanks(i+is), self.func().print(i+is, is), \"\\n\",\n Blanks(i), \")\"\n )\n));\n\nClass(Scale_Pt, BaseOperation, rec(\n __call__ := (self, scalar, func) >> SPL(WithBases(self, rec(\n scalar := scalar,\n func := self >> self._children[1],\n _children := [func]\n ))),\n dims := self >> self._children[1].dims(),\n from_rChildren := (self, rch) >> CopyFields(self, rec(_children := rch)),\n doNotMarkBB := true,\n print := (self, i, is) >> Print(\n self.name, \"(\", self.scalar, \",\\n\",\n Blanks(i+is), self.func().print(i+is, is), \"\\n\",\n Blanks(i), \")\"\n )\n));\n\nClass(IterateIndefinite, BaseOperation, rec(\n __call__ := (self, op1, op2) >> SPL(WithBases(self, rec(\n op1 := self >> self._children[1],\n op2 := self >> self._children[2],\n _children := [op1, op2]\n ))),\n dims := self >> [V(1), V(1)],\n from_rChildren := (self, rch) >> CopyFields(self, rec(_children := rch)),\n doNotMarkBB := true,\n print := (self, i, is) >> Print(\n self.name, \"(\\n\",\n Blanks(i+is), self.op1().print(i+is, is), \"\\n\",\n Blanks(i+is), self.op2().print(i+is, is), \"\\n\",\n Blanks(i), \")\"\n )\n));\n\nClass(KTrussWrap, BaseOperation, rec(\n __call__ := (self, s, body) >> SPL(WithBases(self, rec(\n s := s,\n body := self >> self._children[1],\n _children := [body]\n ))),\n dims := self >> [V(1), V(1)],\n from_rChildren := (self, rch) >> CopyFields(self, rec(_children := rch)),\n doNotMarkBB := true,\n print := (self, i, is) >> Print(\n self.name, \"(\", self.s, \"\\n\",\n Blanks(i+is), self.body().print(i+is, is), \"\\n\",\n Blanks(i), \")\"\n )\n));\n\nClass(loopw, Command, rec(\n __call__ := (self, cond, cmd) >> WithBases(self, rec(\n cond := toExpArg(cond),\n cmd := Checked(IsCommand(cmd), cmd),\n operations := CmdOps\n )),\n rChildren := self >> [self.cond, self.cmd],\n rSetChild := rSetChildFields(\"cond\", \"cmd\"),\n print := (self, i, si) >> Print(self.__name__, \"(\", self.cond, \",\\n\",\n Blanks(i+si), self.cmd.print(i+si, si), \"\\n\",\n Blanks(i), \")\"\n )\n));\n\nClass(loopf, Command, rec(\n __call__ := (self, var, range_min, range_max, cmd) >> WithBases(self, rec(\n var := var,\n range_min := range_min,\n range_max := range_max,\n cmd := Checked(IsCommand(cmd), cmd),\n operations := CmdOps\n )),\n rChildren := self >> [self.var, self.range_min, self.range_max, self.cmd],\n rSetChild := rSetChildFields(\"var\", \"range_min\", \"range_max\", \"cmd\"),\n print := (self, i, si) >> Print(self.__name__, \"(\", self.var, \", \", self.range_min, \", \", self.range_max, \",\\n\",\n Blanks(i+si), self.cmd.print(i+si, si), \"\\n\",\n Blanks(i), \")\"\n )\n));\n\nClass(smp_reduct_loopf, Command, rec(\n __call__ := (self, sr, var, range_min, range_max, y, nthreads, cmd) >> WithBases(self, rec(\n sr := sr,\n var := var,\n range_min := range_min,\n range_max := range_max,\n y := y,\n nthreads := nthreads,\n cmd := Checked(IsCommand(cmd), cmd),\n operations := CmdOps\n )),\n rChildren := self >> [self.sr, self.var, self.range_min, self.range_max, self.y, self.nthreads, self.cmd],\n rSetChild := rSetChildFields(\"sr\", \"var\", \"range_min\", \"range_max\", \"y\", \"nthreads\", \"cmd\"),\n print := (self, i, si) >> Print(self.__name__, \"(\", self.var, \", \", self.range_min, \", \", self.range_max, \", \", self.nthreads, \",\\n\",\n Blanks(i+si), self.cmd.print(i+si, si), \"\\n\",\n Blanks(i), \")\"\n )\n));\n\nClass(smp_loopf, Command, rec(\n __call__ := (self, var, range_min, range_max, nthreads, cmd) >> WithBases(self, rec(\n var := var,\n range_min := range_min,\n range_max := range_max,\n nthreads := nthreads,\n cmd := Checked(IsCommand(cmd), cmd),\n operations := CmdOps\n )),\n rChildren := self >> [self.var, self.range_min, self.range_max, self.nthreads, self.cmd],\n rSetChild := rSetChildFields(\"var\", \"range_min\", \"range_max\", \"nthreads\", \"cmd\"),\n print := (self, i, si) >> Print(self.__name__, \"(\", self.var, \", \", self.range_min, \", \", self.range_max, \", \", self.nthreads, \",\\n\",\n Blanks(i+si), self.cmd.print(i+si, si), \"\\n\",\n Blanks(i), \")\"\n )\n));\n\nClass(if1, Command, rec(\n __call__ := (self, if_cond, if_cmd) >> WithBases(self, rec(\n if_cond := toExpArg(if_cond),\n if_cmd := Checked(IsCommand(if_cmd), if_cmd),\n operations := CmdOps\n )),\n rChildren := self >> [self.if_cond, self.if_cmd],\n rSetChild := rSetChildFields(\"if_cond\", \"if_cmd\"),\n print := (self, i, si) >> Print(self.__name__, \"(\", self.if_cond, \",\\n\",\n Blanks(i+si), self.if_cmd.print(i+si, si), \"\\n\",\n Blanks(i), \")\"\n )\n));\n\nClass(if2, Command, rec(\n __call__ := (self, if_cond, if_cmd, ei_cond, ei_cmd, else_cmd) >> WithBases(self, rec(\n if_cond := toExpArg(if_cond),\n if_cmd := Checked(IsCommand(if_cmd), if_cmd),\n else_cmd := Checked(IsCommand(else_cmd), else_cmd),\n operations := CmdOps\n )),\n rChildren := self >> [self.if_cond, self.if_cmd, self.else_cmd],\n rSetChild := rSetChildFields(\"if_cond\", \"if_cmd\", \"else_cmd\"),\n print := (self, i, si) >> Print(self.__name__, \"(\", self.if_cond, \",\\n\",\n Blanks(i+si), self.if_cmd.print(i+si, si), \",\\n\",\n Blanks(i+si), self.else_cmd.print(i+si, si), \"\\n\",\n Blanks(i), \")\"\n )\n));\n\nClass(if3, Command, rec(\n __call__ := (self, if_cond, if_cmd, ei_cond, ei_cmd, else_cmd) >> WithBases(self, rec(\n if_cond := toExpArg(if_cond),\n if_cmd := Checked(IsCommand(if_cmd), if_cmd),\n ei_cond := toExpArg(ei_cond),\n ei_cmd := Checked(IsCommand(ei_cmd), ei_cmd),\n else_cmd := Checked(IsCommand(else_cmd), else_cmd),\n operations := CmdOps\n )),\n rChildren := self >> [self.if_cond, self.if_cmd, self.ei_cond, self.ei_cmd, self.else_cmd],\n rSetChild := rSetChildFields(\"if_cond\", \"if_cmd\", \"ei_cond\", \"ei_cmd\", \"else_cmd\"),\n print := (self, i, si) >> Print(self.__name__, \"(\", self.if_cond, \",\\n\",\n Blanks(i+si), self.if_cmd.print(i+si, si), \",\\n\",\n Blanks(i+si), self.ei_cond, \",\\n\",\n Blanks(i+si), self.ei_cmd.print(i+si, si), \",\\n\",\n Blanks(i+si), self.else_cmd.print(i+si, si), \"\\n\",\n Blanks(i), \")\"\n )\n));\n\nClass(break_ic, Command, rec(\n __call__ := (self) >> WithBases(self, rec(\n operations := CmdOps\n )),\n rChildren := self >> [],\n rSetChild := rSetChildFields(),\n print := (self, i, si) >> Print(self.__name__, \"()\")\n));\n\nCUnparser.loopw := (self,o,i,is) >> Print(Blanks(i),\n \"while (\", self(o.cond,i,is), \") {\\n\",\n self(o.cmd,i+is,is), Blanks(i), \"}\\n\");\n\nCUnparser.loopf := (self,o,i,is) >> Print(Blanks(i),\n \"for (int \", o.var, \" = \", self(o.range_min,i,is), \"; \", o.var, \" < \", self(o.range_max,i,is), \"; \", o.var, \"++) {\\n\",\n self(o.cmd,i+is,is), Blanks(i), \"}\\n\");\n\nCUnparser.smp_reduct_loopf := (self,o,i,is) >> Print(Blanks(i),\n \"#pragma omp parallel for schedule(dynamic) reduction(\", o.sr.OpenMP_sum, \":\", o.y, \") num_threads(\", o.nthreads, \")\\n\",\n Blanks(i), \"for (int \", o.var, \" = \", self(o.range_min,i,is), \"; \", o.var, \" < \", self(o.range_max,i,is), \"; \", o.var, \"++) {\\n\",\n self(o.cmd,i+is,is), Blanks(i), \"}\\n\");\n\nCUnparser.smp_loopf := (self,o,i,is) >> Print(Blanks(i),\n \"#pragma omp parallel for schedule(dynamic) num_threads(\", o.nthreads, \")\\n\",\n Blanks(i), \"for (int \", o.var, \" = \", self(o.range_min,i,is), \"; \", o.var, \" < \", self(o.range_max,i,is), \"; \", o.var, \"++) {\\n\",\n self(o.cmd,i+is,is), Blanks(i), \"}\\n\");\n\nCUnparser.if1 := (self,o,i,is) >> Print(Blanks(i),\n \"if (\", self(o.if_cond,i,is), \") {\\n\", self(o.if_cmd,i+is,is), Blanks(i), \"}\\n\");\n\nCUnparser.if2 := (self,o,i,is) >> Print(Blanks(i),\n \"if (\", self(o.if_cond,i,is), \") {\\n\", self(o.if_cmd,i+is,is), Blanks(i), \"}\",\n \" else {\\n\", self(o.else_cmd,i+is,is), Blanks(i), \"}\\n\");\n\nCUnparser.if3 := (self,o,i,is) >> Print(Blanks(i),\n \"if (\", self(o.if_cond,i,is), \") {\\n\", self(o.if_cmd,i+is,is), Blanks(i), \"}\",\n \" else if (\", self(o.ei_cond,i,is), \") {\\n\", self(o.ei_cmd,i+is,is), Blanks(i), \"}\",\n \" else {\\n\", self(o.else_cmd,i+is,is), Blanks(i), \"}\\n\");\n\nCUnparser.break_ic := (self,o,i,is) >> Print(Blanks(i),\n \"break;\\n\");\n\nClass(VMV_X, TaggedNonTerminal, rec(\n __call__ := (self, sr, s1, sm, s2, d1, d2, x_n) >> WithBases(self, rec(\n sr := Checked(IsSemiring(sr), sr),\n start1 := s1,\n startm := sm,\n start2 := s2,\n d1 := d1,\n d2 := d2,\n x_n := x_n,\n params := []\n )),\n isReal := self >> true,\n dims := self >> [self.x_n, V(1)]\n));\n\nClass(TriangleCount, TaggedNonTerminal, rec(\n abbrevs := [ (n) -> [n] ],\n isReal := self >> true,\n dims := self >> [self.params[1], self.params[1]]\n));\n\nClass(KTruss, TaggedNonTerminal, rec(\n abbrevs := [ (n, m, k) -> [n, m, k] ],\n isReal := self >> true,\n dims := self >> [self.params[1], self.params[1]]\n));\n\nClass(TriangleCountEdges, TaggedNonTerminal, rec(\n abbrevs := [ (n, m, s) -> [n, m, s] ],\n isReal := self >> true,\n dims := self >> [self.params[1], self.params[1]]\n));\n\nClass(KTrussPrune, TaggedNonTerminal, rec(\n abbrevs := [ (n, m, k, s) -> [n, m, k, s] ],\n isReal := self >> true,\n dims := self >> [self.params[1], self.params[1]]\n));\n\nNewRulesFor(VMV_X, rec(\n Accum_X_Dot := rec(\n info := \"Selective accumulation of dot products <Mi,v2> over existing elements in v1\",\n maxSize := false,\n applicable := (self, t) >> true,\n apply := (nt, C, ct) -> let(i := Ind(), sr := nt.sr, x_n := nt.x_n,\n Accum_X(sr, x_n, i, nt.start1, nt.d1, Dot_X(sr, x_n, [i, nt.startm[2]], nt.start2, nt.d2)))\n )\n));\n\nNewRulesFor(TriangleCount, rec(\n Accum_VMV_FLAME1 := rec(\n info := \"FLAME Approach #1\",\n maxSize := false,\n applicable := nt -> not nt.hasTags(),\n children := (self, nt) >> let(i := Ind(), n := nt.params[1], sr := TSemiring_Arithmetic(n.t),\n [[ VMV_X(sr, [i, V(0)], [V(0), V(0)], [i, V(0)], i, i, n) ]]),\n apply := (nt, C, ct) -> let(i := C[1]._children[1].rt.node.d1, n := nt.params[1], sr := TSemiring_Arithmetic(n.t),\n Assign_Ptr(Scale_Pt(V(0.5), Accum(sr, i, V(1), n, C[1]))))\n ),\n Accum_VMV_FLAME2 := rec(\n info := \"FLAME Approach #2\",\n maxSize := false,\n applicable := nt -> not nt.hasTags(),\n children := (self, nt) >> let(i := Ind(), n := nt.params[1], sr := TSemiring_Arithmetic(n.t),\n [[ VMV_X(sr, [i, V(0)], [V(0), i+1], [i, i+1], i, n-i-1, n) ]]),\n apply := (nt, C, ct) -> let(i := C[1]._children[1].rt.node.d1, n := nt.params[1], sr := TSemiring_Arithmetic(n.t),\n Assign_Ptr(Accum(sr, i, V(1), n-1, C[1])))\n ),\n Accum_VMV_FLAME4 := rec(\n info := \"FLAME Approach #4\",\n maxSize := false,\n applicable := nt -> not nt.hasTags(),\n children := (self, nt) >> let(i := Ind(), n := nt.params[1], sr := TSemiring_Arithmetic(n.t),\n [[ VMV_X(sr, [i-1, i], [i, i], [i-1, i], n-i, n-i, n) ]]),\n apply := (nt, C, ct) -> let(i := C[1]._children[1].rt.node.startm[1], n := nt.params[1], sr := TSemiring_Arithmetic(n.t),\n Assign_Ptr(Scale_Pt(V(0.5), Accum(sr, i, V(1), n, C[1]))))\n ),\n Accum_VMV_FLAME2_SMP := rec(\n info := \"FLAME Approach #2\",\n maxSize := false,\n applicable := nt -> nt.hasTags(),\n children := (self, nt) >> let(i := Ind(), n := nt.params[1], sr := TSemiring_Arithmetic(n.t),\n [[ VMV_X(sr, [i, V(0)], [V(0), i+1], [i, i+1], i, n-i-1, n) ]]),\n apply := (nt, C, ct) -> let(i := C[1]._children[1].rt.node.d1, n := nt.params[1], sr := TSemiring_Arithmetic(n.t),\n Assign_Ptr(SMP_Accum(sr, i, V(1), n-1, C[1], nt.firstTag().params[1])))\n )\n));\n\nNewRulesFor(KTruss, rec(\n TC_Support_Prune := rec(\n info := \"Triangle Count for Support, then Prune. Iterate\",\n maxSize := false,\n applicable := nt -> not nt.hasTags(),\n children := (self, nt) >> let(n := nt.params[1], m := nt.params[2], k := nt.params[3], s := var.fresh_t(\"s\", TArray(TInt, nt.params[2])),\n [[ TriangleCountEdges(n, m, s), KTrussPrune(n, m, k, s) ]]),\n apply := (nt, C, ct) -> Assign_Ptr(Scale_Pt(V(0.5), IterateIndefinite(C[1], C[2])))\n ),\n TC_Support_Prune_SMP := rec(\n info := \"Triangle Count for Support, then Prune. Iterate\",\n maxSize := false,\n applicable := nt -> nt.hasTags(),\n children := (self, nt) >> let(n := nt.params[1], m := nt.params[2], k := nt.params[3], s := var.fresh_t(\"s\", TArray(TInt, nt.params[2])),\n [[ TriangleCountEdges(n, m, s).withTags(nt.tags), KTrussPrune(n, m, k, s) ]]),\n apply := (nt, C, ct) -> Assign_Ptr(Scale_Pt(V(0.5), IterateIndefinite(C[1], C[2])))\n )\n));\n\nNewRulesFor(TriangleCountEdges, rec(\n Endpoint_Row_Dot := rec(\n info := \"Dot products of rows corresponding to endpoints of each edge\",\n maxSize := false,\n applicable := nt -> not nt.hasTags(),\n apply := (nt, C, ct) -> let(v1 := var.fresh_t(\"v\", TInt), v2 := var.fresh_t(\"v\", TInt), n := nt.params[1], m := nt.params[2], s := nt.params[3], sr := TSemiring_Arithmetic(n.t),\n Scat_E(sr, n, v1, v2, m, s, Dot_X(sr, n, [v1, 1], [v2, 1], n)))\n ),\n Endpoint_Row_Dot_SMP := rec(\n info := \"Dot products of rows corresponding to endpoints of each edge\",\n maxSize := false,\n applicable := nt -> nt.hasTags(),\n apply := (nt, C, ct) -> let(v1 := var.fresh_t(\"v\", TInt), v2 := var.fresh_t(\"v\", TInt), n := nt.params[1], m := nt.params[2], s := nt.params[3], sr := TSemiring_Arithmetic(n.t),\n SMP_Scat_E(sr, n, v1, v2, m, s, Dot_X(sr, n, [v1, 1], [v2, 1], n), nt.firstTag().params[1]))\n )\n));\n\nNewRulesFor(KTrussPrune, rec(\n Check_Support_Prune := rec(\n info := \"Eliminate edges without enough support and break if nothing changes\",\n maxSize := false,\n applicable := nt -> not nt.hasTags(),\n apply := (nt, C, ct) -> let(i := Ind(), v := var.fresh_t(\"v\", TInt), n := nt.params[1], m := nt.params[2], k := nt.params[3], s := nt.params[4],\n CheckEdgesUpdate(m, v, PruneEdges(i, m, v, n, s, k)))\n )\n));\n\nDefaultSumsGen.Accum := (self, o, opts) >> Accum(o.sr, o.var, o.range_min, o.range_max, self(o.func(), opts));\n\nDefaultSumsGen.Accum_X := (self, o, opts) >> Accum_X(o.sr, o.x_n, o.var, o.start, o.range, self(o.func(), opts));\n\nDefaultSumsGen.Scat_E := (self, o, opts) >> Scat_E(o.sr, o.x_n, o.v1, o.v2, o.range, o.svar, self(o.func(), opts));\n\nDefaultSumsGen.SMP_Scat_E := (self, o, opts) >> SMP_Scat_E(o.sr, o.x_n, o.v1, o.v2, o.range, o.svar, self(o.func(), opts), o.nthreads);\n\nDefaultSumsGen.Dot_X := (self, o, opts) >> o;\n\nDefaultSumsGen.CheckEdgesUpdate := (self, o, opts) >> CheckEdgesUpdate(o.edges, o.var, self(o.func(), opts));\n\nDefaultSumsGen.PruneEdges := (self, o, opts) >> o;\n\nDefaultSumsGen.SMP_Accum := (self, o, opts) >> SMP_Accum(o.sr, o.var, o.range_min, o.range_max, self(o.func(), opts), o.nthreads);\n\nDefaultSumsGen.Assign_Ptr := (self, o, opts) >> Assign_Ptr(self(o.func(), opts));\n\nDefaultSumsGen.Scale_Pt := (self, o, opts) >> Scale_Pt(o.scalar, self(o.func(), opts));\n\nDefaultSumsGen.IterateIndefinite := (self, o, opts) >> IterateIndefinite(self(o.op1(), opts), self(o.op2(), opts));\n\nDefaultCodegen.Dot_X := meth(self, o, y, x, opts)\n local j1, j1m, j2, j2m;\n if (IsBound(opts.isCSR) and opts.isCSR) then\n j1 := var.fresh_t(\"j1\", x.t);\n j1m := var.fresh_t(\"j1m\", x.t);\n j2 := var.fresh_t(\"j2\", x.t);\n j2m := var.fresh_t(\"j2m\", x.t);\n return decl([j1, j1m, j2, j2m], chain(\n assign(y, o.sr.zero()),\n assign(j1, add(x, o.x_n, V(1), nth(x, o.start1[1]))),\n assign(j1m, add(x, o.x_n, V(1), nth(x, add(o.start1[1], V(1))))),\n assign(j2, add(x, o.x_n, V(1), nth(x, o.start2[1]))),\n assign(j2m, add(x, o.x_n, V(1), nth(x, add(o.start2[1], V(1))))),\n loopw(logic_and(lt(j1, j1m), lt(deref(j1), o.start1[2])),\n assign(j1, add(j1, V(1)))),\n loopw(logic_and(lt(j2, j2m), lt(deref(j2), o.start2[2])),\n assign(j2, add(j2, V(1)))),\n loopw(logic_and(logic_and(lt(j1, j1m), lt(j2, j2m)), logic_and(lt(deref(j1), add(o.start1[2], o.range)), lt(deref(j2), add(o.start2[2], o.range)))),\n if3(lt(deref(j1), deref(j2)),\n assign(j1, add(j1, V(1))),\n lt(deref(j2), deref(j1)),\n assign(j2, add(j2, V(1))),\n chain(\n assign(y, o.sr.sum(y, V(1))),\n assign(j1, add(j1, V(1))),\n assign(j2, add(j2, V(1))))))));\n fi;\nend;\n\nDefaultCodegen.Accum_X := meth(self, o, y, x, opts)\n local j, jm, t;\n t := var.fresh_t(\"t\", y.t);\n if (IsBound(opts.isCSR) and opts.isCSR) then\n j := var.fresh_t(\"j\", x.t);\n jm := var.fresh_t(\"jm\", x.t);\n return decl([j, jm], chain(\n assign(y, o.sr.zero()),\n assign(j, add(x, o.x_n, V(1), nth(x, o.start[1]))),\n assign(jm, add(x, o.x_n, V(1), nth(x, add(o.start[1], V(1))))),\n loopw(logic_and(lt(j, jm), lt(deref(j), o.start[2])),\n assign(j, add(j, V(1)))),\n loopw(logic_and(lt(j, jm), lt(deref(j), add(o.start[2], o.range))), decl([o.var, t], chain(\n assign(o.var, deref(j)),\n self(o.func(), t, x, opts),\n assign(y, o.sr.sum(y, t)),\n assign(j, add(j, V(1))))))));\n fi;\nend;\n\nDefaultCodegen.Scat_E := meth(self, o, y, x, opts)\n local t, i;\n t := var.fresh_t(\"t\", y.t);\n i := Ind();\n if (IsBound(opts.isCSR) and opts.isCSR) then\n return decl([o.v1, o.svar], chain(\n assign(o.v1, V(0)),\n loopf(i, V(0), o.range, decl([t, o.v2], chain(\n loopw(eq(nth(x, add(o.v1, V(1))), i),\n assign(o.v1, add(o.v1, V(1)))),\n assign(o.v2, nth(x, add(o.x_n, V(1), i))),\n self(o.func(), t, x, opts),\n assign(nth(o.svar, i), t))))));\n fi;\nend;\n\nDefaultCodegen.SMP_Scat_E := meth(self, o, y, x, opts)\n local t, i, j;\n t := var.fresh_t(\"t\", y.t);\n i := Ind();\n j := Ind();\n if (IsBound(opts.isCSR) and opts.isCSR) then\n return decl([o.v1, o.svar],\n smp_loopf(i, V(0), o.x_n, o.nthreads,\n loopf(j, nth(x, i), nth(x, add(i, V(1))), decl([o.v1, o.v2, t], chain(\n assign(o.v1, i),\n assign(o.v2, nth(x, add(o.x_n, V(1), j))),\n self(o.func(), t, x, opts),\n assign(nth(o.svar, j), t))))));\n fi;\nend;\n\nDefaultCodegen.CheckEdgesUpdate := meth(self, o, y, x, opts)\n return decl([o.var], chain(\n assign(o.var, V(0)),\n assign(y, o.edges),\n self(o.func(), y, x, opts),\n if1(eq(o.edges, o.var),\n break_ic()),\n assign(o.edges, o.var),\n assign(y, o.var)));\nend;\n\nDefaultCodegen.PruneEdges := meth(self, o, y, x, opts)\n local t;\n t := var.fresh_t(\"t\", y.t);\n if (IsBound(opts.isCSR) and opts.isCSR) then\n return decl([t], chain(\n assign(t, V(0)),\n loopf(o.idx, V(0), o.range, chain(\n loopw(eq(nth(x, add(t, V(1))), o.idx), chain(\n assign(t, add(t, V(1))),\n assign(nth(x, t), o.var))),\n if1(geq(nth(o.s, o.idx), sub(o.k, V(2))), chain(\n assign(nth(x, add(o.x_n, V(1), o.var)), nth(x, add(o.x_n, V(1), o.idx))),\n assign(o.var, add(o.var, V(1))))))),\n assign(nth(x, add(t, V(1))), o.var)));\n fi;\nend;\n\nDefaultCodegen.Accum := meth(self, o, y, x, opts)\n local t;\n t := var.fresh_t(\"t\", y.t);\n return chain(\n assign(y, o.sr.zero()),\n loopf(o.var, o.range_min, o.range_max, decl([t], chain(\n self(o.func(), t, x, opts),\n assign(y, o.sr.sum(y, t))))));\nend;\n\nDefaultCodegen.SMP_Accum := meth(self, o, y, x, opts)\n local t;\n t := var.fresh_t(\"t\", y.t);\n return chain(\n assign(y, o.sr.zero()),\n smp_reduct_loopf(o.sr, o.var, o.range_min, o.range_max, y, o.nthreads, decl([t], chain(\n self(o.func(), t, x, opts),\n assign(y, o.sr.sum(y, t))))));\nend;\n\nDefaultCodegen.Scale_Pt := meth(self, o, y, x, opts)\n return chain(\n self(o.func(), y, x, opts),\n assign(y, mul(o.scalar, y)));\nend;\n\nDefaultCodegen.Assign_Ptr := meth(self, o, y, x, opts)\n local t;\n t := var.fresh_t(\"t\", y.t.t);\n return decl([t], chain(\n self(o._children[1], t, x, opts),\n assign(deref(y), t)));\nend;\n\nDefaultCodegen.IterateIndefinite := meth(self, o, y, x, opts)\n return loopw(V(1), chain(\n self(o.op1(), y, x, opts),\n self(o.op2(), y, x, opts)));\nend;\n\nGraphIndicesCS := [\n c -> Compile.pullDataDeclsRefs(c),\n c -> Compile.fastScalarize(c),\n c -> UnrollCode(c),\n c -> FlattenCode(c),\n c -> UntangleChain(c),\n #(c, opts) -> CopyPropagate.initial(c, opts),\n #(c, opts) -> HashConsts(c, opts),\n #c -> MarkDefUse(c),\n #(c, opts) -> BinSplit(c, opts),\n #c -> MarkDefUse(c),\n #CopyPropagate, # does CSE\n c -> Compile.declareVars(c)\n];\n\nTCDefaults := CopyFields(SpiralDefaults, rec(\n compileStrategy := GraphIndicesCS,\n X := var(\"IJ\", TPtr(TInt)),\n XType := TPtr(TInt),\n arrayDataModifier := \"\",\n arrayBufModifier := \"\",\n Y := var(\"res\", TPtr(TInt)),\n YType := TPtr(TInt),\n isCSR := true,\n));", "meta": {"hexsha": "5bdd85081128dd700c58f01864ff5b2ccd29a05b", "size": 25954, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "namespaces/packages/graph/graph.gi", "max_stars_repo_name": "sr7cb/spiral-software", "max_stars_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_stars_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "namespaces/packages/graph/graph.gi", "max_issues_repo_name": "sr7cb/spiral-software", "max_issues_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_issues_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "namespaces/packages/graph/graph.gi", "max_forks_repo_name": "sr7cb/spiral-software", "max_forks_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_forks_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 36.7620396601, "max_line_length": 181, "alphanum_fraction": 0.5560607228, "num_tokens": 8798, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.554470450236115, "lm_q2_score": 0.5350984286266116, "lm_q1q2_score": 0.296696266641235}}
{"text": "\n# Copyright (c) 2018-2021, Carnegie Mellon University\n# See LICENSE for details\n\n\nClass(AVX_LDST, rec(\n list := [],\n __call__ := meth(arg) \n local self;\n\tself := arg[1];\n\tAppend(self.list, Drop(arg, 1)); \n end,\n\n getList := self >> self.list :: SSE_LDST.list,\n\n));\n\n_evshuf1 := self >> let(\n a := _unwrap(self.args[1].ev()), \n p := self.args[2].p,\n self.semantic(a, p));\n\n_evshuf2 := self >> let(\n a := _unwrap(self.args[1].ev()), \n b := _unwrap(self.args[2].ev()), \n p := self.args[3].p,\n self.semantic(a, b, p));\n\n_evpack := self >> let(\n a := _unwrap(self.args[1].ev()), \n b := _unwrap(self.args[2].ev()), \n self.semantic(a, b, []));\n\n\n#######################################################################################\n# AVX 4-way 64-bit floating-point instructions\n\nvzero_4x64f_const := TVect(T_Real(64), 4).zero();\nvzero_4x64f := () -> vzero_4x64f_const;\n\n# Load\n#\nAVX_LDST( \n # __m256d _mm256_maskload_pd(double *a, __m256i mask);\n Class(vloadmask_4x64f, VecExp_4.unary(), rec(\n mask := n -> Reversed(Flat(List([1..4], i->[\"0x00000000\", When(i <= n, \"0x80000000\", \"0x00000000\")])))\n )),\n\n # __m256d _mm256_broadcast_sd(const double *a)\n Class(vbroadcast_4x64f, VecExp_4.unary()),\n # __m256d _mm256_loadu_pd(double const *a)\n Class(vloadu_4x64f, VecExp_4.unary()) \n);\n\n# Store\n#\nAVX_LDST(\n # void _mm256_maskstore_pd(double *a, __m256i mask, __m256d b);\n Class(vstoremask_4x64f, VecStoreCommand.ternary(), rec(\n mask := n -> Reversed(Flat(List([1..4], i->[\"0x00000000\", When(i <= n, \"0x80000000\", \"0x00000000\")])))\n )),\n\n # void _mm256_storeu_pd(double *a, __m256d b)\n Class(vstoreu_4x64f, VecStoreCommand.binary())\n);\n\nClass(addsub_4x64f, VecExp_4.binary(), rec(\n ev := self >> add(self.args[1], mul(self.t.value([-1.0, 1.0, -1.0, 1.0]), self.args[2])).ev(),\n));\n\nClass(fmaddsub_4x64f, VecExp_4.ternary()); \n\n# __m256d _mm256_insertf128_pd(__m256d a, __m128d b, int offset);\nClass(vinsert_2l_4x64f, VecExp_4.binary(), rec(\n ev := self >> let( \n a := _unwrap(self.args[1].ev()),\n b := _unwrap(self.args[2].ev()),\n When( self.args[3].p[1] = 0, \n b :: a{[3 .. 4]},\n a{[1 .. 2]} :: b )),\n computeType := self >> self.args[1].t, \n));\n\n# __m128d _mm256_extractf128_pd(__m256d a, int offset);\nClass(vextract_2l_4x64f, VecExp_4.unary(), rec(\n semantic := (in1, p) -> in1{[1+2*p[1] .. 2 + 2*p[1]]},\n ev := _evshuf1,\n\n computeType := self >> Checked(IsVecT(self.args[1].t), \n\tTVect(self.args[1].t.t, 2)), #self.args[1].t.size/2, \n));\n\n\n# Binary shuffle\n#\n\n# __m256d _mm256_unpacklo_pd(__m256d a, __m256d b);\nClass(vunpacklo_4x64f, VecExp_4.binary(), rec(\n semantic := (in1, in2, p) -> [in1[1], in2[1], in1[3], in2[3]],\n ev := _evpack\n));\n\n# __m256d _mm256_unpackhi_pd(__m256d a, __m256d b);\nClass(vunpackhi_4x64f, VecExp_4.binary(), rec(\n semantic := (in1, in2, p) -> [in1[2], in2[2], in1[4], in2[4]],\n ev := _evpack\n));\n\n# __m256d _mm256_shuffle_pd(__m256d a, __m256d b, const int select);\nClass(vshuffle_4x64f, VecExp_4.binary(), rec(\n semantic := (in1, in2, p) -> [in1[p[1]], in2[p[2]], in1[p[3]+2], in2[p[4]+2]],\n params := self >> [[1,2], [1,2], [1,2], [1,2]],\n ev := _evshuf2\n));\n\n# __m256d _mm256_permute2_pd(__m256d a, __m256d b, __m256i control, int imm);\nClass(vperm2_4x64f, VecExp_4.binary(), rec(\n semantic := (in1, in2, p) -> let(lane1 := Concat(in1{[1..2]}, in2{[1..2]}), lane2 := Concat(in1{[3..4]}, in2{[3..4]}),\n [lane1[p[1]], lane1[p[2]], lane2[p[3]], lane2[p[4]]]),\n params := self >> [[1..4], [1..4], [1..4], [1..4]],\n ev := _evshuf2\n));\n\n#__m256d _mm256_blend_pd(__m256d m1, __m256d m2, const int mask);\nClass(vblend_4x64f, VecExp_4.binary(), rec(\n semantic := (in1, in2, p) -> List( Zip2(TransposedMat([in1, in2]), p), e -> e[1][e[2]]),\n params := self >> Replicate(4, [1,2]),\n ev := _evshuf2\n));\n\n# __m256d _mm256_permute2f128_pd(__m256d a, __m256d b, int control);\nClass(vpermf128_4x64f, VecExp_4.binary(), rec(\n semantic := (in1, in2, p) -> let(v128 := [[in1[1], in1[2]], [in1[3], in1[4]], [in2[1], in2[2]], [in2[3], in2[4]]],\n Concat(v128[p[1]], v128[p[2]])),\n params := self >> [[1..4], [1..4]],\n ev := _evshuf2\n));\n\n\n# Unary shuffle\n#\n\n# __m256d _mm256_permute_pd(__m256d a, int control);\nClass(vperm_4x64f, VecExp_4.unary(), rec(\n semantic := (in1, p) -> [in1[p[1]], in1[p[2]], in1[p[3]+2], in1[p[4]+2]],\n params := self >> [[1,2], [1,2], [1,2], [1,2]],\n ev := _evshuf1\n));\n\nClass(vuunpacklo_4x64f, VecExp_4.unaryFromBinop(vunpacklo_4x64f));\nClass(vuunpackhi_4x64f, VecExp_4.unaryFromBinop(vunpackhi_4x64f));\nClass(vushuffle_4x64f, VecExp_4.unaryFromBinop(vshuffle_4x64f));\nClass(vuperm2_4x64f, VecExp_4.unaryFromBinop(vperm2_4x64f));\nClass(vupermf128_4x64f, VecExp_4.unaryFromBinop(vpermf128_4x64f));\n\n#######################################################################################\n# AVX 8-way 32-bit float instructions\n\nvzero_8x32f_const := TVect(T_Real(64), 8).zero();\nvzero_8x32f := () -> vzero_8x32f_const;\n\nClass(addsub_8x32f, VecExp_8.binary(), rec(\n ev := self >> add(self.args[1], mul(self.t.value([-1.0, 1.0, -1.0, 1.0, -1.0, 1.0, -1.0, 1.0]), self.args[2])).ev(),\n)); \nClass(fmaddsub_8x32f, VecExp_8.ternary()); \n\n# Load\n#\nAVX_LDST( \n # __m256 _mm256_maskload_ps(float *a, __m256i mask);\n Class(vloadmask_8x32f, VecExp_8.unary(), rec(\n mask := n -> Reversed(List([1..8], i -> When(i <= n, \"0x80000000\", \"0x00000000\")))\n )),\n\n # __m256 _mm256_loadu_ps(float const *a)\n Class(vloadu_8x32f, VecExp_8.unary()) \n);\n\n# Store\n#\nAVX_LDST(\n # void _mm256_maskstore_ps(float *a, __m256i mask, __m256 b);\n Class(vstoremask_8x32f, VecStoreCommand.ternary(), rec(\n mask := n -> Reversed(List([1..8], i->When(i <= n, \"0x80000000\", \"0x00000000\")))\n )),\n\n # void _mm256_storeu_ps(float *a, __m256 b)\n Class(vstoreu_8x32f, VecStoreCommand.binary())\n);\n\n\n# __m256 _mm256_insertf128_ps(__m256 a, __m128d , int offset);\nClass(vinsert_4l_8x32f, VecExp_4.binary(), rec(\n ev := self >> let( \n a := _unwrap(self.args[1].ev()),\n b := _unwrap(self.args[2].ev()),\n When( self.args[3].p[1] = 0, \n b :: a{[5 .. 8]},\n a{[1 .. 4]} :: b )),\n computeType := self >> self.args[1].t, \n));\n\n# __m128 _mm256_extractf128_pd(__m256 a, int offset);\nClass(vextract_4l_8x32f, VecExp_8.unary(), rec(\n semantic := (in1, p) -> in1{[1+4*p[1] .. 4 + 4*p[1]]},\n ev := _evshuf1,\n\n computeType := self >> Checked(IsVecT(self.args[1].t), \n\tTVect(self.args[1].t.t, 4)), #self.args[1].t.size/2, \n));\n\n# Binary shuffle\n#\n\n# __m256 _mm256_unpacklo_ps(__m256 a, __m256 b);\nClass(vunpacklo_8x32f, VecExp_8.binary(), rec(\n semantic := (in1, in2, p) -> [in1[1], in2[1], in1[2], in2[2], in1[5], in2[5], in1[6], in2[6]],\n ev := _evpack,\n));\n\n# __m256 _mm256_unpackhi_ps(__m256 a, __m256 b);\nClass(vunpackhi_8x32f, VecExp_8.binary(), rec(\n semantic := (in1, in2, p) -> [in1[3], in2[3], in1[4], in2[4], in1[7], in2[7], in1[8], in2[8]],\n ev := _evpack,\n));\n\n# __m256 _mm256_permute2f128_ps(__m256 a, __m256 b, int control);\nClass(vpermf128_8x32f, VecExp_8.binary(), rec(\n semantic := (in1, in2, p) -> let(v128 := [in1{[1..4]}, in1{[5..8]}, in2{[1..4]}, in2{[5..8]}],\n Concat(v128[p[1]], v128[p[2]])),\n params := self >> [[1..4], [1..4]],\n ev := _evshuf2,\n));\n\n# __m256 _mm256_permute2_ps(__m256 a, __m256 b, __m256i control, int imm);\nClass(vperm2_8x32f, VecExp_8.binary(), rec(\n semantic := (in1, in2, p) -> let(lane1 := Concat(in1{[1..4]}, in2{[1..4]}), lane2 := Concat(in1{[5..8]}, in2{[5..8]}),\n [lane1[p[1]], lane1[p[2]], lane1[p[3]], lane1[p[4]], lane2[p[1]], lane2[p[2]], lane2[p[3]], lane2[p[4]]]),\n params := self >> [[1..8], [1..8], [1..8], [1..8]],\n ev := _evshuf2\n));\n\n# __m256 _mm256_shuffle_ps(__m256 a, __m256 b, const int select);\nClass(vshuffle_8x32f, VecExp_8.binary(), rec(\n semantic := (in1, in2, p) -> [in1[p[1]], in1[p[2]], in2[p[3]], in2[p[4]], in1[p[1]+4], in1[p[2]+4], in2[p[3]+4], in2[p[4]+4]],\n params := self >> [[1..4], [1..4], [1..4], [1..4]],\n ev := _evshuf2,\n));\n\n#__m256 _mm256_blend_ps(__m256 m1, __m256 m2, const int mask);\nClass(vblend_8x32f, VecExp_8.binary(), rec(\n semantic := (in1, in2, p) -> List( Zip2(TransposedMat([in1, in2]), p), e -> e[1][e[2]]),\n params := self >> Replicate(8, [1,2]),\n ev := _evshuf2\n));\n\n\n# Unary shuffle\n#\n\n# __m256 _mm256_permute_ps(__m256 a, int control);\nClass(vperm_8x32f, VecExp_8.unary(), rec(\n semantic := (in1, p) -> [in1[p[1]], in1[p[2]], in1[p[3]], in1[p[4]], in1[p[1]+4], in1[p[2]+4], in1[p[3]+4], in1[p[4]+4]],\n params := self >> [[1..4], [1..4], [1..4], [1..4]],\n ev := _evshuf1\n));\n\nClass(vuunpacklo_8x32f, VecExp_8.unaryFromBinop(vunpacklo_8x32f));\nClass(vuunpackhi_8x32f, VecExp_8.unaryFromBinop(vunpackhi_8x32f));\nClass(vushuffle_8x32f, VecExp_8.unaryFromBinop(vshuffle_8x32f));\nClass(vupermf128_8x32f, VecExp_8.unaryFromBinop(vpermf128_8x32f));\n\n\n\n# __m256 _mm256_permutevar_ps(__m256 a, __m256i control);\nClass(vpermv_8x32f, VecExp_8.unary(), rec(\n semantic := (in1, p) -> [in1[p[1]], in1[p[2]], in1[p[3]], in1[p[4]], in1[p[5]+4], in1[p[6]+4], in1[p[7]+4], in1[p[8]+4]],\n params := self >> Replicate(8, [1,2]),\n ev := _evshuf1,\n));\n\n# __m256 _mm256_movehdup_ps (__m256 a);\nClass(vhdup_8x32f, VecExp_8.unary(), rec(\n semantic := (in1, p) -> [in1[2], in1[2], in1[4], in1[4], in1[6], in1[6], in1[8], in1[8]],\n ev := self >> let( v := self._vval(1), self.t.value(self.semantic(v, []))),\n));\n\n# __m256 _mm256_moveldup_ps (__m256 a);\nClass(vldup_8x32f, VecExp_8.unary(), rec(\n semantic := (in1, p) -> [in1[1], in1[1], in1[3], in1[3], in1[5], in1[5], in1[7], in1[7]],\n ev := self >> let( v := self._vval(1), self.t.value(self.semantic(v, []))),\n));\n\n# vcxtr_8x32f is a virtual instruction: in-register Tensor(L(4,2),I(2))\n# later rewritten to vblend_8x32f(x, vperm_8x32f(vupermf128_8x32f(x, [ 2, 1 ]), [3,4,1,2]), [1,1,2,2,2,2,1,1])\n# this helps SIMD_ISA_DB to find this permutation\nClass(vcxtr_8x32f, VecExp_8.unary(), rec(\n semantic := (in1, p) -> [in1[1], in1[2], in1[5], in1[6], in1[3], in1[4], in1[7], in1[8]],\n ev := self >> let( v := self._vval(1), self.t.value(self.semantic(v, []))),\n vcost := 5, # 3 instructions + dependency penalty\n));\n\n# Type Conversion\n\n# __m256 _mm256_cvtpd_ps (__m256d a)\nClass(vcvt_8x32f_4x64f, VecExp_4.unary(), rec(\n computeType := (self) >> TVect(T_Real(32), 8)\n));\n\n# __m256d _mm256_cvtps_pd (__m128 a)\nClass(vcvt_4x64f_4x32f, VecExp_4.unary(), rec(\n computeType := (self) >> TVect(T_Real(64), 4)\n));\n\n# __m256d _mm256_cvtepi32_pd (__m128i src)\nClass(vcvt_4x64f_4x32i, VecExp_4.unary(), rec(\n computeType := (self) >> TVect(T_Real(64), 4)\n));\n\n# __m128i _mm256_cvtpd_epi32 (__m256d src), rounding\nClass(vcvt_4x32i_4x64f, VecExp_4.unary(), rec(\n computeType := (self) >> TVect(T_Int(32), 4)\n));\n\n# __m128i _mm256_cvttpd_epi32 (__m256d src), truncation \nClass(vcvtt_4x32i_4x64f, VecExp_4.unary(), rec(\n computeType := (self) >> TVect(T_Int(32), 4)\n));\n\n# __m256 _mm256_cvtepi32_ps (__m256i src)\nClass(vcvt_8x32f_8x32i, VecExp_8.unary(), rec(\n computeType := (self) >> TVect(T_Real(32), 8)\n));\n\n# type conversion 8x32f to 8x32i, rounding\n# __m256i _mm256_cvtps_epi32 (__m256 a)\nClass(vcvt_8x32i_8x32f, VecExp_8.unary(), rec(\n computeType := (self) >> TVect(T_Int(32), 8)\n));\n\n# type conversion 8x32f to 8x32i, truncation toward zero\n# __m256i _mm256_cvttps_epi32 (__m256 a)\nClass(vcvtt_8x32i_8x32f, VecExp_8.unary(), rec(\n computeType := (self) >> TVect(T_Int(32), 8)\n));\n\n\n", "meta": {"hexsha": "ab8249bc00095f0ee0bbf91e9973857de47172d8", "size": 11785, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "namespaces/spiral/platforms/avx/code.gi", "max_stars_repo_name": "sr7cb/spiral-software", "max_stars_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_stars_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_stars_count": 42, "max_stars_repo_stars_event_min_datetime": "2019-09-01T19:29:39.000Z", "max_stars_repo_stars_event_max_datetime": "2022-01-17T12:26:12.000Z", "max_issues_repo_path": "namespaces/spiral/platforms/avx/code.gi", "max_issues_repo_name": "sr7cb/spiral-software", "max_issues_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_issues_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_issues_count": 12, "max_issues_repo_issues_event_min_datetime": "2020-11-20T16:15:52.000Z", "max_issues_repo_issues_event_max_datetime": "2022-01-07T21:17:28.000Z", "max_forks_repo_path": "namespaces/spiral/platforms/avx/code.gi", "max_forks_repo_name": "sr7cb/spiral-software", "max_forks_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_forks_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_forks_count": 21, "max_forks_repo_forks_event_min_datetime": "2019-08-20T19:27:52.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-01T22:11:18.000Z", "avg_line_length": 33.8649425287, "max_line_length": 142, "alphanum_fraction": 0.5944845142, "num_tokens": 4718, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.5273165233795671, "lm_q2_score": 0.5621765008857981, "lm_q1q2_score": 0.2964449579727892}}
{"text": "\nlocal reps,tori,labels,I,II,ords,blocks;\n\nreps:=[[[1,1],[2,1],[3,1],[4,1],[5,1],[6,1],[7,1]], # E_7\n [[1,1],[3,1],[10,1],[9,1],[5,1],[6,1],[7,1]], # E_7(a_1)\n [[1,1],[2,1],[3,1],[9,1],[11,1],[12,1],[13,1]], # E_7(a_2)\n [[15,1],[1,1],[17,1],[6,1],[7,1],[16,1],[4,1]], # E_7(a_3) asta functioneaza in caracteristica 3\n# [[1,1],[4,1],[7,1],[11,1],[12,1],[15,1],[17,1]], # E_7(a_3)\n [[1,1],[2,1],[3,1],[4,1],[5,1],[6,1]], # E_6\n# [[3,1],[5,1],[1,1],[6,1],[10,1],[11,1],[2,1]], # E_6(a_1)\n [[1,1],[2,1],[10,1],[11,1],[5,1],[6,1]], # E_6(a_1)\n [[7,1],[6,1],[5,1],[4,1],[2,1],[3,1]], # D_6\n [[1,1],[4,1],[7,1],[13,1],[15,1],[16,1],[17,1],[23,1]], # E_7(a_4) acelas ca cel mai de jos dar ordonat\n# [[15,1],[1,1],[17,1],[13,1],[23,1],[7,1],[16,1],[4,1]], # E_7(a_4) asta functioneaza in caracteristica 3\n# [[1,1],[4,1],[7,1],[10,1],[22,1],[23,1],[24,1]], # E_7(a_4)\n# [[7,1],[6,1],[5,1],[9,1],[10,-1],[2,1],[3,1]], # D_6(a_1)\n [[2,1],[3,1],[9,1],[11,1],[6,1],[7,1]], # D_6(a_1)\n [[1,1],[3,1],[4,1],[2,1],[5,1],[7,1]], # D_5A_1\n [[1,1],[3,1],[4,1],[5,1],[6,1],[7,1]], # A_6\n# [[21,1],[23,1],[7,1],[24,1],[20,1],[4,1],[22,1]], # E_7(a_5)\n [[4,1],[10,1],[13,1],[14,1],[21,1],[22,1],[23,1]], # E_7(a_5)\n [[1,1],[3,1],[4,1],[2,1],[5,1]], # D_5\n [[15,1],[1,1],[17,1],[6,1],[16,1],[4,1]], # E_6(a_3) this works in characteristic 3\n# [[4,1],[6,1],[8,1],[10,1],[16,1],[17,1]], # E_6(a_3)\n# [[7,1],[12,1],[9,1],[10,-1],[11,1],[2,1],[3,1]], # D_6(a_2)\n [[2,1],[3,1],[9,1],[11,1],[12,1],[13,1]], # D_6(a_2)\n# [[1,1],[3,1],[9,1],[11,1],[2,1],[5,1],[7,1]], # D_5(a_1)A_1\n [[1,1],[9,1],[10,1],[2,1],[5,1],[7,1]], # D_5(a_1)A_1\n \n [[2,1],[4,1],[5,1],[6,1],[7,1],[1,1]], # A_5A_1\n [[1,1],[3,1],[4,1],[5,1],[6,1]], # (A_5)'\n [[1,1],[3,1],[4,1],[2,1],[6,1],[7,1]], # A_4A_2\n# [[1,1],[3,1],[9,1],[11,1],[2,1],[5,1]], # D_5(a_1)\n# [[1,1],[10,1],[11,1],[2,1],[5,1]], # D_5(a_1) ALSO WORKS?\n [[1,1],[9,1],[10,1],[2,1],[5,1]], # D_5(a_1)\n [[1,1],[2,1],[3,1],[4,1],[6,1]], # A_4A_1\n [[3,1],[4,1],[2,1],[5,1],[7,1]], # D_4A_1\n [[2,1],[4,1],[5,1],[6,1],[7,1]], # (A_5)''\n [[1,1],[3,1],[2,1],[5,1],[6,1],[7,1]], # A_3A_2A_1\n [[1,1],[2,1],[3,1],[4,1]], # A_4\n# [[3,1],[4,1],[2,1],[6,1],[7,1]], # A_3A_2\n [[3,1],[4,1],[2,1],[6,1],[7,1]], # A_3A_2\n# [[3,1],[9,1],[11,1],[2,1],[5,1],[7,1]], # D_4(a_1)A_1\n# [[2,1],[3,1],[9,1],[11,1],[7,1]], # D_4(a_1)A_1 \n [[2,1],[5,1],[9,1],[10,1],[7,1]], # D_4(a_1)A_1 cel de deasupra simetric fata de D4\n [[3,1],[4,1],[2,1],[5,1]], # D_4\n [[5,1],[6,1],[7,1],[2,1],[3,1]], # A_3A_1^2\n# [[3,1],[9,1],[11,1],[2,1],[5,1]], # D_4(a_1)\n [[2,1],[3,1],[9,1],[11,1]], # D_4(a_1)\n [[1,1],[3,1],[4,1],[6,1]], # (A_3A_1)'\n [[1,1],[3,1],[5,1],[6,1],[2,1]], # A_2^2A_1\n [[5,1],[6,1],[7,1],[2,1]], # (A_3A_1)''\n [[1,1],[3,1],[2,1],[5,1],[7,1]], # A_2A_1^3\n [[1,1],[3,1],[5,1],[6,1]], # A_2^2\n [[1,1],[3,1],[4,1]], # A_3\n [[2,1],[4,1],[1,1],[6,1]], # A_2A_1^2\n [[1,1],[3,1],[2,1]], # A_2A_1\n [[2,1],[3,1],[5,1],[7,1]], # A_1^4\n [[1,1],[3,1]], # A_2\n [[1,1],[4,1],[6,1]], # (A_1^3)'\n [[2,1],[5,1],[7,1]], # (A_1^3)''\n [[1,1],[6,1]], # A_1^2\n [[1,1]] # A_1\n ];\n\nI:=[[], # E_7\n [4], # E_7(a_1)\n [4,6], # E_7(a_2)\n# [2,3,5], # E_7(a_3)\n [], # E_7(a_3)\n [], # E_6\n# [4], # E_6(a_1)\n [], # E_6(a_1)\n [], # D_6\n# [2,3,5,6], # E_7(a_4)\n [], # E_7(a_4)\n# [4], # D_6(a_1)\n [], # D_6(a_1)\n [], # D_5A_1\n [], # A_6\n# [1,2,3,5,6], # E_7(a_5)\n [], # E_7(a_5)\n [], # D_5\n# [2,3,5], # E_6(a_3)\n [], # E_6(a_3)\n# [4,5], # D_6(a_2) ???\n [], # D_6(a_2) ???\n# [4], # D_5(a_1)A_1 ???\n [], # D_5(a_1)A_1 ???\n \n [], # A_5A_1\n [], # (A_5)'\n [], # A_4A_2\n# [4], # D_5(a_1) ???\n [], # D_5(a_1) ???\n [], # A_4A_1\n [], # D_4A_1\n [], # (A_5)''\n [], # A_3A_2A_1\n [], # A_4\n [], # A_3A_2\n# [4], # D_4(a_1)A_1\n [], # D_4(a_1)A_1\n [], # D_4\n [], # A_3A_1^2\n# [4], # D_4(a_1)\n [], # D_4(a_1)\n [], # (A_3A_1)'\n [], # A_2^2A_1\n [], # (A_3A_1)''\n [], # A_2A_1^3\n [], # A_2^2\n [], # A_3\n [], # A_2A_1^2\n [], # A_2A_1\n [], # A_1^4\n [], # A_2\n [], # (A_1^3)'\n [], # (A_1^3)''\n [], # A_1^2\n [] # A_1\n ];\n\n\n#\n# The parabolic where the representative is distinguished\n#\nII:=[[1,2,3,4,5,6,7], # E_7\n [1,2,3,4,5,6,7], # E_7(a_1)\n [1,2,3,4,5,6,7], # E_7(a_2)\n [1,2,3,4,5,6,7], # E_7(a_3)\n# [], # E_7(a_3)\n [1,2,3,4,5,6], # E_6\n [1,2,3,4,5,6], # E_6(a_1)\n# [], # E_6(a_1)\n [2,3,4,5,6,7], # D_6\n [1,2,3,4,5,6,7], # E_7(a_4)\n# [], # E_7(a_4)\n [2,3,4,5,6,7], # D_6(a_1)\n# [], # D_6(a_1)\n [1,2,3,4,5,7], # D_5A_1\n [1,3,4,5,6,7], # A_6\n [1,2,3,4,5,6,7], # E_7(a_5)\n# [], # E_7(a_5)\n [1,2,3,4,5], # D_5\n [1,2,3,4,5,6], # E_6(a_3)\n# [], # E_6(a_3)\n [2,3,4,5,6,7], # D_6(a_2)\n# [], # D_6(a_2)\n [1,2,3,4,5,7], # D_5(a_1)A_1\n# [], # D_5(a_1)A_1\n \n [1,2,4,5,6,7], # A_5A_1\n [1,3,4,5,6], # (A_5)'\n [1,2,3,4,6,7], # A_4A_2\n [1,2,3,4,5], # D_5(a_1)\n# [], # D_5(a_1)\n [1,2,3,4,6], # A_4A_1\n [2,3,4,5,7], # D_4A_1\n [2,4,5,6,7], # (A_5)''\n [1,2,3,5,6,7], # A_3A_2A_1\n [1,2,3,4], # A_4\n [2,3,4,6,7], # A_3A_2\n [2,3,4,5,7], # D_4(a_1)A_1\n# [], # D_4(a_1)A_1\n [2,3,4,5], # D_4\n [2,3,5,6,7], # A_3A_1^2\n [2,3,4,5], # D_4(a_1)\n# [], # D_4(a_1)\n [1,3,4,6], # (A_3A_1)'\n [1,2,3,5,6], # A_2^2A_1\n [2,5,6,7], # (A_3A_1)''\n [1,2,3,5,7], # A_2A_1^3\n [1,3,5,6], # A_2^2\n [1,3,4], # A_3\n [1,2,4,6], # A_2A_1^2\n [1,2,3], # A_2A_1\n [2,3,5,7], # A_1^4\n [1,3], # A_2\n [1,4,6], # (A_1^3)'\n [2,5,7], # (A_1^3)''\n [1,6], # A_1^2\n [1] # A_1\n ];\n\nlabels:=[\"E_7\",\n \"E_7(a_1)\",\n \"E_7(a_2)\",\n \"E_7(a_3)\",\n \"E_6\",\n \"E_6(a_1)\",\n \"D_6\",\n \"E_7(a_4)\",\n \"D_6(a_1)\",\n \"D_5A_1\",\n \"A_6\",\n \"E_7(a_5)\",\n \"D_5\",\n \"E_6(a_3)\",\n \"D_6(a_2)\",\n \"D_5(a_1)A_1\",\n \n \"A_5A_1\",\n \"(A_5)1\",\n \"A_4A_2\",\n \"D_5(a_1)\",\n \"A_4A_1\",\n \"D_4A_1\",\n \"(A_5)2\",\n \"A_3A_2A_1\",\n \"A_4\",\n \"A_3A_2\",\n \"D_4(a_1)A_1\",\n \"D_4\",\n \"A_3A_1^2\",\n \"D_4(a_1)\",\n \"(A_3A_1)1\",\n \"A_2^2A_1\",\n \"(A_3A_1)2\",\n \"A_2A_1^3\",\n \"A_2^2\",\n \"A_3\",\n \"A_2A_1^2\",\n \"A_2A_1\",\n \"A_1^4\",\n \"A_2\",\n \"(A_1^3)1\",\n \"(A_1^3)2\",\n \"A_1^2\",\n \"A_1\"\n ];\n\ntori:=[\n [2,2,2,2,2,2,2], # E_7\n [2,2,2,0,2,2,2], # E_7(a_1)\n [2,2,2,0,2,0,2], # E_7(a_2)\n [2,0,0,2,0,2,2], # E_7(a_3)\n# [], # E_7(a_3)\n [2,2,2,2,2,2,-16], # E_6\n [2,2,2,0,2,2,-12], # E_6(a_1)\n# [], # E_6(a_1)\n [-15,2,2,2,2,2,2], # D_6\n [2,0,0,2,0,0,2], # E_7(a_4)\n# [], # E_7(a_4)\n [-11,2,2,0,2,2,2], # D_6(a_1)\n# [], # D_6(a_1)\n [2,2,2,2,2,-11,2], # D_5A_1\n [2,-12,2,2,2,2,2], # A_6\n [0,0,0,2,0,0,2], # E_7(a_5)\n# [], # E_7(a_5)\n [2,2,2,2,2,-10,0], # D_5\n [2,0,0,2,0,2,-8], # E_6(a_3)\n# [], # E_6(a_3)\n [-9,2,2,0,2,0,2], # D_6(a_2)\n# [], # D_6(a_2)\n [2,2,2,0,2,-8,2], # D_5(a_1)A_1\n# [], # D_5(a_1)A_1\n \n [2,2,-9,2,2,2,2], # A_5A_1\n [2,-9,2,2,2,2,-5], # (A_1)'\n [2,2,2,2,-8,2,2], # A_4A_2\n [2,2,2,0,2,-7,0], # D_5(a_1)\n# [], # D_5(a_1)\n [2,2,2,2,-7,2,-1], # A_4A_1\n [-6,2,2,2,2,-7,2], # D_4A_1\n [0,2,-8,2,2,2,2], # (A_5)''\n [2,2,2,-6,2,2,2], # A_3A_2A_1\n [2,2,2,2,-6,0,0], # A_4\n [-3,2,2,2,-6,2,2], # A_3A_2\n [-4,2,2,0,2,-5,2], # D_4(a_1)A_1\n# [], # D_4(a_1)A_1\n [-6,2,2,2,2,-6,0], # D_4\n [-1,2,2,-5,2,2,2], # A_3A_1^2\n [-4,2,2,0,2,-4,0], # D_4(a_1)\n# [], # D_4(a_1)\n [2,-3,2,2,-4,2,-1], # (A_3A_1)'\n [2,2,2,-5,2,2,-2], # A_2^2A_1\n [0,2,0,-4,2,2,2], # (A_3A_1)''\n [2,2,2,-4,2,-2,2], # A_2A_1^3\n [2,0,2,-4,2,2,-2], # A_2^2\n [2,-3,2,2,-3,0,0], # A_3\n [2,2,-3,2,-3,2,-1], # A_2A_1^2\n [2,2,2,-3,0,0,0], # A_2A_1\n [-1,2,2,-3,2,-2,2], # A_1^4\n [2,0,2,-2,0,0,0], # A_2\n [2,-1,-2,2,-2,2,-1],# (A_1^3)'\n [0,2,0,-2,2,-2,2], # (A_1^3)''\n [2,0,-1,0,-1,2,-1], # A_1^2\n [2,0,-1,0,0,0,0], # A_1\n ];\n\n#blocks:=[];\nblocks:=\n[[[27, 3], [19, 1], [15, 1], [9, 2]], [[27, 1], [19, 1], [18, 2], [15, 1], [9, 4]], [[19, 1], [18, 2], [15, 1], [9, 7]], [[19, 1], [17, 1], [15, 2], [11, 2], [9, 3], [6, 2], [3, 2]], [[19, 1], [15, 4], [9, 5], [3, 3]], [[9, 14], [7, 1]], [[19, 1], [16, 2], [15, 1], [11, 1], [10, 2], [9, 2], [6, 2], [3, 1], [1, 3]], [[9, 12], [7, 1], [6, 2], [3, 2]], [[9, 11], [8, 2], [6, 2], [3, 1], [1, 3]], [[9, 11], [8, 2], [6, 2], [3, 1], [1, 3]], [[9, 11], [7, 4], [3, 1], [1, 3]], [[9, 9], [7, 1], [6, 2], [5, 3], [3, 6]], [[9, 11], [7, 4], [1, 6]], [[9, 6], [7, 1], [6, 8], [3, 8]], [[9, 9], [7, 1], [6, 2], [5, 1], [4, 4], [3, 3], [1, 3]], [[9, 5], [7, 4], [6, 6], [3, 7], [1, 3]], [[9, 9], [3, 16], [2, 2]], [[9, 5], [8, 2], [6, 8], [3, 7], [1, 3]], [[9, 3], [7, 1], [6, 8], [5, 3], [3, 12]], [[9, 3], [8, 4], [7, 2], [6, 6], [3, 4], [2, 4], [1, 4]], [[9, 1], [8, 2], [7, 3], [6, 4], [5, 5], [4, 2], [3, 8], [2, 2], [1, 2]], [[9, 2], [8, 4], [7, 5], [6, 4], [3, 2], [2, 4], [1, 10]], [[9, 9], [3, 15], [1, 7]], [[7, 1], [6, 8], [5, 3], [3, 21]], [[9, 1], [7, 7], [5, 9], [3, 7], [1, 9]], [[7, 1], [6, 8], [5, 1], [4, 4], [3, 18], [1, 3]], [[7, 1], [6, 6], [5, 4], [4, 4], [3, 16], [1, 6]], [[9, 2], [7, 13], [3, 1], [1, 21]], [[7, 1], [6, 4], [5, 7], [4, 4], [3, 11], [2, 6], [1, 6]], [[7, 1], [6, 2], [5, 12], [3, 15], [1, 9]], [[7, 1], [6, 2], [5, 7], [4, 10], [3, 6], [2, 6], [1, 9]], [[3, 43], [2, 2]], [[7, 1], [5, 15], [3, 10], [1, 21]], [[3, 42], [1, 7]], [[3, 42], [1, 7]], [[7, 1], [5, 7], [4, 16], [3, 1], [1, 24]], [[3, 37], [2, 8], [1, 6]], [[3, 34], [2, 8], [1, 15]], [[3, 28], [2, 14], [1, 21]], [[3, 33], [1, 34]], [[3, 19], [2, 26], [1, 24]], [[3, 27], [1, 52]], [[3, 10], [2, 32], [1, 39]], [[3, 1], [2, 32], [1, 66]]];\n\n\nords:=[];\n#ords:=[ 27, 27, 27, 27, 27, 9, 27, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 3, 9, 3, 3, 9, 3, 3, 3, 3, 3, 3, 3, 3 ];\n\nreturn [reps,tori,labels,I,II,ords,blocks];\n", "meta": {"hexsha": "205d395e447df40d50b7d4da5c58ef16fc171f28", "size": 12209, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "lib/data/dataE7char3Ross.gi", "max_stars_repo_name": "iuliansimion/Chevalley.gap", "max_stars_repo_head_hexsha": "dd237f36d69a42bcd6cb6a24c5e4bf7dfb3da186", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/data/dataE7char3Ross.gi", "max_issues_repo_name": "iuliansimion/Chevalley.gap", "max_issues_repo_head_hexsha": "dd237f36d69a42bcd6cb6a24c5e4bf7dfb3da186", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/data/dataE7char3Ross.gi", "max_forks_repo_name": "iuliansimion/Chevalley.gap", "max_forks_repo_head_hexsha": "dd237f36d69a42bcd6cb6a24c5e4bf7dfb3da186", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 40.561461794, "max_line_length": 1731, "alphanum_fraction": 0.2906052912, "num_tokens": 6698, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.6548947290421276, "lm_q2_score": 0.4493926344647597, "lm_q1q2_score": 0.29430486758132673}}
{"text": "\n# Copyright 2018-2019, Carnegie Mellon University\n# See LICENSE for details\n\nDeclare(ScatHUnion, eUnion);\n\nClass(ISumUnion, ISum, rec(\n toOperator := self >> (vec -> Checked(Length(vec)=self.dims()[2], \n Flat(List(TransposedMat(List([0..self.var.range-1], \n j->RulesStrengthReduce(SubstVars(Copy(self._children[1]), rec((self.var.id):=V(j)))).toOperator()(vec))), i->Filtered(i, k->k<>()))\n )))\n));\n\n\nClass(ISumReduction, ISum, rec(\n abbrevs := [ (v, rng, op, idval, isSaturated, expr) -> [v, rng, op, idval, isSaturated, expr] ],\n new := meth(self, var, domain, op, idval, isSaturated, expr)\n local res;\n Constraint(IsSPL(expr));\n # if domain is an integer (not symbolic) it must be positive\n Constraint(not IsInt(domain) or domain >= 0);\n var.isLoopIndex := true;\n res := SPL(WithBases(self, rec(_children := [expr], var := var, domain := domain, op := op, idval := idval, isSaturated := isSaturated)));\n res.dimensions := res.dims();\n return res;\n end,\n print := (self, i, is) >> Print(\n self.name, \"(\", self.var, \", \", self.domain, \", \", self.op, \", \", self.idval, \", \", self.isSaturated, \",\\n\",\n Blanks(i+is), self._children[1].print(i+is, is), \"\\n\",\n Blanks(i), \")\", self.printA(),\n When(IsBound(self._setDims), Print(\".overrideDims(\", self._setDims, \")\"), Print(\"\"))\n ),\n toOperator := self >> (vec -> Checked(Length(vec)=self.dims()[2], \n List(List(TransposedMat(List([0..self.var.range-1], \n j->RulesStrengthReduce(SubstVars(Copy(self._children[1]), rec((self.var.id):=V(j)))).toOperator()(vec))), i->Filtered(i, k->k<>())),\n e->_unwrap(FoldL(e, self.op, self.idval)))))\n));\n\nClass(GathH, SumsBase, BaseMat, rec(\n rChildren := self >> [self.N, self.n, self.base, self.stride],\n rSetChild := rSetChildFields(\"N\", \"n\", \"base\", \"stride\"),\n new := (self, N, n, base, stride) >> \n\tSPL(WithBases(self, rec(\n \tN:= N, n := n, base := base, stride := stride, dimensions := [n, N]))),\n dims := self >> self.dimensions,\n sums := self >> self,\n area := self >> self.n,\n isReal := self >> true,\n transpose := self >> ScatHUnion(self.N, self.n, self.base, self.stride),\n conjTranspose := self >> self.transpose(),\n inverse := self >> self.transpose(),\n toAMat := self >> let(\n\t n := self.n,\n N := self.N,\n base := self.base,\n stride := self.stride,\n AMatMat(List([0..n-1], row -> let(\n idx := base+row*stride,\n\t\t BasisVec(N, idx))))\n ),\n isIdentity := self >> (self.n=self.N) and self.base=0 and self.stride = 1,\n toOperator := self >> (vec-> Checked(Checked(Length(vec) = self.N, List([0..self.n-1], i->vec[_unwrap(self.base+i*self.stride+1)]))))\n));\n\nClass(ScatHUnion, SumsBase, BaseMat, rec(\n rChildren := self >> [self.N, self.n, self.base, self.stride],\n rSetChild := rSetChildFields(\"N\", \"n\", \"base\", \"stride\"),\n new := (self, N, n, base, stride) >> \n\n SPL(WithBases(self, rec(\n N:= N, n := n, base := base, stride := stride, dimensions := [N, n]))),\n dims := self >> self.dimensions,\n sums := self >> self,\n area := self >> self.n,\n isReal := self >> true,\n transpose := self >> GathH(self.N, self.n, self.base, self.stride),\n conjTranspose := self >> self.transpose(),\n inverse := self >> self.transpose(),\n toAMat := self >> let(\n\t n := self.n,\n N := self.N,\n base := self.base,\n stride := self.stride,\n TransposedAMat(AMatMat(List([0..n-1], row -> let(\n idx := base+row*stride,\n\t\t BasisVec(N, idx))))\n )),\n isIdentity := self >> (self.n=self.N) and self.base=0 and self.stride = 1,\n toOperator := self >>(vec -> Checked(Length(vec) = self.n, List([0..self.N-1], j->let(i := (j-_unwrap(self.base))/_unwrap(self.stride), When(IsPosInt0(i) and i < _unwrap(self.n), vec[i+1], ())))))\n));\n\nClass(ScatHAcc, ScatHUnion);\n\nClass(eT, SumsBase, BaseMat, rec(\n rChildren := self >> [self.N, self.base],\n rSetChild := rSetChildFields(\"N\", \"base\"),\n new := (self, N, base) >> SPL(WithBases(self, rec(\n \tN:= N, base := base, dimensions := [1, N]))),\n dims := self >> self.dimensions,\n sums := self >> self,\n area := self >> self.N,\n isReal := self >> true,\n transpose := self >> eUnion(self.N, self.base),\n conjTranspose := self >> self.transpose(),\n inverse := self >> self.transpose(),\n toAMat := self >> let(\n\t n := self.n,\n N := self.N,\n base := self.base,\n stride := self.stride,\n AMatMat(List([0..n-1], row -> let(\n idx := base+row*stride,\n\t\t BasisVec(N, idx))))\n ),\n isIdentity := self >> false,#(self.N=1),\n toOperator := self >>(vec -> Checked(Length(vec) = self.N, [vec[_unwrap(self.base)+1]]))\n));\n\nClass(eUnion, SumsBase, BaseMat, rec(\n rChildren := self >> [self.N, self.base],\n rSetChild := rSetChildFields(\"N\", \"base\"),\n new := (self, N, base) >> SPL(WithBases(self, rec(\n \tN:= N, base := base, dimensions := [N, 1]))),\n dims := self >> self.dimensions,\n sums := self >> self,\n area := self >> 1,\n isReal := self >> true,\n transpose := self >> eT(self.N, self.base),\n conjTranspose := self >> self.transpose(),\n inverse := self >> self.transpose(),\n toAMat := self >> let(\n\t n := 1,\n N := self.N,\n base := self.base,\n stride := 1,\n TransposedAMat(AMatMat(List([0..n-1], row -> let(\n idx := base+row*stride,\n\t\t BasisVec(N, idx))))\n )),\n isIdentity := False,\n toOperator := self >>(vec -> Checked(Length(vec) = 1, List([0..self.N-1], i->When(i = _unwrap(self.base), vec[1], ()))))\n));\n\nClass(Mul1, Blk1, rec(\n toOperator := self >> (vec -> Checked(Length(vec) = 1, [_unwrap(RulesStrengthReduce(vec[1]*_unwrap(self.element)))]))\n));\n\nClass(SUMUnion, SUM, rec(\n toOperator := self >> (vec -> Checked(Length(vec)=self.dims()[2], \n Flat(List(TransposedMat(List(self.children(), c->RulesStrengthReduce(c.toOperator()(vec)))), i->Filtered(i, k->k<>())))))\n));\n\nClass(Inductor, BaseMat, rec(\n abbrevs := [ (N, i, op, initval) -> [N, i, op, initval] ],\n new := (self, N, i, op, initval) >> SPL(WithBases(self, rec(\n N := N, i := i, op := op, initval := initval, dimensions := [1, 1]))),\n print := (self, i, is) >> Print(\"Inductor(\", self.N, \", \", self.i, \", \", self.op, \", \", self.initval, \")\"),\n dims := self >> self.dimensions,\n rChildren := self >> [self.N, self.i, self.op, self.initval],\n rSetChild := rSetChildFields(\"N\", \"i\", \"op\", \"initval\"),\n isReal := True,\n recurrence := self >> ((j,v)->When(j=0, self.initval, self.op.at(self.recurrence()(j-1,v),v))),\n toOperator := self >> (vec -> Checked(Length(vec)=self.dims()[2], [List([0..self.N-1], i->_unwrap(RulesStrengthReduce(self.recurrence()(i,vec[1]))))[_unwrap(self.i)+1]]))\n));\n\n\n", "meta": {"hexsha": "0be973214bb19dbe3fd08bacd6967c5494f7356f", "size": 6861, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "sigmaspl.gi", "max_stars_repo_name": "spiral-software/spiral-package-hcol", "max_stars_repo_head_hexsha": "b4a0118382e3bba91ecd82a6c667f2cdb6389ceb", "max_stars_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "sigmaspl.gi", "max_issues_repo_name": "spiral-software/spiral-package-hcol", "max_issues_repo_head_hexsha": "b4a0118382e3bba91ecd82a6c667f2cdb6389ceb", "max_issues_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "sigmaspl.gi", "max_forks_repo_name": "spiral-software/spiral-package-hcol", "max_forks_repo_head_hexsha": "b4a0118382e3bba91ecd82a6c667f2cdb6389ceb", "max_forks_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2019-11-26T05:21:02.000Z", "max_forks_repo_forks_event_max_datetime": "2019-11-26T05:21:02.000Z", "avg_line_length": 41.0838323353, "max_line_length": 200, "alphanum_fraction": 0.5653694797, "num_tokens": 2067, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO\n\n", "lm_q1_score": 0.6076631698328916, "lm_q2_score": 0.480478678047907, "lm_q1q2_score": 0.29196919653970854}}
{"text": "\n# Copyright (c) 2018-2021, Carnegie Mellon University\n# See LICENSE for details\n\n\nClass(APar, ASingletonTag);\nClass(AVec, ASingletonTag);\n\nIsParPar := P -> P[3] = APar and P[4] = APar;\nIsVecVec := P -> P[3] = AVec and P[4] = AVec;\nIsVecPar := P -> P[3] = AVec and P[4] = APar;\nIsParVec := P -> P[3] = APar and P[4] = AVec;\nIsParXXX := P -> P[3] = APar;\nIsVecXXX := P -> P[3] = AVec;\nIsXXXPar := P -> P[4] = APar;\nIsXXXVec := P -> P[4] = AVec;\n\nBaseOperation.doNotMeasure := true;\nPermClass.doNotMeasure := true;\n\n###################################################################\n#F tSPL - base class for all tSPL constructs\n#F *OBSOLETE*. Use Tagged_tSPL\n#F\n\n#D Class(tSPL, NonTerminal, rec(\n#D isTSPL := true\n#D ));\n\n###################################################################\n#F Tagged_tSPL - base class for all tSPL constructs with tag support\n#F\n#F *!!* Should be used for all new constructs instead of tSPL\n#F\nClass(Tagged_tSPL, TaggedNonTerminal, rec(\n isTSPL := true\n));\n\n###################################################################\n#F Tagged_tSPL_Container - base class for a generic tSPL container\n#F\nClass(Tagged_tSPL_Container, Tagged_tSPL, rec(\n abbrevs := [ nt -> Checked(IsSPL(nt), [nt]) ],\n dims := self >> self.params[1].dims(),\n advdims := self >> self.params[1].advdims(),\n terminate := self >> self.params[1].terminate(),\n transpose := self >> ObjId(self)(self.params[1].transpose())\n .withTags(self.getTags()),\n isReal := self >> self.params[1].isReal(),\n isInplace := self >> self.params[1].isInplace(),\n normalizedArithCost := self >> self.params[1].normalizedArithCost(),\n doNotMeasure := true,\n));\n\n\nIsTSPL := o -> IsRec(o) and IsBound(o.isTSPL) and o.isTSPL;\n\nDeclare(TGrp, TTensor, TTensorI, TTensorInd, TDirectSum, TInplace);\n\n#F TGrp(<s>)\n#F tSPL grouping container (i.e. parenthesis)\n#F\nClass(TGrp, Tagged_tSPL_Container, rec(\n abbrevs := [ s -> Checked(IsSPL(s), [s]) ],\n HashId := self >> let(\n\tp := self.params[1],\n\th := When(IsBound(p.HashId), p.HashId(), p),\n [ TGrp, h ] :: When(IsBound(self.tags), self.tags, [])\n )\n));\n\n#F TTensor(<A>, <B>)\n#F Nonterminal for Tensor(A, B)\n#F\nClass(TTensor, Tagged_tSPL_Container, rec(\n abbrevs := [ (A, B) -> Checked(IsNonTerminal(A), IsNonTerminal(B), [A,B]) ],\n\n dims := self >> let(\n\ta := self.params[1].dims(), b := self.params[2].dims(),\n\t[ a[1]*b[1], a[2]*b[2] ] ),\n\n terminate := self >> Tensor(self.params[1], self.params[2]),\n\n transpose := self >>\n TTensor(self.params[1].transpose(), self.params[2].transpose())\n .withTags(self.getTags()),\n\n isReal := self >> self.params[1].isReal() and self.params[2].isReal(),\n\n normalizedArithCost := self >>\n self.params[1].normalizedArithCost() * Rows(self.params[2]) +\n\tself.params[2].normalizedArithCost() * Cols(self.params[1]),\n\n HashId := self >> let(\n\th := List(self.params, i -> When(IsBound(i.HashId), i.HashId(), i)),\n When(IsBound(self.tags), Concatenation(h, self.tags), h))\n));\n\n#F TDirectSum(<A>, <B>)\n#F Nonterminal for DirectSum(A, B)\n#F\nClass(TDirectSum, Tagged_tSPL_Container, rec(\n abbrevs := [ (A, B) -> Checked(IsSPL(A), IsSPL(B), [ A, B ]) ],\n dims := self >> let(\n\ta:=self.params[1].dims(), b:=self.params[2].dims(),\n\t[ a[1]+b[1], a[2]+b[2] ]),\n\n terminate := self >> DirectSum(self.params[1], self.params[2]),\n\n transpose := self >>\n TDirectSum(self.params[1].transpose(), self.params[2].transpose())\n\t .withTags(self.getTags()),\n\n isReal := self >> self.params[1].isReal() and self.params[2].isReal(),\n\n doNotMeasure := true,\n\n HashId := self >> let(\n\th := List(self.params, i->When(IsBound(i.HashId), i.HashId(), i)),\n When(IsBound(self.tags), Concatenation(h, self.tags), h))\n));\n\n#F TTensorI(<nt>, <s>, <l>, <r>)\n#F\n#F tSPL nonterminal for A x I, I x A, (A x I)L, (I x A)L\n#F\n#F Example: TTensorI(F(2), 32, APar, APar)\n#F\nClass(TTensorI, Tagged_tSPL_Container, rec(\n abbrevs := [ (nt, s, l, r) -> Checked(\n IsSPL(nt), IsPosInt(s), l in [APar, AVec], r in [APar, AVec],\n\t[nt, s, l, r])\n ],\n\n dims := self >> self.params[1].dims()*self.params[2],\n\n SPLtSPL := (self, nt, P) >> let(\n\tA := nt[1], n := P[2], l := P[3], r := P[4],\n Cond(IsParPar(P), Tensor(I(n), A),\n IsVecVec(P), Tensor(A, I(n)),\n IsParVec(P), Tensor(I(n), A) * L(A.dims()[2]*n, n),\n IsVecPar(P), let(m:=A.dims()[2], Tensor(A, I(n)) * L(m*n, m))\n )),\n\n terminate := self >> let(\n\tP := self.params, A:=P[1].terminate(), n:= P[2], l:=P[3], r:=P[4],\n Cond(IsParPar(P), Tensor(I(n), A),\n IsVecVec(P), Tensor(A, I(n)),\n IsParVec(P), Tensor(I(n), A) * L(A.dims()[2]*n, n),\n IsVecPar(P), let(m:=A.dims()[2], Tensor(A, I(n)) * L(m*n, m)))),\n\n transpose := self >> let(p := self.params,\n TTensorI(p[1].transpose(), p[2], p[4], p[3]).withTags(self.getTags())),\n\n isReal := self >> self.params[1].isReal(),\n\n normalizedArithCost := self >>\n self.params[1].normalizedArithCost() * self.params[2],\n\n doNotMeasure := true,\n\n HashId := self >> let(\n\tp := self.params,\n\th := When(IsBound(p[1].HashId), p[1].HashId(), p[1]),\n [h, p[2], p[3], p[4]] :: When(IsBound(self.tags), self.tags, [])\n ),\n));\n\nClass(TTensorInd, Tagged_tSPL_Container, rec(\n abbrevs := [ (nt, idx, l, r) -> Checked(\n IsSPL(nt), IsVar(idx), l in [APar, AVec], r in [APar, AVec],\n\t[nt, idx, l, r])\n ],\n\n dims := self >> self.params[1].dims() * self.params[2].range,\n\n SPLtSPL := (self, nt, P) >> let(\n\tA := nt[1], idx := P[2], m := A.dims()[2], n := idx.range,\n dsA := IDirSum(idx, A),\n Cond(IsParPar(P), dsA,\n IsVecVec(P), L(m*n, m) * dsA * L(m*n, n),\n IsParVec(P), dsA * L(m*n, n),\n IsVecPar(P), L(m*n, m) * dsA)\n ),\n\n terminate := self >> let(\n\tP := self.params, A := P[1], idx:= P[2],\n lstA := List([0..idx.range-1],\n\t i -> SubstVars(Copy(A), rec((idx.id) := V(i))).terminate()),\n d := A.dims(),\n\tn := idx.range,\n dsA := DirectSum(lstA),\n Cond(IsParPar(P), dsA,\n IsVecVec(P), L(d[1]*n, d[1]) * dsA * L(d[2]*n, n),\n IsParVec(P), dsA * L(m*n, n),\n IsVecPar(P), L(m*n, m) * dsA)\n ),\n\n transpose := self >> TTensorInd(\n self.params[1].transpose(), self.params[2], self.params[4], self.params[3])\n .withTags(self.getTags()),\n\n isReal := self >> self.params[1].isReal(),\n\n normalizedArithCost := self >>\n self.params[1].normalizedArithCost() * self.params[2].range,\n\n# doNotMeasure := true,\n\n HashId := self >> let(\n\tp := self.params,\n\th := When(IsBound(p[1].HashId), p[1].HashId(), p[1]),\n [h, p[2].range, p[3], p[4]] :: When(IsBound(self.tags), self.tags, [])\n )\n));\n\n\nDeclare(TL);\n\n#F tSPL I x L x I\n#F TL(m, n, k, j)\n#F I(k), L(m, n), I(j)\nClass(TL, Tagged_tSPL_Container, rec(\n abbrevs := [ (size, stride) -> Checked(ForAll([size, stride], IsPosIntSym), [size, stride, 1, 1]),\n (size, stride, left, right) -> Checked(ForAll([size, stride, left, right], IsPosIntSym), [size, stride, left, right]) ],\n __call__ := arg >> let(self := arg[1], args := Drop(arg, 1),\n Cond(args=[1,1,1,1], I(1),\n ApplyFunc(Inherited,args))),\n\n dims := self >> Replicate(2, self.params[1]*self.params[3]*self.params[4]),\n terminate := self >> Tensor(I(self.params[3]), L(self.params[1], self.params[2]), I(self.params[4])),\n transpose := self >> TL(self.params[1], self.params[1]/self.params[2], self.params[3], self.params[4]).withTags(self.getTags()),\n isReal := self >> true,\n noCodelet := true,\n # need that for DPBench!\n doNotMeasure := true,\n transposeSymmetric := False,\n isSymmetric := self >> self.params[2]^2 = self.params[1],\n hashAs := self >> ObjId(self)(self.params[1], self.params[2], self.params[3], self.params[4]).withTags(self.getTags()),\n));\n\n#F tSPL Bit Reversal\nClass(TBR, Tagged_tSPL_Container, rec(\n abbrevs := [ n -> Checked(IsInt(n), [n])],\n dims := self >> [self.params[1], self.params[1]],\n terminate := self >> BR(self.params[1]),\n transpose := self >> self,\n isReal := True,\n doNotMeasure := true,\n));\n\nDeclare(TRDiag);\n\n#F TRDiag(<nrows>, <ncols>, <diagfunc>)\n#F\n#F TRDiag is a rectangular tall matrix, which is a diagonal\n#F zero-padded on the bottom.\n#F\n#F To obtain wide matrix (diagonal zero-padded on the right),\n#F use TRDiag(...).transpose()\n#F\n#F Example:\n#F spiral> PrintMat(MatSPL( TRDiag(6, 3, FList(TInt, [1,2,3])) ));\n#F [ [ 1, , ],\n#F [ , 2, ],\n#F [ , , 3 ],\n#F [ , , ],\n#F [ , , ],\n#F [ , , ] ]\n#F\nClass(TRDiag, Tagged_tSPL, rec(\n abbrevs := [ (m,n,diag) -> Checked(IsPosIntSym(m), IsPosIntSym(n),\n\t AnySyms(m, n) or (m>=n),\n\t IsFunction(diag) or IsFuncExp(diag),\n\t [m, n, diag])],\n\n dims := self >> let( d := [ self.params[1], self.params[2] ], Cond(self.transposed, Reversed(d), d)),\n\n # tells autolib's ConstrainPSums that params[2] must be = params[3].domain()\n # NOTE: get rid of params[2]\n paramConstraints := self >> [[self.params[2], self.params[3].domain()]],\n\n terminate := self >> let(\n res := RI(self.params[1], self.params[2]) * Diag(self.params[3]),\n\tWhen(self.transposed, res.transpose(), res)),\n\t\n conjTranspose := self >> CopyFields(self,\n\trec(params := [self.params[1], self.params[2], FConj(self.params[3])]))\n .transpose(),\n\n isReal := self >> not IsComplexT(self.params[3].range()),\n\n doNotMeasure := true,\n\n hashAs := self >> let(\n\tt := ObjId(self)(self.params[1], self.params[2],\n\t fUnk(self.params[3].range(), self.params[3].domain())),\n\ttt := t.withTags(self.getTags()),\n\tWhen(self.transposed, tt.transpose(), tt))\n));\n\n\n#F tSPL Digit Reversal\nClass(TDR, Tagged_tSPL_Container, rec(\n abbrevs := [ (n, r) -> Checked(IsInt(n) and IsInt(r) and n=r^LogInt(n,r), [n, r])],\n dims := self >> [self.params[1], self.params[1]],\n terminate := self >> DR(self.params[1], self.params[2]),\n transpose := self >> self,\n isReal := True,\n doNotMeasure := true,\n));\n\nDeclare(TReflL);\n#F tSPL Refl(L(mn,m))\nClass(TReflL, Tagged_tSPL_Container, rec(\n abbrevs := [ (mn, m) -> Checked(IsInt(mn) and IsInt(m), [mn, m]) ],\n dims := self >> self.terminate().dims(),\n terminate := self >> let(mn := self.params[1], m:=self.params[2], N := mn/2,\n Refl(N, 2*N-1, N, L(mn, m))),\n transpose := self >> TReflL(self.params[1], self.params[1]/self.params[2]).withTags(self.getTags()),\n isReal := True,\n doNotMeasure := true,\n));\n\n\nDeclare(TRC, TCompose, TDiag, TICompose);\n\n\n#F tSPL RC(.)\nClass(TRC, Tagged_tSPL_Container, rec(\n _short_print := true,\n abbrevs := [ (A) -> Checked(IsNonTerminal(A) or IsSPL(A), [A]) ],\n dims := self >> 2*self.params[1].dims(),\n terminate := self >> Mat(MatSPL(RC(self.params[1]))),\n\n transpose := self >> ObjId(self)(\n\tself.params[1].conjTranspose()).withTags(self.getTags()),\n\n conjTranspose := self >> self.transpose(),\n\n isReal := self >> true,\n\n # Do not use doNotMeasure, this will prevent TRC_By_Def from ever being found!\n doNotMeasure := false,\n normalizedArithCost := self >> self.params[1].normalizedArithCost(),\n\n HashId := self >> let(\n\th := [ When(IsBound(self.params[1].HashId), self.params[1].HashId(),\n\t\t self.params[1]) ],\n When(IsBound(self.tags), Concatenation(h, self.tags), h))\n));\n\nClass(TMat, Tagged_tSPL, rec(\n abbrevs := [ m -> Checked(IsMat(m), [m]) ],\n dims := self >> DimensionsMat(self.params[1]),\n terminate := self >> Mat(self.params[1]),\n transpose := self >> ObjId(self)(TransposedMat(self.params[1])).withTags(self.getTags()),\n isReal := self >> IsRealMat(self.params[1]),\n isInplace := self >> false,\n normalizedArithCost := self >> 2 * Rows(self.params[1]) * Cols(self.params[1]),\n doNotMeasure := false,\n));\n\n#F tSPL Diag(d)\nClass(TDiag, Tagged_tSPL_Container, rec(\n abbrevs := [ (D) -> [D] ],\n dims := self >> let(n:=self.params[1].domain(), [n,n]),\n terminate := self >> Diag(self.params[1]),\n transpose := self >> Copy(self),\n conjTranspose := self >> ObjId(self)(FConj(self.params[1])).withTags(self.getTags()),\n\n isReal := self >> Diag(self.params[1]).isReal(),\n\n doNotMeasure := true,\n noCodelet := true,\n hashAs := self >> ObjId(self)(FUnk(self.params[1].domain())).withTags(self.getTags()),\n #NOTE: depends on wether the whole transform is complex...\n normalizedArithCost := self >> When(self.params[1].isReal(), 2*Rows(self), 6*Rows(self))\n));\n\n#F tSPL RCDiag(d)\nClass(TRCDiag, Tagged_tSPL_Container, rec(\n abbrevs := [ (D) -> [D] ],\n dims := self >> let(n:=self.params[1].domain(), [n,n]),\n terminate := self >> RCDiag(self.params[1]),\n # NOTE: transpose on real == conjugate; transpose on complex == id. What to use?\n# transpose := self >> let(d := self.params[1].var.value, t := d.t.t, size := d.t.size,\n# newd := List(d.v, i-> t.value(Complex(ReComplex(i.v), -ImComplex(i.v)))),\n# FData(newd)),\n transpose := self >> CopyFields(self, rec(transposed := not self.transposed)),\n isReal := True,\n doNotMeasure := true,\n noCodelet := true,\n hashAs := self >> ObjId(self)(FUnk(self.params[1].domain())).withTags(self.getTags()),\n normalizedArithCost := self >> 3*Rows(self)\n));\n\n\n\n#F tSPL Id(f)\nClass(TId, TDiag);\n\n\nDeclare(TCond);\n#F tSPL Cond\nClass(TCond, Tagged_tSPL_Container, rec(\n abbrevs := [ (f, a, b) -> Checked(IsBound(f.ev), [f,a,b]) ],\n dims := self >> self.params[2].dims(),\n terminate := self >> COND(self.params[1], self.params[2].terminate(), self.params[3].terminate()),\n transpose := self >> TCond(self.params[1], self.params[2].transpose(), self.params[3].transpose()), # maybe\n));\n\nDeclare(TRaderMid);\n#F tSPL RaderMid(N, k, root, transp)\nClass(TRaderMid, Tagged_tSPL_Container, rec(\n # -- Rader infrastructure --\n raderDiag := (N, k, root) -> SubList(ComplexFFT(List([0..N-2], x->ComplexW(N, k*root^x mod N))), 2) / (N-1),\n raderMid := (self, N, k, root) >>\n DirectSum(Mat([[1, 1], [1, -1/(N-1)]]),\n Diag(FData(self.raderDiag(N, k, root)))),\n # -- tSPL infrastructure --\n abbrevs := [ (N, k, root) -> [N, k, root, false],\n (N, k, root, transp) -> [N, k, root, transp] ],\n dims := self >> let(N:=self.params[1], [N,N]),\n terminate := self >> let(spl := self.raderMid(self.params[1], self.params[2], self.params[3]),\n When(self.params[4], spl.transpose(), spl)),\n transpose := self >> TRaderMid(self.params[1], self.params[2], self.params[3], not self.params[4]).withTags(self.getTags()),\n isReal := False,\n doNotMeasure := true,\n noCodelet := true,\n));\n\n\n#F tSPL Compose([A,B,...])\nClass(TCompose, Tagged_tSPL_Container, rec(\n abbrevs := [ (l) -> Checked(IsList(l), [l]) ],\n dims := self >> [self.params[1][1].dims()[1], self.params[1][Length(self.params[1])].dims()[2]],\n terminate := self >> Compose(List(self.params[1], i->i.terminate())),\n transpose := self >> TCompose(Reversed(List(self.params[1], i->i.transpose()))).withTags(self.getTags()),\n isReal := self >> ForAll(self.params[1], i->i.isReal()),\n doNotMeasure := true,\n normalizedArithCost := self >> Sum(List(self.params[1], i->i.normalizedArithCost())),\n\n HashId := self >> let(h := List(self.params[1], i->When(IsBound(i.HashId), i.HashId(), i)),\n When(IsBound(self.tags), Concatenation(h, self.tags), h))\n));\n\n\n#F tSPL ICompose(<var>, <domain>, <nonterm>, <attrib>)\nClass(TICompose, Tagged_tSPL_Container, rec(\n abbrevs := [ (var,domain,l) -> [var, domain, l] ],\n dims := self >> self.params[3].dims(),\n terminate := self >> ICompose(self.params[1], self.params[2], self.params[3]).unroll(),\n\n unroll := self >> let(\n var := self.params[1],\n domain := self.params[2],\n expr := self.params[3],\n tag := self.getTags(),\n TCompose(\n List([ 0 .. domain - 1 ],\n index_value -> SubstBottomUp(\n Copy(expr), var,\n e -> V(index_value))))),\n\n isReal := self >> ICompose(self.params[1], self.params[2], self.params[3]).unroll().isReal(),\n\n transpose := self >> let(\n var := self.params[1],\n dom := self.params[2],\n ch := self.params[3],\n newvar := var.clone(),\n tags := self.getTags(),\n TICompose(newvar, dom,\n SubstVars(Copy(ch.transpose()), tab((var.id) := dom-1-newvar))).withTags(tags)\n )\n));\n\n\nDeclare(TGath, TScat, TPrm, TConj, TS);\n#F tSPL Gath(d)\nClass(TGath, Tagged_tSPL_Container, rec(\n abbrevs := [ (tspl) -> [tspl] ],\n dims := self >> [self.params[1].domain(), self.params[1].range()],\n terminate := self >> Gath(self.params[1]),\n transpose := self >> TScat(self.params[1]).withTags(self.getTags()),\n isReal := True,\n doNotMeasure := true,\n noCodelet := true,\n normalizedArithCost := self >> 0\n));\n\n\nClass(TScat, Tagged_tSPL_Container, rec(\n abbrevs := [ (tspl) -> [tspl] ],\n dims := self >> [self.params[1].range(),self.params[1].domain()],\n terminate := self >> Scat(self.params[1]),\n transpose := self >> TGath(self.params[1]).withTags(self.getTags()),\n isReal := True,\n doNotMeasure := true,\n noCodelet := true,\n normalizedArithCost := self >> 0\n));\n\n\nClass(TPrm, Tagged_tSPL_Container, rec(\n abbrevs := [ (tspl) -> [tspl] ],\n dims := self >> Cond(IsBound(self.params[1].domain), [self.params[1].domain(), self.params[1].range()], self.params[1].dims()),\n terminate := self >> Prm(self.params[1]),\n transpose := self >> TPrm(self.params[1].transpose()).withTags(self.getTags()),\n isReal := True,\n doNotMeasure := true,\n noCodelet := true,\n normalizedArithCost := self >> 0\n));\n\n\nClass(TConj, Tagged_tSPL_Container, rec(\n abbrevs := [ (tspl, prm) -> [tspl,prm.transpose(),prm],\n (tspl, prml, prmr) -> [tspl,prml,prmr] ],\n dims := self >> [self.params[2].domain(), self.params[3].range()],\n terminate := self >> ConjLR(self.params[1].terminate(), self.params[2], self.params[3]),\n transpose := self >> TConj(self.params[1].transpose(), self.params[3].transpose(), self.params[2].transpose()).withTags(self.getTags()),\n isReal := self >> self.params[1].isReal(),\n doNotMeasure := false,\n noCodelet := true,\n normalizedArithCost := self >> self.params[1].normalizedArithCost()\n));\n\n\nClass(TS, Tagged_tSPL_Container, rec(\n abbrevs := [ (N) -> [N, false],\n (N, t) -> [N, t] ],\n dims := self >> [self.params[1], self.params[1]],\n terminate := self >> When(self.params[2], S(self.params[1]).transpose(), S(self.params[1])),\n transpose := self >> TS(self.params[1], not self.params[2]).withTags(self.getTags()),\n isReal := True,\n doNotMeasure := true,\n noCodelet := true,\n normalizedArithCost := self >> self.params[1] - 1\n));\n\nClass(TInplace, Tagged_tSPL_Container, rec(\n abbrevs := [ (tspl) -> [tspl] ],\n dims := self >> self.params[1].dims(),\n terminate := self >> self.params[1].terminate(),\n transpose := self >> TInplace(self.params[1].transpose()).withTags(self.getTags()),\n isReal := self >> self.params[1].isReal(),\n isInplace := True,\n doNotMeasure := true,\n noCodelet := true,\n normalizedArithCost := self >> self.params[1].normalizedArithCost()\n));\n\n\n\nInterleavedComplexT := t -> TRC(t);\nSplitComplexT := t -> let(r:= Rows(t), c:=Cols(t), TConj(TRC(t), L(2*r, 2), L(2*c, c)));\nComplexT := (t,opts) -> When((not IsBound(opts.interleavedComplex)) or (IsBound(opts.interleavedComplex) and opts.interleavedComplex), InterleavedComplexT(t), SplitComplexT(t));\n\nInterleavedSplitComplexT := t -> let(r:= Rows(t), c:=Cols(t), TConj(TRC(t), fId(2*r), L(2*c, c)));\n", "meta": {"hexsha": "76cd3d9c406176175df3c9dd8231158f14999bd3", "size": 20000, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "namespaces/spiral/paradigms/common/nonterms.gi", "max_stars_repo_name": "sr7cb/spiral-software", "max_stars_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_stars_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_stars_count": 42, "max_stars_repo_stars_event_min_datetime": "2019-09-01T19:29:39.000Z", "max_stars_repo_stars_event_max_datetime": "2022-01-17T12:26:12.000Z", "max_issues_repo_path": "namespaces/spiral/paradigms/common/nonterms.gi", "max_issues_repo_name": "sr7cb/spiral-software", "max_issues_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_issues_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_issues_count": 12, "max_issues_repo_issues_event_min_datetime": "2020-11-20T16:15:52.000Z", "max_issues_repo_issues_event_max_datetime": "2022-01-07T21:17:28.000Z", "max_forks_repo_path": "namespaces/spiral/paradigms/common/nonterms.gi", "max_forks_repo_name": "sr7cb/spiral-software", "max_forks_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_forks_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_forks_count": 21, "max_forks_repo_forks_event_min_datetime": "2019-08-20T19:27:52.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-01T22:11:18.000Z", "avg_line_length": 35.5871886121, "max_line_length": 177, "alphanum_fraction": 0.5754, "num_tokens": 6275, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.523420348936324, "lm_q2_score": 0.5544704649604273, "lm_q1q2_score": 0.2902211242444727}}
{"text": "\n## Copyright (c) 2018-2021, Carnegie Mellon University\n## See LICENSE for details\n\nNewRulesFor(TFCall, rec(\n TFCall_tag := rec(\n forTransposition := false,\n children := nt -> [[ nt.params[1].withTags(nt.getTags()) ]],\n apply := (nt, c, cnt) -> c[1]\n )\n));\n\nNewRulesFor(TDeviceCall, rec(\n TFCall_tag := rec(\n forTransposition := false,\n children := nt -> [[ nt.params[1].withTags(nt.getTags()) ]],\n apply := (nt, c, cnt) -> c[1]\n )\n));\n\nNewRulesFor(TSparseMat, rec(\n TSparseMat_base := rec(\n forTransposition := false,\n children := nt -> [[ ]],\n applicable := (self, nt) >> When(IsBound(self.max_rows), nt.params[1][1] <= self.max_rows, true),\n apply := function(nt, c, cnt)\n local P, mat, i, j, rdata;\n P := nt.params;\n mat := MatSPL(ApplyFunc(O, P[1]));\n \n for i in [0..P[1][1]-1] do\n rdata := Drop(Filtered(P[2], ii->ii[1] = i)[1], 1);\n for j in rdata do\n mat[i+1][j[1]+1] := j[2];\n od;\n od; \n \n return Mat(mat);\n end\n ),\n TSparseMat_VStack := rec(\n forTransposition := false,\n applicable := nt -> nt.params[1][1] > 1,\n children := nt -> [ List([0..nt.params[1][1]-1], i->TSparseMat([1, nt.params[1][2]], [let(row := Filtered(nt.params[2], j->j[1] = i)[1], [0] :: Drop(row, 1))])) ],\n apply := (nt, c, cnt) -> BB(VStack(c))\n ),\n));\n\nNewRulesFor(TIterHStack, rec(\n TIterHStack_tag := rec(\n forTransposition := false,\n children := nt -> [[ nt.params[1].withTags(nt.getTags()), InfoNt(nt.params[2]) ]],\n apply := (nt, c, cnt) -> IterHStack(cnt[2].params[1], cnt[2].params[1].range, c[1])\n )\n));\n\nNewRulesFor(TIterVStack, rec(\n TIterVStack_tag := rec(\n forTransposition := false,\n children := nt -> [[ nt.params[1].withTags(nt.getTags()), InfoNt(nt.params[2]) ]],\n apply := (nt, c, cnt) -> IterVStack(cnt[2].params[1], cnt[2].params[1].range, c[1])\n )\n));\n\nNewRulesFor(TNoDiagPullinLeft, rec(\n TNoDiagPullinLeft_tag := rec(\n forTransposition := false,\n children := nt -> [[ nt.params[1].withTags(nt.getTags()) ]],\n apply := (nt, c, cnt) -> NoDiagPullinLeft(c[1])\n )\n));\n\nNewRulesFor(TNoDiagPullinRight, rec(\n TNoDiagPullinRight_tag := rec(\n forTransposition := false,\n children := nt -> [[ nt.params[1].withTags(nt.getTags()) ]],\n apply := (nt, c, cnt) -> NoDiagPullinRight(c[1])\n )\n));\n\nNewRulesFor(TNoPullLeft, rec(\n TNoPullLeft_tag := rec(\n forTransposition := false,\n children := nt -> [[ nt.params[1].withTags(nt.getTags()) ]],\n apply := (nt, c, cnt) -> NoPullLeft(c[1])\n )\n));\n\nNewRulesFor(TNoPullRight, rec(\n TNoPullRight_tag := rec(\n forTransposition := false,\n children := nt -> [[ nt.params[1].withTags(nt.getTags()) ]],\n apply := (nt, c, cnt) -> NoPullRight(c[1])\n )\n));\n\nNewRulesFor(TColMajor, rec(\n TColMajor_MDDFT_2D := rec(\n forTransposition := false,\n switch := false,\n applicable := (self, nt) >> ObjId(nt.params[1]) = MDDFT and Length(nt.params[1].params[1]) = 2,\n\n children := nt -> [[ nt.params[1].withTags(nt.getTags()) ]],\n apply := (nt, c, cnt) -> let(n1 := nt.params[1].params[1][1], n2 := nt.params[2][1].params[1][2], \n prm := L(n1*n2, n2),\n iprm := prm.transpose(),\n iprm * c[1] * prm)\n ),\n TColMajor_MDDFT_3D := rec(\n forTransposition := false,\n switch := false,\n applicable := (self, nt) >> ObjId(nt.params[1]) = MDDFT and Length(nt.params[1].params[1]) = 3,\n\n children := nt -> [[ nt.params[1].withTags(nt.getTags()) ]],\n apply := (nt, c, cnt) -> let(n1 := nt.params[1].params[1][1], n2 := nt.params[1].params[1][2], n3 := nt.params[1].params[1][3], \n # prm := Tensor(I(n1), L(n2*n3, n3)) * L(n1*n2*n3, n2*n3),\n prm := Prm(fCompose(L(n1*n2*n3, n2*n3), fTensor(fId(n1), L(n2*n3, n3)))),\n # iprm := L(n1*n2*n3, n1) * Tensor(I(n1), L(n2*n3, n2)),\n iprm := prm.transpose(),\n iprm * c[1] * prm)\n ),\n TColMajor_MDDFT_tensorFlip := rec(\n forTransposition := false,\n applicable := (self, nt) >> ObjId(nt.params[1]) = MDDFT,\n\n children := nt -> [[ ApplyFunc(MDDFT, [Reversed(nt.params[1].params[1])]::Drop(nt.params[1].params, 1)).withTags(nt.getTags()) ]],\n apply := (nt, c, cnt) -> c[1]\n ),\n));\n", "meta": {"hexsha": "10009a80c9d1dcc9460d405fe423a2226359aa13", "size": 4568, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "breakdown/tspl.gi", "max_stars_repo_name": "franzfranchetti/spiral-package-fftx", "max_stars_repo_head_hexsha": "3149606d3d60a9b50c225ec1e8450628d543698b", "max_stars_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2021-06-15T12:40:19.000Z", "max_stars_repo_stars_event_max_datetime": "2021-06-15T12:40:19.000Z", "max_issues_repo_path": "breakdown/tspl.gi", "max_issues_repo_name": "franzfranchetti/spiral-package-fftx", "max_issues_repo_head_hexsha": "3149606d3d60a9b50c225ec1e8450628d543698b", "max_issues_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2021-01-05T20:58:29.000Z", "max_issues_repo_issues_event_max_datetime": "2021-08-18T20:10:45.000Z", "max_forks_repo_path": "breakdown/tspl.gi", "max_forks_repo_name": "franzfranchetti/spiral-package-fftx", "max_forks_repo_head_hexsha": "3149606d3d60a9b50c225ec1e8450628d543698b", "max_forks_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_forks_count": 5, "max_forks_repo_forks_event_min_datetime": "2020-12-14T18:24:29.000Z", "max_forks_repo_forks_event_max_datetime": "2021-06-15T12:40:20.000Z", "avg_line_length": 35.1384615385, "max_line_length": 171, "alphanum_fraction": 0.5218914186, "num_tokens": 1443, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.6224593312018545, "lm_q2_score": 0.4649015713733885, "lm_q1q2_score": 0.2893823211917706}}
{"text": "\n# Copyright (c) 2018-2021, Carnegie Mellon University\n# See LICENSE for details\n\n\n#\nIDFUNC := (N,n,ofs) -> #Cond(\n# (N mod n) = 0 and (ofs mod n) = 0 and n<>1, fTensor(fBase(N/n, ofs/n), fId(n)),\n# IsInt(n) and IsInt(N) and IsInt(ofs) and Gcd(n, N, ofs) > 1, let(g := Gcd(n,N, ofs), fTensor(fAdd(N/g, n/g, ofs/g), fId(g))),\n H(N,n,ofs,1);\n#);\n# fAdd(N,n,ofs));\n\nRID := (N, n, ofs) -> Gath(IDFUNC(N,n,ofs));\nWID := (N, n, ofs) -> Scat(IDFUNC(N,n,ofs));\n\n\n###########################################################################################\n# SumsSPL(spl, opts)\nSumsSPL := function(spl, opts) \n local s;\n if IsBound(opts.sumsgen) then\n trace_log.beginStage(\"SPL\",\"Sigma-SPL\", spl); \n s := opts.sumsgen(spl, opts);\n trace_log.endStage(\"SPL\",\"Sigma-SPL\", s); \n return s;\n else\n Error(\"opts.sumsgen must be defined!\");\n fi;\nend;\n\nSumsSPLOpts := function(spl,opts)\n local sums;\n sums:=SumsSPL(spl,opts);\n return ApplyStrategy(sums,opts.formulaStrategies.postProcess,UntilDone, opts);\nend;\n\nLiftDataSums := function(sums)\n local p, datas, sums;\n p := Pull(sums, Data, e->e.child(1), e->[e.var, e.value]);\n sums := p[2];\n datas := tab();\n DoForAll(p[1], function(vv) datas.(vv[1].id) := vv[2]; end);\n sums.datas := datas;\n return sums;\nend;\n\nFinalizeSums := s->s;\nsums -> SubstBottomUp(\n sums,\n [Compose, @(1).target(Scat), @(2).target(Gath)],\n e -> let(n := Rows(@(2).val),\n j := Ind(n),\n fbase := fBase(n,j),\n ISum(j, n,\n Scat(fCompose(@(1).val.func, fbase)) *\n Gath(fCompose(@(2).val.func, fbase)))));\n\n###########################################################################################\nDoNotReorder := function(sums) sums.doNotReorder := true; return sums; end;\n###########################################################################################\nNonTerminal.sums := self >> self;\n\nO.sums := self >> self;\n\nPermClass.sums := self >> Prm(self);\n\nRot.sums := self >> ExpandRotationsSPL(self).sums();\n\nSym.sums := self >> #When(self.isPermutation(),\n# SumsSPL(Perm(foldPerm(self.getObj()), Rows(self))),\n self.getObj().sums();\n\nI.sums := self >> Prm(fId(self.params[1]));\n\n# Perm is given by a list of numbers, and is only used for unrolled code,\n# so I convert it to Gath, which is simpler. Using Prm would require\n# something invertible, and a list of numbers is not invertible when\n# using FList (inversion not implemented).\n#\nPerm.sums := self >> let(\n N := self.size,\n plist_r := Permuted([1..N], self.element^-1) - 1, # we want 0-based perms\n #plist_w := Permuted([1..N], self.element) - 1, # we want 0-based perms\n Gath(FList(N, plist_r).setRange(N))\n);\n\nDiag._sums := self >> let(\n N := Rows(self), ind := Ind(N), d := Dat(TUnknown),\n DoNotReorder(\n ISum(ind, N,\n Data(d, self.element.lambda(),\n Compose(Scat(fBase(N, ind)),\n Blk1( nth(d, ind) ), # SS( $.. $..)\n Gath(fBase(N, ind)))) ))\n);\n\nDiag.sums := self >> self;\nRCDiag.sums := self >> self;\n\nMat.sums := self >> Blk(self.element);\n\nSparse.sums := self >> Blk(MatSparseSPL(self));\n\n# Operators\n\nScale.sums := self >> Inherit(self, rec(_children := [self.child(1).sums()]));\n\n#Compose(\n# Diag(LambdaList([1..Rows(self)], Subst(i -> $(self.scalar)))), self.child(1)).sums();\n\nConjugate.sums := self >> let(\n O := self.child(1), perm := self.child(2), Tperm := perm.transpose(),\n Compose(Tperm, O, perm).sums()\n);\n\nCompose.sums := self >> Cond(self.isPermutation(),\n Prm(ApplyFunc(fCompose, List(Reversed(self.children()), c->c.sums().func))),\n Compose(Map(self.children(), c->c.sums())));\n\n_directSumSums := (obj, roverlap, coverlap) ->\n let(cspans := BaseOverlap.spans(roverlap, List(obj.children(), Cols)),\n rspans := BaseOverlap.spans(coverlap, List(obj.children(), Rows)),\n nblocks := obj.numChildren(),\n C := Cols(obj),\n R := Rows(obj),\n OP := When(coverlap > 0, SUMAcc, SUM),\n OP( Map([1..nblocks],\n i -> Compose( #W(N, bksize_cols, fTensor(fBase(nblocks, ind), fId(bksize)))\n WID(R, 1 + rspans[i][2] - rspans[i][1], rspans[i][1]-1),\n obj.child(i).sums(),\n RID(C, 1 + cspans[i][2] - cspans[i][1], cspans[i][1]-1) ))));\n\nDirectSum.sums := self >> Cond(self.isPermutation(),\n Prm(ApplyFunc(fDirsum, List(self.children(), c->c.sums().func))),\n _directSumSums(self, 0, 0));\n\nColDirectSum.sums := self >> _directSumSums(self, 0, self.overlap);\n\nRowTensor.sums := self >>\n let( A := self.child(1),\n i := Ind(self.isize),\n ISum(i, i.range,\n Scat(fTensor(fBase(self.isize, i), fId(Rows(A)))) *\n A.sums() *\n Gath(fAdd(Cols(self), Cols(A), i * (Cols(A) - self.overlap)))) );\n\nColTensor.sums := self >>\n let( A := self.child(1),\n i := Ind(self.isize),\n ISumAcc(i, i.range,\n Scat(fAdd(Rows(self), Rows(A), i * (Rows(A) - self.overlap))) *\n A.sums() *\n Gath(fTensor(fBase(self.isize, i), fId(Cols(A))))) );\n\n#Tensor.sums := self >>\n# Cond(self.isPermutation(),\n# Prm(\n# ApplyFunc(fTensor, List(self.children(), c->c.sums().func))),\n\n# self.numChildren() > 2,\n# self.rightBinary().sums(),\n\n# not IsIdentitySPL(self.child(1)),\n# self.parallelForm().sums(),\n\n# let(nblocks := Cols(self.child(1)),\n# ind := Ind(nblocks),\n# bkcols := Cols(self.child(2)),\n# bkrows := Rows(self.child(2)),\n# cols := Cols(self), rows := Rows(self),\n# ISum(ind, nblocks,\n# Compose(Scat(fTensor(fBase(nblocks, ind), fId(bkrows))),\n# self.child(2).sums(),\n# Gath(fTensor(fBase(nblocks, ind), fId(bkcols)))))\n# ));\n\nTensor.gathTensor := (self,i) >> fTensor;\nTensor.scatTensor := (self,i) >> fTensor;\nTensor.fTensor := fTensor;\nTensor.sums := meth(self)\n local ch, col_prods, row_prods, col_prods_rev, row_prods_rev, i, j1, j2, j1b, j2b, bkcols, bkrows, prod, term;\n if self.isPermutation() then return\n Prm(ApplyFunc(self.fTensor, List(self.children(), c->c.sums().func)));\n elif ForAll(self.children(), x->ObjId(x)=Diag) then return\n Diag(ApplyFunc(diagTensor, List(self.children(), c->c.element)));\n fi;\n\n ch := self.children();\n col_prods := ScanL(ch, (x,y)->x*Cols(y), 1);\n col_prods_rev := Drop(ScanR(ch, (x,y)->x*Cols(y), 1), 1);\n #row_prods := ScanL(ch, (x,y)->x*Rows(y), 1);\n #row_prods_rev := DropLast(ScanR(ch, (x,y)->x*Rows(y), 1), 1);\n\n prod := [];\n for i in [1..Length(ch)] do\n if not IsIdentitySPL(ch[i]) then\n bkcols := Cols(ch[i]);\n bkrows := Rows(ch[i]);\n j1 := Ind(col_prods[i]);\n j2 := Ind(col_prods_rev[i]);\n j1b := When(j1.range = 1, 0, fBase(j1));\n j2b := When(j2.range = 1, 0, fBase(j2));\n\n term := Scat(self.scatTensor(i)(Filtered(\n [j1b, fId(bkrows), j2b], x->x<>0))) *\n ch[i].sums() *\n Gath(self.gathTensor(i)(Filtered(\n [j1b, fId(bkcols), j2b], x->x<>0)));\n\n if j2.range <> 1 then\n term := ISum(j2, j2.range, term); fi;\n if j1.range <> 1 then\n term := ISum(j1, j1.range, term); fi;\n\n Add(prod, term);\n fi;\n od;\n return Compose(prod);\nend;\n\nClass(GammaTensor, Tensor, rec(\n gathTensor := (self,i) >> When(i=self.numChildren(), gammaTensor, fTensor),\n scatTensor := (self,i) >> When(i=1, gammaTensor, fTensor),\n #fTensor := gammaTensor,\n toAMat := self >> self.sums().toAMat()\n));\n\n_partSum := l -> List([1..Length(l)+1], i -> Sum(l{[1..i-1]}));\n\n#-----------------------------------------------------------------------\nIterDirectSum.sums := self >>\n let(s := fTensor(fBase(self.domain, self.var), fId(Rows(self.child(1)))),\n g := fTensor(fBase(self.domain, self.var), fId(Cols(self.child(1)))),\n ISum(self.var, self.domain,\n Scat(s) * self.child(1).sums() * Gath(g)));\n\n\n_sbs := function(s, e)\n local cs;\n cs := Set(Copy(s));\n SubtractSet(cs, Set([e]));\n return cs;\nend;\n\n#-----------------------------------------------------------------------\nIRowDirSum.sums := meth(self)\n local idx, i, ii, bkrows2, ivars,k, nblocks, q, overlap, s, cd1, rows, bkrows, vars, lambda, bs, ps, fps, gcd, rbase, len, rdom, rows_data, rows_by_gcd, rows_by_one, cols, bkcols, cdom, cbase, g,\n j, pj, rlambda;\n\n nblocks := self.domain;\n q := self.var;\n overlap := self.overlap;\n cd1 := spiral.code.RulesMergedStrengthReduce(self.child(1).dims()[1]);\n vars := _sbs(Filtered(cd1.free(), IsLoopIndex), q);\n if IsInt(cd1) then\n rows := Rows(self);\n bkrows := Rows(self.child(1));\n s := fTensor(fBase(nblocks, self.var), fId(bkrows));\n# FF: NOTE!! temporary hack for SAR\n elif IsExp(cd1) and Length(vars) = 0 then\n bkrows := _evInt(List(self.unrolledChildren(), i->spiral.code.RulesStrengthReduce(Rows(i))));\n rows := Rows(self);\n ps := _partSum(bkrows);\n gcd := Gcd(List(Concat(ps, [rows]), _unwrapV));\n rbase := FData(List(ps, i->TInt.value(i/gcd)));\n rdom := rbase.at(q+1)-rbase.at(q);\n s := fTensor(fAdd(rows/gcd, rdom, rbase.at(q)), fId(gcd));\n elif IsExp(cd1) and ObjId(cd1)=mul and IsValue(cd1.args[1]) then\n if Length(vars)=1 then\n lambda := Lambda(vars, Lambda(q, cd1));\n bs := Product(List(vars, i->i.range));\n bkrows := List(lambda.tolist(), i->i.tolist());\n ps := List(bkrows, _partSum);\n fps := Flat(ps);\n gcd := Gcd(List(Concat(fps, [cd1.args[1].v]), _unwrapV));\n rbase := FData(List(Flat(ps), i->TInt.value(i/gcd)));\n len := Length(ps[1]);\n rdom := rbase.at(vars[1]*len+q+1)-rbase.at(vars[1]*len+q);\n rows_data := idiv(Rows(self), gcd);\n rows_by_gcd := FData(Lambda(vars, rows_data).tolist()).at(vars[1]);\n s := fTensor(fAdd(rows_by_gcd, rdom, rbase.at(vars[1]*len+q)), fId(gcd));\n elif Length(vars) = 2 and Length(Filtered(vars, IsParallelLoopIndex)) = 1 then\n pj := Filtered(vars, IsParallelLoopIndex)[1];\n j := Filtered(vars, i -> not IsParallelLoopIndex(i))[1];\n lambda := Lambda(pj, Lambda(j, Lambda(q, cd1)));\n bs := Product(List(vars, i->i.range));\n bkrows := List(Flat(List(lambda.tolist(), i->i.tolist())), j->spiral.code.RulesMergedStrengthReduce(j.tolist()));\n ps := List(bkrows, _partSum);\n fps := Flat(ps);\n gcd := Gcd(List(Concat(fps, [cd1.args[1].v]), _unwrapV));\n rbase := FData(List(Flat(ps), i->TInt.value(i/gcd)));\n len := Length(ps[1]);\n rdom := rbase.at((pj * j.range +j)*len+q+1)-rbase.at((pj * j.range +j)*len+q);\n rows_data := idiv(Rows(self), gcd);\n rlambda := Lambda(pj, Lambda(j, rows_data));\n rows_by_gcd := FData(Flat(List(rlambda.tolist(), j->j.tolist() ))).at(pj * j.range +j);\n s := fTensor(fAdd(rows_by_gcd, rdom, rbase.at((pj * j.range +j)*len+q)), fId(gcd));\n elif Length(vars) = 3 and Length(Filtered(vars, IsParallelLoopIndex)) = 1 then\n pj := Filtered(vars, IsParallelLoopIndex)[1];\n ivars := Filtered(vars, i -> not IsParallelLoopIndex(i));\n j := ivars[2];\n k := ivars[1];\n\t k.isSWPLoopIndex := true;\n lambda := Lambda(k, Lambda(pj, Lambda(j, Lambda(q, cd1))));\n bs := Product(List(vars, i->i.range));\n bkrows := List(Flat(List(lambda.tolist(), i->i.tolist())), j-> (List(j.tolist(),kk->Flat(spiral.code.RulesMergedStrengthReduce(kk.tolist())))));\n bkrows2 :=[]; \n for i in [1..Length(bkrows)] do\n for ii in [1..Length(bkrows[i])] do\n Add(bkrows2, bkrows[i][ii]);\n od; \n \n od; \n ps := List(bkrows2, _partSum);\n fps := Flat(ps);\n gcd := Gcd(List(Concat(fps, [cd1.args[1].v]), _unwrapV));\n rbase := FData(List(Flat(ps), i->TInt.value(i/gcd)));\n len := Length(ps[1]);\n idx := k * (pj.range * j.range) + (pj * j.range) + j;\n rdom := rbase.at(idx*len+q+1)-rbase.at(idx*len+q);\n rows_data := idiv(Rows(self), gcd);\n rlambda := Lambda(k, Lambda(pj, Lambda(j, rows_data)));\n rows_by_gcd := FData(Flat(List(rlambda.tolist(), j->List(j.tolist(),i->i.tolist())))).at(idx);\n s := fTensor(fAdd(rows_by_gcd, rdom, rbase.at(idx*len+q)), fId(gcd));\n else\n Error(\"Unsupported case -- please fix IRowDirSum.sums in spl2sums.gi:308\");\n fi;\n elif IsExp(cd1) then\n vars := _sbs(Filtered(cd1.free(), IsLoopIndex), q);\n if Length(vars)=1 then\n lambda := Lambda(vars, Lambda(q, cd1));\n bs := Product(List(vars, i->i.range));\n bkrows := List(lambda.tolist(), i->i.tolist());\n ps := List(bkrows, _partSum);\n fps := Flat(ps);\n rbase := FData(List(Flat(ps), i->TInt.value(i)));\n len := Length(ps[1]);\n rdom := rbase.at(vars[1]*len+q+1)-rbase.at(vars[1]*len+q);\n rows_data := Rows(self);\n rows_by_one := FData(Lambda(vars, rows_data).tolist()).at(vars[1]);\n s := fAdd(rows_by_one, rdom, rbase.at(vars[1]*len+q));\n elif Length(vars) = 2 and Length(Filtered(vars, IsParallelLoopIndex)) = 1 then\n pj := Filtered(vars, IsParallelLoopIndex)[1];\n j := Filtered(vars, i -> not IsParallelLoopIndex(i))[1];\n lambda := Lambda(pj, Lambda(j, Lambda(q, cd1)));\n bs := Product(List(vars, i->i.range));\n\n bkrows := List(Flat(List(lambda.tolist(), i->i.tolist())), j->spiral.code.RulesMergedStrengthReduce(j.tolist()));\n ps := List(bkrows, _partSum);\n fps := Flat(ps);\n rbase := FData(List(Flat(ps), i->TInt.value(i)));\n len := Length(ps[1]);\n rdom := rbase.at((pj * j.range +j)*len+q+1)-rbase.at((pj * j.range +j)*len+q);\n\n rows_data := Rows(self);\n rlambda := Lambda(pj, Lambda(j, rows_data));\n rows_by_one := FData(Flat(List(rlambda.tolist(), j->j.tolist() ))).at(pj * j.range +j);\n s := fAdd(rows_by_one, rdom, rbase.at((pj * j.range +j)*len+q));\n elif Length(vars) = 3 and Length(Filtered(vars, IsParallelLoopIndex)) = 1 then\n pj := Filtered(vars, IsParallelLoopIndex)[1];\n ivars := Filtered(vars, i -> not IsParallelLoopIndex(i));\n j := ivars[2];\n k := ivars[1];\n k.isSWPLoopIndex := true;\n lambda := Lambda(k, Lambda(pj, Lambda(j, Lambda(q, cd1))));\n bs := Product(List(vars, i->i.range));\n bkrows := List(Flat(List(lambda.tolist(), i->i.tolist())), j-> (List(j.tolist(),kk->Flat(spiral.code.RulesMergedStrengthReduce(kk.tolist())))));\n bkrows2 :=[];\n for i in [1..Length(bkrows)] do\n for ii in [1..Length(bkrows[i])] do\n Add(bkrows2, bkrows[i][ii]);\n od;\n\n od;\n ps := List(bkrows2, _partSum);\n fps := Flat(ps);\n rbase := FData(List(Flat(ps), i->TInt.value(i)));\n len := Length(ps[1]);\n idx := k * (pj.range * j.range) + (pj * j.range) + j;\n rdom := rbase.at(idx*len+q+1)-rbase.at(idx*len+q);\n rows_data := Rows(self);\n rlambda := Lambda(k, Lambda(pj, Lambda(j, rows_data)));\n rows_by_one := FData(Flat(List(rlambda.tolist(), j->List(j.tolist(),kk->kk.tolist())))).at(idx);\n s := fAdd(rows_by_one, rdom, rbase.at(idx*len+q));\n else\n Error(\"Unsupported case -- please fix IRowDirSum.sums in spl2sums.gi:344\");\n fi;\n else\n Error(\"Unsupported case -- please fix IRowDirSum.sums in spl2sums.gi:347\");\n fi;\n\n if IsInt(self.child(1).dims()[2]) then\n cols := Cols(self);\n bkcols := Cols(self.child(1));\n cdom :=bkcols-overlap;\n gcd := Gcd(List([cols, bkcols, cdom], _unwrapV));\n g := fTensor(fAdd(cols/gcd, bkcols/gcd, q*(cdom/gcd)), fId(gcd));\n else\n bkcols := _evInt(List(self.unrolledChildren(), i->Cols(i)));\n cols := Cols(self);\n ps := _partSum(bkcols);\n gcd := Gcd(List(Concat(ps, [cols]), _unwrapV));\n cbase := FData(List(ps, i->TInt.value(i/gcd)));\n cdom := cbase.at(q+1)-cbase.at(q);\n g := fTensor(fAdd(cols/gcd, cdom, cbase.at(q)), fId(gcd));\n fi;\n return\n ISum(self.var, self.domain,\n Compose(\n Scat(s),\n self.child(1).sums(),\n Gath(g)\n )\n );\nend;\n\n\n#NOTE: FF to YSV: Injecting H by default is BAD!!!\nRowDirectSum.sums := meth(self)\n local c, nblocks, cols, rows, bkrows, bkcols, overlap, psr, psc, gcd, blks, bkrows_by_gcd, bkrows_by_gcd_data, vars, psr_data, psr_by_gcd,\n pj, j, k, lambda, ivars, llist, lambda2, llist2;\n overlap := self.overlap;\n nblocks := self.numChildren();\n c := self.children();\n cols := EvalScalar(Cols(self));\n rows := EvalScalar(Rows(self));\n bkcols := List(c, i->EvalScalar(Cols(i)));\n# FF: NOTE!! temporary hack for SAR\n bkrows := List(c, i->spiral.code.RulesStrengthReduce(Rows(i)));\n if ForAny(bkrows, IsExp) then\n bkrows := List(bkrows, i->spiral.code.RulesMergedStrengthReduce(i));\n if ForAny(bkrows, i->not (IsRec(i) and ObjId(i)=mul and IsValue(i.args[1]) and i.args[1].t=TInt)) then\n vars := Set(Flat(List(bkrows, i->Filtered(i.free(), IsLoopIndex))));\n gcd := 1;\n if Length(vars) = 1 then\n bkrows_by_gcd := List(bkrows, i->FData(Lambda(vars, i).tolist()).at(vars[1]));\n psr_data := DropLast(_partSum(bkrows), 1);\n psr_by_gcd := List(psr_data, i->When(IsExp(i), FData(Lambda(vars, i).tolist()).at(vars[1]), i));\n elif Length(vars) = 2 and Length(Filtered(vars, IsParallelLoopIndex)) = 1 then\n pj := Filtered(vars, IsParallelLoopIndex)[1];\n j := Filtered(vars, i -> not IsParallelLoopIndex(i))[1];\n lambda := List(bkrows, i->Lambda(pj, Lambda(j, i)));\n llist := List([1..Length(bkrows)], k->Flat(List(lambda[k].tolist(), i->i.tolist())));\n bkrows_by_gcd := List(llist, i->fCompose(FData(i), fTensor(fBase(pj), fId(j.range))).at(j));\n psr_data := List(DropLast(_partSum(bkrows), 1), i ->spiral.code.RulesMergedStrengthReduce(i));\n lambda2 := List(psr_data, i->Lambda(pj, Lambda(j, i)));\n llist2 := List([1..Length(bkrows)], k->Flat(List(lambda2[k].tolist(), i->i.tolist())));\n psr_by_gcd := List(llist2, i->fCompose(FData(i), fTensor(fBase(pj), fId(j.range))).at(j));\n elif Length(vars) = 3 and Length(Filtered(vars, IsParallelLoopIndex)) = 1 then\n pj := Filtered(vars, IsParallelLoopIndex)[1];\n ivars := Filtered(vars, i -> not IsParallelLoopIndex(i));\n j := ivars[2];\n k := ivars[1];\n k.isSWPLoopIndex := true;\n lambda := List(bkrows, i->Lambda(k, Lambda(pj, Lambda(j, i))));\n llist := List([1..Length(bkrows)], k->Flat(List(lambda[k].tolist(),i->List(i.tolist(),j->j.tolist()))));\n bkrows_by_gcd := List(llist, i->fCompose(FData(i), fTensor(fBase(k), fBase(pj), fId(j.range))).at(j));\n psr_data := List(DropLast(_partSum(bkrows), 1), i ->spiral.code.RulesMergedStrengthReduce(i));\n lambda2 := List(psr_data, i->Lambda(k, Lambda(pj, Lambda(j, i))));\n llist2 := List([1..Length(bkrows)], k->Flat(List(lambda2[k].tolist(), i->List(i.tolist(),kk->kk.tolist()))));\n psr_by_gcd := List(llist2, i->fCompose(FData(i), fTensor(fBase(k), fBase(pj), fId(j.range))).at(j));\n else\n Error(\"Unsupported case -- please fix RowDirSum.sums in spl2sums.gi:409\");\n fi;\n else\n vars := Set(Flat(List(bkrows, i->Filtered(i.free(), IsLoopIndex))));\n blks := List(bkrows, i->i.args[1].v);\n gcd := Gcd(blks);\n if Length(vars) = 1 then\n bkrows_by_gcd_data := List(bkrows, i->ApplyFunc(mul, Concat([i.args[1].v/gcd], Drop(i.args, 1))));\n bkrows_by_gcd := List(bkrows_by_gcd_data, i->FData(Lambda(vars, i).tolist()).at(vars[1]));\n psr_data := List(DropLast(_partSum(bkrows), 1), i ->idiv(i,gcd));\n psr_by_gcd := List(psr_data, i->When(IsExp(i), FData(Lambda(vars, i).tolist()).at(vars[1]), i));\n elif Length(vars) = 2 and Length(Filtered(vars, IsParallelLoopIndex)) = 1 then\n bkrows_by_gcd_data := List(bkrows, i->spiral.code.RulesMergedStrengthReduce(ApplyFunc(mul, Concat([i.args[1].v/gcd], Drop(i.args, 1)))));\n pj := Filtered(vars, IsParallelLoopIndex)[1];\n j := Filtered(vars, i -> not IsParallelLoopIndex(i))[1];\n lambda := List(bkrows_by_gcd_data, i->Lambda(pj, Lambda(j, i)));\n llist := List([1..Length(bkrows)], k->Flat(List(lambda[k].tolist(), i->i.tolist())));\n bkrows_by_gcd := List(llist, i->fCompose(FData(i), fTensor(fBase(pj), fId(j.range))).at(j));\n psr_data := List(DropLast(_partSum(bkrows), 1), i ->spiral.code.RulesMergedStrengthReduce(idiv(i,gcd)));\n lambda2 := List(psr_data, i->Lambda(pj, Lambda(j, i)));\n llist2 := List([1..Length(bkrows)], k->Flat(List(lambda2[k].tolist(), i->i.tolist())));\n psr_by_gcd := List(llist2, i->fCompose(FData(i), fTensor(fBase(pj), fId(j.range))).at(j));\n elif Length(vars) = 3 and Length(Filtered(vars, IsParallelLoopIndex)) = 1 then\n bkrows_by_gcd_data := List(bkrows, i->spiral.code.RulesMergedStrengthReduce(ApplyFunc(mul, Concat([i.args[1].v/gcd], Drop(i.args, 1)))));\n pj := Filtered(vars, IsParallelLoopIndex)[1];\n ivars := Filtered(vars, i -> not IsParallelLoopIndex(i));\n j := ivars[2];\n k := ivars[1]; \n k.isSWPLoopIndex := true;\n lambda := List(bkrows_by_gcd_data, i->Lambda(k, Lambda(pj, Lambda(j, i))));\n llist := List([1..Length(bkrows)], k->Flat(List(lambda[k].tolist(),i->List(i.tolist(),j->j.tolist()))));\n bkrows_by_gcd := List(llist, i->fCompose(FData(i), fTensor(fBase(k), fBase(pj), fId(j.range))).at(j));\n psr_data := List(DropLast(_partSum(bkrows), 1), i ->spiral.code.RulesMergedStrengthReduce(idiv(i,gcd)));\n lambda2 := List(psr_data, i->Lambda(k, Lambda(pj, Lambda(j, i))));\n llist2 := List([1..Length(bkrows)], k->Flat(List(lambda2[k].tolist(), i->List(i.tolist(),kk->kk.tolist()))));\n psr_by_gcd := List(llist2, i->fCompose(FData(i), fTensor(fBase(k), fBase(pj), fId(j.range))).at(j));\n \n else\n Error(\"Unsupported case -- please fix RowDirSum.sums in spl2sums.gi:432\");\n fi;\n fi;\n else\n bkrows := List(bkrows, EvalScalar);\n gcd := Gcd(List(Concat([rows, cols, overlap], bkrows, bkcols), _unwrapV));\n bkrows_by_gcd := List(bkrows, i->i/gcd);\n psr_by_gcd := List(DropLast(_partSum(bkrows), 1), i ->idiv(i,gcd));\n fi;\n psc := DropLast(Concat([0], List(Drop(_partSum(bkcols), 1), i->i-overlap)), 1);\n return SUM( Map([1..nblocks],\n i -> Compose(\n Scat(fTensor(fAdd(rows/gcd, bkrows_by_gcd[i], Cond(i=1, 0, i=2, bkrows_by_gcd[i-1], psr_by_gcd[i])), fId(gcd))),\n self.child(i).sums(),\n Gath(fTensor(fAdd(cols/gcd, bkcols[i]/gcd, psc[i]/gcd), fId(gcd))))\n ));\nend;\n\n#----------------------------------------------------------------------\nIterHStack.sums := self >> let(\n bkcols := Cols(self.child(1)),\n bkrows := Rows(self.child(1)),\n nblocks := self.domain,\n cols := Cols(self), rows := Rows(self),\n ISumAcc(self.var, self.domain,\n Scat(fId(bkrows)) *\n self.child(1).sums() *\n Gath(fTensor(fBase(nblocks, self.var), fId(bkcols)))));\n\n#-----------------------------------------------------------------------\nIterVStack.sums := self >> let(\n bkcols := Cols(self.child(1)),\n bkrows := Rows(self.child(1)),\n nblocks := self.domain,\n cols := Cols(self), rows := Rows(self),\n ISum(self.var, self.domain,\n Scat(fTensor(fBase(nblocks, self.var), fId(bkrows))) *\n self.child(1).sums() *\n Gath(fId(bkcols))));\n\n#-----------------------------------------------------------------------\n", "meta": {"hexsha": "7980c7fda992925f7c72b1d8e38fd425e041663d", "size": 24869, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "namespaces/spiral/sigma/spl2sums.gi", "max_stars_repo_name": "sr7cb/spiral-software", "max_stars_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_stars_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_stars_count": 42, "max_stars_repo_stars_event_min_datetime": "2019-09-01T19:29:39.000Z", "max_stars_repo_stars_event_max_datetime": "2022-01-17T12:26:12.000Z", "max_issues_repo_path": "namespaces/spiral/sigma/spl2sums.gi", "max_issues_repo_name": "sr7cb/spiral-software", "max_issues_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_issues_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_issues_count": 12, "max_issues_repo_issues_event_min_datetime": "2020-11-20T16:15:52.000Z", "max_issues_repo_issues_event_max_datetime": "2022-01-07T21:17:28.000Z", "max_forks_repo_path": "namespaces/spiral/sigma/spl2sums.gi", "max_forks_repo_name": "sr7cb/spiral-software", "max_forks_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_forks_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_forks_count": 21, "max_forks_repo_forks_event_min_datetime": "2019-08-20T19:27:52.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-01T22:11:18.000Z", "avg_line_length": 45.7992633517, "max_line_length": 199, "alphanum_fraction": 0.5375366923, "num_tokens": 7316, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO\n\n", "lm_q1_score": 0.5774953651858117, "lm_q2_score": 0.49609382947091946, "lm_q1q2_score": 0.2864918872167364}}
{"text": "\n# Copyright (c) 2018-2021, Carnegie Mellon University\n# See LICENSE for details\n\n\n\nClass(SIMD_Macro, SIMD_ISA, rec(\n \n file := \"macro\",\n\n commonIncludes := self >> [],\n \n active := true,\n \n isFixedPoint := false,\n isFloat := true,\n ctype := \"double\",\n bits := 64,\n useDeref := false,\n\n splopts := rec(precision := \"double\"),\n\n duploadn := (y, x, n) -> Error(\"broadcast is undefined\"),\n \n arrayDataModifier := \"static \",\n arrayBufModifier := \"static \",\n\n declareConstants := true,\n threeOps := true,\n fma\t\t := true,\n\n svload := [],\n svstore := [],\n\n unparser := MACROUnparser,\n\n compileStrategy := self >> BaseIndicesCS\n :: When(self.fma, [DoFMA], [])\n :: [ MarkDefUse, #\n (c, opts) -> CopyPropagate(c, CopyFields(opts, rec(autoinline := true))),\n MarkDefUse, #\n (c, opts) -> CopyPropagate(c, CopyFields(opts, rec(autoinline := true)))]\n :: When(self.threeOps, [DoThreeOp], [])\n :: [ Compile.declareVars,\n (c, opts) -> opts.vector.isa.fixProblems(c, opts),\n HashConsts ],\n\n));\n\nClass(MACRO_2xf, SIMD_Macro, rec(\n\n info := \"MACRO 2 x floating point\",\n\n countrec := rec(\n ops := [\n [ add, sub ]\n :: [ add_cmd, sub_cmd ], \n\t [ mul, vmulcx_2xf ]\n\t :: [ mul_cmd, vmulcx_2xf_cmd ],\n [ fma, fms, nfma ]\n :: [fma_cmd, fms_cmd, nfma_cmd],\n [ vunpacklo_2xf, vunpackhi_2xf, vpacklo_2xf, vpackhi_2xf, vswapcx_2xf ] \n :: [ vunpacklo_2xf_cmd, vunpackhi_2xf_cmd, vpacklo_2xf_cmd, vpackhi_2xf_cmd, vswapcx_2xf_cmd ],\n [ ],\n [ deref, nth, vload_cmd, vstore_cmd ],\n Value # Value without [] is a keyword in countOps !!\n ],\n printstrings := [\"[adds]\", \"[mults]\", \"[fmas]\", \"[vperms]\", \"[svldst]\", \"[vldst]\", \"[vval]\"],\n arithcost := (self, opcount) >> opcount[1]+opcount[2]\n ),\n \n v := 2,\n t := TVect(TReal, 2),\n \n instr := [vunpacklo_2xf, vunpackhi_2xf, vpacklo_2xf, vpackhi_2xf],\n\n includes := self >> self.commonIncludes() :: [\"<include/macro_fv2.h>\"], \n \n dupload := (y, x) -> assign(y, vdup(x, 2)),\n\n mul_cx := (self, opts) >> ((y,x,c) -> assign(y, vmulcx_2xf(x,c))),\n swap_cx := (y, x, opts) -> assign(y, vswapcx_2xf(x)),\n));\n\n\nClass(MACRO_4xf, SIMD_Macro, rec(\n \n info := \"MACRO 4 x floating point\",\n\n countrec := rec(\n ops := [\n [ add, sub ]\n :: [ add_cmd, sub_cmd ], \n\t [ mul, vmulcx_4xf ]\n\t :: [ mul_cmd, vmulcx_4xf_cmd ],\n [ fma, fms, nfma ]\n :: [fma_cmd, fms_cmd, nfma_cmd],\n [ vpacklo_4xf, vpackhi_4xf, vpacklo2_4xf, vpackhi2_4xf, \n vunpacklo_4xf, vunpackhi_4xf, vunpacklo2_4xf, vunpackhi2_4xf, \n vswapcx_4xf ]\n :: [ vpacklo_4xf_cmd, vpackhi_4xf_cmd, vpacklo2_4xf_cmd, vpackhi2_4xf_cmd, \n vunpacklo_4xf_cmd, vunpackhi_4xf_cmd, vunpacklo2_4xf_cmd, vunpackhi2_4xf_cmd, \n vswapcx_4xf_cmd ],\n [ ],\n [ deref, nth, vload_cmd, vstore_cmd ],\n Value # Value without [] is a keyword in countOps !!\n ],\n printstrings := [\"[adds]\", \"[mults]\", \"[fmas]\", \"[vperms]\", \"[svldst]\", \"[vldst]\", \"[vval]\"],\n arithcost := (self, opcount) >> opcount[1]+opcount[2]\n ),\n \n v := 4,\n t := TVect(TReal, 4),\n\n instr := [vpacklo_4xf, vpackhi_4xf, vpacklo2_4xf, vpackhi2_4xf, \n vunpacklo_4xf, vunpackhi_4xf, vunpacklo2_4xf, vunpackhi2_4xf],\n\n includes := self >> self.commonIncludes() :: [\"<include/macro_fv4.h>\"], \n\n dupload := (y, x) -> assign(y, vdup(x, 4)),\n\n mul_cx := (self, opts) >> ((y,x,c) -> assign(y, vmulcx_4xf(x,c))),\n swap_cx := (y, x, opts) -> assign(y, vswapcx_4xf(x)),\n));\n\nClass(MACRO_8xf, SIMD_Macro, rec(\n\n info := \"MACRO 8 x floating point\",\n\n countrec := rec(\n ops := [\n [ add, sub ]\n :: [ add_cmd, sub_cmd ], \n\t [ mul, vmulcx_4xf ]\n\t :: [ mul_cmd, vmulcx_4xf_cmd ],\n [ fma, fms, nfma ]\n :: [fma_cmd, fms_cmd, nfma_cmd],\n [ vpacklo_8xf, vpackhi_8xf, vpacklo2_8xf, vpackhi2_8xf, \n vunpacklo_8xf, vunpackhi_8xf, vunpacklo2_8xf, vunpackhi2_8xf,\n vswapcx_8xf, vtrcx_8xf ]\n :: [ vpacklo_8xf_cmd, vpackhi_8xf_cmd, vpacklo2_8xf_cmd, vpackhi2_8xf_cmd, \n vunpacklo_8xf_cmd, vunpackhi_8xf_cmd, vunpacklo2_8xf_cmd, vunpackhi2_8xf_cmd,\n vswapcx_8xf_cmd, vtrcx_8xf_cmd ],\n [ ],\n [ deref, nth, vload_cmd, vstore_cmd ],\n Value # Value without [] is a keyword in countOps !!\n ],\n printstrings := [\"[adds]\", \"[mults]\", \"[fmas]\", \"[vperms]\", \"[svldst]\", \"[vldst]\", \"[vval]\"],\n arithcost := (self, opcount) >> opcount[1]+opcount[2]\n ),\n \n v := 8,\n t := TVect(TReal, 8),\n\n instr := [ vpacklo_8xf, vpackhi_8xf, vpacklo2_8xf, vpackhi2_8xf, \n vunpacklo_8xf, vunpackhi_8xf, vunpacklo2_8xf, vunpackhi2_8xf,\n vtrcx_8xf ],\n\n includes := self >> self.commonIncludes() :: [\"<include/macro_fv8.h>\"], \n\n dupload := (y, x) -> assign(y, vdup(x, 8)),\n\n mul_cx := (self, opts) >> ((y,x,c) -> assign(y, vmulcx_8xf(x,c))),\n swap_cx := (y, x, opts) -> assign(y, vswapcx_8xf(x)),\n));\n\nSIMD_ISA_DB.addISA(MACRO_2xf);\nSIMD_ISA_DB.addISA(MACRO_4xf);\nSIMD_ISA_DB.addISA(MACRO_8xf);\n\n", "meta": {"hexsha": "be45725b55042a5708bdf7567acfa966ae1bf69b", "size": 5796, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "namespaces/spiral/platforms/macro/isa.gi", "max_stars_repo_name": "sr7cb/spiral-software", "max_stars_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_stars_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_stars_count": 42, "max_stars_repo_stars_event_min_datetime": "2019-09-01T19:29:39.000Z", "max_stars_repo_stars_event_max_datetime": "2022-01-17T12:26:12.000Z", "max_issues_repo_path": "namespaces/spiral/platforms/macro/isa.gi", "max_issues_repo_name": "sr7cb/spiral-software", "max_issues_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_issues_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_issues_count": 12, "max_issues_repo_issues_event_min_datetime": "2020-11-20T16:15:52.000Z", "max_issues_repo_issues_event_max_datetime": "2022-01-07T21:17:28.000Z", "max_forks_repo_path": "namespaces/spiral/platforms/macro/isa.gi", "max_forks_repo_name": "sr7cb/spiral-software", "max_forks_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_forks_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_forks_count": 21, "max_forks_repo_forks_event_min_datetime": "2019-08-20T19:27:52.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-01T22:11:18.000Z", "avg_line_length": 33.8947368421, "max_line_length": 109, "alphanum_fraction": 0.5153554175, "num_tokens": 1908, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.5467381372136563, "lm_q2_score": 0.523420348936324, "lm_q1q2_score": 0.2861738665571678}}
{"text": "\nlocal reps,tori,labels,I,II,ords,mizuno,blocks;\n\nmizuno:=[[1,2,3,4,5,6,7,\n 9,10,11,12,\n 13,14,16,17,\n 19,18,20,21,\n 23,24,25,27,\n 26,28,30,31,\n 32,33,35,34,\n 37,38,39,40,\n 41,44,45,46,\n 48,49,51,52,\n 53,55,57,58,\n 59,61,63,64,\n 66,69,70,71,\n 75,76,80,82,\n 85,89,93,97],\n [8,\n 15,22,29,36,\n 43,42,47,50,\n 54,56,60,62,\n 65,67,68,72,\n 73,74,77,78,\n 79,81,83,84,\n 86,87,88,90,\n 91,92,94,95,\n 96,98,99,100,\n 101,102,103,104,\n 105,106,107,108,\n 109,110,111,112,\n 114,113,115,116,\n 117,118,119,120]];\n\nreps:=[[[1,1],[2,1],[3,1],[4,1],[5,1],[6,1],[7,1],[101,1]], # E_8\n [[1,1],[2,1],[9,1],[10,1],[5,1],[6,1],[7,1],[101,1]], # E_8(a_1)\n [[1,1],[3,1],[2,1],[9,1],[11,1],[12,1],[13,1],[101,1]], # E_8(a_2)\n [[8,1],[9,1],[10,1],[11,1],[16,1],[12,1],[7,1],[101,1]], # E_7+A_1\n [[1,1],[15,1],[16,1],[17,1],[6,1],[7,1],[101,1]], # E_7\n [[8,1],[9,1],[10,1],[11,1],[16,1],[12,1],[13,1],[102,1]], # D_8\n [[8,1],[15,1],[16,1],[17,1],[18,1],[19,1],[7,1],[101,1]], # E_7(a_1)+A_1\n [[1,1],[15,1],[16,1],[17,1],[24,1],[13,1],[101,1]], # E_7(a_1)\n [[1,1],[15,1],[16,1],[17,1],[18,1],[24,1],[13,1],[102,1]], # D_8(a_1) ?\n [[1,1],[15,1],[16,1],[17,1],[18,1],[19,1],[103,1]], # D_7\n [[14,1],[15,1],[21,1],[17,1],[18,1],[29,1],[19,1],[101,1]], # E_7(a_2)+A_1\n [[20,1],[21,1],[17,1],[23,1],[24,1],[7,1],[101,1]], # E_7(a_2)\n [[14,1],[20,1],[21,1],[22,1],[18,1],[33,1],[13,1],[102,1]], # A_8\n [[20,1],[21,1],[28,1],[23,1],[24,1],[7,1],[101,1]], # E_6+A_1\n [[14,1],[22,1],[23,1],[24,1],[19,1],[25,1],[35,1],[102,1]], # D_7(a_1)\n [[14,1],[22,1],[23,1],[24,1],[19,1],[25,1],[102,1]], # (D_7(a_1))_2\n [[20,1],[21,1],[23,1],[24,1],[7,1],[101,1]], # E_6\n [[20,1],[21,1],[22,1],[23,1],[24,1],[25,1],[102,1],[103,1]], # D_8(a_2)\n [[8,1],[28,1],[23,1],[24,1],[25,1],[30,1],[102,1]], # D_6+A_1\n [[20,1],[21,1],[28,1],[23,1],[24,1],[10,1],[40,1],[103,1]], # A_7\n# [[20,1],[21,1],[28,1],[23,1],[24,1],[19,1],[103,1]], # (A_7)_3\n [[20,1],[21,1],[28,1],[23,1],[31,1],[101,1],[102,1]], # E_6(a_1)+A_1\n [[1,1],[28,1],[29,1],[30,1],[31,1],[101,1]], # D_6\n [[20,1],[21,1],[28,1],[29,1],[25,1],[31,1],[103,1]], # D_7(a_2)\n [[20,1],[21,1],[23,1],[31,1],[101,1],[102,1]], # E_6(a_1)\n [[26,1],[28,1],[27,1],[29,1],[30,1],[31,1],[102,1],[103,1]], # D_5+A_2\n [[26,1],[28,1],[27,1],[29,1],[30,1],[31,1],[102,1]], # (D_5+A_2)_2\n [[20,1],[21,1],[28,1],[29,1],[30,1],[31,1],[105,1]], # A_6+A_1\n [[28,1],[27,1],[29,1],[30,1],[31,1],[39,1],[102,1]], # D_6(a_1)+A_1\n [[28,1],[29,1],[33,1],[31,1],[34,1],[101,1]], # D_6(a_1)\n [[29,1],[21,1],[20,1],[30,1],[31,1],[105,1]], # A_6\n# [[32,1],[33,1],[30,1],[32,1],[40,1],[101,1]], # D_5+A_1 ??? two times 32\n [[26,1],[29,1],[35,1],[38,1],[30,1],[44,1],[47,1],[105,1]], # 2A_4 ? 26\n [[32,1],[37,1],[29,1],[31,1],[34,1],[105,1],[107,1]], # A_5+A_2\n [[32,1],[37,1],[27,1],[33,1],[40,1],[36,1],[105,1]], # A_5+2A_1\n [[32,1],[29,1],[31,1],[34,1],[106,1],[108,1]], # D_6(a_2)\n [[30,1],[31,1],[32,1],[33,1],[101,1]], # D_5\n [[37,1],[33,1],[40,1],[34,1],[36,1],[41,1],[105,1]], # D_5(a_1)+A_2 ? 26/20\n [[26,1],[27,1],[40,1],[41,1],[106,1],[107,1]], # (A_5+A_1)'\n [[32,1],[27,1],[37,1],[33,1],[36,1],[105,1]], # (A_5+A_1)''\n [[37,1],[38,1],[40,1],[49,1],[41,1],[104,1],[108,1]], # D_4+A_2\n [[37,1],[38,1],[40,1],[49,1],[41,1],[104,1]], # (D_4+A_2)_2\n [[37,1],[38,1],[40,1],[34,1],[36,1],[106,1],[107,1]], # A_4+A_3\n [[20,1],[21,1],[49,1],[106,1],[107,1]], # A_5\n [[37,1],[42,1],[43,1],[44,1],[45,1],[103,1]], # D_5(a_1)+A_1\n [[37,1],[38,1],[39,1],[40,1],[41,1],[108,1],[109,1]], # A_4+A_2+A_1\n \n [[38,1],[40,1],[39,1],[41,1],[108,1],[109,1]], # A_4+A_2\n [[42,1],[43,1],[48,1],[49,1],[102,1]], # D_5(a_1)\n [[47,1],[48,1],[49,1],[53,1],[101,1]], # D_4+A_1\n [[42,1],[43,1],[44,1],[45,1],[107,1],[108,1]], # A_4+2A_1\n [[47,1],[48,1],[49,1],[101,1]], # D_4\n [[42,1],[48,1],[49,1],[106,1],[107,1]], # A_4+A_1\n [[37,1],[38,1],[39,1],[49,1],[108,1],[113,1]], # 2A_3\n [[42,1],[48,1],[106,1],[107,1]], # A_4\n [[42,1],[44,1],[48,1],[49,1],[110,1],[113,1]], # D_4(a_1)+A_2\n [[46,1],[47,1],[48,1],[49,1],[112,1],[113,1]], # A_3+A_2+A_1\n [[46,1],[47,1],[48,1],[112,1],[116,1],[119,1]], # A_3+A_2\n [[46,1],[47,1],[48,1],[112,1],[116,1]], # (A_3+A_2)_2\n [[53,1],[47,1],[48,1],[115,1],[116,1]], # D_4(a_1)+A_1\n [[53,1],[54,1],[55,1],[112,1],[113,1]], # A_3+2A_1\n [[47,1],[48,1],[115,1],[116,1]], # D_4(a_1)\n [[53,1],[54,1],[55,1],[117,1],[118,1],[119,1]], # 2A_2+2A_1\n [[55,1],[56,1],[112,1],[113,1]], # A_3+A_1\n [[56,1],[57,1],[117,1],[118,1],[119,1]], # 2A_2+A_1\n [[63,1],[106,1],[107,1]], # A_3\n [[56,1],[57,1],[117,1],[118,1]], # 2A_2\n [[60,1],[126,1],[127,1],[128,1]], # A_2+2A_1\n [[58,1],[59,1],[123,1],[124,1],[125,1]], # A_2+3A_1\n [[63,1],[128,1],[129,1]], # A_2+A_1\n [[127,1],[130,1]], # A_2\n [[63,1],[135,1],[136,1],[137,1]], # 4A_1\n [[141,1],[142,1],[143,1]], # 3A_1\n [[150,1],[151,1]], # 2A_1\n [[157,1]] # A_1\n ];\n\nlabels:=[\"E_8\",\n \"E_8(a_1)\",\n \"E_8(a_2)\",\n \"E_7+A_1\",\n \"E_7\",\n \"D_8\",\n \"E_7(a_1)+A_1\",\n \"E_7(a_1)\",\n \"D_8(a_1)\",\n \"D_7\",\n \"E_7(a_2)+A_1\",\n \"E_7(a_2)\",\n \"A_8\",\n \"E_6+A_1\",\n \"D_7(a_1)\",\n \"(D_7(a_1))_2\",\n \"E_6\",\n \"D_8(a_2)\",\n \"D_6+A_1\",\n \"A_7\",\n# \"(A_7)_3\",\n \"E_6(a_1)+A_1\",\n \"D_6\",\n \"D_7(a_2)\",\n \"E_6(a_1)\",\n \"D_5+A_2\",\n \"(D_5+A_2)_2\",\n \"A_6+A_1\",\n \"D_6(a_1)+A_1\",\n \"D_6(a_1)\",\n \"A_6\",\n# \"D_5+A_1\",\n \"2A_4\",\n \"A_5+A_2\",\n \"A_5+2A_1\",\n \"D_6(a_2)\",\n \"D_5\",\n \"D_5(a_1)+A_2\",\n \"(A_5+A_1)'\",\n \"(A_5+A_1)''\",\n \"D_4+A_2\",\n \"(D_4+A_2)_2\",\n \"A_4+A_3\",\n \"A_5\",\n \"D_5(a_1)+A_1\",\n \"A_4+A_2+A_1\",\n \n \"A_4+A_2\",\n \"D_5(a_1)\",\n \"D_4+A_1\",\n \"A_4+2A_1\",\n \"D_4\",\n \"A_4+A_1\",\n \"2A_3\",\n \"A_4\",\n \"D_4(a_1)+A_2\",\n \"A_3+A_2+A_1\",\n \"A_3+A_2\",\n \"(A_3+A_2)_2\",\n \"D_4(a_1)+A_1\",\n \"A_3+2A_1\",\n \"D_4(a_1)\",\n \"2A_2+2A_1\",\n \"A_3+A_1\",\n \"2A_2+A_1\",\n \"A_3\",\n \"2A_2\",\n \"A_2+2A_1\",\n \"A_2+3A_1\",\n \"A_2+A_1\",\n \"A_2\",\n \"4A_1\",\n \"3A_1\",\n \"2A_1\",\n \"A_1\",\n ];\n\nI:=[ [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ] ];#, [ ], [ ] ];\n\nII:=[ [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ] ];#, [ ], [ ] ];\n\ntori:=[ [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ], [ ] ];#, [ ], [ ] ];\n\n#blocks:=[];\nblocks:=[[[32, 7], [24, 1]], [[32, 5], [28, 1], [16, 3], [12, 1]], [[32, 3], [26, 1], [16, 7], [14, 1]], [[32, 1], [30, 1], [24, 2], [22, 2], [16, 3], [14, 1], [8, 4]], [[32, 1], [26, 3], [22, 1], [18, 3], [16, 1], [10, 3], [8, 1], [2, 3], [1, 2]], [[16, 14], [12, 2]], [[16, 11], [14, 3], [10, 2], [6, 1], [2, 1], [1, 2]], [[16, 11], [14, 3], [10, 2], [6, 1], [2, 1], [1, 2]], [[16, 10], [10, 6], [8, 1], [6, 1], [2, 6], [1, 2]], [[16, 7], [12, 9], [4, 6], [2, 2]], [[16, 10], [12, 2], [10, 2], [8, 3], [6, 1], [4, 2], [3, 2]], [[16, 10], [10, 6], [8, 1], [6, 1], [2, 6], [1, 2]], [[16, 6], [13, 2], [8, 14], [7, 2]], [[16, 10], [10, 6], [8, 1], [6, 1], [2, 6], [1, 2]], [[16, 3], [14, 5], [10, 2], [8, 10], [6, 4], [2, 2], [1, 2]], [[16, 3], [14, 1], [12, 6], [10, 2], [8, 7], [6, 1], [4, 8]], [[16, 10], [10, 6], [8, 1], [6, 1], [1, 14]], [[16, 2], [15, 2], [12, 4], [11, 4], [8, 6], [7, 2], [4, 8]], [[16, 3], [14, 5], [10, 2], [8, 10], [6, 4], [2, 2], [1, 2]], [[8, 4], [7, 6], [6, 8], [5, 8], [4, 10], [3, 6], [2, 10], [1, 8]], [[16, 2], [14, 2], [13, 2], [12, 2], [11, 2], [10, 2], [9, 2], [8, 4], [6, 2], [5, 2], [4, 4], [2, 4]], [[16, 1], [14, 5], [10, 10], [8, 1], [6, 5], [2, 10], [1, 4]], [[8, 28], [6, 4]], [[16, 2], [13, 6], [11, 2], [9, 6], [8, 2], [5, 6], [4, 2], [1, 8]], [[8, 27], [6, 1], [4, 5], [2, 3]], [[8, 27], [6, 1], [4, 4], [3, 2], [2, 2]], [[8, 24], [7, 2], [6, 4], [4, 2], [3, 2], [2, 2]], [[8, 27], [6, 1], [4, 5], [2, 1], [1, 4]], [[8, 27], [6, 1], [4, 5], [2, 1], [1, 4]], [[8, 22], [7, 6], [5, 4], [3, 2], [1, 4]], [[8, 20], [7, 4], [4, 12], [3, 4]], [[8, 20], [6, 6], [4, 8], [3, 2], [2, 6], [1, 2]], [[8, 20], [6, 4], [5, 4], [4, 6], [3, 2], [2, 6], [1, 2]], [[8, 14], [6, 18], [2, 12], [1, 4]], [[8, 27], [6, 1], [2, 6], [1, 14]], [[8, 13], [6, 3], [4, 30], [3, 2]], [[8, 14], [6, 18], [2, 12], [1, 4]], [[8, 20], [5, 12], [4, 2], [3, 2], [1, 14]], [[8, 11], [6, 7], [4, 26], [1, 14]], [[8, 11], [6, 7], [4, 26], [1, 14]], [[8, 12], [7, 2], [6, 2], [4, 30], [3, 2]], [[8, 14], [6, 18], [2, 6], [1, 16]], [[8, 11], [6, 7], [4, 26], [2, 6], [1, 2]], [[8, 10], [7, 2], [6, 4], [5, 4], [4, 24], [2, 6], [1, 2]], [[8, 6], [7, 10], [5, 4], [4, 20], [3, 8], [1, 6]], [[8, 11], [6, 7], [4, 26], [1, 14]], [[8, 1], [6, 27], [2, 36], [1, 6]], [[8, 6], [7, 2], [6, 12], [5, 4], [4, 14], [3, 2], [2, 16]], [[8, 1], [6, 27], [2, 26], [1, 26]], [[8, 4], [7, 6], [6, 8], [5, 8], [4, 10], [3, 6], [2, 10], [1, 8]], [[4, 60], [2, 4]], [[8, 2], [7, 10], [5, 20], [4, 2], [3, 10], [1, 24]], [[4, 56], [3, 8]], [[4, 54], [3, 2], [2, 12], [1, 2]], [[4, 54], [3, 2], [2, 10], [1, 6]], [[4, 50], [3, 10], [2, 6], [1, 6]], [[4, 54], [3, 2], [2, 10], [1, 6]], [[4, 46], [2, 30], [1, 4]], [[4, 54], [3, 2], [1, 26]], [[4, 44], [3, 4], [2, 28], [1, 4]], [[4, 46], [2, 24], [1, 16]], [[4, 40], [3, 12], [2, 18], [1, 16]], [[4, 46], [2, 10], [1, 44]], [[4, 28], [3, 36], [1, 28]], [[4, 22], [3, 14], [2, 52], [1, 14]], [[4, 26], [3, 6], [2, 62], [1, 2]], [[4, 14], [3, 30], [2, 34], [1, 34]], [[4, 2], [3, 54], [1, 78]], [[2, 120], [1, 8]], [[2, 110], [1, 28]], [[2, 92], [1, 64]], [[2, 58], [1, 132]]];\n\n#ords:=[];\nords:=[ 32, 32, 32, 32, 32, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 8, 16, 16, 8, 16, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2 ];\n\nreturn [reps,tori,labels,I,II,ords,blocks,mizuno];\n", "meta": {"hexsha": "096c2ab5318216f3d62c1acecb0674bf5cff3fbb", "size": 12760, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "lib/data/dataE8char2Mizuno.gi", "max_stars_repo_name": "iuliansimion/Chevalley.gap", "max_stars_repo_head_hexsha": "dd237f36d69a42bcd6cb6a24c5e4bf7dfb3da186", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/data/dataE8char2Mizuno.gi", "max_issues_repo_name": "iuliansimion/Chevalley.gap", "max_issues_repo_head_hexsha": "dd237f36d69a42bcd6cb6a24c5e4bf7dfb3da186", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/data/dataE8char2Mizuno.gi", "max_forks_repo_name": "iuliansimion/Chevalley.gap", "max_forks_repo_head_hexsha": "dd237f36d69a42bcd6cb6a24c5e4bf7dfb3da186", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 63.1683168317, "max_line_length": 3109, "alphanum_fraction": 0.2854231975, "num_tokens": 6639, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.6584175139669997, "lm_q2_score": 0.4339814648038985, "lm_q1q2_score": 0.2857409971639398}}
{"text": "\nlocal reps,tori,labels,I,II,ords,blocks;\n\n# Permutation from standard to gap\n# / 1 2 3 4 \\\n# \\ 2 4 3 1 /\n# Position(pr,Permuted([2,3,4,2],(2,4,1)))=24;\n\n\n#......Ross Jordan Block Sizes........Donna & Ross nilpotents........(in GAP notation)\nreps:=[[[2,1],[4,1],[3,1],[1,1]], # F_4\n [[2,1],[4,1],[7,1],[5,1]], # F_4(a_1) [[2,1],[4,1],[10,1],[1,1]],\n #[[6,1],[10,1],[1,1],[5,1]], # F_4(a_2) [[9,1],[1,1],[10,1],[4,1]],\n [[1,1],[5,1],[6,1],[10,1]], # F_4(a_2) [[9,1],[1,1],[10,1],[4,1]], I want it ordered\n [[4,1],[3,1],[1,1]], # C_3 [[1,1],[3,1],[4,1]],\n [[2,1],[4,1],[3,1]], # B_3 the same\n [[4,1],[6,1],[10,1],[18,1]], # F_4(a_3) [[4,1],[13,1],[11,1],[12,1]],\n [[4,1],[1,1],[10,1],[20,1]], # C_3(a_1)^{(2)}\n [[4,1],[1,1],[10,1]], # C_3(a_1) [[1,1],[10,1],[4,1]],\n [[2,1],[3,1],[1,1],[15,1]], # sA_2A_1^{(2)}\n [[2,1],[3,1],[1,1]], # sA_2A_1 [[3,1],[1,1],[2,1]],\n [[4,1],[3,1],[13,1]], # B_2^{(2)}\n [[4,1],[3,1]], # B_2 the same\n [[2,1],[4,1],[1,1]], # A_2sA_1 the same\n [[3,1],[1,1]], # sA_2 the same\n [[2,1],[4,1]], # A_2 the same\n# [[2,1],[3,1]], # A_1sA_1 [[2,1],[1,1]],\n# [[3,1],[10,1]], # sA_1^{(2)}\n# [[3,1]], # sA_1 [[1,1]],\n# [[2,1]] # A_1 [[2,1]]\n [[2,1],[1,1]], # A_1sA_1 [[2,1],[1,1]],\n# [[1,1],[15,1]], # sA_1^{(2)} above*reflection[1]*reflection[3]\n [[21,1],[24,1]], # sA_1^{(2)} Liebeck & Seitz ---> is already in the right position\n [[1,1]], # sA_1 [[1,1]],\n [[2,1]] # A_1 [[2,1]]\n ];\n\nI:=[[], # F_4\n [3], # F_4(a_1)\n [3,4], # F_4(a_2)\n [], # C_3\n [], # B_3\n [2,3,1],# F_4(a_3)\n [3], # C_3(a_1)^{(2)}\n [3], # C_3(a_1)\n [], # sA_2A_1^{(2)}\n [], # sA_2A_1\n [], # B_2^{(2)}\n [], # B_2\n [], # A_2sA_1\n [], # sA_2\n [], # A_2\n [], # A_1sA_1\n [], # sA_1^{(2)}\n [], # sA_1\n [] # A_1\n ];\n\n#\n# The parabolic where the representative is distinguished\n#\nII:=[[1,2,3,4], # F_4\n [1,2,3,4], # F_4(a_1)\n [1,2,3,4], # F_4(a_2)\n [4,3,1], # C_3\n [2,4,3], # B_3\n [1,2,3,4], # F_4(a_3)\n [1,2,3,4], # C_3(a_1)^{(2)}\n [4,3,1], # C_3(a_1)\n [1,2,3,4], # sA_2A_1^{(2)}\n [3,1,2], # sA_2A_1\n [1,2,3,4], # B_2^{(2)}\n [4,3], # B_2\n [2,4,1], # A_2sA_1\n [3,1], # sA_2\n [2,4], # A_2\n [2,1], # A_1sA_1\n [1,2,3,4], # sA_1^{(2)}\n [1], # sA_1\n [2] # A_1\n ];\n\nlabels:=[\"F_4\",\n \"F_4(a_1)\",\n \"F_4(a_2)\",\n \"C_3\",\n \"B_3\",\n \"F_4(a_3)\",\n \"C_3(a_1)^{(2)}\",\n \"C_3(a_1)\",\n \"(\\\\tilde A_2A_1)^{(2)}\",\n \"\\\\tilde A_2A_1\",\n \"B_2^{(2)}\",\n \"B_2\",\n \"A_2\\\\tilde A_1\",\n \"\\\\tilde A_2\",\n \"A_2\",\n \"A_1\\\\tilde A_1\",\n \"\\\\tilde A_1^{(2)}\",\n \"\\\\tilde A_1\",\n \"A_1\"\n ];\n\ntori:=[\n [2,2,2,2], # F_4\n [2,2,0,2], # F_4(a_1)\n [2,0,0,2], # F_4(a_2)\n [2,-9,2,2], # C_3\n [-6,2,2,2], # B_3\n [0,0,0,2], # F_4(a_3)\n [2,-5,0,2], # C_3(a_1)^{(2)}\n [2,-5,0,2], # C_3(a_1)\n [2,2,2,-5], # (sA_2A_1)^{(2)}\n [2,2,2,-5], # sA_2A_1\n [-3,-4,2,2], # (B_2)^{(2)}\n [-3,-4,2,2], # B_2\n [2,2,-3,2], # A_2sA_1\n [2,0,2,-4], # sA_2\n [0,2,-2,2], # A_2\n [2,2,-1,-1], # A_1sA_1\n #[2,0,-1,0], # (sA_1)^{(2)}\n [2,2,2,2], # (sA_1)^{(2)} ---> is already in the right position\n [2,0,-1,0], # sA_1\n [0,2,0,-1] # A_1\n ];\n\n#blocks:=[];\nblocks:=[[[16, 2], [13, 1], [7, 1]], # F_4\n [[8, 6], [4, 1]], # F_4(a_1)\n [[8, 4], [7, 1], [6, 1], [4, 1],[3, 1]],# F_4(a_2)\n [[8, 4], [4, 3], [2, 3], [1, 2]], # C_3\n [[8, 1], [6, 6], [2, 3], [1, 2]], # B_3\n [[4, 12], [2, 2]], # F_4(a_3)\n [[4, 10], [3, 1], [2, 4], [1, 1]], # C_3(a_1)^{(2)}\n [[4, 10], [3, 1], [2, 3], [1, 3]], # C_3(a_1)\n [[4, 9], [3, 3], [2, 3], [1, 1]], # sA_2A_1^{(2)}\n [[4, 8], [2, 10]], # sA_2A_1\n [[4, 10], [3, 1], [2, 3], [1, 3]], # B_2^{(2)}\n [[4, 10], [3, 1], [1, 9]], # B_2\n [[4, 6], [3, 4], [2, 8]], # A_2sA_1\n [[4, 8], [2, 6], [1, 8]], # sA_2\n [[4, 2], [3, 12], [1, 8]], # A_2\n [[2, 24], [1, 4]], # A_1sA_1\n [[2, 21], [1, 10]], # sA_1^{(2)}\n [[2, 16], [1, 20]], # sA_1\n [[2, 16], [1, 20]] # A_1\n ];\n\n#ords:=[];\nords:=[ 16, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2 ];\n\nreturn [reps,tori,labels,I,II,ords,blocks];\n", "meta": {"hexsha": "46f1c774ca1530dd099d6fdee10e2b2fa2c6753c", "size": 5238, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "lib/data/dataF4char2.gi", "max_stars_repo_name": "iuliansimion/Chevalley.gap", "max_stars_repo_head_hexsha": "dd237f36d69a42bcd6cb6a24c5e4bf7dfb3da186", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/data/dataF4char2.gi", "max_issues_repo_name": "iuliansimion/Chevalley.gap", "max_issues_repo_head_hexsha": "dd237f36d69a42bcd6cb6a24c5e4bf7dfb3da186", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/data/dataF4char2.gi", "max_forks_repo_name": "iuliansimion/Chevalley.gap", "max_forks_repo_head_hexsha": "dd237f36d69a42bcd6cb6a24c5e4bf7dfb3da186", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 34.2352941176, "max_line_length": 103, "alphanum_fraction": 0.2970599465, "num_tokens": 2538, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.640635868562172, "lm_q2_score": 0.4378234991142019, "lm_q1q2_score": 0.28048543763195605}}
{"text": "\n# Copyright (c) 2018-2021, Carnegie Mellon University\n# See LICENSE for details\n\n\nImportAll(paradigms.vector);\nImportAll(paradigms.smp);\n\nClass(RulesFuncSimpScratch,RulesFuncSimp);\nRewriteRules(RulesFuncSimpScratch, rec(\n #L(mn,m) o (fBase(m,j) (X) f) -> f (X) fBase(j,m)\n LTensorFlip := ARule(fCompose,\n [ @(1,L), [ @(3,fTensor), @(2).cond(e->range(e) = @(1).val.params[2]), ...] ], e -> [ fTensor(Copy(Drop(@(3).val.children(), 1)), Copy(@(2).val)) ] ),\n));\n\nClass(RulesSumsScratch, RulesSums);\nRewriteRules(RulesSumsScratch, rec(\n \n merge_LSKernel := ARule(Compose, [@(1, LSKernel), @(2, LSKernel)],\n e -> [LSKernel(Compose([@(1).val.child(1), @(2).val.child(1)]), @(1).val.mergeInfo(@(1).val.info, @(2).val.info))]),\n \n mark_DMAGS := Rule([Compose, @(1, Scat), @(2, LSKernel), @(3, Gath)], e -> DMAScat(@(1).val.func) * @(2).val * DMAGath(@(3).val.func) ),\n \n mark_SWPSum := Rule([DMAFence, [@(1, ISum), @(2)]], e -> let(\n var := @(1).val.var,\n dom := @(1).val.domain,\n comp := Compose(@(2).val._children),\n DMAFence(SWPSum(var, dom, comp)))),\n\n Scat_DMAFence := ARule( Compose,\n [ @(1, [Scat, Prm, Diag]),\n @(2, [DMAFence, ISum]) ],\n e -> [ CopyFields(@(2).val, rec(\n _children := List(@(2).val._children, c -> @(1).val * c),\n dimensions := [Rows(@(1).val), Cols(@(2).val)] )) ]),\n\n Gath_DMAFence := ARule( Compose,\n [ @(1, [DMAFence, ISum]),\n @(2, [Gath, Prm, Diag]) ],\n e -> [ CopyFields(@(1).val, rec(\n _children := List(@(1).val._children, c -> c * @(2).val),\n dimensions := [Rows(@(1).val), Cols(@(2).val)] )) ]),\n\n DMAFence_fold := Rule([@(1, DMAFence), @(2, DMAFence)],\n e -> @(2).val),\n \n Diag_fPrecompute := Rule([Diag, @(2, fPrecompute)], e -> Diag(@(2).val._children[1])),\n\n Diag_LSKernel := ARule( Compose,\n [ @(1, Diag), @(2, LSKernel) ],\n e -> [LSKernel(@(1).val * @(2).val.child(1), CopyFields(@(2).val.info, rec(opcount := @(2).val.info.opcount + 6 * Rows(@(1).val))))]),\n\n LSKernel_Diag := ARule( Compose,\n [ @(1, LSKernel), @(2, Diag) ],\n e -> [\n LSKernel(@(1).val.child(1) * @(2).val, \n CopyFields(@(1).val.info, \n rec(opcount := @(1).val.info.opcount + 6 * Rows(@(2).val))\n )\n )\n ]\n )\n));\n\n\nClass(RulesRCScratch, RulesRC);\nRewriteRules(RulesRCScratch, rec(\n RC_ISum := Rule([RC, @(1, ISum)], \n e -> let(s := @(1).val, ISum(s.var, s.domain, RC(s.child(1))))),\n \n RC_SWPSum := Rule([RC, @(1, SWPSum)],\n e -> let(s := @(1).val, SWPSum(s.var, s.domain, RC(s.child(1))))),\n\n RC_DMAFence := Rule([RC, @(1, DMAFence)],\n e -> let(s:=@(1).val, DMAFence(RC(s.child(1))))),\n\n RC_LSKernel := Rule([RC, @(1, LSKernel)],\n e -> let(s:=@(1).val, LSKernel(RC(s.child(1)), s.info))),\n\n RC_DMAGath := Rule([RC, @(1, DMAGath)], e -> DMAGath(fTensor(@(1).val.func, fId(2)))),\n\n RC_DMAScat := Rule([RC, @(1, DMAScat)], e -> DMAScat(fTensor(@(1).val.func, fId(2)))),\n));\n\nDMAGath.needInterleavedRight := False;\nDMAGath.needInterleavedLeft := False;\nDMAGath.cannotChangeDataFormat := True;\nDMAGath.totallyCannotChangeDataFormat := True;\n\nDMAScat.needInterleavedRight := False;\nDMAScat.needInterleavedLeft := False;\nDMAScat.cannotChangeDataFormat := True;\nDMAScat.totallyCannotChangeDataFormat := True;\n", "meta": {"hexsha": "d35a4566e1caab07a5d1f579ed23e6759c0a8c73", "size": 3458, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "namespaces/spiral/paradigms/scratchpad/rewrite.gi", "max_stars_repo_name": "sr7cb/spiral-software", "max_stars_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_stars_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_stars_count": 42, "max_stars_repo_stars_event_min_datetime": "2019-09-01T19:29:39.000Z", "max_stars_repo_stars_event_max_datetime": "2022-01-17T12:26:12.000Z", "max_issues_repo_path": "namespaces/spiral/paradigms/scratchpad/rewrite.gi", "max_issues_repo_name": "sr7cb/spiral-software", "max_issues_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_issues_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_issues_count": 12, "max_issues_repo_issues_event_min_datetime": "2020-11-20T16:15:52.000Z", "max_issues_repo_issues_event_max_datetime": "2022-01-07T21:17:28.000Z", "max_forks_repo_path": "namespaces/spiral/paradigms/scratchpad/rewrite.gi", "max_forks_repo_name": "sr7cb/spiral-software", "max_forks_repo_head_hexsha": "349d9e0abe75bf4b9a4690f2dbee631700f8361a", "max_forks_repo_licenses": ["BSD-2-Clause-FreeBSD"], "max_forks_count": 21, "max_forks_repo_forks_event_min_datetime": "2019-08-20T19:27:52.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-01T22:11:18.000Z", "avg_line_length": 36.7872340426, "max_line_length": 157, "alphanum_fraction": 0.539907461, "num_tokens": 1178, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.6150878414043816, "lm_q2_score": 0.4493926344647597, "lm_q1q2_score": 0.2764159454759573}}
{"text": "#\n# walrus: Computational Methods for Finitely Generated Monoids and Groups\n#\n\n## Places\nInstallGlobalFunction(NewPlace,\nfunction(loc, c, colour)\n local p;\n p := Objectify(PregroupPlaceType, [loc,c,colour]);\n Add(loc![3], p);\n return p;\nend);\n\nInstallMethod(Location\n , \"for a pregroup place\"\n , [IsPregroupPlaceRep],\n p -> p![1]);\n\nInstallMethod(Relator\n , \"for a pregroup place\"\n , [IsPregroupPlace],\n p -> Relator(p![1]));\n\nInstallMethod(Letter\n , \"for a pregroup place\"\n , [IsPregroupPlaceRep],\n p -> p![2]);\n\nInstallMethod(Colour\n , \"for a pregroup place\"\n , [IsPregroupPlaceRep],\n p -> p![3]);\n\nInstallMethod(NextPlaces\n , \"for a pregroup place\"\n , [IsPregroupPlaceRep],\nfunction(p)\n if not IsBound(p![6]) then\n p![6] := Places(NextLocation(Location(p)));\n fi;\n return p![6];\nend);\n\nAddOrUpdate := function(map, key, val)\n local tmp;\n\n tmp := map[key];\n if tmp = fail or val < tmp then\n map[key] := val;\n fi;\nend;\n\nInstallGlobalFunction(OneStepRedCase,\nfunction(P)\n local Q, Ql\n , b, c, d, x, y\n , Lp\n , v, v1, v2\n , res\n , xi1, xi2, binv, l, onv, pres, vg, xi;\n\n pres := PregroupPresentationOf(Relator(P));\n res := HashMap(1024);\n vg := VertexGraph(pres);\n\n c := Letter(P);\n\n for Q in NextPlaces(P) do\n # same relator, one position up\n Ql := Location(Q);\n b := InLetter(Ql); binv := PregroupInverse(b);\n d := OutLetter(Ql);\n x := Letter(Q);\n v := VertexFor(vg, [b, d, 0]);\n onv := OutNeighboursOfVertex(vg, v);\n\n for y in IntermultMap(binv) do\n v1 := VertexFor(vg, [y, binv, 1]);\n xi1 := Blob(pres, y, binv, c);\n for v2 in onv do\n #T this check is new, and assuming the paper\n #T is accurate correct\n if DigraphVertexLabel(vg, v2)[1][2] = x then\n xi2 := Vertex(pres, v1, v, v2);\n\n AddOrUpdate(res, [ __ID(Q), 1 ], xi1 + xi2);\n fi;\n od;\n od;\n od;\n # Note this list is not necessarily dense atm.\n return res;\nend);\n\nInstallGlobalFunction(OneStepGreenCase,\nfunction(P)\n local L, L2, b, c, loc, pls, is_consoledge, v, v1, v2, xi1, xi2,\n R, R2, P2, P2s, P2T, i, j, next, res, len, n, l, pres, vg,\n P2_loc, P2_inletter, P2_outletter, P2_outletterinv, P2_letter;\n\n pres := PregroupPresentationOf(Relator(P));\n res := HashMap(1024);\n vg := VertexGraph(pres);\n\n L := Location(P);\n b := OutLetter(L);\n c := Letter(P);\n\n # Every place that is instanciated with location that is in an instantiation of\n # a place P'.\n # We're interested in consolidated edges between Relator(P) and Relator(L2)\n # from the locations that P and pls are at.\n #\n # Do we have to check that Relator(P) and Relator(pls) don't entirely cancel?\n for L2 in Locations(pres) do\n R2 := Relator(L2);\n\n # L2 instantiates place on R2, have to test consolidated\n # edges between R and R2 starting from L/L2 on R/R2\n # respectively\n if (InLetter(L2) = PregroupInverse(b))\n and (OutLetter(L2) = c) then\n\n # We compute all consolidated edge places,\n # we could do this incrementally, but I don't\n # currently see a use in doing so\n P2s := ConsolidatedEdgePlaces(L, L2);\n\n for P2T in P2s do\n P2 := P2T[1]; # Place reachable on R1 by consolidated edge\n \n P2_loc := Location(P2);\n P2_inletter := InLetter(P2_loc);\n P2_outletter := OutLetter(P2_loc);\n P2_outletterinv := PregroupInverse(P2_outletter);\n P2_letter := Letter(P2);\n\n # P2T[2] location on R2 reachable by the edge\n len := P2T[3]; # length of consolidated edge\n v1 := VertexFor(vg, [ InLetter(P2T[2]), OutLetter(P2T[2]), 0 ]);\n v := VertexFor(vg, [ P2_inletter, P2_outletter, 0 ]);\n for v2 in OutNeighboursOfVertex(vg, v) do\n if DigraphVertexLabel(vg, v2)[1][1] = P2_outletterinv and\n P2_letter = DigraphVertexLabel(vg, v2)[1][2] then\n\n xi1 := Vertex(pres, v1, v, v2);\n if Colour(P2) = \"green\" then\n AddOrUpdate(res, [ __ID(P2), len ], xi1);\n\n elif Colour(P2) = \"red\" then\n next := OneStepRedCase(P2);\n # testhack\n for n in Keys(next) do\n AddOrUpdate( res, [ n[1], len + 1 ]\n , xi1 + next[n] );\n od;\n else\n Error(\"Invalid colour\");\n fi;\n else\n\n fi;\n od;\n od;\n fi;\n od;\n return res;\nend);\n\nInstallMethod(OneStepReachablePlaces\n , \"for a pregroup place\"\n , [IsPregroupPlaceRep],\nfunction(p)\n if not IsBound(p![7]) then\n if Colour(p) = \"red\" then\n p![7] := OneStepRedCase(p);\n elif Colour(p) = \"green\" then\n p![7] := OneStepGreenCase(p);\n else\n Error(\"Invalid colour for place \", p, \"\\n\");\n fi;\n fi;\n return p![7];\nend);\n\nInstallMethod(__ID\n , \"for a pregroup place\"\n , [IsPregroupPlace],\n p -> p![5]);\n\nInstallMethod(ViewString\n , \"for a pregroup place\"\n , [IsPregroupPlaceRep],\nfunction(p)\n return STRINGIFY(\"(\", ViewString(p![1]),\n \",\", ViewString(p![2]),\n \",\", ViewString(p![3]),\n \")\");\nend);\n\nInstallMethod(\\=\n , \"for two pregroup places\"\n , [IsPregroupPlaceRep, IsPregroupPlaceRep],\nfunction(p1, p2)\n return (p1![1] = p2![1])\n and (p1![2] = p2![2])\n and (p1![3] = p2![3]);\nend);\n\n", "meta": {"hexsha": "197118c96b501830f4aabee7cfbdcbb9d5ba8628", "size": 6263, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "gap/place.gi", "max_stars_repo_name": "wilfwilson/walrus", "max_stars_repo_head_hexsha": "4af44a0cc9acfd756be8009f7cdf8450a2ba3722", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2021-10-02T14:55:52.000Z", "max_stars_repo_stars_event_max_datetime": "2021-10-02T14:55:52.000Z", "max_issues_repo_path": "gap/place.gi", "max_issues_repo_name": "wilfwilson/walrus", "max_issues_repo_head_hexsha": "4af44a0cc9acfd756be8009f7cdf8450a2ba3722", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 26, "max_issues_repo_issues_event_min_datetime": "2018-11-22T11:15:07.000Z", "max_issues_repo_issues_event_max_datetime": "2022-02-21T13:31:01.000Z", "max_forks_repo_path": "gap/place.gi", "max_forks_repo_name": "wilfwilson/walrus", "max_forks_repo_head_hexsha": "4af44a0cc9acfd756be8009f7cdf8450a2ba3722", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 4, "max_forks_repo_forks_event_min_datetime": "2019-02-11T14:47:47.000Z", "max_forks_repo_forks_event_max_datetime": "2021-05-20T10:22:09.000Z", "avg_line_length": 29.8238095238, "max_line_length": 83, "alphanum_fraction": 0.4964074725, "num_tokens": 1689, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.5813030906443133, "lm_q2_score": 0.4610167793123159, "lm_q1q2_score": 0.2679904786531365}}
{"text": "#############################################################################\n##\n#W pcpgrp4.gi Karel Dekimpe\n#W Bettina Eick\n##\n## This file contains the 4-dimensional almost crystallographic groups\n## as pcp groups. There are 95 types of groups.\n##\n\nACPcpGroupDim4Nr001 := function (k1, k2, k3) \nlocal FTL;\n FTL := FromTheLeftCollector( 4 );\n SetConjugate( FTL, 2, 1, [2,1, 4,k1 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,k2 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,k3 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr002 := function (k1, k2, k3 , k4, k5, k6, k7) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k7 ] );\n SetConjugate( FTL, 2, 1, [2,-1, 3,0, 4,0, 5,k4 ] );\n SetConjugate( FTL, 3, 1, [2,0, 3,-1, 4,0, 5,k5 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,-1, 5,k6 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,k2 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,k3 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr003 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,-1, 3,0, 4,0, 5,k2 ] );\n SetConjugate( FTL, 3, 1, [2,0, 3,1, 4,0, 5,0 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,-1, 5,k3 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,0 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,k1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr004 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,0, 3,1, 4,0, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,-1, 3,0, 4,0, 5,k2 ] );\n SetConjugate( FTL, 3, 1, [2,0, 3,1, 4,0, 5,0 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,-1, 5,k3 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,0 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,k1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr004b:= function (k1, k2, k3 ) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,0, 3,1, 4,0, 5,k3 ] );\n SetConjugate( FTL, 2, 1, [2,-1, 3,0, 4,0, 5,k1 ] );\n SetConjugate( FTL, 3, 1, [2,0, 3,1, 4,0, 5,2*k3 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,-1, 5,-k2 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,-1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,2*k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,2*k2 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr005 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,0, 3,-1, 4,0, 5,k2 ] );\n SetConjugate( FTL, 3, 1, [2,-1, 3,0, 4,0, 5,k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,-1, 5,k3 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,0 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,k1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr006 := function (k1, k2, k3 ) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k3 ] );\n SetConjugate( FTL, 2, 1, [2,1, 3,0, 4,0, 5,0 ] );\n SetConjugate( FTL, 3, 1, [2,0, 3,-1, 4,0, 5,k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,1, 5,0 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,0 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,k1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr007 := function (k1, k2, k3 ) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,0, 3,0, 4,1, 5,k3 ] );\n SetConjugate( FTL, 2, 1, [2,1, 3,0, 4,0, 5,-k1 ] );\n SetConjugate( FTL, 3, 1, [2,0, 3,-1, 4,0, 5,k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,1, 5,0 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,0 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,2*k1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr007b:= function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,0, 3,0, 4,1, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,1, 3,0, 4,0, 5,-k3 ] );\n SetConjugate( FTL, 3, 1, [2,0, 3,-1, 4,0, 5,k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,1, 5,2*k4 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,-1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,2*k2 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr008 := function (k1, k2, k3) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k3 ] );\n SetConjugate( FTL, 2, 1, [2,0, 3,1, 4,0, 5,k2 ] );\n SetConjugate( FTL, 3, 1, [2,1, 3,0, 4,0, 5,-k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,1, 5,0 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,0 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,k1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr009 := function (k1, k2, k3) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,0, 3,0, 4,1, 5,k3 ] );\n SetConjugate( FTL, 2, 1, [2,0, 3,1, 4,0, 5,-k1 + k2 ] );\n SetConjugate( FTL, 3, 1, [2,1, 3,0, 4,0, 5,-k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,1, 5,0 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,0 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,k1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr009b:= function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,0, 3,0, 4,1, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,0, 3,1, 4,0, 5,k2 - k3 ] );\n SetConjugate( FTL, 3, 1, [2,1, 3,0, 4,0, 5,-k3 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,1, 5,2*k4 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,-1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,k2 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,-k2 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr010 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k6 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,0, 5,0, 6,0 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,k5 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,k3 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,-1, 6,k3 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr011 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,-1, 5,0, 6,-k6 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,-2*k6 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,k3 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,1, 5,0, 6,k4 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,-1, 6,k3 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr012 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k6 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,0, 5,0, 6,0 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,k5 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,2*k2 - k5 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,k3 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 3, 2, [3,0, 4,-1, 5,0, 6,k2 ] );\n SetConjugate( FTL, 4, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,-1, 6,k3 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr013 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,0, 5,1, 6,k6 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,k1 + k2 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,k4 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,-2*k6 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,-1, 6,-2*k6 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,2*k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr014 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,-1, 5,1, 6,-k3 - k6 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,k1 + k2 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,-k3 - 2*k6 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,k3 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,1, 5,0, 6,k4 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,-1, 6,k3 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,2*k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr014b:= function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,-1, 5,1, 6,-k2 - 2*k3 + 2*k5 - k6 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,k2 - 2*k3 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,k2 + 2*k3 - 2*k5 + 2*k6 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,1, 5,0, 6,k3 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,k1 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,1, 5,0, 6,2*k3 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,-1, 6,-k2 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,-1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,2*k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,2*k2 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr015 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,0, 5,1, 6,k6 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,k1 + 2*k2 - k4 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,-2*k6 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 3, 2, [3,0, 4,-1, 5,0, 6,k2 ] );\n SetConjugate( FTL, 4, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,-1, 6,-2*k6 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr018 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,1, 5,0, 6,k3 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,1, 4,1, 5,0, 6,k1 - 2*k2 + 2*k3 - k4 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,k1 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,1, 5,0, 6,2*k3 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,0 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,-k1 + 2*k2 - 2*k3 + 2*k4 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,k1 - 2*k3 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,2*k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr019 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,1, 5,0, 6,k3 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,1, 4,1, 5,-1, 6,-3*k1 - 2*k2 + 2*k3 - k4 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,3*k1 + 2*k2 - 2*k3 + 2*k4 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,-k1 - 2*k2 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,1, 6,k2 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,k1 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,2*k2 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,-1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,2*k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr019b:= function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,1, 5,0, 6,k3 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,1, 4,1, 5,-1, 6,k1 - 2*k2 + 2*k3 - k4 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,k1 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,1, 5,0, 6,2*k3 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,0 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,1, 6,k2 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,-k1 + 2*k2 - 2*k3 + 2*k4 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,k1 - 2*k3 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,2*k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr019c:= function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,1, 5,0, 6,k3 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,1, 4,1, 5,-1, 6,-2*k2 + 2*k3 + k4 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,0 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,1, 5,0, 6,2*k3 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,-k1 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,1, 6,k2 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,0 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,k1 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,2*k2 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,-1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,2*k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr026 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,0, 6,0 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,k3 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,1, 6,k2 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,k1 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,2*k2 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,-1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,2*k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr027 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,1, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,0, 5,0, 6,-k4 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,0, 6,-k2 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,2*k5 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,k3 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr029 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,1, 6,k3 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,1, 5,0, 6,-2*k2 + 2*k3 - k4 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,0, 6,-k1 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,2*(k2 - k3 + k4) ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,1, 6,k2 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,k1 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,2*k2 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,-1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,2*k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr029b:= function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,1, 6,k4 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,1, 5,0, 6,-2*k3 + 2*k4 - k5 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,0, 6,-k1 - k2 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,2*k4 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,1, 6,k3 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,2*(k3 - k4 + k5) ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,2*k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr029c:= function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,1, 6,k1 + k2 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,1, 5,0, 6,-4*k1 + k4 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,0, 6,-k3 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,2*k1 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,2*(k1 + k2) ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,1, 6,k2 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,0 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,2*k1 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,2*k2 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,-1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,4*k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr030 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,1, 6,k4 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,1, 5,0, 6,-2*k3 - k5 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,0, 6,-k1 - k2 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,2*k4 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,2*(k3 + k5) ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,2*k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr031 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,1, 5,0, 6,2*k3 - k4 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,0, 6,0 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,-2*(k3 - k4) ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,1, 6,k2 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,k1 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,2*k2 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,-1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,2*k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr032 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,1, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,1, 4,1, 5,0, 6,3*k1 - 2*k2 + 2*k4 - k5 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,0, 6,2*k4 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,-k1 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,-k3 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,-k1 - 2*k4 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,-3*k1 + 2*k2 - 2*k4 + 2*k5 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,2*k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr033 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,1, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,1, 4,1, 5,0, 6,2*k3 - k4 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,0, 6,0 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,-k1 - 2*k3 + 2*k4 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,k1 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,1, 6,k2 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,k1 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,2*k2 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,-1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,2*k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr033b:= function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,1, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,1, 4,1, 5,0, 6,3*k1 - 2*k2 - k3 + 2*k4 - k5 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,0, 6,2*k4 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,-k1 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,-k3 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,1, 6,k2 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,-k1 - 2*k4 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,-3*k1 + 2*k2 + k3 - 2*k4 + 2*k5 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,2*k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr033c:= function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,1, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,1, 4,1, 5,0, 6,-k1 + 2*k3 + k4 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,0, 6,2*k3 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,k1 + 2*k2 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,1, 6,k2 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,0 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,k1 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,2*k2 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,-1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,2*k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr034 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,1, 4,0, 5,1, 6,k4 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,1, 4,1, 5,0, 6,2*k1 - k2 - 2*k3 - k5 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,0, 6,-k1 - k2 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,-k1 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,k1 + k2 + 2*k4 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,-2*k1 + k2 + 2*k3 + 2*k5 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,2*k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr036 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 3, 1, [3,0, 4,1, 5,0, 6,k3 ] );\n SetConjugate( FTL, 4, 1, [3,1, 4,0, 5,0, 6,-k3 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,1, 6,k2 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,k1 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,k1 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,2*k2 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,-1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,2*k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,2*k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr037 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,1, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,0, 5,0, 6,-k3 ] );\n SetConjugate( FTL, 3, 1, [3,0, 4,1, 5,0, 6,-k4 ] );\n SetConjugate( FTL, 4, 1, [3,1, 4,0, 5,0, 6,-k4 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,2*k5 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,-k2 + 2*k4 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr041 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,1, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,1, 4,1, 5,1, 6,k1 - k2 - k3 + k5 ] );\n SetConjugate( FTL, 3, 1, [3,0, 4,-1, 5,0, 6,2*k1 - k4 ] );\n SetConjugate( FTL, 4, 1, [3,-1, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,2*k5 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 3, 2, [3,0, 4,-1, 5,0, 6,k2 ] );\n SetConjugate( FTL, 4, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,-1, 6,2*(k1 - k5) ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,2*k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,2*k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr043 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,1, 5,0, 6,k4 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,0, 5,1, 6,-k2 - 2*k3 - k5 ] );\n SetConjugate( FTL, 3, 1, [3,0, 4,1, 5,-1, 6,k1 + k2 + 2*k4 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,1, 5,0, 6,2*k4 ] );\n SetConjugate( FTL, 5, 1, [3,-1, 4,1, 5,0, 6,-k2 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 3, 2, [3,0, 4,1, 5,-1, 6,k2 + 2*k3 + 2*k5 ] );\n SetConjugate( FTL, 4, 2, [3,1, 4,0, 5,-1, 6,k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,-1, 6,2*(k2 + k3 + k5) ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,-k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr045 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,1, 4,1, 5,0, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,0, 5,0, 6,-k3 ] );\n SetConjugate( FTL, 3, 1, [3,0, 4,0, 5,-1, 6,-k4 ] );\n SetConjugate( FTL, 4, 1, [3,1, 4,1, 5,1, 6,k4 + 2*k5 ] );\n SetConjugate( FTL, 5, 1, [3,-1, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 3, 2, [3,0, 4,1, 5,0, 6,k2 ] );\n SetConjugate( FTL, 4, 2, [3,1, 4,0, 5,0, 6,-k2 ] );\n SetConjugate( FTL, 5, 2, [3,-1, 4,-1, 5,-1, 6,k2 - 2*k4 - 2*k5 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,-k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr055 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 7 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [4,0, 5,0, 6,0, 7,2*k1 + k2 + k4 + k6 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 4,1, 5,-1, 6,0, 7,k1 + 2*k2 - 2*k3 + 2*k4 + k6 ] );\n SetConjugate( FTL, 3, 1, [3, 1 , 4,0, 5,0, 6,0, 7,0 ] );\n SetConjugate( FTL, 4, 1, [4,-1, 5,0, 6,0, 7,-k1 - 2*k2 + 2*k3 - 2*k4 ] );\n SetConjugate( FTL, 5, 1, [4,0, 5,-1, 6,0, 7,-k1 - 2*k3 ] );\n SetConjugate( FTL, 6, 1, [4,0, 5,0, 6,-1, 7,k5 ] );\n SetConjugate( FTL, 7, 1, [4,0, 5,0, 6,0, 7,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [4,0, 5,1, 6,0, 7,k3 ] );\n SetConjugate( FTL, 3, 2, [ 3, 1, 4,-1, 5,1, 6,0, 7,-k1 - 2*k2 + 2*k3 - k4 ] );\n SetConjugate( FTL, 4, 2, [4,-1, 5,0, 6,0, 7,k1 ] );\n SetConjugate( FTL, 5, 2, [4,0, 5,1, 6,0, 7,2*k3 ] );\n SetConjugate( FTL, 6, 2, [4,0, 5,0, 6,-1, 7,0 ] );\n SetConjugate( FTL, 7, 2, [4,0, 5,0, 6,0, 7,-1 ] );\n SetRelativeOrder( FTL, 3, 2 );\n SetPower( FTL, 3, [4,0, 5,0, 6,0, 7,k2 ] );\n SetConjugate( FTL, 4, 3, [4,-1, 5,0, 6,0, 7,-k1 - 2*k2 + 2*k3 - 2*k4 ] );\n SetConjugate( FTL, 5, 3, [4,0, 5,-1, 6,0, 7,-k1 - 2*k3 ] );\n SetConjugate( FTL, 6, 3, [4,0, 5,0, 6,1, 7,0 ] );\n SetConjugate( FTL, 7, 3, [4,0, 5,0, 6,0, 7,1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0, 7,2*k1 ] );\n SetConjugate( FTL, 6, 4, [6,1, 7,0 ] );\n SetConjugate( FTL, 6, 5, [6,1, 7,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr056 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 7 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [4,0, 5,0, 6,0, 7,k6 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 4,0, 5,-1, 6,1, 7,-2*k3 - k5 + 2*k6 ] );\n SetConjugate( FTL, 3, 1, [3, 1 , 4,1, 5,1, 6,0, 7,k4 ] );\n SetConjugate( FTL, 4, 1, [4,-1, 5,0, 6,0, 7,2*(k1 + k3 - k4) ] );\n SetConjugate( FTL, 5, 1, [4,0, 5,-1, 6,0, 7,-2*k3 ] );\n SetConjugate( FTL, 6, 1, [4,0, 5,0, 6,-1, 7,2*(k3 + k5 - k6) ] );\n SetConjugate( FTL, 7, 1, [4,0, 5,0, 6,0, 7,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [4,0, 5,1, 6,0, 7,k3 ] );\n SetConjugate( FTL, 3, 2, [ 3, 1, 4,1, 5,1, 6,0, 7,-k2 + k4 ] );\n SetConjugate( FTL, 4, 2, [4,-1, 5,0, 6,0, 7,k1 ] );\n SetConjugate( FTL, 5, 2, [4,0, 5,1, 6,0, 7,2*k3 ] );\n SetConjugate( FTL, 6, 2, [4,0, 5,0, 6,-1, 7,0 ] );\n SetConjugate( FTL, 7, 2, [4,0, 5,0, 6,0, 7,-1 ] );\n SetRelativeOrder( FTL, 3, 2 );\n SetPower( FTL, 3, [4,0, 5,0, 6,0, 7,k2 ] );\n SetConjugate( FTL, 4, 3, [4,-1, 5,0, 6,0, 7,k1 + 2*k3 - 2*k4 ] );\n SetConjugate( FTL, 5, 3, [4,0, 5,-1, 6,0, 7,k1 - 2*k3 ] );\n SetConjugate( FTL, 6, 3, [4,0, 5,0, 6,1, 7,0 ] );\n SetConjugate( FTL, 7, 3, [4,0, 5,0, 6,0, 7,1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0, 7,2*k1 ] );\n SetConjugate( FTL, 6, 4, [6,1, 7,0 ] );\n SetConjugate( FTL, 6, 5, [6,1, 7,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr058 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 7 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [4,0, 5,0, 6,0, 7,k6 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 4,1, 5,-1, 6,1, 7,-3*k1 - 2*k3 - k5 + 2*k6 ] );\n SetConjugate( FTL, 3, 1, [3, 1 , 4,0, 5,0, 6,0, 7,0 ] );\n SetConjugate( FTL, 4, 1, [4,-1, 5,0, 6,0, 7,-k1 - 2*k2 + 2*k3 - 2*k4 ] );\n SetConjugate( FTL, 5, 1, [4,0, 5,-1, 6,0, 7,-k1 - 2*k3 ] );\n SetConjugate( FTL, 6, 1, [4,0, 5,0, 6,-1, 7,2*(2*k1 + k2 + k4 + k5 - k6) ] );\n SetConjugate( FTL, 7, 1, [4,0, 5,0, 6,0, 7,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [4,0, 5,1, 6,0, 7,k3 ] );\n SetConjugate( FTL, 3, 2, [ 3, 1, 4,-1, 5,1, 6,0, 7,-k1 - 2*k2 + 2*k3 - k4 ] );\n SetConjugate( FTL, 4, 2, [4,-1, 5,0, 6,0, 7,k1 ] );\n SetConjugate( FTL, 5, 2, [4,0, 5,1, 6,0, 7,2*k3 ] );\n SetConjugate( FTL, 6, 2, [4,0, 5,0, 6,-1, 7,0 ] );\n SetConjugate( FTL, 7, 2, [4,0, 5,0, 6,0, 7,-1 ] );\n SetRelativeOrder( FTL, 3, 2 );\n SetPower( FTL, 3, [4,0, 5,0, 6,0, 7,k2 ] );\n SetConjugate( FTL, 4, 3, [4,-1, 5,0, 6,0, 7,-k1 - 2*k2 + 2*k3 - 2*k4 ] );\n SetConjugate( FTL, 5, 3, [4,0, 5,-1, 6,0, 7,-k1 - 2*k3 ] );\n SetConjugate( FTL, 6, 3, [4,0, 5,0, 6,1, 7,0 ] );\n SetConjugate( FTL, 7, 3, [4,0, 5,0, 6,0, 7,1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0, 7,2*k1 ] );\n SetConjugate( FTL, 6, 4, [6,1, 7,0 ] );\n SetConjugate( FTL, 6, 5, [6,1, 7,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr060 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 7 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [4,0, 5,0, 6,0, 7,k6 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 4,0, 5,-1, 6,1, 7,-2*k3 - k5 + 2*k6 ] );\n SetConjugate( FTL, 3, 1, [3, 1 , 4,1, 5,0, 6,0, 7,k1 - k2 + k3 - k4 ] );\n SetConjugate( FTL, 4, 1, [4,-1, 5,0, 6,0, 7,-2*(k1 - k2 + k3 - k4) ] );\n SetConjugate( FTL, 5, 1, [4,0, 5,-1, 6,0, 7,-2*k3 ] );\n SetConjugate( FTL, 6, 1, [4,0, 5,0, 6,-1, 7,2*(k3 + k5 - k6) ] );\n SetConjugate( FTL, 7, 1, [4,0, 5,0, 6,0, 7,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [4,0, 5,1, 6,0, 7,k3 ] );\n SetConjugate( FTL, 3, 2, [ 3, 1, 4,1, 5,1, 6,0, 7,2*k1 - 2*k2 + 2*k3 - k4 ] );\n SetConjugate( FTL, 4, 2, [4,-1, 5,0, 6,0, 7,2*k1 ] );\n SetConjugate( FTL, 5, 2, [4,0, 5,1, 6,0, 7,2*k3 ] );\n SetConjugate( FTL, 6, 2, [4,0, 5,0, 6,-1, 7,0 ] );\n SetConjugate( FTL, 7, 2, [4,0, 5,0, 6,0, 7,-1 ] );\n SetRelativeOrder( FTL, 3, 2 );\n SetPower( FTL, 3, [4,0, 5,0, 6,0, 7,k2 ] );\n SetConjugate( FTL, 4, 3, [4,-1, 5,0, 6,0, 7,-2*(k1 - k2 + k3 - k4) ] );\n SetConjugate( FTL, 5, 3, [4,0, 5,-1, 6,0, 7,2*(k1 - k3) ] );\n SetConjugate( FTL, 6, 3, [4,0, 5,0, 6,1, 7,0 ] );\n SetConjugate( FTL, 7, 3, [4,0, 5,0, 6,0, 7,1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0, 7,4*k1 ] );\n SetConjugate( FTL, 6, 4, [6,1, 7,0 ] );\n SetConjugate( FTL, 6, 5, [6,1, 7,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr061 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 7 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [4,0, 5,0, 6,0, 7,-k1 + k3 - k4 + k5 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 4,0, 5,-1, 6,1, 7,2*k1 + 2*k2 - k6 ] );\n SetConjugate( FTL, 3, 1, [3, 1 , 4,1, 5,0, 6,-1, 7,-8*k1 - 2*k2 + 2*k3 - 2*k4 + k5 ] );\n SetConjugate( FTL, 4, 1, [4,-1, 5,0, 6,0, 7,2*(4*k1 + k2 - k3 + k4) ] );\n SetConjugate( FTL, 5, 1, [4,0, 5,-1, 6,0, 7,2*(k1 + k2 - k6) ] );\n SetConjugate( FTL, 6, 1, [4,0, 5,0, 6,-1, 7,-2*(k1 + k2) ] );\n SetConjugate( FTL, 7, 1, [4,0, 5,0, 6,0, 7,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [4,0, 5,1, 6,0, 7,k3 ] );\n SetConjugate( FTL, 3, 2, [ 3, 1, 4,1, 5,1, 6,-1, 7,-6*k1 - 2*k2 + 2*k3 - k4 ] );\n SetConjugate( FTL, 4, 2, [4,-1, 5,0, 6,0, 7,2*(3*k1 + k2 - k3 + k4) ] );\n SetConjugate( FTL, 5, 2, [4,0, 5,1, 6,0, 7,0 ] );\n SetConjugate( FTL, 6, 2, [4,0, 5,0, 6,-1, 7,-2*(k1 + k2) ] );\n SetConjugate( FTL, 7, 2, [4,0, 5,0, 6,0, 7,1 ] );\n SetRelativeOrder( FTL, 3, 2 );\n SetPower( FTL, 3, [4,0, 5,0, 6,1, 7,k2 ] );\n SetConjugate( FTL, 4, 3, [4,-1, 5,0, 6,0, 7,2*k1 ] );\n SetConjugate( FTL, 5, 3, [4,0, 5,-1, 6,0, 7,0 ] );\n SetConjugate( FTL, 6, 3, [4,0, 5,0, 6,1, 7,2*k2 ] );\n SetConjugate( FTL, 7, 3, [4,0, 5,0, 6,0, 7,-1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0, 7,0 ] );\n SetConjugate( FTL, 6, 4, [6,1, 7,4*k1 ] );\n SetConjugate( FTL, 6, 5, [6,1, 7,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr061b := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 7 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [4,0, 5,0, 6,0, 7,-k1 + k2 + k4 + k5 + k6 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 4,0, 5,-1, 6,1, 7,-2*k1 + 2*k2 - 2*k3 + 2*k4 + 2*k5 + k6 ] );\n SetConjugate( FTL, 3, 1, [3, 1 , 4,1, 5,0, 6,-1, 7,2*k1 - 2*k2 + 2*k3 - 2*k4 - k5 ] );\n SetConjugate( FTL, 4, 1, [4,-1, 5,0, 6,0, 7,-2*(k1 - k2 + k3 - k4) ] );\n SetConjugate( FTL, 5, 1, [4,0, 5,-1, 6,0, 7,-2*k3 ] );\n SetConjugate( FTL, 6, 1, [4,0, 5,0, 6,-1, 7,2*(k1 - k2 + k3 - k4 - k5) ] );\n SetConjugate( FTL, 7, 1, [4,0, 5,0, 6,0, 7,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [4,0, 5,1, 6,0, 7,k3 ] );\n SetConjugate( FTL, 3, 2, [ 3, 1, 4,1, 5,1, 6,-1, 7,2*k1 - 2*k2 + 2*k3 - k4 ] );\n SetConjugate( FTL, 4, 2, [4,-1, 5,0, 6,0, 7,2*k1 ] );\n SetConjugate( FTL, 5, 2, [4,0, 5,1, 6,0, 7,2*k3 ] );\n SetConjugate( FTL, 6, 2, [4,0, 5,0, 6,-1, 7,0 ] );\n SetConjugate( FTL, 7, 2, [4,0, 5,0, 6,0, 7,-1 ] );\n SetRelativeOrder( FTL, 3, 2 );\n SetPower( FTL, 3, [4,0, 5,0, 6,1, 7,k2 ] );\n SetConjugate( FTL, 4, 3, [4,-1, 5,0, 6,0, 7,-2*(k1 - k2 + k3 - k4) ] );\n SetConjugate( FTL, 5, 3, [4,0, 5,-1, 6,0, 7,2*(k1 - k3) ] );\n SetConjugate( FTL, 6, 3, [4,0, 5,0, 6,1, 7,0 ] );\n SetConjugate( FTL, 7, 3, [4,0, 5,0, 6,0, 7,1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0, 7,4*k1 ] );\n SetConjugate( FTL, 6, 4, [6,1, 7,0 ] );\n SetConjugate( FTL, 6, 5, [6,1, 7,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr061c:= function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 7 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [4,0, 5,0, 6,0, 7,k1 + k2 + k3 + k6 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 4,0, 5,-1, 6,1, 7,2*k2 + k6 ] );\n SetConjugate( FTL, 3, 1, [3, 1 , 4,1, 5,0, 6,-1, 7,2*k1 + 2*k3 - k5 + 2*k6 ] );\n SetConjugate( FTL, 4, 1, [4,-1, 5,0, 6,0, 7,-2*(k1 + k3 - k5 + k6) ] );\n SetConjugate( FTL, 5, 1, [4,0, 5,-1, 6,0, 7,2*(k1 - k3) ] );\n SetConjugate( FTL, 6, 1, [4,0, 5,0, 6,-1, 7,-2*k2 ] );\n SetConjugate( FTL, 7, 1, [4,0, 5,0, 6,0, 7,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [4,0, 5,1, 6,0, 7,k3 ] );\n SetConjugate( FTL, 3, 2, [ 3, 1, 4,1, 5,1, 6,-1, 7,-2*k2 + 2*k3 + k4 ] );\n SetConjugate( FTL, 4, 2, [4,-1, 5,0, 6,0, 7,0 ] );\n SetConjugate( FTL, 5, 2, [4,0, 5,1, 6,0, 7,2*k3 ] );\n SetConjugate( FTL, 6, 2, [4,0, 5,0, 6,-1, 7,-2*k1 ] );\n SetConjugate( FTL, 7, 2, [4,0, 5,0, 6,0, 7,-1 ] );\n SetRelativeOrder( FTL, 3, 2 );\n SetPower( FTL, 3, [4,0, 5,0, 6,1, 7,k2 ] );\n SetConjugate( FTL, 4, 3, [4,-1, 5,0, 6,0, 7,0 ] );\n SetConjugate( FTL, 5, 3, [4,0, 5,-1, 6,0, 7,2*k1 ] );\n SetConjugate( FTL, 6, 3, [4,0, 5,0, 6,1, 7,2*k2 ] );\n SetConjugate( FTL, 7, 3, [4,0, 5,0, 6,0, 7,-1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0, 7,0 ] );\n SetConjugate( FTL, 6, 4, [6,1, 7,0 ] );\n SetConjugate( FTL, 6, 5, [6,1, 7,4*k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr062 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 7 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [4,0, 5,0, 6,0, 7,k3 - k4 + k5 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 4,0, 5,-1, 6,0, 7,-k6 ] );\n SetConjugate( FTL, 3, 1, [3, 1 , 4,1, 5,0, 6,-1, 7,-3*k1 - 2*k2 + 2*k3 - 2*k4 + k5 ] );\n SetConjugate( FTL, 4, 1, [4,-1, 5,0, 6,0, 7,3*k1 + 2*k2 - 2*k3 + 2*k4 ] );\n SetConjugate( FTL, 5, 1, [4,0, 5,-1, 6,0, 7,-2*k6 ] );\n SetConjugate( FTL, 6, 1, [4,0, 5,0, 6,-1, 7,-k1 - 2*k2 ] );\n SetConjugate( FTL, 7, 1, [4,0, 5,0, 6,0, 7,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [4,0, 5,1, 6,0, 7,k3 ] );\n SetConjugate( FTL, 3, 2, [ 3, 1, 4,1, 5,1, 6,-1, 7,-3*k1 - 2*k2 + 2*k3 - k4 ] );\n SetConjugate( FTL, 4, 2, [4,-1, 5,0, 6,0, 7,3*k1 + 2*k2 - 2*k3 + 2*k4 ] );\n SetConjugate( FTL, 5, 2, [4,0, 5,1, 6,0, 7,0 ] );\n SetConjugate( FTL, 6, 2, [4,0, 5,0, 6,-1, 7,-k1 - 2*k2 ] );\n SetConjugate( FTL, 7, 2, [4,0, 5,0, 6,0, 7,1 ] );\n SetRelativeOrder( FTL, 3, 2 );\n SetPower( FTL, 3, [4,0, 5,0, 6,1, 7,k2 ] );\n SetConjugate( FTL, 4, 3, [4,-1, 5,0, 6,0, 7,k1 ] );\n SetConjugate( FTL, 5, 3, [4,0, 5,-1, 6,0, 7,0 ] );\n SetConjugate( FTL, 6, 3, [4,0, 5,0, 6,1, 7,2*k2 ] );\n SetConjugate( FTL, 7, 3, [4,0, 5,0, 6,0, 7,-1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0, 7,0 ] );\n SetConjugate( FTL, 6, 4, [6,1, 7,2*k1 ] );\n SetConjugate( FTL, 6, 5, [6,1, 7,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr075 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 4 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,0, 3,-1, 4,0, 5,k3 ] );\n SetConjugate( FTL, 3, 1, [2,1, 3,0, 4,0, 5,-k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,1, 5,0 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr076 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 4 );\n SetPower( FTL, 1, [2,0, 3,0, 4,1, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,0, 3,-1, 4,0, 5,k3 ] );\n SetConjugate( FTL, 3, 1, [2,1, 3,0, 4,0, 5,-k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,1, 5,0 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr077 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 4 );\n SetPower( FTL, 1, [2,0, 3,0, 4,2, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,0, 3,-1, 4,0, 5,k3 ] );\n SetConjugate( FTL, 3, 1, [2,1, 3,0, 4,0, 5,-k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,1, 5,0 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr079 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 4 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,1, 3,1, 4,1, 5,-k3 ] );\n SetConjugate( FTL, 3, 1, [2,0, 3,0, 4,-1, 5,k3 ] );\n SetConjugate( FTL, 4, 1, [2,-1, 3,0, 4,0, 5,k2 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,0 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,k1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,-k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr080 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 4 );\n SetPower( FTL, 1, [2,1, 3,1, 4,0, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,1, 3,1, 4,1, 5,-k3 ] );\n SetConjugate( FTL, 3, 1, [2,0, 3,0, 4,-1, 5,k3 ] );\n SetConjugate( FTL, 4, 1, [2,-1, 3,0, 4,0, 5,k2 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,0 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,k1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,-k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr081 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 4 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k5 ] );\n SetConjugate( FTL, 2, 1, [2,0, 3,1, 4,0, 5,-k3 ] );\n SetConjugate( FTL, 3, 1, [2,-1, 3,0, 4,0, 5,k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,-1, 5,k4 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr082 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 4 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k5 ] );\n SetConjugate( FTL, 2, 1, [2,-1, 3,-1, 4,-1, 5,k2 + k3 + k4 ] );\n SetConjugate( FTL, 3, 1, [2,0, 3,0, 4,1, 5,-k4 ] );\n SetConjugate( FTL, 4, 1, [2,1, 3,0, 4,0, 5,-k2 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,0 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,k1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,-k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr083 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k6 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,0, 5,0, 6,0 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,k2 + k3 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,-k2 + k3 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,k5 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 4 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 3, 2, [3,0, 4,-1, 5,0, 6,k3 ] );\n SetConjugate( FTL, 4, 2, [3,1, 4,0, 5,0, 6,-k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr084 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,0, 5,-1, 6,-k6 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,k2 + k3 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,-k2 + k3 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,-2*k6 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 4 );\n SetPower( FTL, 2, [3,0, 4,0, 5,2, 6,k4 ] );\n SetConjugate( FTL, 3, 2, [3,0, 4,-1, 5,0, 6,k3 ] );\n SetConjugate( FTL, 4, 2, [3,1, 4,0, 5,0, 6,-k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr085 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,-1, 4,0, 5,0, 6,k2 - k6 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,2*(k2 - k6) ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,-2*k6 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,k4 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 4 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 3, 2, [3,0, 4,-1, 5,0, 6,-k1 + k2 - 2*k6 ] );\n SetConjugate( FTL, 4, 2, [3,1, 4,0, 5,0, 6,-k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,2*k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr086 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,-1, 4,0, 5,-1, 6,k2 - k6 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,k1 + k2 + k3 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,k1 - k2 + k3 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,-k1 + k2 - k3 - 2*k6 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 4 );\n SetPower( FTL, 2, [3,0, 4,0, 5,2, 6,k4 ] );\n SetConjugate( FTL, 3, 2, [3,0, 4,-1, 5,0, 6,k3 ] );\n SetConjugate( FTL, 4, 2, [3,1, 4,0, 5,0, 6,-k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,2*k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr087 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k6 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,0, 5,0, 6,0 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,k5 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,-2*k2 + 2*k3 + k5 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,2*k2 - k5 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 4 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,1, 5,1, 6,-k3 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,0, 5,-1, 6,k3 ] );\n SetConjugate( FTL, 5, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,-k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr088 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,1, 4,0, 5,0, 6,-k2 - k6 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,2*(k2 + k6) ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,-k1 + 2*k3 + 2*k6 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,-2*k6 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 4 );\n SetPower( FTL, 2, [3,-1, 4,-1, 5,0, 6,k4 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,1, 5,1, 6,-k3 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,0, 5,-1, 6,k3 ] );\n SetConjugate( FTL, 5, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,-k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr103 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,1, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 3 , 3,0, 4,0, 5,0, 6,-k4 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,0, 6,-k2 - k3 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,2*k5 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 4 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 3, 2, [3,0, 4,-1, 5,0, 6,k3 ] );\n SetConjugate( FTL, 4, 2, [3,1, 4,0, 5,0, 6,-k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr104 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,1, 4,0, 5,1, 6,k4 ] );\n SetConjugate( FTL, 2, 1, [2, 3 , 3,1, 4,0, 5,0, 6,-k2 - 2*k3 - k5 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,0, 6,-2*(k2 + k3 + k5) ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,-k1 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,2*(k2 + k3 + k4 + k5) ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 4 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 3, 2, [3,0, 4,-1, 5,0, 6,-k1 + k2 + 2*k3 + 2*k5 ] );\n SetConjugate( FTL, 4, 2, [3,1, 4,0, 5,0, 6,-k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,2*k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr106 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,1, 4,0, 5,0, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 3 , 3,1, 4,0, 5,-1, 6,-k3 - k4 + k5 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,0, 6,2*k5 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,-k1 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,-2*k4 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 4 );\n SetPower( FTL, 2, [3,0, 4,0, 5,2, 6,k3 ] );\n SetConjugate( FTL, 3, 2, [3,0, 4,-1, 5,0, 6,-k1 - k2 - 2*k5 ] );\n SetConjugate( FTL, 4, 2, [3,1, 4,0, 5,0, 6,-k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,2*k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr110 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,1, 4,1, 5,0, 6,k1 - k2 - k4 ] );\n SetConjugate( FTL, 2, 1, [2, 3 , 3,1, 4,1, 5,1, 6,-2*k1 + 2*k2 - 2*k3 + 2*k4 - k5 ] );\n SetConjugate( FTL, 3, 1, [3,0, 4,0, 5,-1, 6,-k4 ] );\n SetConjugate( FTL, 4, 1, [3,1, 4,1, 5,1, 6,2*k1 - 2*k2 - k4 ] );\n SetConjugate( FTL, 5, 1, [3,-1, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 4 );\n SetPower( FTL, 2, [3,-1, 4,-1, 5,0, 6,k3 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,1, 5,1, 6,-k2 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,0, 5,-1, 6,k2 ] );\n SetConjugate( FTL, 5, 2, [3,-1, 4,0, 5,0, 6,4*k1 - 4*k2 + 2*k3 - 3*k4 + 2*k5 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,0 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,2*k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,-2*k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr114 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,1, 5,0, 6,k4 ] );\n SetConjugate( FTL, 2, 1, [2, 3 , 3,0, 4,1, 5,1, 6,-k1 + k2 - 2*k3 + 2*k4 - k5 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,k1 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,1, 5,0, 6,2*k4 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,0 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 4 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 3, 2, [3,0, 4,1, 5,0, 6,-k1 + k2 + 2*k4 ] );\n SetConjugate( FTL, 4, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,-1, 6,2*(k1 - k2 + k3 - k4 + k5) ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,2*k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr143 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 3 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,-1, 3,-1, 4,0, 5,k2 + k3 ] );\n SetConjugate( FTL, 3, 1, [2,1, 3,0, 4,0, 5,-k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,1, 5,0 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr144 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 3 );\n SetPower( FTL, 1, [2,0, 3,0, 4,1, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,-1, 3,-1, 4,0, 5,k2 + k3 ] );\n SetConjugate( FTL, 3, 1, [2,1, 3,0, 4,0, 5,-k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,1, 5,0 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr146 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 3 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,0, 3,0, 4,1, 5,k2 + k3 ] );\n SetConjugate( FTL, 3, 1, [2,1, 3,0, 4,0, 5,-k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,1, 4,0, 5,-k3 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,-k1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr147 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 6 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k5 ] );\n SetConjugate( FTL, 2, 1, [2,1, 3,1, 4,0, 5,k1 - k2 - k3 ] );\n SetConjugate( FTL, 3, 1, [2,-1, 3,0, 4,0, 5,k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,-1, 5,k4 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr148 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 6 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k5 ] );\n SetConjugate( FTL, 2, 1, [2,0, 3,0, 4,-1, 5,k4 ] );\n SetConjugate( FTL, 3, 1, [2,-1, 3,0, 4,0, 5,k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,-1, 4,0, 5,k3 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,-k1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr158 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,1, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 2 , 3,0, 4,0, 5,0, 6,-k4 ] );\n SetConjugate( FTL, 3, 1, [3,0, 4,-1, 5,0, 6,-k2 ] );\n SetConjugate( FTL, 4, 1, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,2*k5 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 3 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,-1, 5,0, 6,k2 + k3 ] );\n SetConjugate( FTL, 4, 2, [3,1, 4,0, 5,0, 6,-k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr159 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,1, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 2 , 3,0, 4,0, 5,0, 6,-k3 ] );\n SetConjugate( FTL, 3, 1, [3,0, 4,1, 5,0, 6,-k4 ] );\n SetConjugate( FTL, 4, 1, [3,1, 4,0, 5,0, 6,-k4 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,2*k5 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 3 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,-1, 5,0, 6,k1 - k2 + 3*k4 ] );\n SetConjugate( FTL, 4, 2, [3,1, 4,0, 5,0, 6,-k1 + 2*k2 - 3*k4 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr161 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,1, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 2 , 3,-1, 4,0, 5,0, 6,-k3 - k4 + 2*k5 ] );\n SetConjugate( FTL, 3, 1, [3,0, 4,1, 5,0, 6,-k1 - k2 - 2*k3 + 2*k5 ] );\n SetConjugate( FTL, 4, 1, [3,1, 4,0, 5,0, 6,-k2 - 2*k3 + 2*k5 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,2*k5 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 3 );\n SetPower( FTL, 2, [3,1, 4,1, 5,1, 6,k4 ] );\n SetConjugate( FTL, 3, 2, [3,0, 4,0, 5,1, 6,k2 + k3 ] );\n SetConjugate( FTL, 4, 2, [3,1, 4,0, 5,0, 6,-k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,1, 5,0, 6,-k3 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,-k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr168 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 6 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,1, 3,1, 4,0, 5,k1 - k2 - k3 ] );\n SetConjugate( FTL, 3, 1, [2,-1, 3,0, 4,0, 5,k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,1, 5,0 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr169 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 6 );\n SetPower( FTL, 1, [2,0, 3,0, 4,5, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,1, 3,1, 4,0, 5,k1 - k2 - k3 ] );\n SetConjugate( FTL, 3, 1, [2,-1, 3,0, 4,0, 5,k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,1, 5,0 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr172 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 6 );\n SetPower( FTL, 1, [2,0, 3,0, 4,2, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,1, 3,1, 4,0, 5,k1 - k2 - k3 ] );\n SetConjugate( FTL, 3, 1, [2,-1, 3,0, 4,0, 5,k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,1, 5,0 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr173 := function (k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 6 );\n SetPower( FTL, 1, [2,0, 3,0, 4,3, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,1, 3,1, 4,0, 5,k1 - k2 - k3 ] );\n SetConjugate( FTL, 3, 1, [2,-1, 3,0, 4,0, 5,k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,1, 5,0 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr174 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 6 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k5 ] );\n SetConjugate( FTL, 2, 1, [2,-1, 3,-1, 4,0, 5,k2 + k3 ] );\n SetConjugate( FTL, 3, 1, [2,1, 3,0, 4,0, 5,-k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,-1, 5,k4 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,0, 5,k1 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr175 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k6 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,0, 5,0, 6,0 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,k1 - 2*k3 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,-k1 + 2*k2 + 2*k3 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,k5 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 6 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,1, 5,0, 6,k1 - k2 - k3 ] );\n SetConjugate( FTL, 4, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr176 := function (k1, k2, k3 , k4, k5, k6) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,0, 5,-1, 6,k6 ] );\n SetConjugate( FTL, 3, 1, [3,-1, 4,0, 5,0, 6,k1 - 2*k3 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,-k1 + 2*k2 + 2*k3 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,2*k6 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 6 );\n SetPower( FTL, 2, [3,0, 4,0, 5,3, 6,k4 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,1, 5,0, 6,k1 - k2 - k3 ] );\n SetConjugate( FTL, 4, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4Nr184 := function (k1, k2, k3 , k4, k5) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,1, 6,k5 ] );\n SetConjugate( FTL, 2, 1, [2, 5 , 3,0, 4,0, 5,0, 6,-k4 ] );\n SetConjugate( FTL, 3, 1, [3,0, 4,-1, 5,0, 6,-k1 + k2 + 2*k3 ] );\n SetConjugate( FTL, 4, 1, [3,-1, 4,0, 5,0, 6,k1 - k2 - 2*k3 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,1, 6,2*k5 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 6 );\n SetPower( FTL, 2, [3,0, 4,0, 5,0, 6,k4 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,1, 5,0, 6,k1 - k2 - k3 ] );\n SetConjugate( FTL, 4, 2, [3,-1, 4,0, 5,0, 6,k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,0 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0, 6,k1 ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\nACPcpGroupDim4NrB1 := function (k , k1, k2 , k3) \nlocal FTL;\n FTL := FromTheLeftCollector( 4 );\n SetConjugate( FTL, 2, 1, [2,1, 3, k, 4, k1 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4, k2 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4, k3 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4NrB2 := function (k, k1, k2, k3) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,0, 3,0, 4,1, 5,k3 ] );\n SetConjugate( FTL, 2, 1, [2,-1, 3,0, 4,0, 5,k1 ] );\n SetConjugate( FTL, 3, 1, [2,0, 3,-1, 4,0, 5,k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,1, 5,2*k3 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,-1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,2*k, 5,2*(k*k1 + k*k2 + k*k3) ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,2*k1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,2*k2 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4NrB3c := function (l, k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,1, 3,0, 4,0, 5,0 ] );\n SetConjugate( FTL, 3, 1, [2,0, 3,-1, 4,0, 5,k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,-1, 5,k3 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,2*l, 5,(k1 - k3)*l ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4NrB3b := function (l, k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,1, 3,0, 4,-1, 5,-k2 ] );\n SetConjugate( FTL, 3, 1, [2,0, 3,-1, 4,0, 5,k3 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,-1, 5,-2*k2 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,2*l, 5,-k1 + 2*k1*l + 2*k2*l ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,2*k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4NrB3 := function (l, k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,1, 3,0, 4,-1, 5,-k2 ] );\n SetConjugate( FTL, 3, 1, [2,0, 3,-1, 4,0, 5,k3 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,-1, 5,-2*k2 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,1 + 2*l, 5,k2 + k1*l + 2*k2*l ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4NrB4 := function (k, k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,1, 3,0, 4,0, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,1, 3,0, 4,0, 5,0 ] );\n SetConjugate( FTL, 3, 1, [2,0, 3,-1, 4,-k, 5,k*k1 + k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,-1, 5,k3 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,2*k, 5,k*(k1 - k3) ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,0 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4NrB4b := function (k, k1, k2, k3) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,1, 3,0, 4,0, 5,k3 ] );\n SetConjugate( FTL, 2, 1, [2,1, 3,0, 4,0, 5,2*k3 ] );\n SetConjugate( FTL, 3, 1, [2,0, 3,-1, 4,-k, 5,k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,-1, 5,k1 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,-1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,2*k, 5,-(k*k1) - 2*k2 ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,-2*k1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4NrB5 := function (l, k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,0, 3,1, 4,0, 5,k2 ] );\n SetConjugate( FTL, 3, 1, [2,1, 3,0, 4,0, 5,-k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,-1, 5,k3 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,2*l, 5,-(k3*l) ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,k1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,-k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4NrB5b := function (l, k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 5 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [2,0, 3,0, 4,0, 5,k4 ] );\n SetConjugate( FTL, 2, 1, [2,0, 3,1, 4,0, 5,k2 ] );\n SetConjugate( FTL, 3, 1, [2,1, 3,0, 4,0, 5,-k2 ] );\n SetConjugate( FTL, 4, 1, [2,0, 3,0, 4,-1, 5,2*k3 ] );\n SetConjugate( FTL, 5, 1, [2,0, 3,0, 4,0, 5,1 ] );\n SetConjugate( FTL, 3, 2, [3,1, 4,1 + 2*l, 5,-(k3*(1 + 2*l)) ] );\n SetConjugate( FTL, 4, 2, [4,1, 5,k1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,-k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4NrB7 := function (l, k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,-1, 5,-1, 6,2*k1 - 2*k2 + 2*k3 - k4 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,2*l, 6,-((k1 - 2*k2)*l) ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,k1 - 2*k2 + 2*k3 - 2*k4 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,k1 - 2*k2 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,1, 6,k2 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,0 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,k1 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,2*k2 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,-1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,4*l, 6,4*(k1*l + k2*l) ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,2*k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4NrB7b := function (l, k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,0, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,0, 4,-1, 5,-1, 6,4*k1 - 2*k2 + 2*k3 - k4 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,1 + 2*l, 6,-k1 + k2 - 2*k1*l + 2*k2*l ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,0, 6,2*(k1 - k2 + k3 - k4) ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,2*(k1 - k2) ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,1, 6,k2 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,0, 6,0 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,0, 6,2*k1 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,2*k2 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,-1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,2*(1 + 2*l), 6,2*(2*k1 + k2 + 4*k1*l + 2*k2*l) ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,4*k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4NrB8 := function (k, k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,1, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,1, 4,-1, 5,-1 - 4*k, 6,2*k1 + 8*k*k1 - 2*k2 - 6*k*k2 + 2*k3 - k4 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,0, 6,0 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,-2*k, 6,k1 + 6*k*k1 - 2*k2 - 6*k*k2 + 2*k3 - 2*k4 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,k1 - 2*k2 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,1, 6,k2 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,2*k, 6,2*k*k2 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,-2*k, 6,k1 + 2*k*k1 - 2*k*k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,2*k2 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,-1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,4*k, 6,2*(k*k1 + 2*k*k2) ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,0 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,2*k1 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n \nACPcpGroupDim4NrB8b := function (k, k1, k2, k3 , k4) \nlocal FTL;\n FTL := FromTheLeftCollector( 6 );\n SetRelativeOrder( FTL, 1, 2 );\n SetPower( FTL, 1, [3,1, 4,0, 5,0, 6,k3 ] );\n SetConjugate( FTL, 2, 1, [2, 1 , 3,1, 4,-1, 5,-1 - 4*k, 6,k1 + 2*k*k1 - 2*k*k2 + 2*k3 + k4 ] );\n SetConjugate( FTL, 3, 1, [3,1, 4,0, 5,0, 6,2*k3 ] );\n SetConjugate( FTL, 4, 1, [3,0, 4,-1, 5,-2*k, 6,-2*k*k2 ] );\n SetConjugate( FTL, 5, 1, [3,0, 4,0, 5,-1, 6,k1 ] );\n SetConjugate( FTL, 6, 1, [3,0, 4,0, 5,0, 6,-1 ] );\n SetRelativeOrder( FTL, 2, 2 );\n SetPower( FTL, 2, [3,0, 4,0, 5,1, 6,k2 ] );\n SetConjugate( FTL, 3, 2, [3,-1, 4,0, 5,2*k, 6,-k1 + 2*k*k1 + 2*k*k2 ] );\n SetConjugate( FTL, 4, 2, [3,0, 4,-1, 5,-2*k, 6,-2*k*k2 ] );\n SetConjugate( FTL, 5, 2, [3,0, 4,0, 5,1, 6,2*k2 ] );\n SetConjugate( FTL, 6, 2, [3,0, 4,0, 5,0, 6,-1 ] );\n SetConjugate( FTL, 4, 3, [4,1, 5,4*k, 6,-2*(k*k1 - 2*k*k2) ] );\n SetConjugate( FTL, 5, 3, [5,1, 6,-2*k1 ] );\n SetConjugate( FTL, 5, 4, [5,1, 6,0 ] );\nreturn PcpGroupByCollector(FTL);\nend;\n\n#############################################################################\n##\n## some small helpers\n##\nACPcpDim4Funcs := [ ACPcpGroupDim4Nr001, ACPcpGroupDim4Nr002,\nACPcpGroupDim4Nr003,\nACPcpGroupDim4Nr004, ACPcpGroupDim4Nr004b, ACPcpGroupDim4Nr005,\nACPcpGroupDim4Nr006, ACPcpGroupDim4Nr007, ACPcpGroupDim4Nr007b,\nACPcpGroupDim4Nr008, ACPcpGroupDim4Nr009, ACPcpGroupDim4Nr009b,\nACPcpGroupDim4Nr010, ACPcpGroupDim4Nr011, ACPcpGroupDim4Nr012,\nACPcpGroupDim4Nr013, ACPcpGroupDim4Nr014, ACPcpGroupDim4Nr014b,\nACPcpGroupDim4Nr015, ACPcpGroupDim4Nr018, ACPcpGroupDim4Nr019,\nACPcpGroupDim4Nr019b, ACPcpGroupDim4Nr019c, ACPcpGroupDim4Nr026,\nACPcpGroupDim4Nr027, ACPcpGroupDim4Nr029, ACPcpGroupDim4Nr029b,\nACPcpGroupDim4Nr029c, ACPcpGroupDim4Nr030, ACPcpGroupDim4Nr031,\nACPcpGroupDim4Nr032, ACPcpGroupDim4Nr033, ACPcpGroupDim4Nr033b,\nACPcpGroupDim4Nr033c, ACPcpGroupDim4Nr034, ACPcpGroupDim4Nr036,\nACPcpGroupDim4Nr037, ACPcpGroupDim4Nr041, ACPcpGroupDim4Nr043,\nACPcpGroupDim4Nr045, ACPcpGroupDim4Nr055, ACPcpGroupDim4Nr056,\nACPcpGroupDim4Nr058, ACPcpGroupDim4Nr060, ACPcpGroupDim4Nr061,\nACPcpGroupDim4Nr061b, ACPcpGroupDim4Nr061c, ACPcpGroupDim4Nr062,\nACPcpGroupDim4Nr075, ACPcpGroupDim4Nr076, ACPcpGroupDim4Nr077,\nACPcpGroupDim4Nr079, ACPcpGroupDim4Nr080, ACPcpGroupDim4Nr081,\nACPcpGroupDim4Nr082, ACPcpGroupDim4Nr083, ACPcpGroupDim4Nr084,\nACPcpGroupDim4Nr085, ACPcpGroupDim4Nr086, ACPcpGroupDim4Nr087,\nACPcpGroupDim4Nr088, ACPcpGroupDim4Nr103, ACPcpGroupDim4Nr104,\nACPcpGroupDim4Nr106, ACPcpGroupDim4Nr110, ACPcpGroupDim4Nr114,\nACPcpGroupDim4Nr143, ACPcpGroupDim4Nr144, ACPcpGroupDim4Nr146,\nACPcpGroupDim4Nr147, ACPcpGroupDim4Nr148, ACPcpGroupDim4Nr158,\nACPcpGroupDim4Nr159, ACPcpGroupDim4Nr161, ACPcpGroupDim4Nr168,\nACPcpGroupDim4Nr169, ACPcpGroupDim4Nr172, ACPcpGroupDim4Nr173,\nACPcpGroupDim4Nr174, ACPcpGroupDim4Nr175, ACPcpGroupDim4Nr176,\nACPcpGroupDim4Nr184, ACPcpGroupDim4NrB1, ACPcpGroupDim4NrB2,\nACPcpGroupDim4NrB3c, ACPcpGroupDim4NrB3b, ACPcpGroupDim4NrB3,\nACPcpGroupDim4NrB4, ACPcpGroupDim4NrB4b, ACPcpGroupDim4NrB5,\nACPcpGroupDim4NrB5b, ACPcpGroupDim4NrB7, ACPcpGroupDim4NrB7b,\nACPcpGroupDim4NrB8, ACPcpGroupDim4NrB8b ];\nMakeReadOnlyGlobal( \"ACPcpDim4Funcs\" );\n\n", "meta": {"hexsha": "f772c844d6925d5f7515a57b20ac51099d624570", "size": 85316, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "gap/pcpgrp4.gi", "max_stars_repo_name": "alex-konovalov/aclib", "max_stars_repo_head_hexsha": "d1afb020805bfd60a8bbb0a9a4adac77fe9b44f1", "max_stars_repo_licenses": ["Artistic-2.0"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "gap/pcpgrp4.gi", "max_issues_repo_name": "alex-konovalov/aclib", "max_issues_repo_head_hexsha": "d1afb020805bfd60a8bbb0a9a4adac77fe9b44f1", "max_issues_repo_licenses": ["Artistic-2.0"], "max_issues_count": 6, "max_issues_repo_issues_event_min_datetime": "2018-03-07T16:35:34.000Z", "max_issues_repo_issues_event_max_datetime": "2022-01-26T23:51:07.000Z", "max_forks_repo_path": "gap/pcpgrp4.gi", "max_forks_repo_name": "alex-konovalov/aclib", "max_forks_repo_head_hexsha": "d1afb020805bfd60a8bbb0a9a4adac77fe9b44f1", "max_forks_repo_licenses": ["Artistic-2.0"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2018-03-10T19:58:42.000Z", "max_forks_repo_forks_event_max_datetime": "2018-03-10T19:58:42.000Z", "avg_line_length": 44.343035343, "max_line_length": 110, "alphanum_fraction": 0.5146748558, "num_tokens": 52309, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.6825737214979745, "lm_q2_score": 0.3886180267058489, "lm_q1q2_score": 0.2652604527298105}}
{"text": "\nlocal reps,tori,labels,I,II,ords;\n\nmizuno:=[[1,2,3,4,5,6,7,\n 9,10,11,12,\n 13,14,16,17,\n 19,18,20,21,\n 23,24,25,27,\n 26,28,30,31,\n 32,33,35,34,\n 37,38,39,40,\n 41,44,45,46,\n 48,49,51,52,\n 53,55,57,58,\n 59,61,63,64,\n 66,69,70,71,\n 75,76,80,82,\n 85,89,93,97],\n [8,\n 15,22,29,36,\n 43,42,47,50,\n 54,56,60,62,\n 65,67,68,72,\n 73,74,77,78,\n 79,81,83,84,\n 86,87,88,90,\n 91,92,94,95,\n 96,98,99,100,\n 101,102,103,104,\n 105,106,107,108,\n 109,110,111,112,\n 114,113,115,116,\n 117,118,119,120]];\n\nreps:=[[[1,1],[2,1],[3,1],[4,1],[5,1],[6,1],[7,1],[8,1]],\n [[1,1],[2,1],[10,1],[11,1],[5,1],[6,1],[7,1],[8,1]],\n [[1,1],[3,1],[2,1],[10,1],[12,1],[13,1],[14,1],[8,1]],\n [[8,1],[18,1],[7,1],[6,1],[19,1],[1,1],[17,1],[4,1]],\n [[18,1],[6,1],[19,1],[1,1],[17,1],[21,1],[4,1],[8,1]],\n [[1,1],[2,1],[3,1],[4,1],[5,1],[6,1],[7,1]],\n [[8,1],[7,1],[14,1],[26,1],[19,1],[1,1],[17,1],[4,1]],\n [[18,1],[22,1],[19,1],[1,1],[17,1],[20,1],[21,1],[4,1],[6,1]],\n [[1,1],[2,1],[11,1],[10,1],[5,1],[6,1],[7,1]],\n [[18,1],[8,1],[31,1],[7,1],[33,1],[4,1],[19,1],[23,1]],\n [[8,1],[7,1],[6,1],[5,1],[4,1],[2,1],[3,1]],\n [[18,1],[31,1],[7,1],[33,1],[4,1],[29,1],[23,1],[19,1]],\n [[1,1],[2,1],[3,1],[10,1],[12,1],[13,1],[14,1]],\n [[1,1],[2,1],[3,1],[4,1],[5,1],[6,1],[8,1]],\n\n [[8,1],[7,1],[6,1],[5,1],[10,1],[11,-1],[2,1],[3,1]],\n [[31,1],[33,1],[18,1],[4,1],[39,-1],[41,1],[8,1],[19,1],[23,1]],\n [[17,1],[1,1],[19,1],[6,1],[7,1],[18,1],[4,1]],\n [[3,1],[5,1],[1,1],[6,1],[11,1],[12,1],[2,1],[8,1]],\n [[1,1],[3,1],[4,1],[5,1],[6,1],[7,1],[8,1]],\n [[8,1],[7,1],[13,1],[10,1],[11,-1],[12,1],[2,1],[3,1]],\n [[1,1],[2,1],[3,1],[4,1],[5,1],[6,1]],\n [[7,1],[6,1],[5,1],[4,1],[2,1],[3,1]],\n [[1,1],[3,1],[4,1],[2,1],[5,1],[7,1],[8,1]],\n [[3,1],[5,1],[1,1],[6,1],[11,1],[12,1],[2,1]],\n [[17,1],[1,1],[19,1],[14,1],[26,1],[7,1],[18,1],[4,1]],\n [[2,1],[4,1],[5,1],[6,1],[7,1],[8,1],[1,1]],\n [[7,1],[6,1],[5,1],[10,1],[11,-1],[2,1],[3,1]],\n [[2,1],[4,1],[5,1],[6,1],[7,1],[8,1]],\n [[47,1],[49,1],[5,1],[45,1],[44,1],[42,1],[27,1],[46,1]],\n\n [[1,1],[3,1],[4,1],[2,1],[5,1],[7,1]],\n [[24,1],[26,1],[7,1],[27,1],[23,1],[4,1],[25,1]],\n [[17,1],[1,1],[19,1],[6,1],[18,1],[4,1],[8,1]],\n [[7,1],[13,1],[10,1],[11,-1],[12,1],[2,1],[3,1]],\n [[1,1],[3,1],[10,1],[12,1],[2,1],[5,1],[7,1],[8,1]],\n [[2,1],[4,1],[5,1],[6,1],[7,1],[1,1]],\n [[1,1],[3,1],[4,1],[2,1],[6,1],[7,1],[8,1]],\n [[1,1],[3,1],[4,1],[2,1],[5,1]],\n [[17,1],[1,1],[19,1],[6,1],[18,1],[4,1]],\n [[3,1],[4,1],[2,1],[5,1],[7,1],[8,1]],\n [[5,1],[6,1],[7,1],[8,1],[1,1],[3,1],[2,1]],\n [[1,1],[3,1],[10,1],[12,1],[2,1],[5,1],[7,1]],\n [[1,1],[3,1],[4,1],[5,1],[6,1]],\n [[1,1],[3,1],[4,1],[2,1],[6,1],[7,1]],\n [[1,1],[3,1],[4,1],[2,1],[6,1],[8,1]],\n [[1,1],[3,1],[10,1],[12,1],[2,1],[5,1]],\n\n [[1,1],[3,1],[4,1],[6,1],[7,1],[8,1]],\n [[1,1],[3,1],[4,1],[2,1],[6,1]],\n [[3,1],[10,1],[12,1],[2,1],[5,1],[7,1],[8,1]],\n [[3,1],[4,1],[2,1],[5,1],[7,1]],\n [[5,1],[6,1],[7,1],[1,1],[3,1],[2,1]],\n [[1,1],[3,1],[4,1],[2,1]],\n [[3,1],[4,1],[2,1],[6,1],[7,1]],\n [[3,1],[10,1],[12,1],[2,1],[5,1],[7,1]],\n [[5,1],[6,1],[7,1],[2,1],[3,1]],\n [[1,1],[3,1],[5,1],[6,1],[2,1],[8,1]],\n [[3,1],[4,1],[2,1],[5,1]],\n [[3,1],[10,1],[12,1],[2,1],[5,1]],\n [[1,1],[3,1],[4,1],[6,1]],\n [[1,1],[3,1],[5,1],[6,1],[2,1]],\n [[1,1],[3,1],[5,1],[6,1]],\n [[1,1],[3,1],[2,1],[5,1],[7,1]],\n [[1,1],[3,1],[4,1]],\n [[2,1],[4,1],[1,1],[6,1]],\n [[1,1],[3,1],[2,1]],\n [[2,1],[3,1],[5,1],[7,1]],\n [[1,1],[3,1]],\n [[1,1],[4,1],[6,1]],\n [[1,1],[6,1]],\n [[1,1]]\n ];\n\n\nI:=[[],\n [4], #??? E_8(a_1)\n [4,6], #??? E_8(a_2)\n [2,3,5], # E_8(a_3)\n [2,3,5,7], # E_8(a_4)\n [],\n [2,3,5,6], # E_8(b_4)\n [2,3,5,6,8], # E_8(a_5)\n [4], # E_7(a_1)\n [1,2,3,5,6], # E_8(b_5)\n [],\n [1,2,3,5,6,8], # E_8(a_6)\n [4,6], #??? E_7(a_2)\n [],\n [4], # D_7(a_1)\n [1,2,3,5,6,7], # E_8(b_6)\n [2,3,5], # E_7(a_3)\n [4], # E_6(a_1)A_1\n [],\n [4,5], #??? D_7(a_2)\n \n [],[],[],\n [4], # E_6(a_1)\n [2,3,5,6], # E_7(a_4)\n [],\n [4],# D_6(a_1)\n [],\n [1,2,3,4,6,7,8], # E_8(a_7)\n [],\n [1,2,3,5,6],# E_7(a_5)\n [2,3,5],# E_6(a_3)A_1\n [4,5],#??? D_6(a_2)\n [4],# D_5(a_1)A_2 \n [],[],[],\n [2,3,5],# E_6(a_3)\n [],[],\n [4],# D_5(a_1)A_1 \n [],[],[],\n \n [4],# D_5(a_1) check this also\n [],[],\n [4],# D_4(a_1)A_2\n [],[],[],[],\n [4],# D_4(a_1)A_1\n [],[],[],\n [4],# D_4(a_1)\n [],[],[],[],[],[],[],[],[],[],[],[]\n ];\n\n\n#\n# The parabolic where the representative is distinguished\n#\nII:=[[1,2,3,4,5,6,7,8],\n [1,2,3,4,5,6,7,8],\n [1,2,3,4,5,6,7,8],\n [1,2,3,4,5,6,7,8],\n [1,2,3,4,5,6,7,8],\n [1,2,3,4,5,6,7],\n [1,2,3,4,5,6,7,8],\n [1,2,3,4,5,6,7,8],\n [1,2,3,4,5,6,7],\n [1,2,3,4,5,6,7,8],\n [2,3,4,5,6,7,8],\n [1,2,3,4,5,6,7,8],\n [1,2,3,4,5,6,7],\n [1,2,3,4,5,6,8],\n\n [2,3,4,5,6,7,8],\n [1,2,3,4,5,6,7,8],\n [1,2,3,4,5,6,7],\n [1,2,3,4,5,6,8],\n [1,3,4,5,6,7,8],\n [2,3,4,5,6,7,8],\n [1,2,3,4,5,6],\n [2,3,4,5,6,7],\n [1,2,3,4,5,7,8],\n [1,2,3,4,5,6],\n [1,2,3,4,5,6,7],\n [1,2,4,5,6,7,8],\n [2,3,4,5,6,7],\n [2,4,5,6,7,8],\n [1,2,3,4,5,6,7,8],\n\n [1,2,3,4,5,7],\n [1,2,3,4,5,6,7],\n [1,2,3,4,5,6,8],\n [2,3,4,5,6,7],\n [1,2,3,4,5,7,8],\n [1,2,4,5,6,7],\n [1,2,3,4,6,7,8],\n [1,2,3,4,5],\n [1,2,3,4,5,6],\n [2,3,4,5,7,8],\n [1,2,3,5,6,7,8],\n [1,2,3,4,5,7],\n [1,3,4,5,6],\n [1,2,3,4,6,7],\n [1,2,3,4,6,8],\n [1,2,3,4,5],\n\n [1,3,4,6,7,8],\n [1,2,3,4,6],\n [2,3,4,5,7,8],\n [2,3,4,5,7],\n [1,2,3,5,6,7],\n [1,2,3,4],\n [2,3,4,6,7],\n [2,3,4,5,7],\n [2,3,5,6,7],\n [1,2,3,5,6,8],\n [2,3,4,5],\n [2,3,4,5],\n [1,3,4,6],\n [1,2,3,5,6],\n [1,3,5,6],\n [1,2,3,5,7],\n [1,3,4],\n [1,2,4,6],\n [1,2,3],\n [2,3,5,7],\n [1,3],\n [1,4,6],\n [1,6],\n [1]\n ];\n \n\nlabels:=[\"E_8\",\"E_8(a_1)\",\"E_8(a_2)\",\"E_8(a_3)\",\"E_8(a_4)\",\"E_7\",\"E_8(b_4)\",\"E_8(a_5)\",\"E_7(a_1)\",\"E_8(b_5)\",\"D_7\",\"E_8(a_6)\",\"E_7(a_2)\",\"E_6A_1\",\n \"D_7(a_1)\",\"E_8(b_6)\",\"E_7(a_3)\",\"E_6(a_1)A_1\",\"A_7\",\"D_7(a_2)\",\"E_6\",\"D_6\",\"D_5A_2\",\"E_6(a_1)\",\"E_7(a_4)\",\"A_6A_1\",\"D_6(a_1)\",\"A_6\",\"E_8(a_7)\",\n \"D_5A_1\",\"E_7(a_5)\",\"E_6(a_3)A_1\",\"D_6(a_2)\",\"D_5(a_1)A_2\",\"A_5A_2\",\"A_4A_3\",\"D_5\",\"E_6(a_3)\",\"D_4A_2\",\"A_4A_2A_1\",\"D_5(a_1)A_1\",\"A_5\",\"A_4A_2\",\"A_4A_1^2\",\"D_5(a_1)\",\n \"A_3^2\",\"A_4A_1\",\"D_4(a_1)A_2\",\"D_4A_1\",\"A_3A_2A_1\",\"A_4\",\"A_3A_2\",\"D_4(a_1)A_1\",\"A_3A_1^2\",\"A_2^2A_1^2\",\"D_4\",\"D_4(a_1)\",\"A_3A_1\",\"A_2^2A_1\",\"A_2^2\",\"A_2A_1^3\",\"A_3\",\"A_2A_1^2\",\"A_2A_1\",\"A_1^4\",\"A_2\",\"A_1^3\",\"A_1^2\",\"A_1\"];\n\ntori:=[\n [2,2,2,2,2,2,2,2],\n [2,2,2,0,2,2,2,2],\n [2,2,2,0,2,0,2,2],\n [2,0,0,2,0,2,2,2],\n [2,0,0,2,0,2,0,2],\n [2,2,2,2,2,2,2,-27],\n [2,0,0,2,0,0,2,2],\n [2,0,0,2,0,0,2,0],\n [2,2,2,0,2,2,2,-21],\n [0,0,0,2,0,0,2,2],\n [-21,2,2,2,2,2,2,2],\n [0,0,0,2,0,0,2,0],\n [2,2,2,0,2,0,2,-17],\n [2,2,2,2,2,2,-17,2],\n\n [-16,2,0,2,2,2,2,2],\n [0,0,0,2,0,0,0,2],\n [2,0,0,2,0,2,2,-15],\n [2,2,2,0,2,2,-13,2],\n [2,-15,2,2,2,2,2,2],\n [-13,2,2,0,2,0,2,2],\n [2,2,2,2,2,2,-16,0],\n [-15,2,2,2,2,2,2,-10],\n [2,2,2,2,2,-12,2,2],\n [2,2,2,0,2,2,-12,0],\n [2,0,0,2,0,0,2,-11],\n [2,2,-11,2,2,2,2,2],\n [-11,2,2,0,2,2,2,-8],\n [0,2,-10,2,2,2,2,2],\n [0,0,0,0,2,0,0,0],\n\n [2,2,2,2,2,-11,2,-1],\n [0,0,0,2,0,0,2,-9],\n [2,0,0,2,0,2,-9,2],\n [-9,2,2,0,2,0,2,-6],\n [2,2,2,0,2,-9,2,2],\n [2,2,-9,2,2,2,2,-5],\n [2,2,2,2,-9,2,2,2],\n [2,2,2,2,2,-10,0,0],\n [2,0,0,2,0,2,-8,0],\n [-6,2,2,2,2,-8,2,2],\n [2,2,2,-7,2,2,2,2],\n [2,2,2,0,2,-8,2,-1],\n [2,-9,2,2,2,2,-5,0],\n [2,2,2,2,-8,2,2,-2],\n [2,2,2,2,-7,2,-2,2],\n [2,2,2,0,2,7,0,0],\n\n [2,-3,2,2,-6,2,2,2],\n [2,2,2,2,-7,2,-1,0],\n [-4,2,2,0,2,-6,2,2],\n [-6,2,2,2,2,-7,2,-1],\n [2,2,2,-6,2,2,2,-3],\n [2,2,2,2,-6,0,0,0],\n [-3,2,2,2,-6,2,2,-2],\n [-4,2,2,0,2,-5,2,-1],\n [-1,2,2,-5,2,2,2,-3],\n [2,2,2,-5,2,2,-3,2],\n [-6,2,2,2,2,-6,0,0],\n [-4,2,2,0,2,-4,0,0],\n [2,-3,2,2,-4,2,-1,0],\n [2,2,2,-5,2,2,-2,0],\n [2,0,2,-4,2,2,-2,0],\n [2,2,2,-4,2,-2,2,-1],\n [2,-3,2,2,-3,0,0,0],\n [2,2,-3,2,-3,2,-1,0],\n [2,2,2,-3,0,0,0,0],\n [-1,2,2,-3,2,-2,2,-1],\n [2,2,0,-2,0,0,0,0],\n [2,-1,-2,2,-2,2,-1,0],\n [2,0,-1,0,-1,2,-1,0],\n [2,0,-1,0,0,0,0,0]\n ];\n\n#ords:=[];\nords:=[ 125, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 5, 25, 25, 25, 25, 25, 25, 5, 25, 25, 25, 5, 25, 25, 5, 5, 25, 5, 5, 5, 25, 5, 5, 5, 5, 5, 5, 25, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5 ];\n\nreturn [reps,tori,labels,I,II,ords];\n", "meta": {"hexsha": "6a1fc0ad8c777b8b0a823c9eac1b261a4c730ba1", "size": 9174, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "lib/data/dataE8char5.gi", "max_stars_repo_name": "iuliansimion/Chevalley.gap", "max_stars_repo_head_hexsha": "dd237f36d69a42bcd6cb6a24c5e4bf7dfb3da186", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/data/dataE8char5.gi", "max_issues_repo_name": "iuliansimion/Chevalley.gap", "max_issues_repo_head_hexsha": "dd237f36d69a42bcd6cb6a24c5e4bf7dfb3da186", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/data/dataE8char5.gi", "max_forks_repo_name": "iuliansimion/Chevalley.gap", "max_forks_repo_head_hexsha": "dd237f36d69a42bcd6cb6a24c5e4bf7dfb3da186", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 28.4906832298, "max_line_length": 259, "alphanum_fraction": 0.3380204927, "num_tokens": 5634, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.6688802471698041, "lm_q2_score": 0.39606816627404173, "lm_q1q2_score": 0.2649221729534721}}
{"text": "#\n# cls 17: A_2\n#\nhandle17char2:=function()\n local tmp1,tmp2,o,info,rep,cent,uu;\n o:=AllClasses(orbs)[17];\n info:=infos[17];\n \n rep:=Representative(o);\n #pr[15]=[0,0,1,1,1,0]\n #pr[13]=[0,1,1,1,0,0]\n #pr[26]=[1,1,1,2,1,0]\n tmp1:=ApplyRootsReflections(rep,[15,13,26]);\n uu:=Unipotent(chevalleyAdj(rep),[[3,1]]);\n tmp1:=Conj(tmp1,uu);\n \n cent:=FromPositiveBorel(o,info[2]);\n tmp2:=ApplyRootsReflections(cent,[15,13,26]);\n uu:=Unipotent(chevalleyAdj(cent),[[3,1]]);\n tmp2:=Conj(tmp2,uu);\n\n return [tmp1,tmp2];\nend;\n\n\n#\n# cls 10: D_4(a_1)\n#\nhandle10char2:=function()\n local tmp1,tmp2,tmp3,tmp4,o,info,rep,cent,uu;\n o:=AllClasses(orbs)[10];\n info:=infos[10];\n \n rep:=Representative(o);\n #pr[4] =[0,0,0,1,0,0]\n #pr[32]=[1,1,2,2,1,1]\n #pr[33]=[1,1,1,2,2,1]\n tmp1:=ApplyRootsReflections(rep,[4,32,33]);\n uu:=Unipotent(chevalleyAdj(rep),[[3,-1],[5,1]]);\n tmp1:=Conj(tmp1,uu);\n tmp1:=ConjugateByTori(tmp1,[4,1,2,6],[-1,-1,-1,-1]);\n\n #pr[20]=[0,1,0,1,1,1]\n #pr[21]=[0,0,1,1,1,1]\n tmp3:=ApplyRootsReflections(rep,[20,21]);\n uu:=Unipotent(chevalleyAdj(rep),[[3,1],[4,1],[5,-1],[9,1],[10,-1]]);\n tmp3:=Conj(tmp3,uu);\n tmp3:=ConjugateByTori(tmp3,[2,4],[-1,-1,-1,-1]);\n \n \n cent:=FromPositiveBorel(o,info[2]);\n tmp2:=ApplyRootsReflections(cent,[4,32,33]);\n uu:=Unipotent(chevalleyAdj(cent),[[3,-1],[5,1]]);\n tmp2:=Conj(tmp2,uu);\n tmp2:=ConjugateByTori(tmp2,[4,1,2,6],[-1,-1,-1,-1]);\n\n tmp4:=ApplyRootsReflections(cent,[20,21]);\n uu:=Unipotent(chevalleyAdj(cent),[[3,1],[4,1],[5,-1],[9,1],[10,-1]]);\n tmp4:=Conj(tmp4,uu);\n tmp4:=ConjugateByTori(tmp4,[2,4],[-1,-1,-1,-1]);\n \n return [tmp1,tmp3,tmp2,tmp4];\nend;\n\n\n#\n# cls 4: E_6(a_3) for [1,8,9,11,14,19]\n#\nhandle4char2:=function()\n local tmp1,tmp2,o,info,rep,cent,uu;\n o:=AllClasses(orbs)[4];\n info:=infos[4];\n \n rep:=Representative(o);\n tmp1:=ConjNegUa(rep,3,1);\n tmp1:=ConjNegUa(tmp1,2,1);\n uu:=Unipotent(chevalleyAdj(rep),[[5,1],[6,1],[7,1],[8,1],[13,1],[14,1],[19,1],[20,1],[25,1]],Ordering(rep));\n tmp1:=Conj(tmp1,uu);\n \n \n cent:=FromPositiveBorel(o,info[2]);\n tmp2:=ConjNegUa(cent,3,1);\n tmp2:=ConjNegUa(tmp2,2,1);\n uu:=Unipotent(chevalleyAdj(cent),[[5,1],[6,1],[7,1],[8,1],[13,1],[14,1],[19,1],[20,1],[25,1]],Ordering(cent));\n tmp2:=Conj(tmp2,uu);\n \n return [tmp1,tmp2];\nend;\n#\n# THIS IS FOR THE E_6(a_3) class of E_6 in char 2\n#\n#vals:=ShallowCopy(avars);\n#vals[3]:=0;\n#vals[2]:=0;\n#vals[9]:=vals[1];\n#vals[5]:=One(APR);\n#vals[4]:=0;\n#vals[7]:=vals[1]+One(APR);\n#vals[6]:=vals[1]+One(APR);\n#vals[8]:=One(APR);\n#vals[13]:=vals[7];\n#vals[14]:=vals[1]+One(APR);\n#vals[15]:=0;\n#vals[11]:=vals[1];\n#vals[18]:=vals[1]^2+vals[1]+vals[16];\n#vals[19]:=One(APR);\n#vals[20]:=vals[1]^2+vals[12]+One(APR);\n#vals[21]:=vals[12];\n#vals[22]:=vals[12];\n#vals[24]:=vals[1]*vals[10]+vals[1]+vals[10]+vals[12]+vals[18];\n#vals[25]:=vals[1]^2+vals[17]+One(APR);\n#vals[27]:=vals[17];\n#vals[28]:=vals[1]^2+vals[1]+vals[12]+vals[23];\n#vals[29]:=vals[23];\n#vals[31]:=vals[1]^2*vals[10]+vals[1]^2+vals[1]*vals[12]+vals[10]+vals[16]+vals[23]+vals[26];\n#vals[33]:=vals[1]^4+vals[1]^3+vals[1]^2*vals[16]+vals[1]^2+vals[1]*vals[12]+vals[12]^2+vals[1]+vals[16]+vals[23]+vals[26];\n#vals[34]:=vals[1]^4+vals[1]^3+vals[1]^2*vals[16]+vals[1]^2+vals[12]^2+vals[12]*vals[17]+vals[1]+vals[16]+vals[30]+vals[32];\n#\n#vv:=Value(generic,avars,vals);\n#vvv:=Value(vv,[avars[1],avars[10],avars[12],avars[16],avars[17],avars[23],avars[26],avars[30],avars[32],avars[35],avars[36]],[0,0,0,0,0,0,0,0,0,0,0]);\n\n\n", "meta": {"hexsha": "423ea495046c185b6c9c56ca0d1c0c6edc96ba46", "size": 3597, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "lib/components/E6char2.gi", "max_stars_repo_name": "iuliansimion/Chevalley.gap", "max_stars_repo_head_hexsha": "dd237f36d69a42bcd6cb6a24c5e4bf7dfb3da186", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "lib/components/E6char2.gi", "max_issues_repo_name": "iuliansimion/Chevalley.gap", "max_issues_repo_head_hexsha": "dd237f36d69a42bcd6cb6a24c5e4bf7dfb3da186", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "lib/components/E6char2.gi", "max_forks_repo_name": "iuliansimion/Chevalley.gap", "max_forks_repo_head_hexsha": "dd237f36d69a42bcd6cb6a24c5e4bf7dfb3da186", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 29.243902439, "max_line_length": 151, "alphanum_fraction": 0.580205727, "num_tokens": 1618, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.5813030906443134, "lm_q2_score": 0.4378234991142019, "lm_q1q2_score": 0.2545081531917934}}
|