ó ¡Œ™\c@ slddlmZmZddlmZddlmZddlmZddl m Z ej Z d„Z dS(iÿÿÿÿ(tprint_functiontdivision(tPermutationGroup(t Permutation(trange(tuniqcG s•g}g}d}d}xT|D]L}|j}t|jƒ}|j|ƒ||7}|j|ƒ||7}qWg}x-t|ƒD]} |jtt|ƒƒƒq‚Wd} d}x tt|ƒƒD]Œ} xgt| | || ƒD]N} || j| | j} g| D]} | |^q|| |||| +qâW| || 7} ||| 7}qÄWttg|D]}tt|ƒƒ^qaƒƒ}t |dt ƒS(sæ Returns the direct product of several groups as a permutation group. This is implemented much like the __mul__ procedure for taking the direct product of two permutation groups, but the idea of shifting the generators is realized in the case of an arbitrary number of groups. A call to DirectProduct(G1, G2, ..., Gn) is generally expected to be faster than a call to G1*G2*...*Gn (and thus the need for this algorithm). Examples ======== >>> from sympy.combinatorics.group_constructs import DirectProduct >>> from sympy.combinatorics.named_groups import CyclicGroup >>> C = CyclicGroup(4) >>> G = DirectProduct(C, C, C) >>> G.order() 64 See Also ======== __mul__ itdups( tdegreetlent generatorstappendRtlistt array_formRt_af_newRtFalse(tgroupstdegreest gens_countt total_degreet total_genstgroupt current_degtcurrent_num_genst array_genstit current_gentjtgentxtat perm_gens((sClib/python2.7/site-packages/sympy/combinatorics/group_constructs.pyt DirectProduct s0     41N( t __future__RRtsympy.combinatorics.perm_groupsRt sympy.combinatorics.permutationsRtsympy.core.compatibilityRtsympy.utilities.iterablesRR R(((sClib/python2.7/site-packages/sympy/combinatorics/group_constructs.pyts