Searched refs:T_PERM2 (Results 1 – 13 of 13) sorted by relevance
/dports/math/gap/gap-4.11.0/src/ |
H A D | permutat.cc | 1868 if (TNUM_OBJ(g)==T_PERM2) { in FuncSPLIT_PARTITION() 1914 UInt type = (TNUM_OBJ(opL) == T_PERM2 ? 20 : 40) + (TNUM_OBJ(opR) == T_PERM2 ? 2 : 4); in FuncDISTANCE_PERMS() 2326 if (TNUM_OBJ(perm) == T_PERM2) in myquo() 2783 MakeBagTypePublic( T_PERM2); in InitKernel() 2820 EqFuncs [ T_PERM2 ][ T_PERM2 ] = EqPerm<UInt2, UInt2>; in InitKernel() 2824 LtFuncs [ T_PERM2 ][ T_PERM2 ] = LtPerm<UInt2, UInt2>; in InitKernel() 2830 ProdFuncs[ T_PERM2 ][ T_PERM2 ] = ProdPerm<UInt2, UInt2>; in InitKernel() 2834 QuoFuncs[T_PERM2][T_PERM2] = QuoPerm; in InitKernel() 2838 LQuoFuncs[ T_PERM2 ][ T_PERM2 ] = LQuoPerm<UInt2, UInt2>; in InitKernel() 2856 PowFuncs [ T_PERM2 ][ T_PERM2 ] = PowPerm<UInt2, UInt2>; in InitKernel() [all …]
|
H A D | permutat.h | 34 return NewBag(T_PERM2, SIZEBAG_PERM2(deg)); in NEW_PERM2() 125 #define IS_PERM2(perm) (TNUM_OBJ(perm) == T_PERM2) 131 return (TNUM_OBJ(f) == T_PERM2 || TNUM_OBJ(f) == T_PERM4); in IS_PERM()
|
H A D | permutat_intern.hh | 25 static const UInt tnum = T_PERM2;
|
H A D | trans.cc | 1766 if (TNUM_OBJ(p) == T_PERM2) { in FuncAS_TRANS_PERM_INT() 1793 if (TNUM_OBJ(p) == T_PERM2) { in FuncAS_TRANS_PERM_INT() 1837 if (TNUM_OBJ(p) == T_PERM2) { in FuncAS_TRANS_PERM() 3463 if (TNUM_OBJ(p) == T_PERM2) { in FuncPOW_KER_PERM() 4516 ProdFuncs[T_TRANS2][T_PERM2] = ProdTransPerm<UInt2, UInt2>; in InitKernel() 4518 ProdFuncs[T_TRANS4][T_PERM2] = ProdTransPerm<UInt4, UInt2>; in InitKernel() 4520 ProdFuncs[T_PERM2][T_TRANS2] = ProdPermTrans<UInt2, UInt2>; in InitKernel() 4521 ProdFuncs[T_PERM2][T_TRANS4] = ProdPermTrans<UInt2, UInt4>; in InitKernel() 4524 PowFuncs[T_TRANS2][T_PERM2] = PowTransPerm<UInt2, UInt2>; in InitKernel() 4526 PowFuncs[T_TRANS4][T_PERM2] = PowTransPerm<UInt4, UInt2>; in InitKernel() [all …]
|
H A D | pperm.cc | 2029 if (TNUM_OBJ(p) == T_PERM2) { in FuncAS_PPERM_PERM() 2524 GAP_ASSERT(TNUM_OBJ(p) == T_PERM2); in ProdPPerm2Perm2() 2720 GAP_ASSERT(TNUM_OBJ(p) == T_PERM2); in ProdPPerm4Perm2() 3943 ProdFuncs[T_PPERM2][T_PERM2] = ProdPPerm2Perm2; in InitKernel() 3946 ProdFuncs[T_PPERM4][T_PERM2] = ProdPPerm4Perm2; in InitKernel() 3947 ProdFuncs[T_PERM2][T_PPERM2] = ProdPermPPerm<UInt2, UInt2>; in InitKernel() 3950 ProdFuncs[T_PERM2][T_PPERM4] = ProdPermPPerm<UInt2, UInt4>; in InitKernel() 3953 PowFuncs[T_PPERM2][T_PERM2] = PowPPerm2Perm2; // special case in InitKernel() 3955 PowFuncs[T_PPERM4][T_PERM2] = PowPPermPerm<UInt4, UInt4, UInt2>; in InitKernel() 3970 LQuoFuncs[T_PERM2][T_PPERM2] = LQuoPermPPerm<UInt2, UInt2>; in InitKernel() [all …]
|
H A D | objects.h | 152 T_PERM2, enumerator
|
H A D | objects.c | 2271 ExportAsConstantGVar(T_PERM2); in InitLibrary()
|
/dports/math/gap/gap-4.11.0/pkg/datastructures-0.2.5/src/ |
H A D | hashfunctions.c | 51 GAP_ASSERT(TNUM_OBJ(perm) == T_PERM2 || TNUM_OBJ(perm) == T_PERM4); in DataHashFuncForPerm() 54 if (TNUM_OBJ(perm) == T_PERM2) { in DataHashFuncForPerm() 71 if (TNUM_OBJ(perm) != T_PERM2 && TNUM_OBJ(perm) != T_PERM4) { in DATA_HASH_FUNC_FOR_PERM() 224 case T_PERM2: in BasicRecursiveHash()
|
/dports/math/gap/gap-4.11.0/tst/testinstall/ |
H A D | perm.tst | 4 # Permutations come in two flavors in GAP, with two TNUMs: T_PERM2 for 7 gap> TNUM_OBJ((1000,2^16)) = T_PERM2; 15 gap> TNUM_OBJ((1,2)) = T_PERM2; 35 # For this, we use the elements of Sym(3), once as T_PERM2 and once as T_PERM4. 296 # PermList error handling for T_PERM2
|
H A D | pperm.tst | 2983 # a bunch of tests involving T_PERM2 permutations of degree 65536
|
/dports/math/gap/gap-4.11.0/pkg/ferret-1.0.2/YAPB++/source/library/ |
H A D | perm.hpp | 393 if(TNUM_OBJ(rec) == T_PERM2) in operator ()()
|
/dports/math/gap/gap-4.11.0/pkg/semigroups-3.2.3/src/ |
H A D | bipart.cc | 538 if (TNUM_OBJ(p) == T_PERM2) { in BIPART_STAB_ACTION() 574 if (TNUM_OBJ(p) == T_PERM2) { in BIPART_STAB_ACTION()
|
/dports/math/gap/gap-4.11.0/src/hpc/ |
H A D | serialize.c | 1108 RegisterSerializerFunctions(T_PERM2, SerializeBinary, DeserializeBinary); in InitKernel()
|