當前位置: 首頁>>代碼示例>>Python>>正文


Python Cycle.replace方法代碼示例

本文整理匯總了Python中sympy.combinatorics.permutations.Cycle.replace方法的典型用法代碼示例。如果您正苦於以下問題:Python Cycle.replace方法的具體用法?Python Cycle.replace怎麽用?Python Cycle.replace使用的例子?那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在sympy.combinatorics.permutations.Cycle的用法示例。


在下文中一共展示了Cycle.replace方法的2個代碼示例,這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚,您的評價將有助於係統推薦出更棒的Python代碼示例。

示例1: _print_Permutation

# 需要導入模塊: from sympy.combinatorics.permutations import Cycle [as 別名]
# 或者: from sympy.combinatorics.permutations.Cycle import replace [as 別名]
    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,代碼行數:27,代碼來源:str.py

示例2: _print_Permutation

# 需要導入模塊: from sympy.combinatorics.permutations import Cycle [as 別名]
# 或者: from sympy.combinatorics.permutations.Cycle import replace [as 別名]
 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)' % self._print(expr.array_form)
             return 'Permutation([], size=%s)' % self._print(expr.size)
         trim = self._print(expr.array_form[:s[-1] + 1]) + ', size=%s' % self._print(expr.size)
         use = full = self._print(expr.array_form)
         if len(trim) < len(full):
             use = trim
         return 'Permutation(%s)' % use
開發者ID:Lenqth,項目名稱:sympy,代碼行數:26,代碼來源:str.py


注:本文中的sympy.combinatorics.permutations.Cycle.replace方法示例由純淨天空整理自Github/MSDocs等開源代碼及文檔管理平台,相關代碼片段篩選自各路編程大神貢獻的開源項目,源碼版權歸原作者所有,傳播和使用請參考對應項目的License;未經允許,請勿轉載。