trax #18411 fixing a typo and doctest continuation

sagemath · Sep 12, 2015 · 57b82e3 · 57b82e3
1 parent 10df218
commit 57b82e3
Show file tree

Hide file tree

Showing 2 changed files with 9 additions and 9 deletions.
diff --git a/src/sage/categories/cartesian_product.py b/src/sage/categories/cartesian_product.py
@@ -120,7 +120,7 @@ def __call__(self, args):
             sage: _.category()
             Category of Cartesian products of finite enumerated sets
 
-            sage: cartesian_product([set([0,1,2]), [0,1])
+            sage: cartesian_product([set([0,1,2]), [0,1]])
             The cartesian product of ({0, 1, 2}, {0, 1})
             sage: _.category()
             Category of Cartesian products of sets

diff --git a/src/sage/rings/quotient_ring.py b/src/sage/rings/quotient_ring.py
@@ -31,14 +31,14 @@
     sage: from sage.rings.noncommutative_ideals import Ideal_nc
     sage: from itertools import product
     sage: class PowerIdeal(Ideal_nc):
-    ...    def __init__(self, R, n):
-    ...        self._power = n
-    ...        self._power = n
-    ...        Ideal_nc.__init__(self,R,[R.prod(m) for m in product(R.gens(), repeat=n)])
-    ...    def reduce(self,x):
-    ...        R = self.ring()
-    ...        return add([c*R(m) for m,c in x if len(m)<self._power],R(0))
-    ...
+    ....:     def __init__(self, R, n):
+    ....:         self._power = n
+    ....:         self._power = n
+    ....:         Ideal_nc.__init__(self, R, [R.prod(m) for m in product(R.gens(), repeat=n)])
+    ....:     def reduce(self,x):
+    ....:         R = self.ring()
+    ....:         return add([c*R(m) for m,c in x if len(m)<self._power],R(0))
+    ....:
     sage: F.<x,y,z> = FreeAlgebra(QQ, 3)
     sage: I3 = PowerIdeal(F,3); I3
     Twosided Ideal (x^3, x^2*y, x^2*z, x*y*x, x*y^2, x*y*z, x*z*x, x*z*y,