{"text": "\n# Copyright (c) 2018-2021, Carnegie Mellon University\n# See LICENSE for details\n\n\n#IsDigit := c -> c in \"0123456789\";\n#var.prefix := meth( self )\n# local p;\n# p := FirstPosition(self.id,IsDigit);\n# p := SplitAt(self.id,When(p>0,p-1,0))[1];\n# Constraint(p <> \"\");\n# return p;\n#end;\n\nClass(VarGenBase, rec(\n __call__ := self >> WithBases(self, rec(counter:=rec(), pfx := \"\")),\n\n suffix := n -> StringInt(n),\n\n reset := meth(self) self.counter := rec(); end,\n\n nextu := (self, t) >> When(self.pfx=\"\", self.next(t, \"u\"), self.next(t, \"\")),\n\n next := meth(self, t, pfx)\n local p;\n\tConstraint(IsString(pfx)); Constraint(IsType(t));\n\tpfx := Concat(self.pfx, pfx);\n\tif not IsBound(self.counter.(pfx)) then \n # first will be plain \"pfx\", then \"pfx2\" \n\t p := self.var(t, pfx); \n\t self.counter.(pfx) := 2;\n\telse\n\t p := self.var(t, Concat(pfx, self.suffix(self.counter.(pfx))));\n\t self.counter.(pfx) := self.counter.(pfx) + 1;\n\tfi;\n\treturn p;\n end,\n\n nextName := (self, pfx) >> self.next(TInt, pfx).id,\n \n var := (t, pfx) -> Error(\"must be implemented in subclasses\"),\n\n # creates a cloned generator with aliased .counter, and an extra prefix\n # that will be added to all params created with .next()\n withPrefix := (self, pfx) >> When(\n pfx=\"i\",\n Error(\"i prefix is RESERVED for loop variables!\"),\n WithBases(self, rec(pfx := Concat(self.pfx, pfx))))\n));\n\n\nClass(VarGenNumeric, VarGenBase, rec(\n var := (t, name) -> var(name, t)\n));\n\n\nClass(VarGenSymbolic, VarGenBase, rec(\n var := (t, name) -> var(name, t),\n suffix := VarNameInt\n));\n\n\nClass(ParamGenNumeric, VarGenBase, rec(\n var := (t, name) -> param(t, name)\n));\n\n\nClass(ParamGenSymbolic, VarGenBase, rec(\n var := (t, name) -> param(t, name),\n suffix := VarNameInt\n));\n\n\nClass(NewInt,rec(\n\t__call__ := meth(self)\n\t self.n := self.n + 1;\n\t return self.n;\n\tend,\n\n\tn := 0,\n));\n\n\nClass(VarMapper, rec(\n __call__ := (self, vargen) >> WithBases(self, rec(\n\t sn := NewInt(),\n\t bindings := tab(),\n\t vargen := vargen)),\n\n reset := meth(self)\n\tself.vargen.reset();\n\tself.bindings := tab();\n\tself.sn := NewInt();\n end,\n\n ignore := (self, var) >> false,\n\n alreadyMapped := (self,var) >> IsBound(var.sn) and var.sn = self.sn,\n\n map := meth(self, var) \n local newvar;\n\tif self.ignore(var) or (IsBound(var.NoReMap) and var.NoReMap) or self.alreadyMapped(var) then\n\t return var;\n\tfi;\n if IsBound(self.bindings.(var.id)) then \n\t return self.bindings.(var.id);\n\telse\n\t newvar := self.vargen.next(var.t, var.id{[1]});\n\t newvar.sn := self.sn;\n\t self.bindings.(var.id):=newvar;\n\t return newvar;\n\tfi;\n end\n));\n\nProperName := function(o)\n o.properName := true;\n return o;\nend;\n\n_RemapVars := function(c, ignore_list, varGen )\n local vmapper;\n vmapper := CopyFields(VarMapper(varGen), \n rec(ignore := (self, var) >> IsBound(var.properName) and var.properName=true\n or var.id in ignore_list));\n return SubstTopDownRules(c, [\n\t [var,v->vmapper.map(v)],\n\t [decl,d->decl(List(d.vars,v->vmapper.map(v)),d.cmd)],\n\t [data,d->data(vmapper.map(d.var),d.value,d.cmd)] ]);\nend;\n\nRemapVars := c -> _RemapVars(c, [\"X\", \"Y\"], VarGenNumeric);\n\nRemapVarsIgnore := (c, ignore_list) -> _RemapVars(c, Concatenation([\"X\", \"Y\"], ignore_list));\n\nRemapVarsSafe := function(c, ignore_list)\n local free, args, init;\n free := c.free();\n args := Set(ConcatList( Collect(c, @(1, [func])), x->x.params));\n init := Collect(c, @(1, [var,param], x->IsBound(x.value) or IsBound(x.init))); # .value and .init: this is a hack!\n return _RemapVars(c, List(free::args, x->x.id) :: init :: ignore_list, ParamGenSymbolic());\nend;\n\n\nClass(RemoveUnusedVars,rec(__call__:=function(code)\n local usedvars,declvars,unusedvars;\n \n usedvars := Set(Flat([\n\t\t \tCollect(code,var)\t# all used vars in operands of assign-cmds\n\t\t]));\n\n declvars := Set(Flat([\n## \t\t\t X, Y, # implicitly they are arguments of DFT kernel\n\t\t\t List(Collect(code,decl),d->d.vars)\n\t\t]));\n\n unusedvars := declvars;\n SubtractSet(unusedvars,usedvars);\n\n # remove unused vars\n\tcode := SubstTopDown(code,decl,d->decl(Difference(d.vars, unusedvars),d.cmd));\n\n return code;\nend));\n\n## # Maybe, it would be usefull to add someting else to remove unused loops, data...\n## Class(RemoveUnused...,rec(__call__:=function(code)\n## local usedvars,declvars,unusedvars,v;\n## declvars := Set(Flat([\n## \t\t\t List(Collect(code,data),d->d.var),\n## \t\t\t List(Collect(code,loop),l->l.var)\n## \t\t]));\n## unusedvars := declvars;\n## SubtractSet(unusedvars,usedvars);\n## \n##\t\t\t# NOTE: prefixes for data and loop var-names?\n## for v in unusedvars do\n## if v.id[1] = 'D' then\n## code := SubstTopDown(code,data,d->Cond(d.var=v,d.cmd,d));\n## elif v.id[1] = 'i' then\n## code := SubstTopDown(code,loop,d->Cond(d.var=v,d.cmd,d));\n## else # decls\n## code := SubstTopDown(code,decl,d->decl(RemoveList(d.vars,v),d.cmd));\n## fi;\n## od;\n", "meta": {"hexsha": "5fdb14ab590596ac89ba091c2ebb7e157dfe81de", "size": 5126, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "namespaces/spiral/code/gen.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/code/gen.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/code/gen.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": 27.5591397849, "max_line_length": 118, "alphanum_fraction": 0.5926648459, "num_tokens": 1531, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. NO\n2. NO", "lm_q1_score": 0.4416730056646256, "lm_q2_score": 0.09670578743859412, "lm_q1q2_score": 0.04271233580316826}}
{"text": "for i in [1 .. 11] do\n if RemInt(i, 5) = 0 then\n Print(i, \"\\n\");\n continue;\n fi;\n Print(i, \", \");\nod;\n\n# 1, 2, 3, 4, 5\n# 6, 7, 8, 9, 10\n", "meta": {"hexsha": "294de024abea5510e3f64f558db15857dad1ceb0", "size": 159, "ext": "gap", "lang": "GAP", "max_stars_repo_path": "Task/Loops-Continue/GAP/loops-continue.gap", "max_stars_repo_name": "LaudateCorpus1/RosettaCodeData", "max_stars_repo_head_hexsha": "9ad63ea473a958506c041077f1d810c0c7c8c18d", "max_stars_repo_licenses": ["Info-ZIP"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2018-11-09T22:08:38.000Z", "max_stars_repo_stars_event_max_datetime": "2018-11-09T22:08:38.000Z", "max_issues_repo_path": "Task/Loops-Continue/GAP/loops-continue.gap", "max_issues_repo_name": "seanwallawalla-forks/RosettaCodeData", "max_issues_repo_head_hexsha": "9ad63ea473a958506c041077f1d810c0c7c8c18d", "max_issues_repo_licenses": ["Info-ZIP"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Task/Loops-Continue/GAP/loops-continue.gap", "max_forks_repo_name": "seanwallawalla-forks/RosettaCodeData", "max_forks_repo_head_hexsha": "9ad63ea473a958506c041077f1d810c0c7c8c18d", "max_forks_repo_licenses": ["Info-ZIP"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2018-11-09T22:08:40.000Z", "max_forks_repo_forks_event_max_datetime": "2018-11-09T22:08:40.000Z", "avg_line_length": 14.4545454545, "max_line_length": 28, "alphanum_fraction": 0.3899371069, "num_tokens": 78, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. NO\n2. NO\n\n", "lm_q1_score": 0.47657965106367595, "lm_q2_score": 0.08509905080783367, "lm_q1q2_score": 0.0405564759398474}}
{"text": "n := 10;\nfor i in [1 .. n] do\n Print(i);\n if i < n then\n Print(\", \");\n else\n Print(\"\\n\");\n fi;\nod;\n", "meta": {"hexsha": "77f07835566e7b07d811265e8c8a74402df3f373", "size": 125, "ext": "gap", "lang": "GAP", "max_stars_repo_path": "Task/Loops-N-plus-one-half/GAP/loops-n-plus-one-half.gap", "max_stars_repo_name": "LaudateCorpus1/RosettaCodeData", "max_stars_repo_head_hexsha": "9ad63ea473a958506c041077f1d810c0c7c8c18d", "max_stars_repo_licenses": ["Info-ZIP"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2018-11-09T22:08:38.000Z", "max_stars_repo_stars_event_max_datetime": "2018-11-09T22:08:38.000Z", "max_issues_repo_path": "Task/Loops-N-plus-one-half/GAP/loops-n-plus-one-half.gap", "max_issues_repo_name": "seanwallawalla-forks/RosettaCodeData", "max_issues_repo_head_hexsha": "9ad63ea473a958506c041077f1d810c0c7c8c18d", "max_issues_repo_licenses": ["Info-ZIP"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Task/Loops-N-plus-one-half/GAP/loops-n-plus-one-half.gap", "max_forks_repo_name": "seanwallawalla-forks/RosettaCodeData", "max_forks_repo_head_hexsha": "9ad63ea473a958506c041077f1d810c0c7c8c18d", "max_forks_repo_licenses": ["Info-ZIP"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2018-11-09T22:08:40.000Z", "max_forks_repo_forks_event_max_datetime": "2018-11-09T22:08:40.000Z", "avg_line_length": 12.5, "max_line_length": 20, "alphanum_fraction": 0.368, "num_tokens": 43, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. NO\n2. NO", "lm_q1_score": 0.3886180267058489, "lm_q2_score": 0.10230470310290449, "lm_q1q2_score": 0.03975745184257848}}
{"text": "# See section 7.5 of reference manual\n\n# GAP has assertions levels. An assertion is tested if its level\n# is less then the global level.\n\n# Set global level\nSetAssertionLevel(10);\n\na := 1;\nAssert(20, a > 1, \"a should be greater than one\");\n# nothing happens\n\na := 1;\nAssert(4, a > 1, \"a should be greater than one\");\n# error\n\n# Show current global level\nAssertionLevel();\n# 10\n", "meta": {"hexsha": "c2f2a6a54cbcad09da2356d9df05086aec1c34fe", "size": 377, "ext": "gap", "lang": "GAP", "max_stars_repo_path": "Task/Assertions/GAP/assertions.gap", "max_stars_repo_name": "LaudateCorpus1/RosettaCodeData", "max_stars_repo_head_hexsha": "9ad63ea473a958506c041077f1d810c0c7c8c18d", "max_stars_repo_licenses": ["Info-ZIP"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2018-11-09T22:08:38.000Z", "max_stars_repo_stars_event_max_datetime": "2018-11-09T22:08:38.000Z", "max_issues_repo_path": "Task/Assertions/GAP/assertions.gap", "max_issues_repo_name": "seanwallawalla-forks/RosettaCodeData", "max_issues_repo_head_hexsha": "9ad63ea473a958506c041077f1d810c0c7c8c18d", "max_issues_repo_licenses": ["Info-ZIP"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Task/Assertions/GAP/assertions.gap", "max_forks_repo_name": "seanwallawalla-forks/RosettaCodeData", "max_forks_repo_head_hexsha": "9ad63ea473a958506c041077f1d810c0c7c8c18d", "max_forks_repo_licenses": ["Info-ZIP"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2018-11-09T22:08:40.000Z", "max_forks_repo_forks_event_max_datetime": "2018-11-09T22:08:40.000Z", "avg_line_length": 18.85, "max_line_length": 64, "alphanum_fraction": 0.6976127321, "num_tokens": 108, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. NO\n2. NO\n\n", "lm_q1_score": 0.3629692055196168, "lm_q2_score": 0.10521053810590077, "lm_q1q2_score": 0.03818818542859017}}
{"text": "#############################################################################\n####\n##\n#A anusp.gi ANUPQ package Eamonn O'Brien\n#A Alice Niemeyer \n##\n#Y Copyright 1993-2001, Lehrstuhl D fuer Mathematik, RWTH Aachen, Germany\n#Y Copyright 1993-2001, School of Mathematical Sciences, ANU, Australia\n##\n\n#############################################################################\n##\n#F ANUPQSPerror( ) . . . . . . . . . . . . report illegal parameter\n##\nInstallGlobalFunction( ANUPQSPerror, function( param )\n Error(\n \"Valid Options:\\n\",\n \" \\\"ClassBound\\\", \\n\",\n \" \\\"PcgsAutomorphisms\\\"\\n\",\n \" \\\"Exponent\\\", \\n\",\n \" \\\"Metabelian\\\"\\n\",\n \" \\\"OutputLevel\\\", \\n\",\n \" \\\"SetupFile\\\", \\n\",\n \"Illegal Parameter: \\\"\", param, \"\\\"\" );\nend );\n\n#############################################################################\n##\n#F ANUPQSPextractArgs( ) . . . . . . . . . . . . parse argument list\n##\nInstallGlobalFunction( ANUPQSPextractArgs, function( args )\n local CR, i, act, G, match;\n\n # allow to give only a prefix\n match := function( g, w )\n \treturn 1 < Length(g) and \n Length(g) <= Length(w) and \n w{[1..Length(g)]} = g;\n end;\n\n # extract arguments\n G := args[2];\n CR := rec( group := G );\n i := 3;\n while i <= Length(args) do\n act := args[i];\n\n # \"ClassBound\", \n if match( act, \"ClassBound\" ) then\n i := i + 1;\n CR.ClassBound := args[i];\n if CR.ClassBound <= PClassPGroup(G) then\n Error( \"\\\"ClassBound\\\" must be at least \", PClassPGroup(G)+1 );\n fi;\n\n # \"PcgsAutomorphisms\"\n elif match( act, \"PcgsAutomorphisms\" ) then\n CR.PcgsAutomorphisms := true;\n\n #this may be available later\n # \"SpaceEfficient\"\n #elif match( act, \"SpaceEfficient\" ) then\n # CR.SpaceEfficient := true;\n\n # \"Exponent\", \n elif match( act, \"Exponent\" ) then\n i := i + 1;\n CR.Exponent := args[i];\n\n # \"Metabelian\"\n elif match( act, \"Metabelian\" ) then\n CR.Metabelian := true;\n\n # \"Verbose\"\n elif match( act, \"Verbose\" ) then\n CR.Verbose := true;\n\n # \"SetupFile\", \n elif match( act, \"SetupFile\" ) then\n i := i + 1;\n CR.SetupFile := args[i];\n\n \t# \"TmpDir\", \n \telif match( act, \"TmpDir\" ) then\n \t i := i + 1;\n \t CR.TmpDir := args[i];\n\n # \"Output\", \n elif match( act, \"OutputLevel\" ) then\n i := i + 1;\n CR.OutputLevel := args[i];\n CR.Verbose := true;\n\n # signal an error\n else\n ANUPQSPerror(act);\n fi;\n i := i + 1;\n od;\n return CR;\n\nend );\n\n#############################################################################\n##\n#F PqFpGroupPcGroup( ) . . . . . . corresponding fp group of a pc group\n##\nInstallGlobalFunction( PqFpGroupPcGroup, \n G -> Image( IsomorphismFpGroup( G ) )\n);\n\n#############################################################################\n##\n#M FpGroupPcGroup( ) . . . . . . . corresponding fp group of a pc group\n##\nInstallMethod( FpGroupPcGroup, \"pc group\", [IsPcGroup], 0, PqFpGroupPcGroup );\n\n#############################################################################\n##\n#F PQ_EPIMORPHISM_STANDARD_PRESENTATION( ) . (epi. onto) SP for group\n##\nInstallGlobalFunction( PQ_EPIMORPHISM_STANDARD_PRESENTATION, \nfunction( args )\n local datarec, rank, Q, Qclass, automorphisms, generators, x,\n images, i, r, j, aut, result, desc, k;\n\n datarec := ANUPQ_ARG_CHK(\"StandardPresentation\", args);\n\n if datarec.calltype = \"interactive\" and IsBound(datarec.SPepi) then\n # Note: the `pq' binary seg-faults if called twice to \n # calculate the standard presentation of a group\n return datarec.SPepi;\n fi;\n\n if VALUE_PQ_OPTION(\"pQuotient\") = fail and\n VALUE_PQ_OPTION(\"Prime\", datarec) <> fail then\n # Ensure a saved value of `Prime' has precedence\n # over a saved value of `pQuotient'.\n Unbind(datarec.pQuotient);\n fi;\n\n if VALUE_PQ_OPTION(\"pQuotient\", datarec) <> fail then\n PQ_AUT_GROUP( datarec.pQuotient );\n datarec.Prime := PrimePGroup( datarec.pQuotient );\n elif VALUE_PQ_OPTION(\"Prime\", datarec) <> fail then\n rank := Number( List( AbelianInvariants(datarec.group), \n x -> Gcd(x, datarec.Prime) ),\n y -> y = datarec.Prime );\n\n # construct free group with generators\n Q := FreeGroup( IsSyllableWordsFamily, rank, \"q\" );\n \n # construct power-relation\n Q := Q / List( GeneratorsOfGroup(Q), x -> x^datarec.Prime );\n \n # construct pc group\n Q := PcGroupFpGroup(Q);\n \n # construct automorphism\n automorphisms := [];\n generators := GeneratorsOfGroup(Q);\n for x in GeneratorsOfGroup( GL(rank, datarec.Prime) ) do\n images := [];\n for i in [ 1 .. rank ] do\n r := One(Q);\n for j in [ 1 .. rank ] do\n r := r * generators[j]^Int(x[i][j]);\n od;\n images[i] := r;\n od;\n aut := GroupHomomorphismByImages( Q, Q, generators, images );\n SetIsBijective( aut, true );\n Add( automorphisms, aut );\n od;\n SetAutomorphismGroup( Q, GroupByGenerators( automorphisms ) );\n datarec.pQuotient := Q;\n fi;\n \n #PushOptions(rec(nonuser := true));\n Qclass := PClassPGroup( datarec.pQuotient );\n if VALUE_PQ_OPTION(\"ClassBound\", 63) <= Qclass then\n Error( \"option `ClassBound' must be greater than `pQuotient' class (\",\n Qclass, \")\\n\" );\n fi;\n PQ_PC_PRESENTATION(datarec, \"SP\" : ClassBound := Qclass);\n\n PQ_SP_STANDARD_PRESENTATION(datarec);\n\n PQ_SP_ISOMORPHISM(datarec);\n\n if datarec.calltype = \"non-interactive\" then\n PQ_COMPLETE_NONINTERACTIVE_FUNC_CALL(datarec);\n if IsBound( datarec.setupfile ) then\n #PopOptions();\n return true;\n fi;\n fi;\n\n # try to read output\n result := ANUPQReadOutput( ANUPQData.SPimages );\n\n if not IsBound(result.ANUPQmagic) then\n Error(\"something wrong with `pq' binary. Please check installation\\n\");\n fi;\n\n desc := rec();\n result.ANUPQgroups[Length(result.ANUPQgroups)](desc);\n# if result.ANUPQautos <> fail and \n# Length( result.ANUPQautos ) = Length( result.ANUPQgroups ) then\n# \tresult.ANUPQautos[ Length(result.ANUPQgroups) ]( desc.group );\n# fi;\n\n # revise images to correspond to images of user-supplied generators \n datarec.SP := desc.group;\n x := Length( desc.map );\n k := Length( GeneratorsOfGroup( datarec.group ) );\n # images of user supplied generators are last k entries in .pqImages \n\n datarec.SPepi := GroupHomomorphismByImagesNC( \n datarec.group, \n datarec.SP, \n GeneratorsOfGroup(datarec.group),\n desc.map{[x - k + 1..x]} );\n #PopOptions();\n return datarec.SPepi;\nend );\n\n#############################################################################\n##\n#F EpimorphismPqStandardPresentation( ) . . . epi. onto SP for p-group\n##\nInstallGlobalFunction( EpimorphismPqStandardPresentation, function( arg )\n return PQ_EPIMORPHISM_STANDARD_PRESENTATION( arg );\nend );\n\n#############################################################################\n##\n#F PqStandardPresentation( : ) . . . . . . . SP for p-group\n##\nInstallGlobalFunction( PqStandardPresentation, function( arg )\n local SPepi;\n\n SPepi := PQ_EPIMORPHISM_STANDARD_PRESENTATION( arg );\n if SPepi = true then\n return true; # the SetupFile case\n fi;\n return Range( SPepi );\nend );\n\n#############################################################################\n##\n#M EpimorphismStandardPresentation( ) . . . . . epi. onto SP for p-group\n#M EpimorphismStandardPresentation( [] )\n##\nInstallMethod( EpimorphismStandardPresentation, \n \"fp group\", [IsFpGroup], 0,\n EpimorphismPqStandardPresentation );\n\nInstallMethod( EpimorphismStandardPresentation, \n \"pc group\", [IsPcGroup], 0,\n EpimorphismPqStandardPresentation );\n\nInstallMethod( EpimorphismStandardPresentation, \n \"positive integer\", [IsPosInt], 0,\n EpimorphismPqStandardPresentation );\n\nInstallOtherMethod( EpimorphismStandardPresentation,\n \"\", [], 0,\n EpimorphismPqStandardPresentation );\n\n#############################################################################\n##\n#M StandardPresentation( ) . . . . . . . . . . . . . . . SP for p-group\n#M StandardPresentation( [] )\n##\nInstallMethod( StandardPresentation, \n \"fp group\", [IsFpGroup], 0,\n PqStandardPresentation );\n\nInstallMethod( StandardPresentation, \n \"pc group\", [IsPcGroup], 0,\n PqStandardPresentation );\n\nInstallMethod( StandardPresentation, \n \"positive integer\", [IsPosInt], 0,\n PqStandardPresentation );\n\nInstallOtherMethod( StandardPresentation,\n \"\", [], 0,\n PqStandardPresentation );\n\n#############################################################################\n##\n#F IsPqIsomorphicPGroup( , ) . . . . . . . . . . . isomorphism test\n##\nInstallGlobalFunction( IsPqIsomorphicPGroup, function( G, H )\n local p, class, SG, SH, Ggens, Hgens;\n \n # and must both be pc groups and p-groups\n if not IsPcGroup(G) then\n Error( \" must be a pc group\" );\n fi;\n if not IsPcGroup(H) then\n Error( \" must be a pc group\" );\n fi;\n if Size(G) <> Size(H) then\n return false;\n fi;\n p := SmallestRootInt(Size(G));\n if not IsPrimeInt(p) then\n Error( \" must be a p-group\" );\n fi;\n \n # check the Frattini factor\n if RankPGroup(G) <> RankPGroup(H) then\n return false;\n fi;\n\n # check the exponent-p length and the sizes of the groups in the\n # p-central series of both groups \n if List(PCentralSeries(G,p), Size) <> List(PCentralSeries(H,p), Size) then\n return false;\n fi;\n\n # if the groups are elementary abelian they are isomorphic\n class := PClassPGroup(G);\n if class = 1 then\n return true;\n fi;\n \n # compute a standard presentation for both\n SG := PqStandardPresentation(PqFpGroupPcGroup(G)\n : Prime := p, ClassBound := class);\n SH := PqStandardPresentation(PqFpGroupPcGroup(H)\n : Prime := p, ClassBound := class);\n \n # the groups are equal if the presentation are equal\n Ggens := GeneratorsOfGroup( FreeGroupOfFpGroup( SG ) );\n Hgens := GeneratorsOfGroup( FreeGroupOfFpGroup( SH ) );\n return RelatorsOfFpGroup(SG)\n = List( RelatorsOfFpGroup(SH), \n x -> MappedWord( x, Hgens, Ggens ) );\n \nend );\n\n#############################################################################\n##\n#M IsIsomorphicPGroup( , )\n##\nInstallMethod( IsIsomorphicPGroup, \"pc group, pc group\",\n [IsPcGroup, IsPcGroup], 0,\n IsPqIsomorphicPGroup );\n\n#E anusp.gi . . . . . . . . . . . . . . . . . . . . . . . . . . . ends here\n", "meta": {"hexsha": "d05fc54d8a21ceed427978fd8a8b7887634e6090", "size": 11719, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "lib/anusp.gi", "max_stars_repo_name": "gap-system/anupq", "max_stars_repo_head_hexsha": "075d27ffe985d561f377a253563605ffea726448", "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": "lib/anusp.gi", "max_issues_repo_name": "gap-system/anupq", "max_issues_repo_head_hexsha": "075d27ffe985d561f377a253563605ffea726448", "max_issues_repo_licenses": ["Artistic-2.0"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2015-03-04T12:41:28.000Z", "max_issues_repo_issues_event_max_datetime": "2015-09-27T22:17:27.000Z", "max_forks_repo_path": "lib/anusp.gi", "max_forks_repo_name": "gap-system/anupq", "max_forks_repo_head_hexsha": "075d27ffe985d561f377a253563605ffea726448", "max_forks_repo_licenses": ["Artistic-2.0"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 33.0112676056, "max_line_length": 79, "alphanum_fraction": 0.5184742725, "num_tokens": 3045, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. NO\n2. NO", "lm_q1_score": 0.49218813572079556, "lm_q2_score": 0.0747700506393715, "lm_q1q2_score": 0.03680093183194174}}
{"text": "\nmyvar := 5;\nmycode := function (x)\n\t return 2*x;\n end;\n", "meta": {"hexsha": "39ea6ce7f0b6b6260ff52d07513eff739e5d2295", "size": 59, "ext": "gap", "lang": "GAP", "max_stars_repo_path": "example/mycode.gap", "max_stars_repo_name": "jorants/gap-loader", "max_stars_repo_head_hexsha": "975d76618bd69a0026460de6040748a28266f12b", "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": "example/mycode.gap", "max_issues_repo_name": "jorants/gap-loader", "max_issues_repo_head_hexsha": "975d76618bd69a0026460de6040748a28266f12b", "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": "example/mycode.gap", "max_forks_repo_name": "jorants/gap-loader", "max_forks_repo_head_hexsha": "975d76618bd69a0026460de6040748a28266f12b", "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": 9.8333333333, "max_line_length": 22, "alphanum_fraction": 0.5423728814, "num_tokens": 23, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. NO\n2. NO", "lm_q1_score": 0.4339814648038985, "lm_q2_score": 0.08389037839420965, "lm_q1q2_score": 0.03640686929847242}}
{"text": "\n# Copyright (c) 2018-2021, Carnegie Mellon University\n# See LICENSE for details\n\n\n# Below we define includes mandated by SSE Intel C+ compiler\n# Due to known incompatibilities between gcc and icc, you can turn\n# off hasXXX if compiler doesnt support it\n# No crosscompilation support. \n\n_hasSSE4_2 := arg -> LocalConfig.cpuinfo.SIMD().hasSSE4_2() and LocalConfig.compilerinfo.SIMD().hasSSE4_2();\n_hasSSE4_1 := arg -> LocalConfig.cpuinfo.SIMD().hasSSE4_1() and LocalConfig.compilerinfo.SIMD().hasSSE4_1();\n_hasSSSE3 := arg -> LocalConfig.cpuinfo.SIMD().hasSSSE3() and LocalConfig.compilerinfo.SIMD().hasSSSE3();\n_hasSSE3 := arg -> LocalConfig.cpuinfo.SIMD().hasSSE3() and LocalConfig.compilerinfo.SIMD().hasSSE3();\n_hasSSE2 := arg -> LocalConfig.cpuinfo.SIMD().hasSSE2() and LocalConfig.compilerinfo.SIMD().hasSSE2();\n_hasSSE := arg -> LocalConfig.cpuinfo.SIMD().hasSSE() and LocalConfig.compilerinfo.SIMD().hasSSE();\n_hasMMX := arg -> LocalConfig.cpuinfo.SIMD().hasMMX() and LocalConfig.compilerinfo.SIMD().hasMMX();\n\n_MM_MALLOC := () -> When(not LocalConfig.osinfo.isDarwin(), [\"\"], []);\n_MMINTRIN := () -> When(_hasMMX(), [\"\"], []);\n_XMMINTRIN := () -> When(_hasSSE(), [\"\"], []);\n_EMMINTRIN := () -> When(_hasSSE2(), [\"\"], []);\n_PMMINTRIN := () -> When(_hasSSE3(), [\"\"], []);\n_TMMINTRIN := () -> When(_hasSSSE3(), [\"\"], []);\n_SMMINTRIN := () -> When(_hasSSE4_1(), [\"\"], []);\n_NMMINTRIN := () -> When(_hasSSE4_2(), [\"\"], []);\n\n#F ==============================================================================================\n#F SIMD_Intel -- Base class for Intel ISAs\n#F\nClass(SIMD_Intel, SIMD_ISA, rec(\n info := \"Intel SSE, SSE2, SSE3, SSSE3, SSE4.1, SSE4.2, MMX architecture definition base\",\n arch := \"Intel_SSE\",\n file := \"sse\",\n unparser := SSEUnparser,\n\n # Should vector values be inlined or declared as constants\n declareConstants := false,\n\n # This is applied as the final pass of compileStrategy. Below we apply ISA specific strength\n # reduction rules, in particular some unaligned stores can only be eliminated in the final pass\n fixProblems := (self, c, opts) >> BUA(c, MergedRuleSet(RulesStrengthReduce, RulesSSEPostProcess), opts),\n\n autolib := rec(\n\tincludes := () -> _NMMINTRIN() :: _SMMINTRIN() :: _TMMINTRIN() :: _PMMINTRIN() ::\n\t _EMMINTRIN() :: _XMMINTRIN(), \n timerIncludes := () -> [\"\"]),\n\n unsigned := meth(self) self.isSigned:=false; return self; end,\n\n vzero := self >> self.t.zero(),\n\n intelCommonIncludes := self >> _NMMINTRIN() :: _SMMINTRIN() :: _TMMINTRIN() :: \n _PMMINTRIN() :: _EMMINTRIN() :: _XMMINTRIN() :: _MMINTRIN(),\n\n simpIndicesInside := SSE_LDST.list\n));\n\n# ==============================================================================================\n# 2-way double precision real\n#\nClass(SSE_2x64f, SIMD_Intel, rec(\n info := \"SSE2 2 x 64-bit double\",\n\n countrec := rec(\n ops := [\n [ add, sub, chslo_2x64f, chshi_2x64f, addsub_2x64f, hadd_2x64f], \n\t [ mul ],\n [ vunpacklo_2x64f, vunpackhi_2x64f, vshuffle_2x64f, vushuffle_2x64f ],\n [ vload1sd_2x64f, vload_1l_2x64f, vload_1h_2x64f, vloadu_2x64f, \n\t vstore_1l_2x64f, vstore_1h_2x64f, vstoreu_2x64f ],\n [ deref ],\n Value # Value without [] is a keyword in countOps !!\n ],\n printstrings := [\"[adds]\", \"[mults]\", \"[vperms]\", \"[svldst]\", \"[vldst]\", \"[vval]\"],\n arithcost := (self, opcount) >> opcount[1]+opcount[2]\n ),\n \n includes := self >> [\"\", \"\"] :: self.intelCommonIncludes(), \n active := true,\n isFixedPoint := false,\n isFloat := true,\n\n v := 2,\n t := TVect(TReal, 2),\n ctype := \"double\",\n instr := [vunpacklo_2x64f, vunpackhi_2x64f, vshuffle_2x64f],\n bits := 64,\n\n splopts := rec(precision := \"double\"),\n dupload := (y, x) -> assign(y, vdup(x, 2)),\n duploadn := (y, x, n) -> assign(y, vushuffle_2x64f(x, [n,n])),\n hadd := (x1,x2) -> hadd_2x64f(x1,x2),\n\n # load full vectors using subvectors of length 1 or 2\n svload:= [ [ (y,x,opts) -> assign(y, vload1sd_2x64f(x[1].toPtr(TReal))),\n (y,x,opts) -> let(u := var.fresh_t(\"U\", TVectDouble(2)),\n decl([u], chain(assign(u, vload1sd_2x64f(x[1].toPtr(TReal))),\n assign(y, vload_1h_2x64f(u, x[2].toPtr(TReal)))))) ],\n [ (y,x,opts) -> assign(y, nth(x[1].toPtr(TVect(TReal, 2)), 0)) ]\n\t ],\n\n # store full vector using subvectors of length 1 or 2\n svstore := [ [ (y,x,opts) -> vstore_1l_2x64f(y[1].toPtr(TReal), x),\n (y,x,opts) -> chain(vstore_1l_2x64f(y[1].toPtr(TReal), x),\n vstore_1h_2x64f(y[2].toPtr(TReal), x)) ],\n [ (y,x,opts) -> assign(nth(y[1].toPtr(TVect(TReal, 2)), 0), x) ]\n\t ],\n\n # keep the n lower scalars and zero the other ones\n optional_mask := (c, n, opts) -> When(IsBound(opts.trueSVSemantics) and opts.trueSVSemantics and not(n=2),\n let(f:=\"0xFFFFFFFF\", z:=\"0x0\", bin_and(c,tcast(TVect(TReal, 2), vhex(List([1..4],x->When(x/2<=n,f,z)))))),\n c),\n\n # load contiguous with unaligned loads\n loadc := (self, sv, opts) >> (\n\t(y,x) -> assign(y, self.optional_mask(vloadu_2x64f(x.toPtr(TReal)), sv, opts))),\n\n # load contiguous + known alignment -> using 2 aligned load to be smarter\n loadc_align := (self, sv, align, opts) >> ((y,x,addr) -> let(\n v1 := nth(nth(x,add(addr,-align)).toPtr(TVect(TReal, 2)),0),\n v2 := nth(nth(x,add(addr,2-align)).toPtr(TVect(TReal, 2)), 0),\n m := x -> self.optional_mask(x, sv, opts),\n\n Cond(align=0, assign(y, m(v1)),\n sv=1, assign(y, m(vushuffle_2x64f(v1, [2, 2]))),\n sv=2, assign(y, m(vshuffle_2x64f(v1, v2, [2, 3]))),\n Error(\"bad parameters\")))),\n\n # store contiguous unaligned\n storec := [ (y,x) -> vstore_1l_2x64f(y.toPtr(TReal), x),\n (y,x) -> vstoreu_2x64f (y.toPtr(TReal), x) ],\n\n reverse := (y,x) -> assign(vref(y,0,2), vushuffle_2x64f(vref(x,0,2), [2,1])),\n\n mul_cx := (self, opts) >> Cond(\n # SSE and MMX can't do double precision\n opts.vector.SIMD in [\"MMX\", \"SSE\"],\n Error(\"SSE2 required for double precision\"),\n # SSE2 only\n opts.vector.SIMD = \"SSE2\",\n (y,x,c) -> let(u1 := var.fresh_t(\"U\", TVectDouble(2)), u2 := var.fresh_t(\"U\", TVectDouble(2)),\n u3 := var.fresh_t(\"U\", TVectDouble(2)), u4 := var.fresh_t(\"U\", TVectDouble(2)),\n decl([u1, u2, u3, u4], chain(\n assign(u1, mul(x, vushuffle_2x64f(c, [1,1]))),\n assign(u2, chshi_2x64f(x)),\n assign(u3, mul(u2, vushuffle_2x64f(c, [2,2]))),\n assign(u4, vushuffle_2x64f(u3, [2,1])),\n assign(y, add(u1, u4))))),\n # SSE3 or higher\n (y, x, c) -> let(u1 := var.fresh_t(\"U\", TVectDouble(2)),\n u2 := var.fresh_t(\"U\", TVectDouble(2)),\n u3 := var.fresh_t(\"U\", TVectDouble(2)),\n decl([u1, u2, u3], chain(\n assign(u1, mul(x, vushuffle_2x64f(c, [1,1]))),\n assign(u2, vushuffle_2x64f(x, [2,1])),\n assign(u3, mul(u2, vushuffle_2x64f(c, [2,2]))),\n assign(y, addsub_2x64f(u1, u3)))))\n ),\n\n mul_cx_conj := (self, opts) >> Cond(\n # SSE and MMX can't do double precision\n opts.vector.SIMD in [\"MMX\", \"SSE\"],\n Error(\"SSE2 required for double precision\"),\n # SSE2 only\n (y,x,c) -> let(u1 := var.fresh_t(\"U\", TVectDouble(2)), u2 := var.fresh_t(\"U\", TVectDouble(2)),\n u3 := var.fresh_t(\"U\", TVectDouble(2)), u4 := var.fresh_t(\"U\", TVectDouble(2)),\n decl([u1, u2, u3, u4], chain(\n assign(u1, mul(x, vushuffle_2x64f(c, [1,1]))),\n assign(u2, chslo_2x64f(x)),\n assign(u3, mul(u2, vushuffle_2x64f(c, [2,2]))),\n assign(u4, vushuffle_2x64f(u3, [2,1])),\n assign(y, add(u1, u4)))))\n\t\t ),\n\n bin_shl1 := (y,x,opts) -> assign(y, vec_shl(x, 1)),\n bin_shl2 := (y,x,opts) -> assign(y, bin_or(vec_shr(x[1],1), vec_shl(x[2],1))),\n bin_shr1 := (y,x,opts) -> assign(y, vec_shr(x, 1)),\n bin_shr2 := (y,x,opts) -> assign(y, bin_or(vec_shr(x[1],1), vec_shl(x[2],1))),\n # support for VO1dsJ(n, v)\n bin_shrev := (y,x,opts) -> assign(y, vshuffle_2x64f(x[1], x[2], [1,2])),\n swap_cx := (y, x, opts) -> assign(y, vushuffle_2x64f(x, [2,1])),\n RCVIxJ2 := (y, x, opts) -> assign(y, vushuffle_2x64f(x, [2,1])) # ???? maybe shuf3 rule is invalid\n\n));\n\n\n#==============================================================================================\n#\nClass(SSE_2x64i, SIMD_Intel, rec(\n info := \"SSE2 2 x 64-bit integer\",\n\n includes := self >> [\"\"] :: self.intelCommonIncludes(), \n active := true,\n isFixedPoint := true,\n isFloat := false,\n saturatedArithmetic := false,\n\n v := 2,\n t := TVect(TReal, 2),\n ctype := \"__int64\",\n instr := [vunpacklo_2x64i, vunpackhi_2x64i, vshuffle_2x64i],\n bits := 64,\n fracbits := 62,\n\n splopts := rec(precision := \"double\"),\n# dupload := (y, x) -> assign(y, vushuffle_2x64i(vload1sd_2x64i(x.toPtr(TReal)), [1,1])),\n reverse := (y,x) -> assign(vref(y,0,2), vushuffle_2x64f(vref(x,0,2), [2,1])),\n bin_shl1 := (y,x,opts) -> assign(y, vec_shl(x, 1)),\n bin_shl2 := (y,x,opts) -> assign(y, bin_or(vec_shr(x[1],1), vec_shl(x[2],1))),\n bin_shr1 := (y,x,opts) -> assign(y, vec_shr(x, 1)),\n bin_shr2 := (y,x,opts) -> assign(y, bin_or(vec_shr(x[1],1), vec_shl(x[2],1))),\n));\n\n#==============================================================================================\nClass(SSE_2x32f, SIMD_Intel, rec(\n info := \"SSE 2 x 32-bit float\",\n countrec := rec(\n ops := [\n [add, sub, addsub_4x32f, hadd_4x32f], [mul],\n [vunpacklo_4x32f, vunpackhi_4x32f, vshuffle_4x32f, vushuffle_4x32f],\n [vload1_4x32f, vloadu_4x32f, vloadu2_4x32f,\n vstore1_4x32f, vstoreu_4x32f, vstoreu2_4x32f, vstoremsk_4x32f],\n [deref, vload_2l_4x32f, vload_2h_4x32f, vstore_2l_4x32f, vstore_2h_4x32f],\n Value # Value without [] is a keyword in countOps !!\n ],\n printstrings := [\"[adds]\", \"[mults]\", \"[vperms]\", \"[svldst]\", \"[vldst]\", \"[vval]\"],\n arithcost := (self, opcount) >> opcount[1]+opcount[2]\n ),\n\n includes := self >> [\"\"] :: self.intelCommonIncludes(), \n active := true,\n isFixedPoint := false,\n isFloat := true,\n\n v := 2,\n t := TVect(TReal, 2),\n ctype := \"float\",\n instr := [vunpacklo_2x32f, vunpackhi_2x32f, vshuffle_2x32f],\n bits := 32,\n\n splopts := rec(precision := \"single\"),\n dupload := (y, x) -> assign(y, vdup(x, 2)),\n duploadn := (y, x, n) -> assign(y, vushuffle_2x32f(x, [n,n])),\n hadd := (x1,x2) -> hadd_2x32f(x1,x2),\n\n # NOTE: Hacks. YSV: these are still alive as of svn 9206.\n #\n requireLoad := true,\n loadop := l -> vload_2x32f(vzero_2x32f(), l),\n requireStore := true,\n storeop := (l, v) -> vstore_2x32f(l.loc, v),\n needScalarVarFix := true,\n scalarVar := () -> var.fresh_t(\"P\", TVectDouble(4)),\n ##\n\n svload:= [ [ # load full vectors using subvectors of length 1 or 2\n (y,x,opts) -> assign(y, vload1sd_2x32f(x[1].toPtr(TReal))),\n (y,x,opts) -> let(u := var.fresh_t(\"U\", TVectDouble(2)),\n decl([u], chain(assign(u, vload1sd_2x32f(x[1].toPtr(TReal))),\n assign(y, vload_1h_2x32f(u, x[2].toPtr(TReal))))))\n ],\n [(y,x,opts) -> assign(y, nth(x[1].toPtr(TVect(TReal, 2)), 0)) ]\n ],\n svstore := [[ # store full vector using subvectors of length 1 or 2\n (y,x,opts) -> vstore_1l_2x32f(y[1].toPtr(TReal), x),\n (y,x,opts) -> chain(vstore_1l_2x32f(y[1].toPtr(TReal), x),\n vstore_1h_2x32f(y[2].toPtr(TReal), x))\n ],\n [\n (y,x,opts) -> assign(nth(y[1].toPtr(TVect(TReal, 2)), 0), x)\n ]],\n\n # keep the n lower scalars and zero the other ones\n optional_mask := (self, c, n, opts) >> Cond(IsBound(opts.trueSVSemantics) and opts.trueSVSemantics and n<>2,\n\tbin_and(c, tcast(self.t, vhex(List([1..4], x -> When(x/2<=n, \"0xFFFFFFFF\", \"0x0\"))))),\n c),\n\n # load contiguous with unaligned loads\n loadc := (self, sv, opts) >> (\n\t(y,x) -> assign(y, self.optional_mask(vloadu_2x32f(x.toPtr(TReal)), sv, opts))),\n\n # load contiguous + known alignment -> using 2 aligned load to be smarter\n loadc_align := (self, sv, align, opts)>>\n ((y,x,addr) -> let(\n v1 := nth(nth(x,add(addr,-align)).toPtr(TVect(TReal, 2)),0),\n v2 := nth(nth(x,add(addr,2-align)).toPtr(TVect(TReal, 2)), 0),\n m := x-> self.optional_mask(x, sv, opts),\n Cond(align=0,\n assign(y, m(v1)),\n\t sv=1,\n assign(y, m(vushuffle_2x32f(v1, [2, 2]))),\n sv=2,\n assign(y, m(vshuffle_2x32f(v1, v2, [2, 3]))),\n\t # else\n\t\t Error(\"bad parameters\")))),\n\n # store contiguous unaligned\n storec := [ \n (y,x) -> vstore_1l_2x32f(y.toPtr(TReal), x),\n (y,x) -> vstoreu_2x32f(y.toPtr(TReal), x)\n ],\n\n reverse := (y,x) -> assign(vref(y,0,2), vushuffle_2x32f(vref(x,0,2), [2,1])),\n\n mul_cx := (self, opts) >> Cond(\n # SSE and MMX can't do double precision\n opts.vector.SIMD in [\"MMX\", \"SSE\"],\n Error(\"SSE2 required for double precision\"),\n\n # SSE2 only\n opts.vector.SIMD = \"SSE2\",\n (y,x,c) -> let(\n\t\tu := var.fresh_t(\"U\", self.t), w := var.fresh_t(\"U\", self.t),\n decl([u, w], chain(\n assign(u, x * vushuffle_2x32f(c, [1,1])),\n assign(w, chshi_2x32f(x) * vushuffle_2x32f(c, [2,2])),\n assign(y, u + vushuffle_2x32f(w, [2,1]))))),\n # SSE3 or higher\n (y, x, c) -> let(\n\t\tu := var.fresh_t(\"U\", self.t), w := var.fresh_t(\"U\", self.t),\n decl([u, w], chain(\n assign(u, x * vushuffle_2x32f(c, [1,1])),\n assign(w, vushuffle_2x32f(x, [2,1]) * vushuffle_2x32f(c, [2,2])),\n assign(y, addsub_2x32f(u, w)))))\n ),\n\n bin_shl1 := (y,x,opts) -> assign(y, vec_shl(x, 8)),\n bin_shl2 := (y,x,opts) -> assign(y, bin_or(vec_shr(x[1],1), vec_shl(x[2],1))),\n bin_shr1 := (y,x,opts) -> assign(y, vec_shr(x, 1)),\n bin_shr2 := (y,x,opts) -> assign(y, bin_or(vec_shr(x[1],1), vec_shl(x[2],1))),\n # support for VO1dsJ(n, v)\n bin_shrev := (y,x,opts) -> assign(y, vshuffle_2x32f(x[1], x[2], [1,2]))\n));\n\n#==============================================================================================\n\nClass(SSE_4x32f, SIMD_Intel, rec(\n info := \"SSE 4 x 32-bit float\",\n\n # experimental -- parametized ISA, is the type of each slot in the vector\n __call__ := (self, el_t) >> WithBases(self, rec(\n t := TVect(el_t, 4), \n\tisSigned := el_t.isSigned(),\n\tisFloat := IsRealT(el_t),\n\tisFixedPoint := IsFixedPtT(el_t),\n\tsplopts := CopyFields(self.splopts, rec(XType := TPtr(el_t), YType := TPtr(el_t))),\n\tsvload := self.svload_init(TVect(el_t, 4)),\n\tsvstore := self.svstore_init(TVect(el_t, 4)),\n\tstorec := self.storec_init(TVect(el_t, 4)),\n\toperations := ISAOps,\n\tprint := self >> Print(self.__name__, \"(\", self.t.t, \")\"),\n\tid := self >> self.__name__ :: \"_\" :: el_t.strId(),\n )),\n\n countrec := rec(\n ops := [\n [ add, sub, addsub_4x32f, hadd_4x32f, chshi_4x32f, chslo_4x32f ], \n\t [ mul ],\n [ vunpacklo_4x32f, vunpackhi_4x32f, vshuffle_4x32f, vushuffle_4x32f ],\n [ vload1_4x32f, vload_2l_4x32f, vload_2h_4x32f, vloadu_4x32f, vloadu2_4x32f,\n vstore1_4x32f, vstore_2l_4x32f, vstore_2h_4x32f, vstoreu_4x32f, vstoreu2_4x32f, \n\t vstoremsk_4x32f, vinsert_4x32f, vextract_4x32f ],\n [ deref ],\n Value, # Value without [] is a keyword in countOps !!\n [vcvt_4x32_i2f]\n ],\n printstrings := [\"[adds]\", \"[mults]\", \"[vperms]\", \"[svldst]\", \"[vldst]\", \"[vval]\", \"[vcvt]\"],\n arithcost := (self, opcount) >> opcount[1]+opcount[2]\n ),\n\n includes := self >> [\"\"] :: self.intelCommonIncludes(), \n active := true,\n isFixedPoint := false,\n isFloat := true,\n\n v := 4,\n t := TVect(TReal, 4),\n ctype := \"float\",\n instr := [vunpacklo_4x32f, vunpackhi_4x32f, vshuffle_4x32f, vushuffle_4x32f],\n bits := 32,\n\n splopts := rec(precision := \"single\"),\n\n #dupload := (self, y, x) >> self.duploadn(y, vload1_4x32f(x.toPtr(self.t.t)), 1),\n dupload := (self, y, x) >> assign(y, vdup(x, self.v)),\n duploadn := (y, x, n) -> assign(y, vushuffle_4x32f(x, [n,n,n,n])),\n\n hadd := (x1,x2) -> hadd_4x32f(x1,x2),\n\n svload_init := (vt) -> [\n # load using subvectors of length 1\n\t[\n (y,x,opts) -> assign(y, vload1_4x32f(x[1].toPtr(vt.t))),\n\n (y,x,opts)->When(_hasSSE4_1(opts),\n let(u := var.fresh_t(\"U\", vt),\n decl([u], chain(\n assign(u, vload1_4x32f(x[1].toPtr(vt.t))),\n assign(y, vinsert_4x32f(u, deref(x[2].toPtr(T_Int(32))), 2))\n ))),\n let(u1 := var.fresh_t(\"U\", vt), u2 := var.fresh_t(\"U\", vt),\n decl([u1, u2], chain(\n assign(u1, vload1_4x32f(x[1].toPtr(vt.t))),\n assign(u2, vload1_4x32f(x[2].toPtr(vt.t))),\n assign(y, vunpacklo_4x32f(u1, u2))\n )))\n ),\n\n (y,x,opts)->When(_hasSSE4_1(opts),\n let(u := var.fresh_t(\"U\", vt),\n decl([u], chain(\n assign(u, vload1_4x32f(x[1].toPtr(vt.t))),\n assign(u, vinsert_4x32f(u, deref(x[2].toPtr(T_Int(32))), 2)),\n assign(y, vinsert_4x32f(u, deref(x[3].toPtr(T_Int(32))), 3))\n ))),\n let(u1 := var.fresh_t(\"U\", vt), u2 := var.fresh_t(\"U\", vt),\n u3 := var.fresh_t(\"U\", vt), u4 := var.fresh_t(\"U\", vt),\n decl([u1, u2, u3, u4], chain(\n assign(u1, vload1_4x32f(x[1].toPtr(vt.t))),\n assign(u2, vload1_4x32f(x[2].toPtr(vt.t))),\n assign(u3, vshuffle_4x32f(u1, u2, [1,2,1,2])),\n assign(u4, vload1_4x32f(x[3].toPtr(vt.t))),\n assign(y, vshuffle_4x32f(u3, u4, [1,3,1,3]))\n )))\n ),\n\n (y,x,opts)->When(_hasSSE4_1(opts),\n let(u := var.fresh_t(\"U\", vt),\n decl([u], chain(\n assign(u, vload1_4x32f(x[1].toPtr(vt.t))),\n assign(u, vinsert_4x32f(u, deref(x[2].toPtr(T_Int(32))), 2)),\n assign(u, vinsert_4x32f(u, deref(x[3].toPtr(T_Int(32))), 3)),\n assign(y, vinsert_4x32f(u, deref(x[4].toPtr(T_Int(32))), 4))\n ))),\n let(u1 := var.fresh_t(\"U\", vt), u2 := var.fresh_t(\"U\", vt),\n u3 := var.fresh_t(\"U\", vt), u4 := var.fresh_t(\"U\", vt),\n u5 := var.fresh_t(\"U\", vt), u6 := var.fresh_t(\"U\", vt),\n decl([u1, u2, u3, u4, u5, u6], chain(\n assign(u1, vload1_4x32f(x[1].toPtr(vt.t))),\n assign(u2, vload1_4x32f(x[2].toPtr(vt.t))),\n assign(u3, vshuffle_4x32f(u1, u2, [1,2,1,2])),\n assign(u4, vload1_4x32f(x[3].toPtr(vt.t))),\n assign(u5, vload1_4x32f(x[4].toPtr(vt.t))),\n assign(u6, vshuffle_4x32f(u4, u5, [1,2,1,2])),\n assign(y, vshuffle_4x32f(u3, u6, [1,3,1,3]))\n )))\n ),\n\t],\n # load using subvectors of length 2\n [ \n (y,x,opts) -> assign(y, vload_2l_4x32f(vzero_4x32f(), x[1].toPtr(TVect(vt.t,2)))),\n (y,x,opts) -> let(u := var.fresh_t(\"U\", vt),\n decl(u, chain(\n assign(u, vload_2l_4x32f(vzero_4x32f(), x[1].toPtr(TVect(vt.t,2)))),\n assign(y, vload_2h_4x32f(u, x[2].toPtr(TVect(vt.t,2)))))\n ))\n ]],\n\n svload := ~.svload_init(~.t),\n\n # keep the n lower scalars and zero the other ones\n optional_mask := (c, n, opts) -> Cond(IsBound(opts.trueSVSemantics) and opts.trueSVSemantics and n <> 4,\n\tbin_and(c, vhex(List([1..4], x -> When(x<=n, \"0xFFFFFFFF\", \"0x0\")))),\n c),\n\n # load contiguous with unaligned loads\n loadc := (self, sv, opts) >> ((y,x) -> assign(y, self.optional_mask(vloadu_4x32f(x.toPtr(self.t.t)), sv, opts))),\n\n #load contiguous + known alignment -> using 2 aligned load to be smarter\n loadc_align := (self, sv, align, opts)>>\n ((y,x,addr) -> let(\n v1 := nth(nth(x, addr-align) .toPtr(self.t), 0),\n v2 := nth(nth(x, addr-align+4).toPtr(self.t), 0),\n m := x -> self.optional_mask(x, sv, opts),\n Cond(align=0,\n assign(y, m(v1)),\n\n _hasSSSE3(opts),\n assign(y, m(alignr_4x32f(v2, v1, align*4))),\n\n assign(y, m(bin_or(\n vec_shr(v1, align),\n vec_shl(v2, (4-align))\n )))))),\n\n svstore_init := (vt) -> [\n [\n (y,x,opts) -> vstore1_4x32f(y[1].toPtr(vt.t), x),\n (y,x,opts)->When(_hasSSE4_1(opts),\n chain(\n vstore1_4x32f(y[1].toPtr(vt.t), x),\n vextract_4x32f(y[2].toPtr(T_Int(32)), x, 2)\n ),\n let(u1 := var.fresh_t(\"U\", vt),\n decl([u1], chain(\n vstore1_4x32f(y[1].toPtr(vt.t), x),\n assign(u1, vushuffle_4x32f(x, [2,3,4,1])),\n vstore1_4x32f(y[2].toPtr(vt.t), u1)\n )))\n ),\n (y,x,opts)->When(_hasSSE4_1(opts),\n chain(\n vstore1_4x32f(y[1].toPtr(vt.t), x),\n vextract_4x32f(y[2].toPtr(T_Int(32)), x, 2),\n vextract_4x32f(y[3].toPtr(T_Int(32)), x, 3)\n ),\n let(u1 := var.fresh_t(\"U\", vt), u2 := var.fresh_t(\"U\", vt),\n decl([u1, u2], chain(\n vstore1_4x32f(y[1].toPtr(vt.t), x),\n assign(u1, vushuffle_4x32f(x, [2,3,4,1])),\n vstore1_4x32f(y[2].toPtr(vt.t), u1),\n assign(u2, vushuffle_4x32f(u1, [2,3,4,1])),\n vstore1_4x32f(y[3].toPtr(vt.t), u2)\n )))\n ),\n (y,x,opts)->When(_hasSSE4_1(opts),\n chain(\n vstore1_4x32f(y[1].toPtr(vt.t), x),\n vextract_4x32f(y[2].toPtr(T_Int(32)), x, 2),\n vextract_4x32f(y[3].toPtr(T_Int(32)), x, 3),\n vextract_4x32f(y[4].toPtr(T_Int(32)), x, 4)\n ),\n let(u1 := var.fresh_t(\"U\", vt), u2 := var.fresh_t(\"U\", vt),\n u3 := var.fresh_t(\"U\", vt),\n decl([u1, u2, u3], chain(\n vstore1_4x32f(y[1].toPtr(vt.t), x),\n assign(u1, vushuffle_4x32f(x, [2,3,4,1])),\n vstore1_4x32f(y[2].toPtr(vt.t), u1),\n assign(u2, vushuffle_4x32f(u1, [2,3,4,1])),\n vstore1_4x32f(y[3].toPtr(vt.t), u2),\n assign(u3, vushuffle_4x32f(u2, [2,3,4,1])),\n vstore1_4x32f(y[4].toPtr(vt.t), u3)\n )))\n )\n ],\n [\n (y,x,opts) -> vstore_2l_4x32f(y[1].toPtr(TVect(vt.t,2)), x),\n (y,x,opts) -> chain(vstore_2l_4x32f(y[1].toPtr(TVect(vt.t,2)), x),\n vstore_2h_4x32f(y[2].toPtr(TVect(vt.t,2)), x))\n ]\n ],\n\n svstore := ~.svstore_init(~.t),\n\n # Store contiguous unaligned\n storec_init := (vt) -> [ \n (y,x) -> vstore1_4x32f(y.toPtr(vt.t), x),\n (y,x) -> vstoreu2_4x32f(y.toPtr(TVect(T_Int(64),2)), x),\n (y,x) -> vstoremsk_4x32f(y.toPtr(vt.t), x, [\"0xFFFFFFFF\", \"0xFFFFFFFF\", \"0xFFFFFFFF\", \"0x0\"]),\n (y,x) -> vstoreu_4x32f(y.toPtr(vt.t), x)\n ],\n\n storec := ~.storec_init(~.t),\n\n reverse := (y,x) -> assign(vref(y,0,4), vushuffle_4x32f(vref(x,0,4), [4,3,2,1])),\n\n # support for VS and VS.transpose()\n bin_shl1 := (y,x,opts) -> assign(y, vec_shl(x, 1)),\n# bin_shl2 := (y,x,opts) -> assign(y, bin_or(vec_shr(x[1],3), vec_shl(x[2],1))),\n bin_shl2 := (self,y,x,opts) >> When(\n\t_hasSSSE3(opts),\n assign(y, alignr_4x32f(x[2], x[1], 12)),\n\t# else\n let(u := self.freshU(),\n chain(\n assign(u, vshuffle_4x32f(x[1], x[2], [3,4,1,2])),\n assign(y, vshuffle_4x32f(u, x[2], [2,3,2,3]))))\n ),\n\n bin_shr1 := (y,x,opts) -> assign(y, vec_shr(x, 1)), \n\n bin_shr2 := (self,y,x,opts) >> Cond(\n\t_hasSSSE3(opts),\n assign(y, alignr_4x32f(x[2], x[1], 4)),\n\t# else, no SSSE3\n let(u := self.freshU(), chain( # x = [a,b,c,d] [e,f,g,h] \n assign(u, vshuffle_4x32f(x[1], x[2], [3,4,1,2])), # u = [c,d,e,f]\n assign(y, vshuffle_4x32f(x[1], u, [2,3,2,3]))))), # y = [b,c,d,e]\n\t# another way\n\t# assign(y, bin_or(vec_shr(x[1],1), vec_shl(x[2],3)))\n\n # support for VO1dsJ(n, v)\n bin_shrev := (self, y, x, opts) >> let(\n\tu := self.freshU(), # data = [a b c d] [e f g h]\n chain( # x = [e,f,g,h] [a,b,c,d] \n assign(u, vshuffle_4x32f(x[1], x[2], [1,2,3,4])), # u = [e f c d]\n assign(y, vshuffle_4x32f(u, x[2], [1,4,3,2])))), # y = [e d c b]\n\n # returns function (y,x,c) -> \n mul_cx := (self, opts) >> Cond(\n # MMX can't do single precision\n opts.vector.SIMD in [\"MMX\"], Error(\"SSE required for single precision\"),\n # SSE only\n opts.vector.SIMD in [\"SSE\", \"SSE2\"],\n (y,x,c) -> let(\n\t\tu := self.freshU(), v := self.freshU(),\n decl([u, v], chain(\n assign(u, x * vushuffle_4x32f(c, [1,1,3,3])),\n assign(v, vushuffle_4x32f(x, [2,1,4,3]) * vushuffle_4x32f(c, [2,2,4,4])),\n assign(y, u + chslo_4x32f(v))))),\n # SSE3 or higher\n (y,x,c) -> let(\n\t\tu := self.freshU(), v := self.freshU(),\n decl([u, v], chain(\n assign(u, x * vushuffle_4x32f(c, [1,1,3,3])),\n assign(v, vushuffle_4x32f(x, [2,1,4,3]) * vushuffle_4x32f(c, [2,2,4,4])),\n assign(y, addsub_4x32f(u, v)))))\n ),\n\n # returns function (y,x,c) -> \n mul_cx_conj := (self, opts) >> Cond(\n # MMX can't do single precision\n opts.vector.SIMD in [\"MMX\"], Error(\"SSE required for single precision\"),\n # SSE \n (y,x,c) -> let(\n\t\tu := self.freshU(), v := self.freshU(),\n decl([u, v], chain(\n assign(u, x * vushuffle_4x32f(c, [1,1,3,3])),\n assign(v, chslo_4x32f(x) * vushuffle_4x32f(c, [2,2,4,4])),\n assign(v, vushuffle_4x32f(v, [2,1,4,3])),\n assign(y, u + v))))\n ),\n\n swap_cx := (y, x, opts) -> assign(y, vushuffle_4x32f(x, [2,1,4,3])),\n RCVIxJ2 := (y, x, opts) -> assign(y, vushuffle_4x32f(x, [3,4,1,2])),\n\n freshU := self >> var.fresh_t(\"U\", self.t),\n\n hmin := (self, y, x, opts) >> let( u := self.freshU(),\n decl( [u], chain( \n assign(u, min(x, vushuffle_4x32f(x, [2,1,4,3]))),\n assign(y, min(u, vushuffle_4x32f(u, [3,4,1,2]))) \n ))),\n \n rotate_left := (self, shift) >> Cond(\n shift mod 4=0,\n ((y, x) -> assign(vtref(self.t, y, 0), vtref(self.t, x, 0))),\n shift mod 4=1, \n ((y, x) -> assign(vtref(self.t, y, 0), vushuffle_4x32f(vtref(self.t, x, 0), [4,1,2,3]))),\n shift mod 4=2, \n ((y, x) -> assign(vtref(self.t, y, 0), vushuffle_4x32f(vtref(self.t, x, 0), [3,4,1,2]))),\n shift mod 4=3, \n ((y, x) -> assign(vtref(self.t, y, 0), vushuffle_4x32f(vtref(self.t, x, 0), [2,3,4,1]))),\n #else \n ((y, x) -> assign(vtref(self.t, y, 0),\n bin_or( vec_shl(vtref(self.t, x, 0), imod(shift,4)),\n vec_shr(vtref(self.t, x, 0), 4-imod(shift,4)))))),\n));\n\n#==============================================================================================\n\nClass(SSE_4x32i, SIMD_Intel, rec(\n active := true,\n isFixedPoint := true,\n isFloat := false,\n saturatedArithmetic := false,\n info := \"SSE 4 x 32-bit integer\",\n v := 4,\n t := TVect(TReal, 4),\n instr := [vunpacklo_4x32i, vunpackhi_4x32i, vshuffle_4x32i, vushuffle_4x32i],\n bits := 32,\n fracbits := 30,\n includes := self >> [\"\"] :: self.intelCommonIncludes(), \n splopts := DataTypes.i32re,\n\n# dupload := (y, x) -> assign(y, vushuffle_4x32i(vload1_4x32i(x.toPtr(TReal)), [1,1,1,1])),\n reverse := (y,x) -> assign(vref(y,0,4), vushuffle_4x32i(vref(x,0,4), [4,3,2,1])),\n # support for VS and VS.transpose()\n bin_shl1 := (y,x,opts) -> assign(y, vec_shl(x, 1)),\n bin_shl2 := (y,x,opts) -> assign(y, bin_or(vec_shr(x[1],3), vec_shl(x[2],1))),\n bin_shr1 := (y,x,opts) -> assign(y, vec_shr(x, 1)),\n bin_shr2 := (y,x,opts) -> assign(y, bin_or(vec_shr(x[1],1), vec_shl(x[2],3))),\n interleavedmask := (b,idx,x1,x2) -> assign(nth(tcast(TPtr(TUChar), b),idx),interleavedmask_4x32i(x1,x2)),\n vrshift := \"_mm_srli_epi32\",\n vlshift := \"_mm_slli_epi32\",\n vmul := \"_mm_mulhi_epi32\"\n));\n\n#==============================================================================================\n\nClass(SSE_8x16i, SIMD_Intel, rec(\n info := \"SSE2 8 x 16-bit int\",\n \n # experimental -- parametized ISA, is the type of each 8-bit slot in the vector\n __call__ := (self, el_t) >> WithBases(self, rec(\n t := TVect(el_t, 8), \n\tisSigned := el_t.isSigned(),\n\tisFloat := IsRealT(el_t),\n\tisFixedPoint := IsFixedPtT(el_t),\n\tsplopts := CopyFields(self.splopts, rec(XType := TPtr(el_t), YType := TPtr(el_t))),\n\tsvload := self.svload_init(TVect(el_t, 8)),\n\tsvstore := self.svstore_init(TVect(el_t, 8)),\n\tstorec := self.storec_init(TVect(el_t, 8)),\n operations := ISAOps,\n\tprint := self >> Print(self.__name__, \"(\", self.t.t, \")\"),\n\tid := self >> self.__name__ :: \"_\" :: el_t.strId(),\n )),\n\n countrec := rec(\n ops := [\n [ add, sub, chs_8x16i ], \n\t [ fpmul ],\n [ vunpacklo_8x16i, vunpackhi_8x16i, vunpacklo2_8x16i, vunpackhi2_8x16i,\n vunpacklo4_8x16i, vunpackhi4_8x16i, vushuffle2_8x16i, vushufflelo_8x16i, \n\t vushufflehi_8x16i, vushuffle_8x16i, vshuffle2_8x16i, vshuffle4_8x16i, \n\t alignr_8x16i ],\n [ vload1_8x16i, vload2_8x16i, vload4_8x16i, vloadu_8x16i,\n vextract1_8x16i, vextract2_8x16i, vstoreu_8x16i, vstore4_8x16i, vstoremsk_8x16i ],\n [ deref ],\n Value\n ],\n printstrings := [\"[adds]\", \"[mults]\", \"[vperms]\", \"[svldst]\", \"[vldst]\", \"[vval]\"],\n arithcost := (self, opcount) >> opcount[1]+opcount[2]*2\n ),\n\n includes := self >> [\"\"] :: self.intelCommonIncludes(), \n active := true,\n isFixedPoint := true,\n isFloat := false,\n saturatedArithmetic := false,\n\n v := 8,\n t := TVect(TReal, 8),\n ctype := \"short int\",\n instr := [vunpacklo_8x16i, vunpackhi_8x16i, vunpacklo2_8x16i, vunpackhi2_8x16i,\n vunpacklo4_8x16i, vunpackhi4_8x16i, vushuffle2_8x16i, vushufflelo_8x16i, \n\t vushufflehi_8x16i, vshuffle2_8x16i ], #vshuffle4_8x16i\n bits := 16,\n fracbits := 14,\n vrshift := \"_mm_srai_epi16\", # \"_mm_srli_epi16\",\n vlshift := \"_mm_slli_epi16\",\n\n splopts := rec(customDataType := \"short_fp14\"),\n\n dupload := (self, y, x) >> assign(y, vdup(x, self.v)),\n\n svload_init := (vt) -> [\n # ------------------------------------\n # Load using subvectors of length 1\n\t[ \n\t (y,x,opts) -> assign(y, vload1_8x16i(vt.zero(), x[1], 0)),\n (y,x,opts) -> let(\n\t u := var.fresh_t(\"U\", vt),\n\t cc := List([1..2], i -> assign(u, vload1_8x16i(u, x[i], i-1))),\n decl([u], chain(assign(u, vt.zero()), cc, assign(y, u)))),\n (y,x,opts) -> let(\n\t u := var.fresh_t(\"U\", vt),\n\t cc := List([1..3], i -> assign(u, vload1_8x16i(u, x[i], i-1))),\n decl([u], chain(assign(u, vt.zero()), cc, assign(y, u)))),\n (y,x,opts) -> let(\n\t u := var.fresh_t(\"U\", vt),\n\t cc := List([1..4], i -> assign(u, vload1_8x16i(u, x[i], i-1))),\n decl([u], chain(assign(u, vt.zero()), cc, assign(y, u)))),\n (y,x,opts) -> let(\n\t u := var.fresh_t(\"U\", vt),\n\t cc := List([1..5], i -> assign(u, vload1_8x16i(u, x[i], i-1))),\n decl([u], chain(assign(u, vt.zero()), cc, assign(y, u)))),\n (y,x,opts) -> let(\n\t u := var.fresh_t(\"U\", vt),\n\t cc := List([1..6], i -> assign(u, vload1_8x16i(u, x[i], i-1))),\n decl([u], chain(assign(u, vt.zero()), cc, assign(y, u)))),\n (y,x,opts) -> let(\n\t u := var.fresh_t(\"U\", vt),\n\t cc := List([1..7], i -> assign(u, vload1_8x16i(u, x[i], i-1))),\n decl([u], chain(assign(u, vt.zero()), cc, assign(y, u)))),\n (y,x,opts) -> let(\n\t u := var.fresh_t(\"U\", vt),\n\t cc := List([1..8], i -> assign(u, vload1_8x16i(u, x[i], i-1))),\n decl([u], chain(assign(u, vt.zero()), cc, assign(y, u)))), \n ],\n\n # ------------------------------------\n # Load using subvectors of length 2\n [ (y,x,opts) -> let(\n\t u := var.fresh_t(\"U\", vt), \n decl([u], chain(\n assign(u, vload2_8x16i(nth(x[1].toPtr(T_Int(32)), 0))),\n assign(u, vunpacklo2_8x16i(u, vt.zero())),\n assign(y, vunpacklo4_8x16i(u, vt.zero()))))),\n (y,x,opts) -> let(\n\t u := var.fresh_t(\"U\", vt), v := var.fresh_t(\"U\", vt),\n decl([u, v], chain(\n assign(u, vload2_8x16i(nth(x[1].toPtr(T_Int(32)), 0))), \n\t\t assign(v, vload2_8x16i(nth(x[2].toPtr(T_Int(32)), 0))),\n assign(u, vunpacklo2_8x16i(u, v)),\n assign(y, vunpacklo4_8x16i(u, vt.zero()))))),\n (y,x,opts) -> let(\n\t u := var.fresh_t(\"U\", vt), v := var.fresh_t(\"U\", vt), \n\t w := var.fresh_t(\"U\", vt),\n decl([u, v, w], chain(\n assign(u, vload2_8x16i(nth(x[1].toPtr(T_Int(32)), 0))), \n\t\t assign(v, vload2_8x16i(nth(x[2].toPtr(T_Int(32)), 0))),\n assign(u, vunpacklo2_8x16i(u, v)),\n assign(w, vload2_8x16i(nth(x[3].toPtr(T_Int(32)), 0))),\n assign(w, vunpacklo2_8x16i(w, vt.zero())),\n assign(y, vunpacklo4_8x16i(u, w))))),\n (y,x,opts) -> let(\n\t u := var.fresh_t(\"U\", vt), v := var.fresh_t(\"U\", vt),\n\t uu := var.fresh_t(\"U\", vt), vv := var.fresh_t(\"U\", vt),\n decl([u, v, uu, vv], chain(\n assign(u, vload2_8x16i(nth(x[1].toPtr(T_Int(32)), 0))),\n\t\t assign(v, vload2_8x16i(nth(x[2].toPtr(T_Int(32)), 0))),\n assign(u, vunpacklo2_8x16i(u, v)),\n assign(uu, vload2_8x16i(nth(x[3].toPtr(T_Int(32)), 0))), \n\t\t assign(vv, vload2_8x16i(nth(x[4].toPtr(T_Int(32)), 0))),\n assign(uu, vunpacklo2_8x16i(uu, vv)),\n assign(y, vunpacklo4_8x16i(u, uu)))))\n ]\n ],\n\n svload := ~.svload_init(~.t),\n\n svstore_init := (vt) -> [\n # ------------------------------------\n # Store subvectors of length 1\n\t#\n\t[ (y,x,opts) -> chain(List([1..1], i -> assign(y[i], vextract1_8x16i(x, i-1)))),\n (y,x,opts) -> chain(List([1..2], i -> assign(y[i], vextract1_8x16i(x, i-1)))),\n (y,x,opts) -> chain(List([1..3], i -> assign(y[i], vextract1_8x16i(x, i-1)))),\n (y,x,opts) -> chain(List([1..4], i -> assign(y[i], vextract1_8x16i(x, i-1)))),\n (y,x,opts) -> chain(List([1..5], i -> assign(y[i], vextract1_8x16i(x, i-1)))),\n (y,x,opts) -> chain(List([1..6], i -> assign(y[i], vextract1_8x16i(x, i-1)))),\n (y,x,opts) -> chain(List([1..7], i -> assign(y[i], vextract1_8x16i(x, i-1)))),\n (y,x,opts) -> chain(List([1..8], i -> assign(y[i], vextract1_8x16i(x, i-1)))),\n ],\n # ------------------------------------\n # Store subvectors of length 2\n\t#\n [ (y,x,opts) -> assign(nth(y[1].toPtr(T_Int(32)),0), vextract2_8x16i(x)),\n\n (y,x,opts) -> let(\n\t u := var.fresh_t(\"U\", vt),\n decl([u], chain(\n assign(nth(y[1].toPtr(T_Int(32)),0), vextract2_8x16i(x)),\n assign(u, vushuffle2_8x16i(x, [2,3,4,1])), \n\t\t assign(nth(y[2].toPtr(T_Int(32)),0), vextract2_8x16i(u))\n ))),\n (y,x,opts) -> let(\n\t u1 := var.fresh_t(\"U\", vt), u2 := var.fresh_t(\"U\", vt),\n decl([u1, u2], chain(\n assign(nth(y[1].toPtr(T_Int(32)),0), vextract2_8x16i(x)),\n assign(u1, vushuffle2_8x16i(x, [2,3,4,1])), assign(nth(y[2].toPtr(T_Int(32)),0), vextract2_8x16i(u1)),\n assign(u2, vushuffle2_8x16i(u1, [2,3,4,1])), assign(nth(y[3].toPtr(T_Int(32)),0), vextract2_8x16i(u2))\n ))),\n (y,x,opts) -> let(\n\t u1 := var.fresh_t(\"U\", vt), u2 := var.fresh_t(\"U\", vt), u3 := var.fresh_t(\"U\", vt),\n decl([u1, u2, u3], chain(\n assign(nth(y[1].toPtr(T_Int(32)),0), vextract2_8x16i(x)),\n assign(u1, vushuffle2_8x16i(x, [2,3,4,1])), assign(nth(y[2].toPtr(T_Int(32)),0), vextract2_8x16i(u1)),\n assign(u2, vushuffle2_8x16i(u1, [2,3,4,1])), assign(nth(y[3].toPtr(T_Int(32)),0), vextract2_8x16i(u2)),\n assign(u3, vushuffle2_8x16i(u2, [2,3,4,1])), assign(nth(y[4].toPtr(T_Int(32)),0), vextract2_8x16i(u3))\n )))\n ]\n ],\n\n svstore := ~.svstore_init(~.t),\n\n # keep the n lower scalars and zero the other ones\n optional_mask := (c, n, opts) -> Cond(IsBound(opts.trueSVSemantics) and opts.trueSVSemantics and n<>8, \n bin_and(c, vhex(List([1..8], x -> When(x<=n, \"0xFFFF\", \"0x0\")))),\n c),\n\n # Load contiguous with unaligned loads\n loadc := (self, sv, opts) >> (\n\t(y,x) -> assign(y, self.optional_mask(vloadu_8x16i(x.toPtr(self.t.t)), sv, opts))),\n\n # Load contiguous + known alignment -> using 2 aligned load to be smarter\n loadc_align := (self, sv, align, opts) >>\n ((y,x,addr) -> let(\n v1 := nth(nth(x, addr-align ).toPtr(self.t), 0),\n v2 := nth(nth(x, addr-align+8).toPtr(self.t), 0),\n mask := x -> self.optional_mask(x, sv, opts),\n Cond(align=0,\n assign(y, mask(v1)),\n\t _hasSSSE3(opts),\n assign(y, mask(alignr_8x16i(v2, v1, align*2))),\n\t # else\n assign(y, mask(bin_or(vec_shr(v1, align), vec_shl(v2, 8-align))))\n\t))),\n\n # Store contiguous unaligned\n storec_init := (vt) -> [ \n (y,x) -> assign(y, vextract1_8x16i(x, 0)),\n (y,x) -> assign(nth(y.toPtr(T_Int(32)),0), vextract2_8x16i(x)),\n (y,x) -> vstoremsk_8x16i(y.toPtr(vt.t), x, [\"0xFFFF\", \"0xFFFF\", \"0xFFFF\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\"]),\n (y,x) -> vstore4_8x16i(y.toPtr(vt), x),\n (y,x) -> vstoremsk_8x16i(y.toPtr(vt.t), x, [\"0xFFFF\", \"0xFFFF\", \"0xFFFF\", \"0xFFFF\", \"0xFFFF\", \"0x0\", \"0x0\", \"0x0\"]),\n (y,x) -> vstoremsk_8x16i(y.toPtr(vt.t), x, [\"0xFFFF\", \"0xFFFF\", \"0xFFFF\", \"0xFFFF\", \"0xFFFF\", \"0xFFFF\", \"0x0\", \"0x0\"]),\n (y,x) -> vstoremsk_8x16i(y.toPtr(vt.t), x, [\"0xFFFF\", \"0xFFFF\", \"0xFFFF\", \"0xFFFF\", \"0xFFFF\", \"0xFFFF\", \"0xFFFF\", \"0x0\"]),\n (y,x) -> vstoreu_8x16i(y.toPtr(vt), x)\n ],\n\n storec := ~.storec_init(~.t),\n\n reverse := (y,x) -> assign(vref(y,0,8), \n\tvushufflehi_8x16i(vushufflelo_8x16i(vushuffle2_8x16i(vref(x,0,8), [3,4,1,2]), [4,3,2,1]), [4,3,2,1])),\n\n # support for VS and VS.transpose()\n bin_shl1 := (self,y,x,opts) >> assign(y, vec_shl(x, 1)),\n bin_shl2 := (self,y,x,opts) >> When(_hasSSSE3(opts),\n assign(y, alignr_8x16i(x[2], x[1], 14)),\n assign(y, bin_or(vec_shr(x[1], 7), vec_shl(x[2], 1)))\n ),\n\n bin_shr1 := (self,y,x,opts) >> assign(y, vec_shr(x, 1)),\n bin_shr2 := (self,y,x,opts) >> When(_hasSSSE3(opts),\n assign(y, alignr_8x16i(x[2], x[1], 2)),\n assign(y, bin_or(vec_shr(x[1], 1), vec_shl(x[2], 7)))\n ),\n\n interleavedmask := (b,idx,x1,x2) -> assign(nth(tcast(TPtr(TSym(\"short int\")), b),idx),interleavedmask_8x16i(x1,x2)),\n\n # support for VO1dsJ(n, v)\n bin_shrev := (y,x,opts) -> let(\n\tu := var.fresh_t(\"U\", TVectDouble(8)),\n chain(\n opts.vector.isa.bin_shr2(u, [x[2], x[1]], opts),\n assign(y, vushufflehi_8x16i(vushufflelo_8x16i(vushuffle2_8x16i(u, [3,4,1,2]), [4,3,2,1]), [4,3,2,1])))\n ),\n\n mul_cx := (self, opts) >> Cond(\n # MMX and SSE can't do 8x16i\n opts.vector.SIMD in [\"MMX\", \"SSE\"],\n Error(\"SSE2 required for 8-way 16-bit integer\"),\n\n opts.vector.SIMD in [\"SSE2\", \"SSE3\"],\n (y,x,c) -> let(\n\t\tu1 := var.fresh_t(\"U\", self.t), u2 := var.fresh_t(\"U\", self.t),\n u3 := var.fresh_t(\"U\", self.t), u4 := var.fresh_t(\"U\", self.t),\n decl([u1, u2, u3, u4], chain(\n assign(u1, x * vushufflehi_8x16i(vushufflelo_8x16i(c, [1,1,3,3]), [1,1,3,3])),\n assign(u2, x * self.t.value([1,-1,1,-1,1,-1,1,-1])),\n assign(u3, u2 * vushufflehi_8x16i(vushufflelo_8x16i(c, [2,2,4,4]), [2,2,4,4])),\n assign(u4, vushufflehi_8x16i(vushufflelo_8x16i(u3, [2,1,4,3]), [2,1,4,3])),\n assign(y, add(u1, u4))))),\n # SSSE3 and higher\n (y,x,c) -> let(\n\t\tu1 := var.fresh_t(\"U\", self.t), u2 := var.fresh_t(\"U\", self.t),\n u3 := var.fresh_t(\"U\", self.t), u4 := var.fresh_t(\"U\", self.t),\n decl([u1, u2, u3, u4], chain(\n assign(u1, x * vushuffle_8x16i(c, TVect(T_Int(8), 16).value([0,1,0,1, 4,5,4,5, 8,9,8,9, 12,13,12,13]))),\n assign(u2, chs_8x16i(x, TVect(T_Int(16), 8).value([1,-1,1,-1,1,-1,1,-1]))),\n assign(u3, u2 * vushuffle_8x16i(c, TVect(T_Int(8), 16).value([2,3,2,3, 6,7,6,7, 10,11,10,11, 14,15,14,15]))),\n assign(u4, vushuffle_8x16i(u3, TVect(T_Int(8), 16).value([2,3,0,1, 6,7,4,5, 10,11,8,9, 14,15,12,13]))),\n assign(y, u1 + u4))))\n ),\n\n swap_cx := (y, x, opts) -> assign(y, vushuffle_8x16i(x, TVect(T_Int(8), 16).value([2,1,4,3, 6,5,8,7, 10,9,12,11, 14,13,16,15]))),\n RCVIxJ2 := (y, x, opts) -> assign(y, vushuffle_8x16i(x, TVect(T_Int(8), 16).value([4,5,6,7, 0,1,2,3, 12,13,14,15, 8,9,10,11]))),\n\n # computes the horizontal minimum of the vector and splats it\n hmin := (self,y,x,opts) >> Cond(\n # MMX and SSE can't do 8x16i\n opts.vector.SIMD in [\"MMX\", \"SSE\"],\n Error(\"SSE2 required for 8-way 16-bit integer\"),\n\n opts.vector.SIMD in [\"SSE2\", \"SSE3\", \"SSSE3\"], let(\n\t z := var.fresh_t(\"m\", self.t),\n\t decl([z], chain(\n\t assign(z, Cond(self.t.isSigned(), x, add(x, self.t.value(-128)))),\n\t assign(z, min(z, vushufflelo_8x16i(vushufflehi_8x16i(z, [2,1,4,3]), [2,1,4,3]))),\n\t assign(z, min(z, vushuffle_4x32i(z, [2,1,4,3]))),\n\t assign(z, min(z, vushuffle_4x32i(z, [3,4,1,2]))),\n\t assign(y, Cond(self.t.isSigned(), z, add(z, self.t.value(-128))))))),\n\t# else SSE4 - there is hmin instruction, need to put it here \n\tlet( z := var.fresh_t(\"m\", self.t),\n\t decl([z], chain(\n\t assign(z, min(x, vushufflelo_8x16i(vushufflehi_8x16i(x, [2,1,4,3]), [2,1,4,3]))),\n\t assign(z, min(z, vushuffle_4x32i(z, [2,1,4,3]))),\n\t assign(y, min(z, vushuffle_4x32i(z, [3,4,1,2]))))))\n ),\n\n));\n\n#==============================================================================================\n\n_svload_16x8i_sv1 := (cnt) -> (\n\t(y,x,opts) -> let(\n\t u := var.fresh_t(\"U\", y.t),\n\t i := Ind(idiv(cnt, 2)),\n\t c := [assign(u, vzero_8x16i())]\n\t :: List( [1..IntDouble(cnt/2.0)], i->assign(u, vload1_8x16i(u, bin_or(x[2*i-1], vec_shl(x[2*i], 1)), i-1)) )\n\t :: When( cnt mod 2 = 0, [], [assign(u, vload1_8x16i(u, x[cnt]), idiv(cnt, 2))] ),\n decl([u], chain(c, assign(y, u)))\n )\n);\n\n_svstore_16x8i_sv1 := (cnt) -> (\n\t(y,x,opts) -> let(\n\t u := var.fresh_t(\"U\", T_UInt(16)),\n\t c := ConcatList( [1..IntDouble(cnt/2.0)], i -> \n\t [ assign(u, vextract1_8x16i(x, i-1)),\n\t assign(y[2*i-1], u),\n\t assign(y[2*i ], vec_shr(u, 1)) ] )\n\t :: When( cnt mod 2 = 0, [], \n\t [ assign(u, vextract1_8x16i(x, idiv(cnt,2))),\n\t assign(y[cnt], u) ]),\n decl([u], chain(c))\n )\n);\n\nClass(SSE_16x8i, SIMD_Intel, rec(\n info := \"SSE2 16 x 8-bit int\",\n\n # experimental -- parametized ISA, is the type of each 8-bit slot in the vector\n __call__ := (self, el_t) >> WithBases(self, rec(\n t := TVect(el_t, 16), \n\tisSigned := el_t.isSigned(),\n\tisFloat := IsRealT(el_t),\n\tisFixedPoint := IsFixedPtT(el_t),\n\tsplopts := CopyFields(self.splopts, rec(XType := TPtr(el_t), YType := TPtr(el_t))),\n\tsvload := self.svload_init(TVect(el_t, 16)),\n\tsvstore := self.svstore_init(TVect(el_t, 16)),\n\tstorec := self.storec_init(TVect(el_t, 16)),\n operations := ISAOps,\n\tprint := self >> Print(self.__name__, \"(\", self.t.t, \")\"),\n\tid := self >> self.__name__ :: \"_\" :: el_t.strId(),\n )),\n\n includes := self >> [\"\"] :: self.intelCommonIncludes(), \n active := true,\n isFixedPoint := true,\n isFloat := false,\n\n isSigned := true,\n saturatedArithmetic := false,\n\n v := 16,\n t := TVect(TReal, 16),\n ctype := \"__int8\",\n instr := [vunpacklo_16x8i, vunpackhi_16x8i, vunpacklo2_16x8i, vunpackhi2_16x8i,\n vunpacklo4_16x8i, vunpackhi4_16x8i, vunpacklo8_16x8i, vunpackhi8_16x8i,\n vushuffle4_16x8i, vushufflelo2_16x8i, vushufflehi2_16x8i, \n\t vshuffle4_16x8i, vshuffle8_16x8i],\n bits := 8,\n fracbits := 6,\n vrshift := \"_mm_srli_epi8\",\n vlshift := \"_mm_slli_epi8\",\n splopts := rec(customDataType := \"char_fp4\"),\n\n # NOTE: missing .loadCont, .storeCont, .svstore\n\n # keep the n lower scalars and zero the other ones\n optional_mask := (c, n, opts) -> When(IsBound(opts.trueSVSemantics) and opts.trueSVSemantics and not(n=16),\n let(f:=\"0xFF\", z:=\"0x0\", bin_and(c,vhex(List([1..16],x->When(x<=n,f,z))))),\n c),\n\n loadCont := (self, n, y, yofs, x, xofs, xofs_align, opts) >> let(\n\ta := _unwrap(xofs_align),\n\tnn := _unwrap(n),\n\tyy := vtref(self.t, y, yofs),\n\tassign(yy, self.optional_mask(vloadu_16x8i(x + xofs), n, opts))),\n\n# ((y,x,addr) -> let(\n# v1 := nth(nth(x, addr-align ).toPtr(TVectDouble(8)), 0),\n# v2 := nth(nth(x, addr-align+8).toPtr(TVectDouble(8)), 0),\n# mask := x -> self.optional_mask(x, sv, opts),\n# Cond(align=0,\n# assign(y, mask(v1)),\n#\t _hasSSSE3(opts),\n# assign(y, mask(alignr_8x16i(v2, v1, align*2))),\n#\t # else\n# assign(y, mask(bin_or(vec_shr(v1, align),\n# vec_shl(v2, (8-align))))))\n#\t)),\n\n # NOTE: rewrite using a method, and add missing.\n svload_init := (vt) -> [\n\t[ _svload_16x8i_sv1(1),\n\t _svload_16x8i_sv1(2),\n\t _svload_16x8i_sv1(3),\n\t _svload_16x8i_sv1(4),\n\t _svload_16x8i_sv1(5),\n\t _svload_16x8i_sv1(6),\n\t _svload_16x8i_sv1(7),\n\t _svload_16x8i_sv1(8),\n\t _svload_16x8i_sv1(9),\n\t _svload_16x8i_sv1(10),\n\t _svload_16x8i_sv1(11),\n\t _svload_16x8i_sv1(12),\n\t _svload_16x8i_sv1(13),\n\t _svload_16x8i_sv1(14),\n\t _svload_16x8i_sv1(15),\n\t _svload_16x8i_sv1(16)\n ]\n ],\n\n svload := ~.svload_init(~.t),\n\n svstore_init := (vt) -> [\n\t[ _svstore_16x8i_sv1(1),\n\t _svstore_16x8i_sv1(2),\n\t _svstore_16x8i_sv1(3),\n\t _svstore_16x8i_sv1(4),\n\t _svstore_16x8i_sv1(5),\n\t _svstore_16x8i_sv1(6),\n\t _svstore_16x8i_sv1(7),\n\t _svstore_16x8i_sv1(8),\n\t _svstore_16x8i_sv1(9),\n\t _svstore_16x8i_sv1(10),\n\t _svstore_16x8i_sv1(11),\n\t _svstore_16x8i_sv1(12),\n\t _svstore_16x8i_sv1(13),\n\t _svstore_16x8i_sv1(14),\n\t _svstore_16x8i_sv1(15),\n\t _svstore_16x8i_sv1(16)\n ]\n ],\n\n svstore := ~.svstore_init(~.t),\n\n bin_shl1 := (y,x,opts) -> assign(y, vec_shl(x, 1)),\n bin_shl2 := (y,x,opts) -> assign(y, bin_or(vec_shr(x[1],15), vec_shl(x[2],1))),\n bin_shr1 := (y,x,opts) -> assign(y, vec_shr(x, 1)),\n bin_shr2 := (y,x,opts) -> assign(y, bin_or(vec_shr(x[1],1), vec_shl(x[2],15))),\n\n bin_shr := (self, y, x, shift, opts) >> assign(y, bin_and( tcast(self.t, bin_shr(tcast(TVect(T_Int(16), 8), x), shift)), \n\t TVect(T_UInt(8), 16).value(idiv(255, 2^shift)))),\n\n interleavedmask := (b,idx,x1,x2) -> chain(\n assign(nth(tcast(TPtr(TSym(\"short int\")), b), 2*idx), interleavedmasklo_16x8i(x1,x2)),\n assign(nth(tcast(TPtr(TSym(\"short int\")), b), 2*idx+1), interleavedmaskhi_16x8i(x1,x2))),\n\n average := (x1,x2) -> average_16x8i(x1,x2),\n\n #splats the first slot of the vector across the full vector\n dupload := (self, y, x) >> assign(y, vdup(x, self.v)),\n # computes the horizontal minimum of the vector and splats it\n hmin := (self,y,x,opts) >> let(\n sh_t := TVect(T_Int(64), 2),\n\tz := var.fresh_t(\"m\", self.t),\n\tdecl([z], chain(\n\t assign(z, min(vec_shr(x, 8), x)),\n\t assign(z, min(vec_shr(z, 4), z)),\n assign(z, min(vec_shr(z, 2), z)),\n assign(z, min(vec_shr(z, 1), z)),\n\t assign(z, vunpacklo_16x8i(z, z)),\n\t assign(z, vushufflelo_8x16i(z, [1,1,1,1])),\n\t assign(y, vunpacklo_2x64i(z, z))))\n ),\n\n # keep the n lower scalars and zero the other ones \n optional_mask := (c, n, opts) -> When(IsBound(opts.trueSVSemantics) and opts.trueSVSemantics and not(n=16),\n let(f:=\"0xFF\", z:=\"0x0\", bin_and(c,vhex(List([1..16],x->When(x<=n,f,z))))),\n c),\n # load contiguous with unaligned loads\n loadc := (self, sv, opts) >> ((y,x) -> assign(y, self.optional_mask(vloadu_16x8i(x.toPtr(self.t.t)), sv, opts))),\n\n # Store contiguous unaligned\n storec_init := (vt) -> [ \n (y,x) -> vstoremsk_16x8i(y.toPtr(vt.t), x, [\"0xFF\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\"]),\n #(y,x) -> assign(y, vextract2_16x8i(x, 0)),\n (y,x) -> vstoremsk_16x8i(y.toPtr(vt.t), x, [\"0xFF\", \"0xFF\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\"]),\n (y,x) -> vstoremsk_16x8i(y.toPtr(vt.t), x, [\"0xFF\", \"0xFF\", \"0xFF\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\"]),\n #(y,x) -> assign(nth(y.toPtr(TVect(vt.t, 4)),0), vextract4_16x8i(x)),\n (y,x) -> vstoremsk_16x8i(y.toPtr(vt.t), x, [\"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\"]),\n (y,x) -> vstoremsk_16x8i(y.toPtr(vt.t), x, [\"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\"]),\n (y,x) -> vstoremsk_16x8i(y.toPtr(vt.t), x, [\"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\"]),\n (y,x) -> vstoremsk_16x8i(y.toPtr(vt.t), x, [\"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\"]),\n #(y,x) -> vstore8_16x8i(y.toPtr(TVect(vt.t, 8)), x),\n (y,x) -> vstoremsk_16x8i(y.toPtr(vt.t), x, [\"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\"]),\n (y,x) -> vstoremsk_16x8i(y.toPtr(vt.t), x, [\"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\"]),\n (y,x) -> vstoremsk_16x8i(y.toPtr(vt.t), x, [\"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\"]),\n (y,x) -> vstoremsk_16x8i(y.toPtr(vt.t), x, [\"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0x0\", \"0x0\", \"0x0\", \"0x0\", \"0x0\"]),\n (y,x) -> vstoremsk_16x8i(y.toPtr(vt.t), x, [\"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0x0\", \"0x0\", \"0x0\", \"0x0\"]),\n (y,x) -> vstoremsk_16x8i(y.toPtr(vt.t), x, [\"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0x0\", \"0x0\", \"0x0\"]),\n (y,x) -> vstoremsk_16x8i(y.toPtr(vt.t), x, [\"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0x0\", \"0x0\"]),\n (y,x) -> vstoremsk_16x8i(y.toPtr(vt.t), x, [\"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0xFF\", \"0x0\"]),\n (y,x) -> vstoreu_16x8i(y.toPtr(vt), x)\n ],\n\n storec := ~.storec_init(~.t),\n));\n\nSIMD_ISA_DB.addISA(SSE_2x64f);\nSIMD_ISA_DB.addISA(SSE_2x64i);\nSIMD_ISA_DB.addISA(SSE_2x32f);\nSIMD_ISA_DB.addISA(SSE_4x32f);\nSIMD_ISA_DB.addISA(SSE_4x32i);\nSIMD_ISA_DB.addISA(SSE_8x16i);\nSIMD_ISA_DB.addISA(SSE_16x8i);\n\n\n\n\n\n\n", "meta": {"hexsha": "0c5ca5cd1cc9002d719b7d119f2247147f2e7f45", "size": 55746, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "namespaces/spiral/platforms/sse/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/sse/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/sse/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": 46.8847771236, "max_line_length": 180, "alphanum_fraction": 0.4961611595, "num_tokens": 20074, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. NO\n2. NO", "lm_q1_score": 0.3775406687981454, "lm_q2_score": 0.09009299396195183, "lm_q1q2_score": 0.034013769194422575}}
{"text": "\n## Copyright (c) 2018-2021, Carnegie Mellon University\n## See LICENSE for details\n\nImport(simt);\n\nClass(FFTXCUDAOpts, FFTXOpts, simt.TitanVDefaults, rec(\n tags := [],\n operations := rec(Print := s -> Print(\"\")), \n max_threads := 1024\n));\n\ncudaOpts := function(arg)\n local opts;\n opts := Copy(FFTXCUDAOpts);\n opts.breakdownRules.Circulant := [Circulant_PRDFT_FDataNT];\n opts.breakdownRules.PRDFT := List([PRDFT1_Base1, PRDFT1_Base2, PRDFT1_CT, PRDFT1_PF, PRDFT_PD, PRDFT_Rader], _noT);\n opts.breakdownRules.IPRDFT := List([ IPRDFT1_Base1, IPRDFT1_Base2, IPRDFT1_CT, IPRDFT_PD, IPRDFT_Rader ], _noT);\n opts.breakdownRules.PRDFT3 := List([ PRDFT3_Base1, PRDFT3_Base2, PRDFT3_CT ], _noT);\n return opts; \n\n return opts;\nend;\n\nDeclare(ParseOptsCUDA);\n\nClass(FFTXCUDADefaultConf, rec(\n getOpts := (self, t) >> ParseOptsCUDA(self, t),\n operations := rec(Print := s -> Print(\"\")),\n useCUDA := true\n));\n\nClass(FFTXCUDADeviceDefaultConf, rec(\n getOpts := (self, t) >> ParseOptsCUDA(self, t),\n operations := rec(Print := s -> Print(\"\")),\n useCUDADevice := true\n));\n\n\ncudaConf := rec(\n defaultName := \"defaultCUDAConf\",\n defaultOpts := (arg) >> FFTXCUDADefaultConf,\n devFunc := true,\n confHandler := cudaOpts \n);\n\nfftx.FFTXGlobals.registerConf(cudaConf);\n\ngetTargetOS := function()\n local tgt;\n \n if LocalConfig.osinfo.isWindows() then\n tgt := \"win-x64-cuda\";\n elif LocalConfig.osinfo.isLinux() then\n tgt := \"linux-cuda\";\n elif LocalConfig.osinfo.isDarwin() then\n tgt := \"linux-cuda\"; ## may work\n fi;\n return tgt;\nend;\n\n#--\nClass(FFTXCUDADeviceOpts, FFTXOpts, simt.TitanVDefaults, rec(\n tags := [],\n devFunc := true,\n target := rec ( name := getTargetOS() ),\n operations := rec(Print := s -> Print(\"\")) \n));\n\ncudaDeviceOpts := function(arg) # specific to WarpX size 100...\n local opts;\n opts := Copy(FFTXCUDADeviceOpts);\n opts.breakdownRules.Circulant := [Circulant_PRDFT_FDataNT];\n opts.breakdownRules.PRDFT := List([PRDFT1_Base1, PRDFT1_Base2, CopyFields(PRDFT1_CT, \n rec(allChildren := P ->Filtered(PRDFT1_CT.allChildren(P), i->When(P[1] = 100, Cols(i[1]) = 4, true)))), \n PRDFT_PD], _noT);\n opts.breakdownRules.IPRDFT := List([ IPRDFT1_Base1, IPRDFT1_Base2, IPRDFT1_CT, IPRDFT_PD ], _noT);\n opts.breakdownRules.PRDFT3 := List([ PRDFT3_Base1, PRDFT3_Base2, PRDFT3_CT ], _noT);\n opts.breakdownRules.DFT := [ DFT_Base, \n CopyFields(DFT_CT, rec(children := nt ->Filtered(DFT_CT.children(nt), i->When(nt.params[1] = 100, Cols(i[1]) = 4, true)))), \n DFT_PD ];\n opts.breakdownRules.TTensorInd := [dsA_base, L_dsA_L_base, dsA_L_base, L_dsA_base]; \n return opts;\nend;\n\n\ncudaDeviceConf := rec(\n defaultName := \"defaultCUDADeviceConf\",\n defaultOpts := (arg) >> FFTXCUDADeviceDefaultConf,\n confHandler := cudaDeviceOpts \n);\n\nfftx.FFTXGlobals.registerConf(cudaDeviceConf);\n\n\n# this is a first experimental opts-deriving logic. This needs to be done extensible and properly\nParseOptsCUDA := function(conf, t)\n local tt, _tt, _conf, _opts, _HPCSupportedSizesCUDA, _thold;\n \n # all dimensions need to be inthis array for the high perf MDDFT conf to kick in for now\n # size 320 is problematic at this point and needs attention. Need support for 3 stages to work first\n\n _HPCSupportedSizesCUDA := [80, 96, 100, 224, 320];\n _thold := 16;\n \n if IsBound(conf.useCUDADevice) then \n # detect real MD convolution\n _tt := Collect(t, RCDiag)::Collect(t, MDPRDFT)::Collect(t, IMDPRDFT)::Collect(t, TTensorI);\n if Length(_tt) = 4 then\n _conf := FFTXGlobals.confWarpXCUDADevice();\n _opts := FFTXGlobals.getOpts(_conf); \n return _opts;\n fi; \n\n # detect batch of DFT/PRDFT/MDDFT/MDPRDFT\n if ((Length(Collect(t, TTensorInd)) >= 1) or (Length(Collect(t, TTensorI)) >= 1)) and \n ((Length(Collect(t, DFT)) = 1) or (Length(Collect(t, PRDFT)) = 1) or (Length(Collect(t, IPRDFT)) = 1) or\n (Length(Collect(t, MDDFT)) >= 1) or (Length(Collect(t, MDPRDFT)) >= 1) or (Length(Collect(t, IMDPRDFT)) >= 1)) then\n _conf := FFTXGlobals.confBatchFFTCUDADevice();\n _opts := FFTXGlobals.getOpts(_conf);\n return _opts;\n fi;\n \n # detect 3D DFT\n _tt := Collect(t, MDDFT)::Collect(t, MDPRDFT)::Collect(t, IMDPRDFT);\n if Length(_tt) = 1 and Length(_tt[1].params[1]) = 3 then\n _conf := FFTXGlobals.confFFTCUDADevice();\n _opts := FFTXGlobals.getOpts(_conf);\n\n # opts for high performance CUDA cuFFT\n if Length(Filtered(_tt, i -> ObjId(i) = MDDFT)) > 0 and ForAll(_tt[1].params[1], i-> i in _HPCSupportedSizesCUDA) then\n _opts.breakdownRules.MDDFT := [fftx.platforms.cuda.MDDFT_tSPL_Pease_SIMT];\n _opts.breakdownRules.TTwiddle := [ TTwiddle_Tw1 ];\n _opts.tags := [ASIMTKernelFlag(ASIMTGridDimX), ASIMTBlockDimY, ASIMTBlockDimX];\n \n _opts.globalUnrolling := 2*_thold + 1;\n\n _opts.breakdownRules.TTensorI := [CopyFields(IxA_L_split, rec(switch := true)), fftx.platforms.cuda.L_IxA_SIMT]::_opts.breakdownRules.TTensorI;\n _opts.breakdownRules.DFT := [CopyFields(DFT_tSPL_CT, rec(switch := true, \n filter := e-> When(e[1]*e[2] <= _thold^2, e[1] <= _thold and e[2] <= _thold, e[1] <= _thold and e[2] >= _thold)))]::_opts.breakdownRules.DFT;\n \n _opts.unparser.simt_synccluster := _opts.unparser.simt_syncblock;\n _opts.postProcessSums := (s, opts) -> let(s1 := ApplyStrategy(s, [ MergedRuleSet(RulesFuncSimp, RulesSums, RulesSIMTFission) ], BUA, opts),\n FixUpCUDASigmaSPL_3Stage(s1, opts)); \n\n _opts.operations.Print := s -> Print(\"\");\n\n fi;\n \n return _opts;\n fi;\n \n # promote with default conf rules\n tt := _promote1(Copy(t));\n\n if ObjId(tt) = TFCall then\n _tt := tt.params[1];\n # check for convolution\n if (ObjId(_tt) in [MDRConv, MDRConvR]) or ((ObjId(_tt) = TTensorI) and (ObjId(_tt.params[1]) in [MDRConv, MDRConvR])) then \n _conf := FFTXGlobals.confMDRConvCUDADevice();\n _opts := FFTXGlobals.getOpts(_conf);\n return _opts;\n fi;\n # check for Hockney. This is for N=130\n if ObjId(_tt) = IOPrunedMDRConv and _tt.params[1] = [130,130,130] then\n _conf := FFTXGlobals.confHockneyMlcCUDADevice();\n _opts := FFTXGlobals.getOpts(_conf);\n return _opts;\n fi;\n # check for general Hockney. \n if ObjId(_tt) = IOPrunedMDRConv then\n _conf := FFTXGlobals.confMDRConvCUDADevice();\n _opts := FFTXGlobals.getOpts(_conf);\n _opts.tags := [ASIMTKernelFlag(ASIMTGridDimY), ASIMTGridDimX, ASIMTBlockDimZ];\n return _opts;\n fi;\n fi;\n\n # check for WarpX\n _conf := FFTXGlobals.confWarpXCUDADevice();\n _opts := FFTXGlobals.getOpts(_conf);\n tt := _opts.preProcess(Copy(t));\n if ObjId(tt) = TFCall and ObjId(tt.params[1]) = TCompose then\n _tt := tt.params[1].params[1];\n # detect promoted WarpX\n if IsList(_tt) and Length(_tt) = 3 and List(_tt, ObjId) = [ TNoDiagPullinRight, TRC, TNoDiagPullinLeft ] then\n return _opts;\n fi;\n fi;\n # we are doing nothing special\n return FFTXGlobals.getOpts(conf); \n fi;\n if IsBound(conf.useCUDA) then \n return FFTXGlobals.getOpts(conf); \n fi;\n \n # Here we have to handle GPU configs\n Error(\"Don't know how to derive opts!\\n\");\nend; \n", "meta": {"hexsha": "101c32f3cf6f675817471db5fa98be4e04236d5d", "size": 8060, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "platforms/cuda/opts.gi", "max_stars_repo_name": "broderickpt/spiral-package-fftx", "max_stars_repo_head_hexsha": "f6c0faea418e5f876ab695a1f7bbc88ed35c88cc", "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": "platforms/cuda/opts.gi", "max_issues_repo_name": "broderickpt/spiral-package-fftx", "max_issues_repo_head_hexsha": "f6c0faea418e5f876ab695a1f7bbc88ed35c88cc", "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": "platforms/cuda/opts.gi", "max_forks_repo_name": "broderickpt/spiral-package-fftx", "max_forks_repo_head_hexsha": "f6c0faea418e5f876ab695a1f7bbc88ed35c88cc", "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": 40.3, "max_line_length": 161, "alphanum_fraction": 0.6135235732, "num_tokens": 2427, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. NO\n2. NO", "lm_q1_score": 0.46879061178313897, "lm_q2_score": 0.07159119845413339, "lm_q1q2_score": 0.033561281721601305}}
{"text": "\n# Copyright (c) 2018-2021, Carnegie Mellon University\n# See LICENSE for details\n\n\n# Here we define shorter print functions for common constructs.\n# Loading this file will cause more compact printing of formulas,\n# but the output can not be pasted back into GAP.\n#\n\nImport(formgen, code);\n\nDiag.print := (s,i,is) >> Print(\"D\");\nBlk.print := (s,i,is) >> Print(\"B\");\n\nGath._sym := true;\nScat._sym := true;\nDiag._sym := true;\nBlk._sym := true;\n\nHideRTWrap := function()\n RTWrap._origprint := RTWrap.print;\n RTWrap.print := (self,i,is) >> Print(self.rt.node);\nend;\n\nShowRTWrap := function()\n if IsBound(RTWrap._origprint)\n then RTWrap.print := RTWrap._origprint;\n fi;\nend;\n", "meta": {"hexsha": "5af23e345445563f5d7937dffcff6f680878ac23", "size": 683, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "namespaces/spiral/veryshortprint.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/veryshortprint.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/veryshortprint.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": 22.0322580645, "max_line_length": 65, "alphanum_fraction": 0.6808199122, "num_tokens": 191, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. NO\n2. NO\n\n", "lm_q1_score": 0.4532618480153861, "lm_q2_score": 0.07055960351653444, "lm_q1q2_score": 0.03198197628513733}}
{"text": "#In GAP strings are lists of characters. An affectation simply copy references\na := \"more\";\nb := a;\nb{[1..4]} := \"less\";\na;\n# \"less\"\n\n# Here is a true copy\na := \"more\";\nb := ShallowCopy(a);\nb{[1..4]} := \"less\";\na;\n# \"more\"\n", "meta": {"hexsha": "876fab4fc58d172b8172b0c5d8f9a0cd8dea9b00", "size": 223, "ext": "gap", "lang": "GAP", "max_stars_repo_path": "Task/Copy-a-string/GAP/copy-a-string.gap", "max_stars_repo_name": "LaudateCorpus1/RosettaCodeData", "max_stars_repo_head_hexsha": "9ad63ea473a958506c041077f1d810c0c7c8c18d", "max_stars_repo_licenses": ["Info-ZIP"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2018-11-09T22:08:38.000Z", "max_stars_repo_stars_event_max_datetime": "2018-11-09T22:08:38.000Z", "max_issues_repo_path": "Task/Copy-a-string/GAP/copy-a-string.gap", "max_issues_repo_name": "seanwallawalla-forks/RosettaCodeData", "max_issues_repo_head_hexsha": "9ad63ea473a958506c041077f1d810c0c7c8c18d", "max_issues_repo_licenses": ["Info-ZIP"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Task/Copy-a-string/GAP/copy-a-string.gap", "max_forks_repo_name": "seanwallawalla-forks/RosettaCodeData", "max_forks_repo_head_hexsha": "9ad63ea473a958506c041077f1d810c0c7c8c18d", "max_forks_repo_licenses": ["Info-ZIP"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2018-11-09T22:08:40.000Z", "max_forks_repo_forks_event_max_datetime": "2018-11-09T22:08:40.000Z", "avg_line_length": 15.9285714286, "max_line_length": 78, "alphanum_fraction": 0.5784753363, "num_tokens": 78, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. NO\n2. NO\n\n", "lm_q1_score": 0.5, "lm_q2_score": 0.06278920640484009, "lm_q1q2_score": 0.031394603202420046}}
{"text": "# At top level, global variables are declared when they are assigned, so one only writes\nglobal_var := 1;\n\n# In a function, local variables are declared like this\nfunc := function(n)\n local a;\n a := n*n;\n return n + a;\nend;\n\n# One can test whether a variable is assigned\nIsBound(global_var);\n# true;\n\n# And destroy a variable\nUnbind(global_var);\n\n# This works with list elements too\nu := [11, 12, , 14];\nIsBound(u[4]);\n# true\nIsBound(u[3]);\n# false\nUnbind(u[4]);\n", "meta": {"hexsha": "0be16d9f6d8ff0241f1f594228595cfef3dea9fc", "size": 472, "ext": "gap", "lang": "GAP", "max_stars_repo_path": "Task/Variables/GAP/variables.gap", "max_stars_repo_name": "LaudateCorpus1/RosettaCodeData", "max_stars_repo_head_hexsha": "9ad63ea473a958506c041077f1d810c0c7c8c18d", "max_stars_repo_licenses": ["Info-ZIP"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2018-11-09T22:08:38.000Z", "max_stars_repo_stars_event_max_datetime": "2018-11-09T22:08:38.000Z", "max_issues_repo_path": "Task/Variables/GAP/variables.gap", "max_issues_repo_name": "seanwallawalla-forks/RosettaCodeData", "max_issues_repo_head_hexsha": "9ad63ea473a958506c041077f1d810c0c7c8c18d", "max_issues_repo_licenses": ["Info-ZIP"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Task/Variables/GAP/variables.gap", "max_forks_repo_name": "seanwallawalla-forks/RosettaCodeData", "max_forks_repo_head_hexsha": "9ad63ea473a958506c041077f1d810c0c7c8c18d", "max_forks_repo_licenses": ["Info-ZIP"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2018-11-09T22:08:40.000Z", "max_forks_repo_forks_event_max_datetime": "2018-11-09T22:08:40.000Z", "avg_line_length": 18.88, "max_line_length": 88, "alphanum_fraction": 0.6779661017, "num_tokens": 133, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. NO\n2. NO", "lm_q1_score": 0.34510527095787247, "lm_q2_score": 0.09009300129119968, "lm_q1q2_score": 0.03109156962200742}}
{"text": "\n# Copyright (c) 2018-2021, Carnegie Mellon University\n# See LICENSE for details\n\n\n#F VTCast(, , , )\n#F\nClass(VTCast, TCast, rec( # TCast is a symbol. So all parameters go into .params \n abbrevs := [],\n def := (n, to_type, from_type, v) -> Perm((), n)\n));\n\n", "meta": {"hexsha": "ce0411376d658a60a93d977cc0126a256c962f82", "size": 289, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "namespaces/spiral/paradigms/vector/sigmaspl/vtcast.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/vector/sigmaspl/vtcast.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/vector/sigmaspl/vtcast.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": 22.2307692308, "max_line_length": 81, "alphanum_fraction": 0.6262975779, "num_tokens": 96, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. NO\n2. NO\n\n", "lm_q1_score": 0.48438008427698437, "lm_q2_score": 0.06278921473524327, "lm_q1q2_score": 0.0304138451251428}}
{"text": "\n# Copyright (c) 2018-2021, Carnegie Mellon University\n# See LICENSE for details\n\n\nClass(SymSPL, BaseContainer, SumsBase, rec(\n isBlock:=true,\n transpose := self >> self,\n rng:=self>>self._children[1].rng(),\n dmn:=self>>self._children[1].dmn(),\n vcost := self >> self._children[1].vcost()\n));\n", "meta": {"hexsha": "19d64e88868fed52f61bd8ef1fcc75ab3dd5b095", "size": 308, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "namespaces/spiral/paradigms/common/sigmaspl.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/sigmaspl.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/sigmaspl.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": 23.6923076923, "max_line_length": 53, "alphanum_fraction": 0.6525974026, "num_tokens": 95, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. NO\n2. NO\n\n", "lm_q1_score": 0.42250463481418826, "lm_q2_score": 0.07055960351653445, "lm_q1q2_score": 0.0298117595163873}}
{"text": "#############################################################################\n####\n##\n#A anupq.gi ANUPQ package Eamonn O'Brien\n#A & Frank Celler\n##\n#Y Copyright 1992-1994, Lehrstuhl D fuer Mathematik, RWTH Aachen, Germany\n#Y Copyright 1992-1994, School of Mathematical Sciences, ANU, Australia\n##\n\n#############################################################################\n##\n#F ANUPQDirectoryTemporary( ) . . . . . redefine ANUPQ temp directory\n##\n## calls the UNIX command `mkdir' to create , which must be a string,\n## and if successful a directory object for is both assigned to\n## `ANUPQData.tmpdir' and returned. The field `ANUPQData.outfile' is also\n## set to be a file in `ANUPQData.tmpdir', and on exit from {\\GAP} is\n## removed.\n##\nInstallGlobalFunction(ANUPQDirectoryTemporary, function(dir)\nlocal created;\n\n # check arguments\n if not IsString(dir) then\n Error(\n \"usage: ANUPQDirectoryTemporary( ) : must be a string.\\n\");\n fi; \n\n # create temporary directory\n CreateDir(dir);\n if not IsDirectoryPath(dir) then\n return fail;\n fi;\n\n Add( GAPInfo.DirectoriesTemporary, dir );\n ANUPQData.tmpdir := Directory(dir);\n ANUPQData.outfile := Filename(ANUPQData.tmpdir, \"PQ_OUTPUT\");\n return ANUPQData.tmpdir;\nend);\n\n#############################################################################\n##\n#F ANUPQerrorPq( ) . . . . . . . . . . . . . . . . . report an error\n##\nInstallGlobalFunction( ANUPQerrorPq, function( param )\n Error(\n \"Valid Options:\\n\",\n \" \\\"ClassBound\\\", \\n\",\n \" \\\"Prime\\\", \\n\",\n \" \\\"Exponent\\\", \\n\",\n \" \\\"Metabelian\\\"\\n\",\n \" \\\"OutputLevel\\\", \\n\",\n \" \\\"Verbose\\\"\\n\",\n \" \\\"SetupFile\\\", \\n\",\n \" \\\"PqWorkspace\\\", \\n\",\n \"Illegal Parameter: \\\"\", param, \"\\\"\" );\nend );\n\n#############################################################################\n##\n#F ANUPQextractPqArgs( ) . . . . . . . . . . . . . extract arguments\n##\nInstallGlobalFunction( ANUPQextractPqArgs, function( args )\n local CR, i, act, match;\n\n # allow to give only a prefix\n match := function( g, w )\n \treturn 1 < Length(g) \n and Length(g) <= Length(w) \n and w{[1..Length(g)]} = g;\n end;\n\n # extract arguments\n CR := rec();\n i := 2;\n while i <= Length(args) do\n act := args[i];\n if not IsString( act ) then ANUPQerrorPq( act ); fi;\n\n \t# \"ClassBound\", \n if match( act, \"ClassBound\" ) then\n i := i + 1;\n CR.ClassBound := args[i];\n\n \t# \"Prime\", \n elif match( act, \"Prime\" ) then\n i := i + 1;\n CR.Prime := args[i];\n\n \t# \"Exponent\", \n elif match( act, \"Exponent\" ) then\n i := i + 1;\n CR.Exponent := args[i];\n\n # \"Metabelian\"\n elif match( act, \"Metabelian\" ) then\n CR.Metabelian := true;\n\n \t# \"Output\", \n elif match( act, \"OutputLevel\" ) then\n i := i + 1;\n CR.OutputLevel := args[i];\n \t CR.Verbose := true;\n\n \t# \"SetupFile\", \n elif match( act, \"SetupFile\" ) then\n \t i := i + 1;\n CR.SetupFile := args[i];\n\n \t# \"PqWorkspace\", \n elif match( act, \"PqWorkspace\" ) then\n \t i := i + 1;\n CR.PqWorkspace := args[i];\n\n \t# \"Verbose\"\n elif match( act, \"Verbose\" ) then\n CR.Verbose := true;\n\n \t# signal an error\n \telse\n ANUPQerrorPq( act );\n\n \tfi; \n \ti := i + 1; \n od;\n return CR;\n\nend );\n\n#############################################################################\n##\n#V ANUPQGlobalVariables\n##\nInstallValue( ANUPQGlobalVariables, \n [ \"F\", # a free group\n \"MapImages\" # images of the generators in G\n ] );\n\n#############################################################################\n##\n#F ANUPQReadOutput . . . . read pq output without affecting global variables\n##\nInstallGlobalFunction( ANUPQReadOutput, function( file )\n local globalvars, var, result;\n\n globalvars := [ \"ANUPQmagic\", \"ANUPQautos\", \"ANUPQgroups\" ];\n\n for var in globalvars do\n HideGlobalVariables( var );\n od;\n\n Read( file );\n\n result := rec();\n\n for var in globalvars do\n if IsBoundGlobal( var ) then\n result.(var) := ValueGlobal( var );\n else\n result.(var) := fail;\n fi;\n od;\n\n for var in globalvars do\n UnhideGlobalVariables( var );\n od;\n \n return result;\nend );\n\n#############################################################################\n##\n#F PqEpimorphism( : ) . . . . . epimorphism onto p-quotient\n##\nInstallGlobalFunction( PqEpimorphism, function( arg )\n return PQ_EPI_OR_PCOVER(arg : PqEpiOrPCover := \"pQepi\");\nend );\n\n#############################################################################\n##\n#F Pq( : ) . . . . . . . . . . . . . . . . . . . p-quotient\n##\nInstallGlobalFunction( Pq, function( arg )\n return PQ_EPI_OR_PCOVER(arg : PqEpiOrPCover := \"pQuotient\");\nend );\n\n#############################################################################\n##\n#F PqPCover( : ) . . . . . . p-covering group of p-quotient\n##\nInstallGlobalFunction( PqPCover, function( arg )\n return PQ_EPI_OR_PCOVER(arg : PqEpiOrPCover := \"pCover\");\nend );\n\n#############################################################################\n##\n#F PQ_GROUP_FROM_PCP(,) . extract gp from pq pcp file into GAP\n##\nInstallGlobalFunction( PQ_GROUP_FROM_PCP, function( datarec, out )\n local gens;\n HideGlobalVariables( \"F\", \"MapImages\" );\n Read( datarec.outfname );\n if out = \"pCover\" then\n datarec.pCover := ValueGlobal( \"F\" );\n IsPGroup( datarec.pCover );\n else\n if IsBound(datarec.pcgs) then\n gens := datarec.pcgs;\n else\n gens := GeneratorsOfGroup( datarec.group );\n fi;\n datarec.pQepi := GroupHomomorphismByImagesNC( \n datarec.group,\n ValueGlobal( \"F\" ),\n gens,\n ValueGlobal( \"MapImages\" )\n );\n SetIsSurjective( datarec.pQepi, true );\n datarec.pQuotient := Image( datarec.pQepi );\n IsPGroup( datarec.pQuotient );\n fi;\n UnhideGlobalVariables( \"F\", \"MapImages\" );\nend );\n\n#############################################################################\n##\n#F TRIVIAL_PQ_GROUP(, ) . . . extract gp when trivial into GAP\n##\nInstallGlobalFunction( TRIVIAL_PQ_GROUP, function( datarec, out )\nlocal Q;\n Q := TrivialGroup( IsPcGroup );\n if out = \"pCover\" then\n datarec.pCover := Q;\n IsPGroup( datarec.pCover );\n else\n datarec.pQepi := GroupHomomorphismByFunction( \n datarec.group, Q, g -> One(Q) );\n SetIsSurjective( datarec.pQepi, true );\n datarec.pQuotient := Image( datarec.pQepi );\n IsPGroup( datarec.pQuotient );\n fi;\nend );\n\n#############################################################################\n##\n#F PQ_EPI_OR_PCOVER(:) . p-quotient, its epi. or its p-cover\n##\nInstallGlobalFunction( PQ_EPI_OR_PCOVER, function( args )\n local out, datarec, AtClass, trivial;\n\n out := ValueOption(\"PqEpiOrPCover\");\n datarec := ANUPQ_ARG_CHK(\"Pq\", args);\n datarec.filter := [\"Output file in\", \"Group presentation\"];\n VALUE_PQ_OPTION(\"Identities\", [], datarec);\n if datarec.calltype = \"GAP3compatible\" then\n # ANUPQ_ARG_CHK calls PQ_EPI_OR_PCOVER itself in this case\n # (so datarec.(out) has already been computed)\n return datarec.(out);\n fi;\n trivial := IsEmpty( datarec.group!.GeneratorsOfMagmaWithInverses );\n if trivial then\n ; #the `pq' binary spits out nonsense if given a trivial pres'n\n elif datarec.calltype = \"interactive\" and \n ( IsBound(datarec.pQuotient) or IsBound(datarec.pCover) ) then\n AtClass := function()\n return IsBound(datarec.complete) and datarec.complete or\n IsBound(datarec.class) and datarec.class = datarec.ClassBound;\n end;\n\n if IsBound(datarec.pcoverclass) and \n datarec.pcoverclass = datarec.class and not AtClass() then\n # ``reduce'' the p-cover to a p-class\n PQ_FINISH_NEXT_CLASS( datarec );\n fi;\n while not AtClass() do\n PQ_NEXT_CLASS( datarec );\n od;\n # the following is not executed if the while-loop is \n # executed at least once\n if IsBound( datarec.(out) ) then\n return datarec.(out); # it had already been computed\n fi;\n else\n PQ_PC_PRESENTATION(datarec, \"pQ\");\n if datarec.class < Minimum(63, datarec.ClassBound) then\n datarec.complete := true;\n fi;\n fi;\n\n trivial := trivial or IsEmpty(datarec.ngens) or datarec.ngens[1] = 0;\n if not trivial then\n if out = \"pCover\" then\n PQ_P_COVER( datarec );\n fi;\n\n PushOptions( rec(nonuser := true) );\n PQ_WRITE_PC_PRESENTATION(datarec, datarec.outfname);\n PopOptions();\n fi;\n \n if datarec.calltype = \"non-interactive\" then\n PQ_COMPLETE_NONINTERACTIVE_FUNC_CALL(datarec);\n if IsBound( datarec.setupfile ) then\n if trivial then\n return fail;\n fi;\n return true;\n fi;\n fi;\n \n if trivial then\n TRIVIAL_PQ_GROUP( datarec, out );\n else\n # read group and images from file\n PQ_GROUP_FROM_PCP( datarec, out );\n fi;\n return datarec.(out);\nend );\n\n#############################################################################\n##\n#F PqRecoverDefinitions( ) . . . . . . . . . . . . . . . . . definitions\n##\n## This function finds a definition for each generator of the p-group .\n## These definitions need not be the same as the ones used by pq. But\n## they serve the purpose of defining each generator as a commutator or\n## power of earlier ones. This is useful for extending an automorphism that\n## is given on a set of minimal generators of .\n##\nInstallGlobalFunction( PqRecoverDefinitions, function( G )\n local col, gens, definitions, h, g, rhs, gen;\n\n col := ElementsFamily( FamilyObj( G ) )!.rewritingSystem;\n gens := GeneratorsOfRws( col );\n\n definitions := [];\n\n for h in [1..NumberGeneratorsOfRws( col )] do\n rhs := GetPowerNC( col, h );\n if Length( rhs ) = 1 then\n gen := Position( gens, rhs );\n if not IsBound( definitions[gen] ) then\n definitions[gen] := h;\n fi;\n fi;\n \n for g in [1..h-1] do\n rhs := GetConjugateNC( col, h, g );\n if Length( rhs ) = 2 then\n gen := SubSyllables( rhs, 2, 2 );\n gen := Position( gens, gen );\n if not IsBound( definitions[gen] ) then\n definitions[gen] := [h, g];\n fi;\n fi;\n od;\n od;\n return definitions;\nend );\n\n#############################################################################\n##\n#F PqAutomorphism( , ) . . . . . . . . . . . . definitions\n##\n## Take an automorphism of the preimage and produce the induced automorphism\n## of the image of the epimorphism.\n##\nInstallGlobalFunction( PqAutomorphism, function( epi, autoimages )\n local G, p, gens, definitions, d, epimages, i, pos, def, \n phi;\n\n G := Image( epi );\n p := PrimePGroup( G );\n gens := GeneratorsOfGroup( G );\n \n autoimages := List( autoimages, im->Image( epi, im ) );\n\n ## Get a definition for each generator.\n definitions := PqRecoverDefinitions( G );\n d := Number( [1..Length(definitions)], \n i->not IsBound( definitions[i] ) );\n\n ## Find the images for the defining generators of G under the\n ## automorphism. We have to be careful, as some of the generators for\n ## the source might be redundant as generators of G.\n epimages := List( GeneratorsOfGroup(Source(epi)), g->Image(epi,g) );\n for i in [1..d] do\n ## Find G.i ...\n pos := Position( epimages, G.(i) );\n if pos = fail then \n Error( \"generators \", i, \"not image of a generators\" );\n fi;\n ## ... and set its image.\n definitions[i] := autoimages[pos];\n od;\n \n ## Replace each definition by its image under the automorphism.\n for i in [d+1..Length(definitions)] do\n def := definitions[i];\n if IsInt( def ) then\n definitions[i] := definitions[ def ]^p;\n else\n definitions[i] := Comm( definitions[ def[1] ],\n definitions[ def[2] ] );\n fi;\n od;\n \n phi := GroupHomomorphismByImages( G, G, gens, definitions );\n SetIsBijective( phi, true );\n\n return phi;\nend );\n\n#############################################################################\n##\n#F PqLeftNormComm( ) . . . . . . . . . . . . . left norm commutator\n##\n## returns for a list of words in the generators of a group the left\n## norm commutator of , e.g.~if , , are words in the\n## generators of some free or fp group then `PqLeftNormComm( [, ,\n## ] );' is equivalent to `Comm( Comm( , ), );'. Actually,\n## the only restrictions on are that must constitute a list\n## of group elements of the same group (so a list of permutations is\n## allowed, for example) and that must contain at least *two* words.\n##\nInstallGlobalFunction( PqLeftNormComm, function( words )\nlocal fam, comm, word;\n if not IsList(words) or 2 > Length(words) or \n not ForAll(words, IsMultiplicativeElementWithInverse) then\n Error( \" should be a list of at least 2 group elements\\n\" );\n else\n fam := FamilyObj(words[1]);\n if not ForAll(words, w -> IsIdenticalObj(FamilyObj(w), fam)) then\n Error( \" should belong to the same group\\n\" );\n fi;\n fi;\n comm := words[1];\n for word in words{[2 .. Length(words)]} do\n comm := Comm(comm, word);\n od;\n return comm;\nend );\n\n#############################################################################\n##\n#F PqGAPRelators( , ) . . . . . . . . pq relators as GAP words\n##\n## returns a list of words that {\\GAP} understands, given a list of\n## strings in the string representations of the generators of the fp group\n## prepared as a list of relators for the `pq' program.\n##\n## *Note:*\n## The `pq' program does not use `/' to indicate multiplication by an\n## inverse and uses square brackets to represent (left normed) commutators.\n## Also, even though the `pq' program accepts relations, all elements of\n## *must* be in relator form, i.e.~a relation of form ` = '\n## must be written as `*()^-1'.\n##\n## Here is an example:\n##\n## \\beginexample\n## gap> F := FreeGroup(\"a\", \"b\");\n## gap> PqGAPRelators(F, [ \"a*b^2\", \"[a,b]^2*a\", \"([a,b,a,b,b]*a*b)^2*a\" ]);\n## [ a*b^2, a^-1*b^-1*a*b*a^-1*b^-1*a*b*a, b^-1*a^-1*b^-1*a^-1*b*a*b^-1*a*b*a^\n## -1*b*a^-1*b^-1*a*b*a*b^-1*a^-1*b^-1*a^-1*b*a*b^-1*a*b^-1*a^-1*b*a^-1*b^\n## -1*a*b*a*b*a^-1*b*a*b^-1*a*b*a^-1*b*a^-1*b^-1*a*b*a*b^-1*a^-1*b^-1*a^\n## -1*b*a*b^-1*a*b^-1*a^-1*b*a^-1*b^-1*a*b*a*b^2*a*b*a ]\n## \\endexample\n##\nInstallGlobalFunction( PqGAPRelators, function( group, rels )\nlocal gens, relgens, diff, g;\n if not( IsFpGroup(group) ) then\n Error(\" must be an fp group\\n\");\n fi;\n gens := List( FreeGeneratorsOfFpGroup(group), String );\n if not ForAll(rels, rel -> Position(rel, '/') = fail) then\n Error( \"pq binary does not understand `/' in relators\\n\" );\n fi;\n relgens := Set( Concatenation( \n List( rels, rel -> Filtered(\n SplitString(rel, \"\", \"*[]()^, \"),\n str -> Int(str) = fail) ) ) );\n diff := Difference(relgens, gens);\n if not IsEmpty(diff) then\n Error( \"generators: \", diff, \n \"\\nare not among the generators of the group supplied\\n\" );\n fi;\n CallFuncList(HideGlobalVariables, gens);\n for g in FreeGeneratorsOfFpGroup(group) do\n ASS_GVAR(String(g), g);\n od;\n rels := List( rels, rel -> EvalString(\n ReplacedString(\n ReplacedString(rel, \"]\", \"])\"),\n \"[\", \"PqLeftNormComm([\"\n ) ) );\n CallFuncList(UnhideGlobalVariables, gens);\n return rels;\nend );\n\n#############################################################################\n##\n#F PqParseWord( , ) . . . . . . . . . . . . parse word through GAP\n#F PqParseWord( , )\n##\n## parse through {\\GAP}, where is a string representing a word\n## in the generators of (the first form of `PqParseWord') or pc\n## generators `x1,...,x'. `PqParseWord' is provided as a rough-and-ready\n## check of for syntax errors. A syntax error will cause the entering\n## of a `break'-loop, in which the error message may or may not be\n## meaningful (depending on whether the syntax error gets caught at the\n## {\\GAP} or kernel level).\n##\n## *Note:*\n## The reason the generators *must* be `x1,...,x' in the second form of\n## `PqParseWord' is that these are the pc generator names used by the `pq'\n## program (as distinct from the generator names for the group provided by\n## the user to a function like `Pq' that invokes the `pq' program).\n##\nInstallGlobalFunction( PqParseWord, function( n, word )\nlocal ParseOnBreak, ParseOnBreakMessage, NormalOnBreak, NormalOnBreakMessage,\n parts, gens;\n\n if IsGroup(n) or\n Position(word, '[') <> fail or Position(word, '(') <> fail then\n #pass word through GAP's parser to see if it's ok\n \n NormalOnBreak := OnBreak;\n ParseOnBreak := function()\n Where(0);\n OnBreak := NormalOnBreak;\n end;\n OnBreak := ParseOnBreak;\n\n if IsFunction(OnBreakMessage) then\n NormalOnBreakMessage := OnBreakMessage;\n ParseOnBreakMessage := function()\n Print( \" syntax error in: \", word, \"\\n\" );\n Print( \" you can type: 'quit;' to quit to outer loop.\\n\" );\n OnBreakMessage := NormalOnBreakMessage;\n end;\n OnBreakMessage := ParseOnBreakMessage;\n fi;\n\n if IsGroup(n) then\n PqGAPRelators(n, [ word ]);\n else\n PqGAPRelators(FreeGroup(n, \"x\"), [ word ]);\n fi;\n\n OnBreak := NormalOnBreak;\n if IsFunction(OnBreakMessage) then\n OnBreakMessage := NormalOnBreakMessage;\n fi;\n \n else\n parts := List( SplitString(word, \"*\"), part -> SplitString(part, \"^\") );\n if ForAny( parts, part -> 2 < Length(part) or\n 2 = Length(part) and not IsInt( Int(part[2]) ) )\n then\n Error( \"detected invalid exponent in argument : \", word, \"\\n\");\n fi;\n if ForAny( parts, part -> IsEmpty( part[1] ) or part[1][1] <> 'x' ) then\n Error( \"generators in argument must all be of form:\\n\",\n \"`x' for some integer \\n\" );\n fi;\n gens := List( parts, part -> Int( part[1]{[2 .. Length(part[1])]} ) );\n if not ForAll(gens, gen -> IsPosInt(gen) and gen <= n) then\n Error( \"generators in argument must be in the range: \",\n \"x1,...,x\", n, \"\\n\" );\n fi;\n fi;\n return true;\nend );\n\n#############################################################################\n##\n#F PQ_EVALUATE( ) . . . . . . . . . evaluate a string emulating GAP\n##\n## For each substring of the string that is a statement (i.e. ends\n## in a `;'), `PQ_EVALUATE( )' evaluates it in the same way {\\GAP}\n## would. If the substring is further followed by a `;' (i.e. there was\n## `;;'), this is an indication that the statement would produce no output;\n## otherwise the output that the user would normally see if she typed the\n## statement interactively is displayed.\n##\nInstallGlobalFunction(PQ_EVALUATE, function(string)\nlocal from, pos, statement, parts, var;\n from := 0;\n pos := Position(string, ';', from);\n while pos <> fail do\n statement := string{[from + 1..pos]};\n statement := ReplacedString(statement,\" last \",\" ANUPQData.example.last \");\n if pos < Length(string) and string[pos + 1] = ';' then\n Read( InputTextString(statement) );\n from := pos + 1;\n else\n parts := SplitString(statement, \"\", \" \\n\");\n if 1 < Length(parts) and parts[2] = \":=\" then\n Read( InputTextString(statement) );\n Read( InputTextString( \n Concatenation( \"View(\", parts[1], \"); Print(\\\"\\\\n\\\");\" ) ) );\n ANUPQData.example.last := parts[1];\n else\n var := EvalString(statement);\n View( var );\n Print( \"\\n\" );\n ANUPQData.example.last := var;\n fi;\n from := pos;\n fi;\n pos := Position(string, ';', from);\n od;\nend );\n\n#############################################################################\n##\n#F PqExample() . . . . . . . . . . execute a pq example or display the index\n#F PqExample( [, PqStart][, Display] )\n#F PqExample( [, PqStart][, ] )\n##\n## With no arguments, or with single argument `\"index\"', or a string\n## that is not the name of a file in the `examples' directory, an\n## index of available examples is displayed.\n##\n## With just the one argument that is the name of a file in the\n## `examples' directory, the example contained in that file is executed in\n## its simplest form. Some examples accept options which you may use to\n## modify some of the options used in the commands of the example. To find\n## out which options an example accepts, use one of the mechanisms for\n## displaying the example described below.\n##\n## Some examples have both non-interactive and interactive forms; those that\n## are non-interactive only have a name ending in `-ni'; those that are\n## interactive only have a name ending in `-i'; examples with names ending\n## in `.g' also have only one form; all other examples have both\n## non-interactive and interactive forms and for these giving `PqStart' as\n## second argument invokes `PqStart' initially and makes the appropriate\n## adjustments so that the example is executed or displayed using\n## interactive functions.\n##\n## If `PqExample' is called with last (second or third) argument `Display'\n## then the example is displayed without being executed. If the last\n## argument is a non-empty string then the example is also\n## displayed without being executed but is also written to a file with that\n## name. Passing an empty string as last argument has the same effect as\n## passing `Display'.\n##\n## *Note:*\n## The variables used in `PqExample' are local to the running of\n## `PqExample', so there's no danger of having some of your variables\n## over-written. However, they are not completely lost either. They are\n## saved to a record `ANUPQData.examples.vars', i.e.~if `F' is a variable\n## used in the example then you will be able to access it after `PqExample'\n## has finished as `ANUPQData.examples.vars.F'.\n##\nInstallGlobalFunction(PqExample, function(arg)\nlocal name, file, instream, line, input, doPqStart, vars, var, printonly,\n filename, DoAltAction, GetNextLine, PrintLine, action, datarec, optname,\n linewidth, sizescreen, CheckForCompoundKeywords, hasFunctionExpr, parts,\n iscompoundStatement, compoundDepth;\n\n sizescreen := SizeScreen();\n if sizescreen[1] < 80 then\n SizeScreen([80, sizescreen[2]]);\n linewidth := 80;\n else\n linewidth := sizescreen[1];\n fi;\n\n if IsEmpty(arg) then\n name := \"index\";\n else\n name := arg[1];\n fi;\n\n if name = \"README\" then\n file := fail;\n else\n file := Filename(DirectoriesPackageLibrary( \"anupq\", \"examples\"), name);\n fi;\n if file = fail then\n Info(InfoANUPQ + InfoWarning, 1,\n \"Sorry! There is no ANUPQ example with name `\", name, \"'\",\n \" ... displaying index.\");\n name := \"index\";\n file := Filename(DirectoriesPackageLibrary( \"anupq\", \"examples\"), name);\n fi;\n\n if name <> \"index\" then\n doPqStart := false;\n if Length(arg) > 1 then\n # At this point the name of the variable doesn't make\n # sense; however, if the value assigned to is `Display'\n # or an empty string then we ``print only'' and if it is a non-empty\n # string then it is assumed to be a filename and we `LogTo' that filename.\n printonly := arg[Minimum(3, Length(arg))];\n if arg[2] = PqStart then\n if 2 < Length(name) and \n name{[Length(name) - 1 .. Length(name)]} in [\"-i\", \"ni\", \".g\"] then\n Error( \"example does not have a (different) interactive form\\n\" );\n fi;\n doPqStart := true;\n fi;\n else\n printonly := false;\n fi;\n\n DoAltAction := function()\n if doPqStart then\n if action[2] = \"do\" then\n # uncomment line\n line := line{[2..Length(line)]};\n else\n # replace a variable with a proc id\n line := ReplacedString( line, action[5], action[3] ); \n fi;\n fi;\n end;\n\n if printonly = Display or IsString(printonly) then\n GetNextLine := function()\n local from, to;\n line := ReadLine(instream);\n if line = fail then\n return;\n elif IsBound(action) then\n action := SplitString(action, \"\", \"# <>\\n\");\n DoAltAction();\n Unbind(action);\n elif 3 < Length(line) and line{[1..4]} = \"#alt\" then\n # only \"#alt\" actions recognised\n action := line;\n elif IsMatchingSublist(line, \"#comment:\") then\n line := ReplacedString(line, \" supplying\", \"\");\n from := Position(line, ' ');\n to := Position(line, '<', from);\n Info(InfoANUPQ, 1, \n \"In the next command, you may\", line{[from .. to - 1]});\n from := to + 1;\n to := Position(line, '>') - 1;\n Info(InfoANUPQ, 1, \"supplying to `PqExample' the option: `\", \n line{[from .. to]}, \"'\");\n fi;\n end;\n\n if IsString(printonly) and printonly <> \"\" then\n filename := printonly;\n LogTo( filename ); #Make sure it's empty and writable\n fi;\n PrintLine := function()\n if IsMatchingSublist(line, \"##\") then \n line := line{[2..Length(line)]};\n elif line[1] = '#' then\n return;\n fi;\n Print( ReplacedString(line, \";;\", \";\") );\n end;\n printonly := true; #now the name of the variable makes sense\n else\n printonly := false;\n ANUPQData.example := rec(options := rec());\n datarec := ANUPQData.example.options;\n\n CheckForCompoundKeywords := function()\n local compoundkeywords;\n compoundkeywords := Filtered( SplitString(line, \"\", \"( ;\\n\"),\n w -> w in [\"do\", \"od\", \"if\", \"fi\",\n \"repeat\", \"until\",\n \"function\", \"end\"] );\n hasFunctionExpr := \"function\" in compoundkeywords;\n compoundDepth := compoundDepth \n + Number(compoundkeywords,\n w -> w in [\"do\", \"if\", \"repeat\", \"function\"])\n - Number(compoundkeywords,\n w -> w in [\"od\", \"fi\", \"until\", \"end\"]);\n return not IsEmpty(compoundkeywords);\n end;\n\n GetNextLine := function()\n local from, to, bhsinput;\n repeat\n line := ReadLine(instream);\n if line = fail then return; fi;\n until not IsMatchingSublist(line, \"#comment:\");\n if IsBound(action) then\n action := SplitString(action, \"\", \"# <>\\n\");\n if action[1] = \"alt:\" then\n DoAltAction();\n else\n # action[2] = name of a possible option passed to `PqExample'\n # action[4] = string to be replaced in with the value\n # of the option if ok and set\n optname := action[2];\n if IsDigitChar(optname[ Length(optname) ]) then\n optname := optname{[1..Length(optname) - 1]};\n fi;\n datarec.(action[2]) := ValueOption(action[2]);\n if datarec.(action[2]) = fail then\n Unbind( datarec.(action[2]) );\n else\n if not ANUPQoptionChecks.(optname)( datarec.(action[2]) ) then\n Info(InfoANUPQ, 1, \"\\\"\", action[2], \"\\\" value must be a \",\n ANUPQoptionTypes.(optname), \n \": option ignored.\");\n Unbind( datarec.(action[2]) );\n else\n if action[1] = \"add\" then\n line[1] := ' ';\n fi;\n if IsString( datarec.(action[2]) ) then\n line := ReplacedString( line, action[4],\n Flat(['\"',datarec.(action[2]),'\"']) );\n else\n line := ReplacedString( line, action[4], \n String( datarec.(action[2]) ) );\n fi;\n fi;\n fi;\n fi;\n Unbind(action);\n elif IsMatchingSublist(line, \"##\") then\n ; # do nothing\n elif 3 < Length(line) and line{[1..4]} in [\"#sub\", \"#add\", \"#alt\"] then\n action := line;\n elif line[1] = '#' then\n # execute instructions behind the scenes\n bhsinput := \"\";\n repeat\n Append( bhsinput, \n ReplacedString(line{[2..Length(line)]},\n \"datarec\",\n \"ANUPQData.example.options\") );\n line := ReadLine(instream);\n until line[1] <> '#' or\n (3 < Length(line) and line{[1..4]} in [\"#sub\", \"#add\", \"#com\"]);\n Read( InputTextString(bhsinput) );\n fi;\n end;\n\n PrintLine := function()\n if IsMatchingSublist(line, \"##\") then \n line := line{[2..Length(line)]};\n elif line[1] = '#' then\n return;\n fi;\n if input = \"\" then\n Print(\"gap> \");\n else\n Print(\"> \");\n fi;\n Print( ReplacedString(line, \";;\", \";\") );\n end;\n fi;\n fi;\n \n instream := InputTextFile(file);\n if name <> \"index\" then\n FLUSH_PQ_STREAM_UNTIL( instream, 10, 1, ReadLine,\n line -> IsMatchingSublist(line, \"#Example\") );\n line := FLUSH_PQ_STREAM_UNTIL( instream, 1, 10, ReadLine,\n line -> IsMatchingSublist(line, \"#vars:\") );\n if Length(line) + 21 < linewidth then\n Info(InfoANUPQ, 1, line{[Position(line, ' ')+1..Position(line, ';')-1]},\n \" are local to `PqExample'\");\n else\n #this assumes one has been careful to ensure the `#vars:' line is not\n #longer than 72 characters.\n Info(InfoANUPQ, 1, line{[Position(line, ' ')+1..Position(line, ';')-1]},\n \" are\");\n Info(InfoANUPQ, 1, \"local to `PqExample'\");\n fi;\n vars := SplitString(line, \"\", \" ,;\\n\");\n vars := vars{[2 .. Length(vars)]};\n if not printonly then\n CallFuncList(HideGlobalVariables, vars);\n fi;\n line := FLUSH_PQ_STREAM_UNTIL(instream, 1, 10, ReadLine,\n line -> IsMatchingSublist(line, \"#options:\"));\n input := \"\";\n GetNextLine();\n while line <> fail do\n PrintLine();\n if line[1] <> '#' then\n if not printonly then\n if input = \"\" then\n compoundDepth := 0;\n iscompoundStatement := CheckForCompoundKeywords();\n elif iscompoundStatement and compoundDepth > 0 then\n CheckForCompoundKeywords();\n fi;\n if line <> \"\\n\" then\n Append(input, line);\n if iscompoundStatement then\n if compoundDepth = 0 and Position(input, ';') <> fail then\n Read( InputTextString(input) ); \n if hasFunctionExpr then\n parts := SplitString(input, \"\", \":= \\n\");\n Read( InputTextString( \n Concatenation( \n \"View(\", parts[1], \"); Print(\\\"\\\\n\\\");\" ) ) );\n ANUPQData.example.last := parts[1];\n fi;\n iscompoundStatement := false;\n input := \"\";\n fi;\n elif Position(input, ';') <> fail then\n PQ_EVALUATE(input);\n input := \"\";\n fi;\n fi;\n fi;\n fi;\n GetNextLine();\n od;\n if printonly then\n if IsBound(filename) then\n LogTo();\n fi;\n else\n ANUPQData.example.vars := rec();\n for var in Filtered(vars, ISBOUND_GLOBAL) do \n ANUPQData.example.vars.(var) := VALUE_GLOBAL(var);\n od;\n Info(InfoANUPQ, 1, \"Variables used in `PqExample' are saved \",\n \"in `ANUPQData.example.vars'.\");\n CallFuncList(UnhideGlobalVariables, vars);\n fi;\n else\n FLUSH_PQ_STREAM_UNTIL(instream, 1, 10, ReadLine, line -> line = fail);\n fi;\n CloseStream(instream);\n if linewidth <> sizescreen[1] then\n SizeScreen( sizescreen ); # restore what was there before\n fi;\nend);\n\n#############################################################################\n##\n#F AllPqExamples() . . . . . . . . . . list the names of all ANUPQ examples\n##\nInstallGlobalFunction( AllPqExamples, function()\n local dir, files;\n\n dir := DirectoriesPackageLibrary( \"anupq\", \"examples\" )[1];\n files := DirectoryContents( Filename( dir, \"\" ));\n # Remove certain files\n files := Difference( files, [\".\", \"..\", \"index\", \"README\", \"CVS\", \n \"5gp-PG-e5-i\", \"7gp-a-x-Rel-i\"] );\n # Remove files ending with a tilde\n files := Filtered( files, file -> file[ Length(file) ] <> '~' );\n return files;\nend );\n\n#############################################################################\n##\n#F GrepPqExamples( ) . . . . . . . grep ANUPQ examples for a string\n##\n## runs the UNIX command `grep ' over the {\\ANUPQ} examples and\n## returns the list of examples for which there is a match. The actual\n## matches are `Info'-ed at `InfoANUPQ' level 2.\n##\nInstallGlobalFunction( GrepPqExamples, function( string )\n local dir, str, grep, out, opts, lines, matches, line;\n\n dir := DirectoriesPackageLibrary( \"anupq\", \"examples\" )[1];\n grep := Filename( DirectoriesSystemPrograms(), \"grep\" );\n str := \"\";\n out := OutputTextString( str, true );\n opts := Concatenation( [ string ], AllPqExamples() );\n Process( dir, grep, InputTextNone(), out, opts );\n CloseStream( out );\n lines := SplitString( str, \"\", \"\\n\" );\n matches := [];\n for line in lines do\n Info(InfoANUPQ, 2, line);\n Add( matches, SplitString(line, \"\", \":\")[1] );\n od;\n return Set(matches);\nend );\n\n#E anupq.gi . . . . . . . . . . . . . . . . . . . . . . . . . . . ends here \n", "meta": {"hexsha": "6018c69a647ec4a198f2ec909093e1120d6ed8c0", "size": 35711, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "lib/anupq.gi", "max_stars_repo_name": "gap-system/anupq", "max_stars_repo_head_hexsha": "075d27ffe985d561f377a253563605ffea726448", "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": "lib/anupq.gi", "max_issues_repo_name": "gap-system/anupq", "max_issues_repo_head_hexsha": "075d27ffe985d561f377a253563605ffea726448", "max_issues_repo_licenses": ["Artistic-2.0"], "max_issues_count": 8, "max_issues_repo_issues_event_min_datetime": "2015-03-04T12:41:28.000Z", "max_issues_repo_issues_event_max_datetime": "2015-09-27T22:17:27.000Z", "max_forks_repo_path": "lib/anupq.gi", "max_forks_repo_name": "gap-system/anupq", "max_forks_repo_head_hexsha": "075d27ffe985d561f377a253563605ffea726448", "max_forks_repo_licenses": ["Artistic-2.0"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 36.2916666667, "max_line_length": 80, "alphanum_fraction": 0.5314328918, "num_tokens": 9564, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. NO\n2. NO", "lm_q1_score": 0.47657966593214324, "lm_q2_score": 0.060975182571362606, "lm_q1q2_score": 0.029059532140011432}}
{"text": "\n# Copyright (c) 2018-2021, Carnegie Mellon University\n# See LICENSE for details\n\n\nClass(SMPGlobals, rec(\n pthreads := self >> \"pthreads\",\n OSThreads := self >> Cond(LocalConfig.osinfo.isWindows(), \"winthreads\", \"LinuxThreads\"),\n threads := self >> \"threads\",\n OpenMP := self >> \"OpenMP\",\n maxThreads := self >> LocalConfig.cpuinfo.cores,\n getOpts := meth(arg)\n local self, opts, optrec, tid;\n\n self := arg[1];\n opts := CopyFields(SpiralDefaults);\n optrec := rec(api := self.OpenMP(), numproc := self.maxThreads(), parOdd := false);\n if Length(arg) >= 2 then optrec := CopyFields(optrec, arg[2]); fi;\n\n opts.breakdownRules.GT := Concat([ GT_Base, GT_NthLoop, CopyFields(GT_Par, rec(parEntireLoop := false, splitLoop := true))],\n When(optrec.parOdd, [GT_Par_odd ], []));\n opts.breakdownRules.TTensorI := [ CopyFields(TTensorI_toGT, rec(applicable := (self, t) >> t.hasTags() and ObjId(t.getTags()[1])=AParSMP ))];\n opts.breakdownRules.TTensorInd := [ dsA_base_smp, dsA_smp, L_dsA_L_base_smp, L_dsA_L_smp ];\n\n tid := When(optrec.api = \"OpenMP\", threadId(), CopyFields(var(\"tid\", TInt), rec(isParallelLoopIndex := true)));\n opts.tags := [ AParSMP(optrec.numproc, tid) ];\n\n# if optrec.api = \"threads\" then opts.subParams := [var(\"num_threads\", TInt), var(\"tid\", TInt)]; fi;\n opts.smp := optrec;\n\n return opts;\n end\n));\n", "meta": {"hexsha": "a4d4d9f21d11708cabbb95695200eae337bf9c6f", "size": 1438, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "namespaces/spiral/paradigms/smp/opts.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/smp/opts.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/smp/opts.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": 42.2941176471, "max_line_length": 149, "alphanum_fraction": 0.6230876217, "num_tokens": 408, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. NO\n2. NO", "lm_q1_score": 0.45713671682749485, "lm_q2_score": 0.06187598875104791, "lm_q1q2_score": 0.028285786348109045}}
{"text": "\n# Copyright (c) 2018-2021, Carnegie Mellon University\n# See LICENSE for details\n\n\nDeclare(TDA, _ApplyAllRulesTopDown, limit_cx);\n\nIsRewriteRule := r -> IsRec(r) and IsBound(r.isRewriteRule) and r.isRewriteRule;\n\nClass(RewriteRuleBase, rec(\n\tisRewriteRule := true,\n\t\n\tregularize := self >> Error(\"Not implemented. This method needs to convert \",\n\t\"a special kind of rewrite rule into a regular RewriteRule\"),\n));\n\n#F RewriteRule()\t-- returns object unchanged\n#F RewriteRule(, ) -- creates an unnamed rewrite rule\n#F RewriteRule(, , ) -- creates a rewrite rule\n#F\nClass(RewriteRule, RewriteRuleBase, rec(\n\tregularize := self >> self,\n\n\t__call__ := meth(arg)\n\t\tlocal op, from, to, name, self;\n\t\n\t\tself := arg[1]; \n\t\targ := Drop(arg, 1);\n\n\t\tif Length(arg)=1 and IsList(arg[1]) then\n\t\t\targ := arg[1];\n\t\tfi;\n\t\tif Length(arg)=1 then \n\t\t\treturn Checked(IsRewriteRule(arg[1]), arg[1]); \n\t\telif Length(arg)=2 then\n\t\t\tfrom := arg[1];\n\t\t\tto := Checked(IsCallableN(arg[2], 1) or IsCallableN(arg[2], 2), arg[2]);\n\t\t\tname := \"unnamed\";\n\t\telif Length(arg)=3 then\n\t\t\tfrom := arg[1];\n\t\t\tto := Checked(IsCallableN(arg[2], 1) or IsCallableN(arg[2], 2), arg[2]);\n\t\t\tname := Checked(IsString(arg[3]), arg[3]); \n\t\telse \n\t\t\tError(\"Rule requires 1, 2 or 3 arguments. See Doc(ARule)\");\n\t\tfi;\n\n\t\tif IsList(from) then\n\t\t\tif Length(from)=0 then\n\t\t\t\tError(\"Rule must have non-empty left-side\");\n\t\t\tfi;\n\t\t\top := from[1];\n\t\telse\n\t\t\top := from;\n\t\tfi;\n\t\tif Is@(op) or not IsRec(op) or not IsBound(op.name) then\n\t\t\tif IsBound(op._target) and Length(op._target)=1 then \n\t\t\t\top := op._target[1];\n\t\t\telse \n\t\t\t\top := @;\n\t\t\tfi;\n\t\tfi;\n\t\treturn WithBases(self, rec(op := op, from := from, to := to, name := name, operations := PrintOps));\n\tend,\n\n\tprint := self >> PrintEval(\"$1($2, $3, \\\"$4\\\")\", self.__name__, self.from, self.to, self.name),\n\n));\n\n# Rule(..), alias for RewriteRule, see Doc(RewriteRule)\n#\nRule := arg -> ApplyFunc(RewriteRule, arg);\n\n#F ARule() - returns object unchanged\n#F ARule(, , ) - creates an unnamed rewrite rule for associative \n#F ARule(, , , ) - creates a rewrite rule for associative \n#F\n#F Create a rewrite rule for an associative operator\n#F\nClass(AssociativeRewriteRule, RewriteRuleBase, rec(\n\t__call__ := meth(arg)\n\t\tlocal op, from, to, name, lhs, rhs, self;\n\t\t\n\t\tself := arg[1];\n\t\targ := Drop(arg, 1);\n\n\t\tif Length(arg)=1 and IsList(arg[1]) then\n\t\t\targ := arg[1];\n\t\tfi;\n\t\t\n\t\tif Length(arg)=1 then \n\t\t\treturn Checked(IsRewriteRule(arg[1]), arg[1]); \n\t\telif Length(arg)=3 then\n\t\t\top := Checked(IsClass(arg[1]), arg[1]);\n\t\t\tfrom := Checked(IsList(arg[2]), arg[2]);\n\t\t\tto := Checked(IsCallableN(arg[3], 1) or IsCallableN(arg[3], 2), arg[3]);\n\t\t\tname := \"unnamed\";\n\t\telif Length(arg)=4 then\n\t\t\top := Checked(IsClass(arg[1]), arg[1]);\n\t\t\tfrom := Checked(IsList(arg[2]), arg[2]);\n\t\t\tto := Checked(IsCallableN(arg[3], 1) or IsCallableN(arg[3], 2), arg[3]);\n\t\t\tname := Checked(IsString(arg[4]), arg[4]); \n\t\telse \n\t\t\tError(\"ARule requires 1, 3 or 4 arguments. See Doc(ARule)\");\n\t\tfi;\n\n\t\treturn WithBases(self, rec(op := op, from := from, to := to, name := name, operations := PrintOps));\n\tend,\n\n\tregularize := meth(self)\n\t\tlocal op, from, to, lhs, rhs;\n\t\t\n\t\t[op, from, to] := [self.op, self.from, self.to];\n\t\tlhs := [op, ...] :: from :: [...];\n\t\tif NumArgs(to)=1 then\n\t\t\trhs := DetachFunc(Subst(\n\t\t\t\tfunction(e)\n\t\t\t\tlocal rch;\n\t\t\t\trch := _children(e); \n\t\t\t\t\t# ....left means O.left, where O is the '...' object, defined in rules.gi\n\t\t\t\treturn _fromChildren(e, Concatenation(\n\t\t\t\trch{[1 .. ....left]}, \n\t\t\t\t$to(e),\n\t\t\t\trch{[....right .. Length(rch)]}));\n\t\t\tend));\n\t\telse\n\t\t\trhs := DetachFunc(Subst(\n\t\t\tfunction(e,cx)\n\t\t\t\tlocal rch;\n\t\t\t\trch := _children(e); \n\t\t\t\t\t # ....left means O.left, where O is the '...' object, defined in rules.gi\n\t\t\t\treturn _fromChildren(e, Concatenation(\n\t\t\t\t\trch{[1 .. ....left]},\n\t\t\t\t\t$to(e,cx),\n\t\t\t\t\trch{[....right .. Length(rch)]}));\n\t\t\tend));\n\t\tfi;\n\t\treturn RewriteRule(lhs, rhs, self.name);\n\tend,\n\n\tprint := self >> PrintEval(\"$1($2, $3, $4, \\\"$5\\\")\", self.__name__, self.op, self.from, self.to, self.name),\n));\n\n# ARule(..), alias for AssociativeRewriteRule, see Doc(AssociativeRewriteRule)\n#\nARule := arg -> ApplyFunc(AssociativeRewriteRule, arg);\n\n_ARule_Transparent := (op, transp_ops, from, to) -> Checked(\n\tIsClass(op), IsList(transp_ops), ForAll(transp_ops, IsClass),\n\tIsList(from), IsCallableN(to, 1) or IsCallableN(to, 2),\n\tList(transp_ops, tr_op -> \n\tARule(op, List(from, f -> [tr_op, f]), \n\t\tWhen(IsCallableN(to, 1), Subst(x -> List($to(x), y->$tr_op(y))),\n\t\t\t\t\t\t\t Subst((x,cx) -> List($to(x, cx), y->$tr_op(y))))))\n);\n\n\nIsRuleSet := x -> IsRec(x) and IsBound(x.isRuleSet) and x.isRuleSet;\n\nClass(RuleSet, rec(\n\tisRuleSet\t:= true,\n\trules\t\t:= rec(),\n\t# counts how many time this RuleSet changed\n\t_changes\t := 0,\n\t# change index of compiled ruleset, need to recompile if\n\t# '_comp_id' is not equal to '_changes'\n\t_comp_id\t := -1,\n\t\n\t__transparent__ := [],\n\n\taddRules := meth(self, rules)\n\t\tlocal f, rr;\n\t\tConstraint(IsRec(rules));\n\t\tself.rules := ShallowCopy(self.rules);\n\t\trules := ShallowCopy(rules);\n\n\t\tfor f in UserRecFields(rules) do\n\t\t\trr := rules.(f);\n\t\t\tConstraint(IsRewriteRule(rr) or (IsList(rr) and ForAll(rr, IsRewriteRule)));\n\t\t\trr := When(IsList(rr), rr, [rr]);\n\t\t\trr := ConcatList(rr, r -> \n\t\t\tCond(r _is AssociativeRewriteRule, \n\t\t\t\t[r] ::\n\t\t\t\tConcatList(Filtered(self.__transparent__, t->t[1]=r.op),\n\t\t\t\tt -> _ARule_Transparent(r.op, t[2], r.from, r.to)),\n\t\t\t\t[r]));\n\t\t\trules.(f) := rr;\n\t\tod;\n\n\t\tMergeIntoRecord(self.rules, rules);\n\t\n\t\t# ruleset changed\n\t\tself._changes := self._changes + 1;\n\t\treturn self;\n\tend,\n\n\tcompileRule := meth(self, name, rule)\n\t\tlocal op, from, to_func, owner, head;\n\t\towner := rule.owner;\n\t\trule := rule.regularize();\n\t\t[op, from, to_func] := [rule.op, rule.from, rule.to];\n\t\top := op.__name__;\n\t\thead := When(IsList(from) and from<>[], from[1], from);\n\n\t\tif op = \"@\" and IsRec(head) and IsBound(head._target) then\n\t\t\tDoForAll(head._target, t ->\n\t\t\t\tself.compileRule(name, CopyFields(rule, rec(op := t))));\n\t\telse\n\t\t\tif not IsBound(self._compiled.(op)) then\n\t\t\t\tself._compiled.(op) := [ CopyFields(rule, rec(name := name)) ]; #[from, to_func, name, owner] ];\n\t\t\telse\n\t\t\t\tAdd(self._compiled.(op), CopyFields(rule, rec(name := name))); #[from, to_func, name, owner]);\n\t\t\tfi;\n\t\tfi;\n\tend,\n\n\tcompile := meth(self)\n\t\tself._compiled := tab();\n\t\t# save the owner ruleset, it will be used to produce warnings of duplicate \n\t\t# rule definitions, when dealing with merged rule sets\n\t\tDoForAll(self.rules, function(name, rule)\n\t\t\tlocal r;\n\t\t\tif IsRewriteRule(rule) then rule.owner := self; \n\t\t\telif IsList(rule) and not IsString(rule) then for r in rule do r.owner := self; od;\n\t\t\tfi;\n\t\tend);\n\n\t\tDoForAll(self.rules, (name, rule) ->\n\t\t\tCond(IsRewriteRule(rule), self.compileRule(name, rule),\n\t\t\t\tIsList(rule) and not IsString(rule), DoForAll(rule, r -> self.compileRule(name, r)), 0)\n\t\t);\n\t\t# remember change number\n\t\tself._comp_id := self._changes;\n\t\treturn self;\n\tend,\n\n\t__call__ := (self, s) >> TDA(s, self, rec()),\n\n\tapply1 := (self, s) >> _ApplyAllRulesTopDown(s, limit_cx(1), self),\n\n\tget_changes := self >> self._changes,\n\tget_comp_ids := self >> self._comp_id,\n\n\tchanged := self >> self.get_comp_ids() <> self.get_changes(),\n\n\tcompiled := self >> When(IsBound(self._locked) or not self.changed(), self, self.compile())._compiled, \n\n\t# locked ruleset doesn't check changes and doesn't recompile rules when asked for compiled() table\n\tlocked := self >> CopyFields(When(self.changed(), self.compile(), self), rec(_locked := true)),\n));\n\n\nClass(EmptyRuleSet, RuleSet);\n\nAnonRuleSet := rules -> WithBases(RuleSet, rec()).addRules(rules);\n\nClass(MergedRuleSet, RuleSet, rec(\n\t _mergedConflictWarnings := [],\n\t warnConflicts := false,\n\t warnDuplicates := true,\n\n\t __call__ := arg >> let(\n\t\t self\t := arg[1],\n\t\t rulesets := Drop(arg, 1),\n\t\t comp_id := Sum(rulesets, e -> e.get_changes())-1,\n\t\t Checked(Length(rulesets) >= 1,\n\t\t\t When( Length(rulesets)=1,\n\t\t\t\t rulesets[1],\n\t\t\t\t WithBases(self, rec(operations := PrintOps,\n\t\t\t\t\t __call__ := RuleSet.__call__,\n\t\t\t\t\t rulesets := rulesets,\n\t\t\t\t\t _comp_id := comp_id))))),\n\n\t get_changes := self >> Sum(self.rulesets, e -> e.get_changes()),\n\t get_comp_ids := self >> self._comp_id,\n\n\t checkConflicts := meth(self, rules1, rules2, rulesets)\n\t\t local conflicts, c;\n\t\t conflicts := Intersection(UserRecFields(rules1), UserRecFields(rules2));\n\t\t # make sure the origins of the rules are different\n\t\t # origin == RuleSet where the rule first appears, i.e., not the MergedRuleSet\n\t\t conflicts := Filtered(conflicts, c -> rules1.(c).owner.__name__ <> rules2.(c).owner.__name__);\n\n\t\t # prevent duplicate warnings\n\t\t if not self.warnDuplicates then\n\t\t\t SubtractSet(conflicts, self._mergedConflictWarnings); fi;\n\n\t\t if conflicts <> [] then\n\t\t\t PrintErr(\"Warning: rewrite rule conflict when merging \", rulesets, \"\\n\");\n\t\t\t for c in conflicts do\n\t\t\t\t Add(self._mergedConflictWarnings, c);\n\t\t\t\t PrintErr(Blanks(9), c, \" \", rules1.(c).owner, \"<->\", rules2.(c).owner, \"\\n\");\n\t\t\t od;\n\t\t fi;\n\t end,\n\n\t compile := meth(self)\n\t\tlocal rules, r;\n\t\trules := rec();\n\t\tfor r in self.rulesets do\n\t\t\tr.compile();\n\t\t\tif self.warnConflicts then\n\t\t\t\tself.checkConflicts(rules, r.rules, self.rulesets);\n\t\t\tfi;\n\t\t\tMergeIntoRecord(rules, r.rules);\n\t\tod;\n\t\tself.rules := rules;\n\n\t\tself._compiled := tab();\n\n\t\tDoForAll(self.rules, (name, rule) ->\n\t\t\tCond(IsRewriteRule(rule), self.compileRule(name, rule),\n\t\t\t\tIsList(rule) and not IsString(rule), \n\t\t\t\tDoForAll(rule, r -> self.compileRule(name, r)),0)\n\t\t);\n\n\t\tself._comp_id := self.get_changes();\n\t\treturn self;\n\tend,\n\n\tprint := self >> Print(self.name, \"(\", PrintCS(self.rulesets), \")\")\n));\n\nRewriteRules := (rule_set, rules) -> rule_set.addRules(rules);\n\n\n_LookupRules := (expr, ruleset) -> let(\n\tname := ObjId(expr).__name__, \n\tR := When(IsBound(ruleset._locked), ruleset._compiled, ruleset.compiled()),\n\tWhen(IsBound(R.(name)), R.(name), []) :: When(IsBound(R.@), R.@, []));\n\n#_AddRule2 := function(op, from, to_func)\n#\t local rules;\n#\t rules := _AddRule_old(op, from, to_func);\n#\t if not IsBound(op._rules) then op._rules := BagAddr(rules); fi;\n#end;\n#_LookupRules2 := op -> When(IsBound(op._rules), BagFromAddr(op._rules), []);\n\n\nChkSPL := function(a,b, rule)\n\tlocal diff;\n#\tError();\n\tif spiral.spl.IsSPL(a) and spiral.spl.IsSPL(b) then\n\t\tdiff := spiral.code.InfinityNormMat(spiral.spl.MatSPL(a) -spiral.spl.MatSPL(b));\n\t\tif diff > 1E-4 then\n\t\t\tPrint(\"Broken SPL rule: \", rule, \"\\nold:\\n\", a, \"\\nnew:\\n\", b);\n\t\t\tError(\"bad SPL rule\");\n\t\tfi;\n\telse\n\t\treturn true;\n\tfi;\nend;\n\nRuleTrace := Ignore;\nRuleStrategyTrace := Ignore;\nRuleStrategyTiming := Ignore;\nRuleStatus := Ignore;\nRuleCheckSPL := false;\n\napply_rules := function(rules, expr, context)\n\tlocal rule, lhs, rhs, old;\n\tfor rule in rules do\n\t\tlhs := rule.from;\n\t\trhs := rule.to;\n\t\twhile PatternMatch(expr, lhs, context) and context.rlimit <> 0 do\n\t\t\tcontext.rlimit := context.rlimit - 1;\n\t\t\tcontext.applied := context.applied + 1;\n\t\t\told := Copy(expr);\n\t\t\tRuleTrace(rule);\n\t\t\tRuleStatus(rule, \"OLD: \", [expr, \"\\n\"]);\n\t\t\tif RuleCheckSPL then old := Copy(expr); fi;\n\t\t\tif NumArgs(rhs)=1 then expr := rhs(expr);\n\t\t\telse expr := rhs(expr, context);\n\t\t\tfi;\n\t\t\tRuleStatus(rule, \"NEW: \", [expr, \"\\n\"]);\n\t\t\ttrace_log.addRewrite(rule.name,old,expr, []);\n\t\t\tif RuleCheckSPL then ChkSPL(old, expr, rule); fi;\n\t\tod;\n\tod;\n\treturn expr;\nend;\n\n# non-iterative version (no more: while PatternMatch(...) do ...)\napply_rules_ni := function(rules, expr, context)\n\tlocal rule, lhs, rhs, old;\n\tfor rule in rules do\n\t\tlhs := rule.from;\n\t\trhs := rule.to;\n\t\tif PatternMatch(expr, lhs, context) and context.rlimit <> 0 then\n\t\t\tcontext.rlimit := context.rlimit - 1;\n\t\t\tcontext.applied := context.applied + 1;\n\t\t\told := Copy(expr);\n\t\t\tRuleTrace(rule);\n\t\t\tRuleStatus(rule, \"OLD: \", [expr, \"\\n\"]);\n\t\t\tif NumArgs(rhs)=1 then expr := rhs(expr);\n\t\t\telse expr := rhs(expr, context);\n\t\t\tfi;\n\t\t\tRuleStatus(rule, \"NEW: \", [expr, \"\\n\"]);\n\t\t\ttrace_log.addRewrite(rule.name,old,expr, []);\n\t\tfi;\n\tod;\n\treturn expr;\nend;\n\ncx_enter := function(cx, expr)\n\tlocal opname;\n\tif IsRec(expr) and IsBound(expr.name) then\n\topname := expr.name;\n\tif not IsBound(cx.(opname)) then cx.(opname) := [ expr ];\n\telse Add(cx.(opname), expr); fi;\n\tfi;\n\tAdd(cx.parents, expr);\nend;\n\ncx_leave := function(cx, expr)\n\t# unupdate context back to original\n\tif IsRec(expr) and IsBound(expr.name) then\n\tRemoveLast(cx.(expr.name), 1);\n\tfi;\n\tRemoveLast(cx.parents, 1);\nend;\n\nmap_children := function(expr, to_func)\n\tlocal ch, i;\n\tch := _children(expr);\n\tfor i in [1..Length(ch)] do\n\t\t_setChild(expr, i, to_func(ch[i]));\n\tod;\n\treturn expr;\nend;\n\nmap_children_safe := function(expr, to_func)\n\tlocal ch, i;\n\tch := ShallowCopy(_children(expr));\n\tif ch=[] then return expr; fi;\n\tfor i in [1..Length(ch)] do\n\t\tch[i] := to_func(ch[i]);\n\tod;\n\treturn _fromChildren(expr, ch);\nend;\n\n# Rule application context fields\n#\tparents - list of parents of current node,\n#\t\t\t immediate parent is last, farthest parent is first,\n#\t\t\t this field is updated by apply_rules()\n#\trlimit - maximum number of rules to apply, this is a parameter\n#\t\t\t to apply_rules()\n#\tapplied - number of rules applied so far, updated by apply_rules()\n#\n#\t - for each list of parents with that id only,\n#\t\t\t immediate parent is last. For instance Last(context.ISum)\n#\t\t\t is the enclosing ISum.\n#\n\n_meth_cx_isInside := (self, oid) >> let(nam := Cond(IsString(oid), oid, oid.__name__),\n\tIsBound(self.(nam)) and self.(nam)<>[]\n);\n\n# construct an empty context, but set a limit on the number of applied rules\nlimit_cx := lim -> tab(\n\tisInside := _meth_cx_isInside,\n\tparents := [], rlimit := lim, applied := 0\n);\n\n# construct an empty initial context\nempty_cx := () -> tab(\n\tisInside := _meth_cx_isInside,\n\tparents := [], rlimit := -1, applied := 0\n);\n\n\n_ApplyAllRulesTopDown := function(expr, context, ruleset)\n\tif (not IsRec(expr) or not IsBound(expr.name)) and (not IsList(expr) or BagType(expr) in [T_STRING, T_RANGE]) then\n\t\treturn expr;\n\tfi;\n\tif IsBound(ruleset.__avoid__) and ObjId(expr) in ruleset.__avoid__ then\n\t\treturn expr;\n\tfi;\n\t# apply rules\n\texpr := apply_rules(_LookupRules(expr, ruleset), expr, context);\n\t# recurse\n\t# NOTE: do not enter context if expr has no children!\n\tcx_enter(context, expr);\n\texpr := map_children(expr, c -> _ApplyAllRulesTopDown(c, context, ruleset));\n\tcx_leave(context, expr);\n\treturn expr;\nend;\n\nApplyAllRulesTopDown := (expr, ruleset) ->\n\t_ApplyAllRulesTopDown(expr, empty_cx(), ruleset.locked());\n\n_ApplyAllRulesBottomUp := function(expr, context, ruleset)\n\tif (not IsRec(expr) or not IsBound(expr.name)) and (not IsList(expr) or BagType(expr) in [T_STRING, T_RANGE]) then\n\t\treturn expr;\n\tfi;\n\tif IsBound(ruleset.__avoid__) and ObjId(expr) in ruleset.__avoid__ then\n\t\treturn expr;\n\tfi;\n\t# recurse\n\tcx_enter(context, expr);\n\texpr := map_children(expr, c -> _ApplyAllRulesBottomUp(c, context, ruleset));\n\tcx_leave(context, expr);\n\t# apply rules\n\texpr := apply_rules(_LookupRules(expr, ruleset), expr, context);\n\treturn expr;\nend;\n\nApplyAllRulesBottomUp := (expr, ruleset) ->\n\t_ApplyAllRulesBottomUp(expr, empty_cx(), ruleset.locked());\n\n_apply_strategy_step := function(expr, rset, apply_func, opts)\n\tif IsFunc(rset) then\n\t\tif NumArgs(rset)=2 then\n\t\t\texpr := rset(expr, opts);\n\t\telse\n\t\t\texpr := rset(expr);\n\t\tfi;\n\telse\n\t\texpr := apply_func(expr, rset.locked(), opts); \n\tfi;\n\treturn expr;\nend;\n\n##\n## ApplyStrategy(, , , )\n##\n## \t\t\t - expression to transform\n## - list of rulesets to apply\n## \t - of type (expr, rset) -> expr\n##\nApplyStrategy := function(expr, strategy, apply_func, opts)\n\tlocal rset, l, r, i, t;\n\t# a hack to make this function reentrant\n\t# (e.g. to make it possible to call this function from within rhs of a rule)\n\tl := ....left; r := ....right; i := 1;\n\tfor rset in strategy do\n\t\tRuleStrategyTrace(i, rset, expr);\n\t[expr, t] := UTimedAction(_apply_strategy_step(expr, rset, apply_func, opts));\n\t\tRuleStrategyTrace(i, \"DONE\", expr);\n\tRuleStrategyTiming(i, t);\n\t\ti := i + 1;\n\tod;\n\t....left := l;\n\t....right := r;\n\treturn expr;\nend;\n\nTD := ApplyAllRulesTopDown;\nBU := ApplyAllRulesBottomUp;\n\nTDA := function(s, ruleset, opts)\n\tlocal cx;\n\tcx := empty_cx();\n\tcx.opts := opts;\n\tcx.applied := 1;\n\twhile cx.applied > 0 do\n\t\tcx.applied := 0; \n\t\ts := _ApplyAllRulesTopDown(s, cx, ruleset);\n\tod;\n\treturn s;\nend;\n\nBUA := function(s, ruleset, opts)\n\tlocal cx;\n\t\n\tcx := empty_cx();\n\tcx.opts := opts;\n\tcx.applied := 1;\n\twhile cx.applied > 0 do\n\t\tcx.applied := 0;\n\t\ts := _ApplyAllRulesBottomUp(s, cx, ruleset);\n\tod;\n\treturn s;\nend;\n\nUntilDone := TDA;\n\nRewrite := function(expr, rset, opts)\n\tlocal res;\n\t\n\tif IsList(rset) then\n\t\treturn FoldL(rset, (a,b)->Rewrite(a, b, opts), expr); \n\tfi;\n\n\ttrace_log.beginRuleset(rset, expr);\n\tres := UntilDone(expr, rset, opts);\t\n\ttrace_log.endRuleset(rset, res);\n\t\t\n\treturn res;\nend;\n\n\n#F TDA_1by1(, , )\n#F\n#F This function applies rules in a top-down fashion to until\n#F it converges, just like TDA. However after each application of the\n#F rule it runs after_each_rule(s) on the newly transformed .\n#F This allows stepwise verification among other things.\n#F\n#F Example:\n#F\tr := RandomRuleTree(DFT(4));\n#F\t# following line (unlike SumsRuleTree) gives non-simplified Sigma-SPL\n#F\ts := SumsSPL(SPLRuleTree(r));\n#F\tTDA_1by1(s, MergedRuleSet(RulesSums, RulesDiag, RulesFuncSimp),\n#F\t\t\t\tx->PrintLine(MatSPL(x)-MatSPL(DFT(4))));\n#F\nTDA_1by1 := function(s, ruleset, after_each_rule)\n\tlocal cx;\n\t\n\tcx := limit_cx(1); cx.applied := 1;\n\twhile cx.applied > 0 do\n\t\tcx := limit_cx(1); cx.applied := 0;\n\t\ts := _ApplyAllRulesTopDown(s, cx, ruleset);\n\t\tafter_each_rule(s);\n\tod;\n\treturn s;\nend;\n", "meta": {"hexsha": "1c5f1b9052c4af7bc89ff79af2bf9257440d6d45", "size": 17823, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "namespaces/spiral/rewrite/ruleset.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/rewrite/ruleset.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/rewrite/ruleset.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": 28.886547812, "max_line_length": 115, "alphanum_fraction": 0.6530887056, "num_tokens": 5476, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. NO\n2. NO", "lm_q1_score": 0.4263215925474903, "lm_q2_score": 0.06465348700453777, "lm_q1q2_score": 0.02756317754352301}}
{"text": "\n## Copyright (c) 2018-2021, Carnegie Mellon University\n## See LICENSE for details\n\nImportAll(paradigms.smp);\nImportAll(paradigms.vector);\n\nClass(FFTXPOWER9Opts, FFTXOpts, rec(\n tags := [],\n operations := rec(Print := s -> Print(\"\")), \n));\n\npower9Opts := function(arg)\n local opts, optrec, vsxopts;\n \n optrec := rec(dataType := T_Real(64), globalUnrolling := 32);\n vsxopts := rec(svct := true, splitL := false, oddSizes := false, stdTTensor := true, tsplPFA := false, realVect := false, cplxVect := true);\n \n opts := CopyFields(FFTXOpts, SIMDGlobals.getOpts(POWER9_2xf, vsxopts));\n opts.breakdownRules.TFCall := FFTXOpts.breakdownRules.TFCall;\n \n opts.globalUnrolling := optrec.globalUnrolling;\n \n # FFTX specific breakdown rules\n opts.breakdownRules.Circulant := [Circulant_PRDFT_FDataNT];\n opts.breakdownRules.PRDFT := List([PRDFT1_Base1, PRDFT1_Base2, PRDFT1_CT, PRDFT1_PF, PRDFT_PD, PRDFT_Rader], _noT);\n opts.breakdownRules.IPRDFT := List([ IPRDFT1_Base1, IPRDFT1_Base2, IPRDFT1_CT, IPRDFT_PD, IPRDFT_Rader ], _noT);\n opts.breakdownRules.PRDFT3 := List([ PRDFT3_Base1, PRDFT3_Base2, PRDFT3_CT ], _noT);\n\n return opts;\nend;\n\nDeclare(ParseOptsPOWER);\n\nClass(FFTXPOWER9DefaultConf, rec(\n __call__ := self >> self,\n getOpts := (self, t) >> ParseOptsPOWER(self, t),\n operations := rec(Print := s -> Print(\"\")),\n useOMP := false,\n useSIMD := true\n));\n\npower9Conf := rec(\n defaultName := \"defaultPOWER9Conf\",\n defaultOpts := (arg) >> FFTXPOWER9DefaultConf,\n useOMP := false,\n useSIMD := true,\n confHandler := power9Opts \n);\n\nfftx.FFTXGlobals.registerConf(power9Conf);\n\ngetTargetOS := function()\n local tgt;\n \n if LocalConfig.osinfo.isWindows() then\n tgt := \"win-x64-cuda\";\n elif LocalConfig.osinfo.isLinux() then\n tgt := \"linux-cuda\";\n elif LocalConfig.osinfo.isDarwin() then\n tgt := \"linux-cuda\"; ## may work\n fi;\n return tgt;\nend;\n\n#-----------------------------------------\n# OpenMP + VSX\n\nClass(FFTXPOWER9OMPOpts, FFTXOpts, rec(\n tags := [],\n operations := rec(Print := s -> Print(\"\")), \n));\n\npower9OMPOpts := function(arg)\n local opts, optrec, vsxopts, smpopts, tid;\n \n optrec := rec(dataType := T_Real(64), globalUnrolling := 32);\n vsxopts := rec(svct := true, splitL := false, oddSizes := false, stdTTensor := true, tsplPFA := false);\n smpopts := rec(numproc := LocalConfig.cpuinfo.cores, api := \"OpenMP\");\n \n opts := CopyFields(FFTXOpts, SIMDGlobals.getOpts(POWER9_2xf, vsxopts));\n opts.breakdownRules.TFCall := FFTXOpts.breakdownRules.TFCall;\n \n #-- OpenMP opts merging-- \n opts.unparser := When(IsBound(smpopts.OmpMode) and smpopts.OmpMode = \"for\", \n OpenMP_POWERUnparser_ParFor, \n OpenMP_POWERUnparser);\n opts.codegen := spiral.libgen.VecRecCodegen;\n \n opts.breakdownRules.GT := [ GT_Base, GT_NthLoop, \n CopyFields(GT_Par, rec(parEntireLoop := false, splitLoop := true)), GT_Par_odd,\n GT_Vec_AxI, GT_Vec_IxA, GT_Vec_IxA_Push, GT_Vec_IxA_L, GT_Vec_L_IxA \n ];\n opts.breakdownRules.TTensorI := Concat([ \n CopyFields(TTensorI_toGT, rec(\n applicable := (self, t) >> t.hasTags() and ObjId(t.getTags()[1])=AParSMP ))], \n opts.breakdownRules.TTensorI);\n \n opts.breakdownRules.TTensorInd := \n Concat([dsA_base_smp, dsA_smp, L_dsA_L_base_smp, L_dsA_L_smp], \n opts.breakdownRules.TTensorInd); \n \n tid := When(smpopts.api = \"OpenMP\", threadId(), var(\"tid\", TInt));\n opts.tags := Concat([ AParSMP(smpopts.numproc, tid) ], opts.tags);\n #----------\n opts.globalUnrolling := optrec.globalUnrolling;\n \n # FFTX specific breakdown rules\n opts.breakdownRules.Circulant := [Circulant_PRDFT_FDataNT];\n opts.breakdownRules.PRDFT := List([PRDFT1_Base1, PRDFT1_Base2, PRDFT1_CT, PRDFT1_PF, PRDFT_PD, PRDFT_Rader], _noT);\n opts.breakdownRules.IPRDFT := List([ IPRDFT1_Base1, IPRDFT1_Base2, IPRDFT1_CT, IPRDFT_PD, IPRDFT_Rader ], _noT);\n opts.breakdownRules.PRDFT3 := List([ PRDFT3_Base1, PRDFT3_Base2, PRDFT3_CT ], _noT);\n\n return opts;\nend;\n\nDeclare(ParseOptsPOWER);\n\nClass(FFTXPOWER9OMPConf, rec(\n __call__ := self >> self,\n getOpts := (self, t) >> ParseOptsPOWER(self, t),\n operations := rec(Print := s -> Print(\"\")),\n useOMP := true,\n useSIMD := true\n));\n\npower9OMPConf := rec(\n defaultName := \"defaultPOWER9OMPConf\",\n defaultOpts := (arg) >> FFTXPOWER9OMPConf,\n useOMP := true,\n useSIMD := true,\n confHandler := power9OMPOpts \n);\n\nfftx.FFTXGlobals.registerConf(power9OMPConf);\n\ngetTargetOS := function()\n local tgt;\n \n if LocalConfig.osinfo.isWindows() then\n tgt := \"win-x64-cuda\";\n elif LocalConfig.osinfo.isLinux() then\n tgt := \"linux-cuda\";\n elif LocalConfig.osinfo.isDarwin() then\n tgt := \"linux-cuda\"; ## may work\n fi;\n return tgt;\nend;\n\n# this is a first experimental opts-deriving logic. This needs to be done extensible and properly\nParseOptsPOWER := function(conf, t)\n local tt, _tt, _conf, _opts;\n \n if conf.useOMP then\n _opts := power9OMPOpts();\n else\n _opts := power9Opts();\n fi;\n return _opts;\n \n Error(\"Don't know how to derive opts!\\n\");\nend; \n\n", "meta": {"hexsha": "0e50eef8c23085e390bfbe60ca2f6e599751cb8b", "size": 5444, "ext": "gi", "lang": "GAP", "max_stars_repo_path": "platforms/power/opts.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": "platforms/power/opts.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": "platforms/power/opts.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": 33.1951219512, "max_line_length": 144, "alphanum_fraction": 0.6491550331, "num_tokens": 1649, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. NO\n2. NO", "lm_q1_score": 0.46101677931231594, "lm_q2_score": 0.05834583447147869, "lm_q1q2_score": 0.026898408694330606}}
{"text": "#############################################################################\n####\n##\n#W options.gi ACE Package Greg Gamble\n##\n## This file installs functions and records for manipulating ACE options.\n## \n#Y Copyright (C) 2000 Centre for Discrete Mathematics and Computing\n#Y Department of Information Technology & Electrical Eng.\n#Y University of Queensland, Australia.\n##\n\n\n#############################################################################\n####\n##\n#V KnownACEOptions . . . . . . record whose fields are the known ACE options\n## . . . . . . . . . . . . . . . . . . each field is assigned a list of two \n## . . . . . . . . . . . . . . . . . . components: [leastlength, listorfn]\n##\n## The known ACE options are the RecNames of KnownACEOptions. The value of \n## of each RecName is a list [ leastlength, listorfn ], where leastlength is\n## an integer specifying the least length of an abbreviation of the RecName\n## that will match an ACE option, and listorfn is either a list of allowed \n## values or a function that can be used to test that the value of an option \n## is valid e.g. for the RecName \"lookahead\", we have knownOptions.lookahead \n## equal to [ 4, [0..4] ] which indicates that \"look\", \"looka\", etc. are all \n## valid abbreviations of the \"lookahead\" option, and the values that that \n## option can take are in the (integer) range 0 to 4. \n##\n## If the allowed values listed for an option are 0 and 1, then false and \n## true are also permitted (we translate false and true to 0 and 1, respect-\n## ively when we call ACE). The empty string signifies that ACE expects no\n## value for that option.\n##\n## Only single-word versions of options can be used by a user of ACE via the \n## GAP interface e.g. \"cc\" is a synonym for \"coset coincidence\" as an ACE\n## option, but the latter, being 2 words, is not available via the GAP \n## interface.\n##\n## The commented out options are known ACE options that probably won't work\n## via the GAP interface ... if the user uses these the interface program\n## CALL_ACE will complain: `unknown (possibly new) or bad' but still pass \n## these options to ACE ... at least the user will then know if ACE does not\n## respond as expected that the options should not be used. We usually only \n## warn that certain options might be bad, so that this interface has a good\n## chance of still being functional if new options are added to the ACE bin-\n## ary.\n##\n## Some options are `GAP-introduced' i.e. technically they are not ACE \n## options ... there is a comment beside such options; and they are also \n## listed in NonACEbinOptions below.\n##\n\nInstallValue(KnownACEOptions, rec(\n # aceinfile, aceignore, aceignoreunknown, acenowarnings, silent (and \n # further down: aceoutfile) are GAP-introduced options ... they are\n # not ACE binary options.\n aceinfile := [5, IsString],\n aceignore := [5, x -> IsList(x) and ForAll(x, xi -> IsString(xi))],\n aceignoreunknown := [10, x -> IsList(x) and ForAll(x, xi -> IsString(xi))],\n acenowarnings := [6, [0,1]],\n aceecho := [7, [\"\"]],\n aceincomment := [6, IsString],\n aceexampleoptions := [17, [0,1]],\n silent := [6, [0,1]],\n lenlex := [6, [0,1]],\n semilenlex := [10, [0,1]],\n incomplete := [10, [0,1]],\n sg := [2, IS_ACE_STRINGS],\n rl := [2, IS_ACE_STRINGS],\n aep := [3, [1..7]],\n ai := [2, IsString],\n ao := [2, IsString], # \"aceoutfile\" is a GAP-introduced \n aceoutfile := [4, IsString],# synonym for \"ao\"\n asis := [2, [0,1]],\n begin := [3, [\"\"]], # \"begin\" and \"start\" are synomyms\n start := [5, [\"\"]], # ... \"end\" synonym omitted (it is a GAP keyword)\n bye := [3, [\"\"]], # \"bye\", \"exit\" and \"qui\" are synonyms\n exit := [4, [\"\"]],\n qui := [1, [\"\"]], # the \"quit\" form is not available since\n # it's a GAP keyword\n cc := [2, x -> IsInt(x) and x > 1],\n cfactor := [1, IsInt], # \"cfactor\" and \"ct\" are synonyms\n ct := [2, IsInt],\n check := [5, [\"\"]],\n redo := [4, [\"\"]],\n compaction := [3, [0..100]],\n continu := [4, [\"\"]], # \"continue\" is a GAP 4.3+ keyword\n cycles := [2, [\"\"]],\n dmode := [4, [0..4]],\n dsize := [4, x -> x = 0 or IsPosInt(x)],\n default := [3, [\"\"]],\n ds := [2, IS_INC_POS_INT_LIST],\n dr := [2, IS_INC_POS_INT_LIST],\n dump := [1, x -> x in [\"\",0,1,2] or\n (IsList(x) and x[1] in [0..2] and\n (Length(x) = 1 or (Length(x) = 2 and x[2] in [0,1])))],\n easy := [4, [\"\"]],\n echo := [4, [0,1,2]], # hijacked! ... we don't pass this to ACE\n enumeration := [4, IsString],\n felsch := [3, [\"\",0,1]],\n ffactor := [1, x -> x = 0 or IsPosInt(x)],# \"ffactor\" and \"fill\"\n fill := [3, x -> x = 0 or IsPosInt(x)], # are synonyms ... there is\n # no \"fi\" since it's a GAP\n # keyword\n ## Most interface functions require the next 3 ACE options to be\n ## passed as arguments rather than options\n group := [2, x -> IsInt(x) or IsString(x) or\n (IsList(x) and \n ForAll(x, xi -> IsString(xi) and\n (Length(xi) = 1) and\n IsLowerAlphaChar( xi[1] )))], \n # For group generators\n generators := [3, IS_ACE_STRINGS], # For subgroup generators\n relators := [3, IS_ACE_STRINGS], # For group relators\n\n hard := [2, [\"\"]],\n help := [1, [\"\"]],\n hlt := [3, [\"\"]],\n hole := [2, [-1..100]],\n lookahead := [4, [0..4]],\n loop := [4, x -> x = 0 or IsPosInt(x)],\n max := [3, x -> x = 0 or (IsInt(x) and x >= 2)],\n mendelsohn := [4, [0,1]],\n messages := [4, IsInt], # \"messages\" and \"monitor\" are synonyms\n monitor := [3, IsInt],\n mode := [2, [\"\"]],\n nc := [2, [\"\",0,1]], # \"nc\" and \"normal\" are synonyms\n normal := [6, [\"\",0,1]],\n no := [2, x -> IsInt(x) and x >= -1],\n options := [3, [\"\"]],\n oo := [2, IsInt], # \"oo\" and \"order\" are synonyms\n order := [5, IsInt],\n #parameters := [3, [\"\"]], # decommissioned ACE option\n path := [4, [0,1]],\n pmode := [4, [0..3]],\n psize := [4, x -> x = 0 or \n (IsInt(x) and IsEvenInt(x) and IsPrimePowerInt(x))],\n sr := [2, [\"\",0,1,2,3,4,5]],\n print := [2, x -> x = \"\" or IsInt(x) or\n (IsList(x) and Length(x) <= 3 and IsInt(x[1]) and\n ForAll(x{[2..Length(x)]}, IsPosInt)) ],\n purec := [5, [\"\"]], # the ACE option is \"pure c\"\n purer := [5, [\"\"]], # the ACE option is \"pure r\"\n rc := [2, x -> x = \"\" or IsInt(x) or \n (IsList(x) and Length(x) <= 2 and ForAll(x, IsInt))],\n recover := [4, [\"\"]], # \"recover\" and \"contiguous\"\n contiguous := [6, [\"\"]], # are synonyms ... \"rec\" is\n # not an allowed abbreviation\n # since it's a GAP keyword\n rep := [2, x -> x in [1..7] or\n (IsList(x) and Length(x) <= 2 and x[1] in [1..7] and\n ForAll(x{[2..Length(x)]}, IsInt))],\n #restart := [7, [\"\"]], # decommissioned ACE option\n rfactor := [1, IsInt], # \"rfactor\" and \"rt\" are synonyms\n rt := [2, IsInt],\n row := [3, [0,1]],\n sc := [2, IsInt], # \"sc\" and \"stabilising\" are synonyms\n stabilising := [6, IsInt],\n sims := [4, [1,3,5,7,9]],\n standard := [2, [\"\"]],\n statistics := [4, [\"\"]], # \"statistics\" and \"stats\" are synonyms\n stats := [5, [\"\"]],\n style := [5, [\"\"]],\n subgroup := [4, IsString],\n system := [3, IsString],\n text := [4, IsString],\n time := [2, x -> IsInt(x) and x >= -1],\n tw := [2, x -> IsList(x) and Length(x) = 2 and \n IsInt(x[1]) and IsWord(x[2])],\n trace := [2, x -> IsList(x) and Length(x) = 2 and \n IsInt(x[1]) and IsWord(x[2])],\n workspace := [2, x -> IsInt(x) or \n (IsString(x) and x[Length(x)] in \"0123456789kmgKMG\")]\n));\n\n#############################################################################\n####\n##\n#V ACEOptionSynonyms . . . . . record whose fields are `preferred' known ACE\n## . . . . . . . . . . . . . . options that have synonyms. The values are\n## . . . . . . . . . . . . . . . . . . . . lists of synonymous alternatives.\n##\n##\n\nInstallValue(ACEOptionSynonyms, rec(\n ao := [\"aceoutfile\"],\n ct := [\"cfactor\"],\n fill := [\"ffactor\"],\n messages := [\"monitor\"],\n nc := [\"normal\"],\n order := [\"oo\"],\n recover := [\"contiguous\"],\n rt := [\"rfactor\"],\n sc := [\"stabilising\"],\n tw := [\"trace\"],\n stats := [\"statistics\"],\n start := [\"begin\"],\n bye := [\"exit\", \"qui\"],\n redo := [\"check\"]\n));\n\n#############################################################################\n####\n##\n#V NonACEbinOptions . . . . . . . list of known ACE options that are not ACE\n## . . . . . . . . . . . . . . . . . . . . . . . . . . . . . binary options.\n##\n\nInstallValue(NonACEbinOptions,\n [ \"aceinfile\", \"aceoutfile\", \"aceignore\", \"aceignoreunknown\",\n \"acenowarnings\", \"aceecho\", \"aceincomment\", \"aceexampleoptions\",\n \"echo\", \"silent\", \"lenlex\", \"semilenlex\",\n \"incomplete\" ]\n);\n\n#############################################################################\n####\n##\n#V ACE_INTERACT_FUNC_OPTIONS . . . . . list of non ACE options that are used\n## . . . . . . . . . . . . . . . . . . . . by the interaction ACE functions\n##\n\nInstallValue(ACE_INTERACT_FUNC_OPTIONS,\n [ # used by: ACEConjugatesForNormalClosure\n \"add\",\n # used by: ACEOrders\n \"suborder\", \n # used by: ACERandomlyApplyCosetCoincidence\n \"attempts\", \"hibound\", \"lobound\", \"subindex\" ]\n);\n\n#############################################################################\n####\n##\n#V ACEParameterOptions . . record whose fields are the known ACE parameter\n## . . . . . . . . . . . . options. Each field is assigned the known \n## . . . . . . . . . . . . default value, or is a record of default values.\n##\n## An ACE `parameter' option, is a known ACE option for which the ACE binary\n## has a default value. These are the `Run Parameters' that ACE lists with \n## the `sr: 1' command, except for `group', `relators' and `generators'\n## (which the user provides a value for via arguments rather than options).\n##\n## For the case that the value of a field of the ACEParameterOptions record\n## is itself a record, the fields of that record are `default' and \n## strategies for which the value assigned by that strategy differs from the\n## `default' strategy. A strategy here means a strategy option concatenated\n## with any of its possible values (as strings).\n##\n\nInstallValue(ACEParameterOptions, rec(\n asis := 0,\n # `ct' is synonymous with `cfactor' but here we list just once.\n ct := rec(default := 0, felsch0 := 1000, felsch1 := 1000, \n hard := 1000, purec := 1000, sims9 := 1000),\n compaction := rec(default := 10, easy := 100, purec := 100, purer := 100),\n dmode := rec(default := 4, easy := 0, hlt := 0,\n purer := 0, sims1 := 0, sims5 := 0),\n dsize := rec(default := 1000),\n enumeration := \"G\",\n # `fill' is synonymous with `ffactor' but here we list just once.\n fill := rec(default := 0, easy := 1, felsch0 := 1, hlt := 1,\n purec := 1, purer := 1, sims1 := 1, sims3 := 1,\n sims5 := 1, sims7 := 1, sims9 := 1),\n hole := -1,\n lookahead := rec(default := 0, hlt := 1),\n loop := 0,\n max := 0,\n mendelsohn := rec(default := 0, sims5 := 1, sims7 := 1),\n messages := 0, # Synonymous with `monitor' but here we list just once.\n no := rec(default := -1, easy := 0, felsch0 := 0, hlt := 0,\n purec := 0, purer := 0, sims1 := 0, sims3 := 0,\n sims5 := 0, sims7 := 0, sims9 := 0),\n path := rec(default := 0),\n pmode := rec(default := 3, easy := 0, felsch0 := 0, hlt := 0,\n purec := 0, purer := 0, sims1 := 0, sims3 := 0,\n sims5 := 0, sims7 := 0, sims9 := 0),\n psize := rec(default := 256),\n # `rt' is synonymous with `rfactor' but here we list just once.\n rt := rec(default := 0, easy := 1000, hard := 1, \n hlt := 1000, purer := 1000, sims1 := 1000,\n sims3 := -1000, sims5 := 1000, sims7 := -1000),\n row := rec(default := 1, felsch0 := 0, felsch1 := 0, \n purec := 0, purer := 0, sims9 := 0),\n subgroup := \"H\",\n time := -1,\n workspace := 1000000\n));\n\n#############################################################################\n####\n##\n#V ACEStrategyOptions . list of known ACE options that are strategy options\n##\n\nInstallValue(ACEStrategyOptions,\n [ \"default\", \"easy\", \"felsch\", \"hard\", \"hlt\", \"purec\", \"purer\", \"sims\" ]\n);\n\n#############################################################################\n####\n##\n#V ACE_OPT_TRANSLATIONS . . . . . record of ACE interface options for which\n## . . . . . . . . . . . . . . . . . the ACE binary has a different name; \n## . . . . . . . . . . . . . . . . . its fields are the ACE interface names,\n## . . . . . . . . . . . . . . . . . its values are the ACE binary names.\n##\n\nInstallValue(ACE_OPT_TRANSLATIONS, rec(\n purec := \"pure c\", # These first two haven't been called NonACEbinOptions\n purer := \"pure r\", \n aceoutfile := \"ao\",\n aceecho := \"echo\", \n aceincomment := \"#\"\n));\n\n#############################################################################\n####\n##\n#V ACE_OPT_ACTIONS . . . . . . . record of special actions of ACE options\n## . . . . . . . . . . . . . . . its fields are the ACE option names with\n## . . . . . . . . . . . . . . . special actions, its values are the actions\n##\n\nInstallValue(ACE_OPT_ACTIONS, rec(\n purec := \"passed to ACE via option: pure c\",\n purer := \"passed to ACE via option: pure r\", \n aceoutfile := \"passed to ACE via option: ao\",\n aceecho := \"passed to ACE via option: echo\",\n aceincomment := \"passed as an ACE comment, behind a '#'\",\n aceexampleoptions := \"inserted by ACEExample, not passed to ACE\"\n));\n\n#############################################################################\n####\n##\n#V ACE_ERRORS . . . . . . . . . . . . record of ACE interface error messages\n##\n##\n\nInstallValue(ACE_ERRORS, rec(\n argnotopt := \"should be passed as an argument, NOT an option\"\n));\n\n#############################################################################\n####\n##\n#V ACE_OPT_SENTINELS . . . . . . . . . . . . . . record of option sentinels\n##\n## is a record whose fields are the preferred option name of those ACE\n## options that normally produce output and whose values are either `fail'\n## if there is no reliable way of detecting the last line of output or a\n## function of an input line that returns `true' if is the\n## last line of output expected for an option.\n##\n\nInstallValue(ACE_OPT_SENTINELS, rec(\n start := line -> Length(line) > 1 and line[ Length(line) - 1 ] = ')',\n redo := line -> Length(line) > 1 and line[ Length(line) - 1 ] = ')',\n continu := line -> Length(line) > 1 and line[ Length(line) - 1 ] = ')',\n aep := line -> IsMatchingSublist(line, \"* P\"),\n rep := fail,\n cc := line -> IsMatchingSublist(line, \"Coset\"),\n mode := line -> IsMatchingSublist(line, \"start =\"),\n nc := fail,\n order := fail,\n options := line -> IsMatchingSublist(line, \" host info\"),\n dump := line -> IsMatchingSublist(line, \" #----\"),\n sr := line -> IsMatchingSublist(line, \" #----\"),\n stats := line -> IsMatchingSublist(line, \" #----\"),\n print := fail,\n rc := line -> Length(line) > 12 and\n line{[1..13]} in [\"* No success;\", \"* An appropri\",\n \" finite ind\", \" * Unable t\"],\n cycles := line -> Length(line) > 1 and line{[1..2]} in [\"CO\", \"co\"],\n recover := line -> Length(line) > 1 and line{[1..2]} in [\"CO\", \"co\"],\n standard := line -> Length(line) > 1 and line{[1..2]} in [\"CO\", \"co\"],\n sc := fail,\n style := line -> IsMatchingSublist(line, \"style =\"),\n test := fail,\n tw := line -> PositionSublist(line, \"* word =\") <> fail or\n IsMatchingSublist(line, \"* Trace \")\n));\n\n#############################################################################\n####\n##\n#F IS_INC_POS_INT_LIST . . . . . . Internal function used in KnownACEOptions\n## . . . . . . . . returns true if argument is a single positive integer or\n## . . . . . . . . . . . is a strictly increasing list of positive integers\n##\nInstallGlobalFunction(IS_INC_POS_INT_LIST, \n x -> IsPosInt(x) or (IsPosInt(x[1]) and IsSSortedList(x)));\n\n#############################################################################\n####\n##\n#F IS_ACE_STRINGS . . . . . . . . Internal function used in KnownACEOptions\n## . . . . . . . . . returns true if argument is a string or list of strings\n##\nInstallGlobalFunction(IS_ACE_STRINGS, \n x -> IsString(x) or (IsList(x) and ForAll(x, xi -> IsString(xi))));\n\n#############################################################################\n####\n##\n#F IsKnownACEOption . . . . . . . . Returns true if optname is a mixed case\n## . . . . . . . . . . . . . . . . . abbreviation of a field of\n## . . . . . . . . . . . . . . . . . . KnownACEOptions, or false otherwise.\n##\nInstallGlobalFunction(IsKnownACEOption, \n optname -> ACEOptionData(optname).known);\n\n#############################################################################\n####\n##\n#F ACEPreferredOptionName . . . . Returns the lowercase unabbreviated first\n## . . . . . . . . . . . . . . . . alternative of optname if it is a known\n## . . . . . . . . . . . . . . . . ACE option, or optname in lowercase,\n## . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . otherwise.\n##\nInstallGlobalFunction(ACEPreferredOptionName, \n optname -> ACEOptionData(optname).synonyms[1]);\n\n#############################################################################\n####\n##\n#F IsACEParameterOption . . Returns true if ACEPreferredOptionName(optname) \n## . . . . . . . . . . . . . . . . . . . . is a field of ACEParameterOptions\n##\nInstallGlobalFunction(IsACEParameterOption, \n optname -> ACEPreferredOptionName(optname) in RecNames(ACEParameterOptions));\n\n#############################################################################\n####\n##\n#F IsACEStrategyOption . . . Returns true if ACEPreferredOptionName(optname) \n## . . . . . . . . . . . . . . . . . . . . . . . . is in ACEStrategyOptions\n##\nInstallGlobalFunction(IsACEStrategyOption, \n optname -> ACEPreferredOptionName(optname) in ACEStrategyOptions);\n\n#############################################################################\n####\n##\n#F ACE_OPTIONS . . . . . . . . . . . . . . . . . . . . . . Internal function\n## . . . . . . . . . returns the options passed to an ACE interface function\n##\n##\nInstallGlobalFunction(ACE_OPTIONS, function()\n if IsEmpty(OptionsStack) then\n return rec();\n else\n return OptionsStack[ Length(OptionsStack) ];\n fi;\nend);\n\n#############################################################################\n####\n##\n#F ACE_OPT_NAMES . . . . . . . . . . . . . . . . . . . . . Internal function\n## . . . . . . . . returns option names passed to an ACE interface function\n## . . . . . . . . . . . . . if acenowarnings is not an option it also warns\n## . . . . . . . . . . . . . . . . . . . . . . . . about deprecated options\n##\nInstallGlobalFunction(ACE_OPT_NAMES, function()\nlocal optnames;\n optnames := RecNames(ACE_OPTIONS());\n if not VALUE_ACE_OPTION(optnames, false, \"acenowarnings\") then\n if \"messfile\" in optnames then\n Info(InfoACE + InfoWarning, 1,\n \"ACE Warning: \", \n \"Option `messfile' deprecated: use `ACEoutfile' instead\");\n elif \"outfile\" in optnames then\n Info(InfoACE + InfoWarning, 1,\n \"ACE Warning: \", \n \"Option `outfile' deprecated: use `ACEinfile' instead\");\n fi;\n fi;\n return optnames;\nend);\n\n#############################################################################\n####\n##\n#F MATCHES_KNOWN_ACE_OPT_NAME . . . . . . . . . . . . . . Internal function\n## . . . . returns true iff optname is a valid abbreviation of knownoptname\n## . . . . . . . . . . . . . . . . . optname should be in lowercase already!\n##\nInstallGlobalFunction(MATCHES_KNOWN_ACE_OPT_NAME, \nfunction(knownoptname, optname)\n return IsMatchingSublist(knownoptname, optname) and\n KnownACEOptions.(knownoptname)[1] <= Length(optname);\nend);\n\n#############################################################################\n####\n##\n#F FULL_ACE_OPT_NAME . . . . . . . . . . . . . . . . . . Internal procedure\n## . . . . . . sets opt.fullname to be the unabbreviated version of opt.name\n## . . . . . . . . . . . if one exists among the fields of KnownACEOptions,\n## . . . . . . . . . . . . . . in which case, opt.known is also set to true;\n## . . . . . . . . . . . otherwise, opt.fullname is set to opt.name in \n## . . . . . . . . . . . . . . lower case, and opt.known is set to false.\n##\nInstallGlobalFunction(FULL_ACE_OPT_NAME, function(opt)\nlocal lcaseoptname, list;\n lcaseoptname := LowercaseString(opt.name);\n list := Filtered(RecNames(KnownACEOptions), \n s -> MATCHES_KNOWN_ACE_OPT_NAME(s, lcaseoptname));\n opt.known := not( IsEmpty(list) );\n if opt.known then\n opt.fullname := list[1]; # We assume any match is unique!\n else\n opt.fullname := lcaseoptname;\n fi;\nend);\n\n#############################################################################\n####\n##\n#F ACE_OPTION_SYNONYMS . . . . . . . . . . . . . . . . . . Internal function\n## . . . . . . . . . . . . . . . . . . returns a list of synonyms of optname\n##\n##\nInstallGlobalFunction(ACE_OPTION_SYNONYMS, function(optname)\nlocal list, recname;\n list := [ optname ];\n for recname in RecNames(ACEOptionSynonyms) do\n if recname = optname or optname in ACEOptionSynonyms.(recname) then\n list := Concatenation( [ recname ], ACEOptionSynonyms.(recname) );\n break;\n fi;\n od;\n return list;\nend);\n\n#############################################################################\n####\n##\n#F ACE_IF_EXPR . . . . . . . . . . . . . . . . . . . . . . An expression if\n##\n##\nInstallGlobalFunction(ACE_IF_EXPR, function(bool, trueval, falseval, failval)\n if bool = true then\n return trueval;\n elif bool = false then\n return falseval;\n else\n return failval;\n fi;\nend);\n \n#############################################################################\n####\n##\n#F ACE_VALUE_OPTION . . . . . . . . Essentially an extension of ValueOption\n## . . . . . . . . . . . . . . . but also removes optname from OptionsStack\n##\n## ACE_VALUE_OPTION(optname, defaultval) returns ValueOption(optname) if\n## optname is set and defaultval, otherwise.\n##\n## ACE_VALUE_OPTION(optname, val, trueval, elseval). If optname has value\n## val then return trueval else return elseval.\n##\n## If ACE_VALUE_OPTION is called with a different no. of aguments to 1 or 2,\n## all but the first argument is ignored, and ValueOption(arg[1]) is\n## returned. Calling ACE_VALUE_OPTION with no arguments is an error.\n##\nInstallGlobalFunction(ACE_VALUE_OPTION, function(arg)\nlocal optval;\n optval := ValueOption(arg[1]);\n if not IsEmpty(OptionsStack) then\n Unbind( OptionsStack[ Length(OptionsStack) ].(arg[1]) );\n fi;\n if Length(arg) = 2 then\n return ACE_IF_EXPR(optval <> fail, optval, arg[2], arg[2]);\n elif Length(arg) = 4 then\n return ACE_IF_EXPR(optval = arg[2], arg[3], arg[4], arg[4]);\n elif not IsEmpty(arg) then\n # Ignore all but the first argument\n return optval;\n fi;\nend);\n \n#############################################################################\n####\n##\n#F ACE_VALUE_OPTION_ERROR(, , , , )\n##\n## returns:\n## `false' if `ValueOption(