当前位置: 首页>>代码示例>>Python>>正文


Python permutations.Cycle类代码示例

本文整理汇总了Python中sympy.combinatorics.permutations.Cycle的典型用法代码示例。如果您正苦于以下问题:Python Cycle类的具体用法?Python Cycle怎么用?Python Cycle使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。


在下文中一共展示了Cycle类的2个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Python代码示例。

示例1: _print_Permutation

    def _print_Permutation(self, expr):
        from sympy.combinatorics.permutations import Permutation, Cycle

        if Permutation.print_cyclic:
            if not expr.size:
                return "()"
            # before taking Cycle notation, see if the last element is
            # a singleton and move it to the head of the string
            s = Cycle(expr)(expr.size - 1).__repr__()[len("Cycle") :]
            last = s.rfind("(")
            if not last == 0 and "," not in s[last:]:
                s = s[last:] + s[:last]
            s = s.replace(",", "")
            return s
        else:
            s = expr.support()
            if not s:
                if expr.size < 5:
                    return "Permutation(%s)" % str(expr.array_form)
                return "Permutation([], size=%s)" % expr.size
            trim = str(expr.array_form[: s[-1] + 1]) + ", size=%s" % expr.size
            use = full = str(expr.array_form)
            if len(trim) < len(full):
                use = trim
            return "Permutation(%s)" % use
开发者ID:MooVI,项目名称:sympy,代码行数:25,代码来源:str.py

示例2: _print_Permutation

 def _print_Permutation(self, expr):
     from sympy.combinatorics.permutations import Permutation, Cycle
     if Permutation.print_cyclic:
         if not expr.size:
             return 'Permutation()'
         # before taking Cycle notation, see if the last element is
         # a singleton and move it to the head of the string
         s = Cycle(expr)(expr.size - 1).__repr__()[len('Cycle'):]
         last = s.rfind('(')
         if not last == 0 and ',' not in s[last:]:
             s = s[last:] + s[:last]
         return 'Permutation%s' % s
     else:
         s = expr.support()
         if not s:
             if expr.size < 5:
                 return 'Permutation(%s)' % str(expr.array_form)
             return 'Permutation([], size=%s)' % expr.size
         trim = str(expr.array_form[:s[-1] + 1]) + ', size=%s' % expr.size
         use = full = str(expr.array_form)
         if len(trim) < len(full):
             use = trim
         return 'Permutation(%s)' % use
开发者ID:MechCoder,项目名称:sympy,代码行数:23,代码来源:str.py


注:本文中的sympy.combinatorics.permutations.Cycle类示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。