spaces in matroids, plot, sets

Author: fchapoton

src/sage/matroids/lean_matrix.pyx

@@ -3682,4 +3682,3 @@ cdef class RationalMatrix(LeanMatrix):
         version = 0
         data = (self.nrows(), self.ncols(), entries)
         return unpickle_rational_matrix, (version, data)
-

src/sage/matroids/matroid.pyx

@@ -7985,8 +7985,8 @@ cdef class Matroid(SageObject):
         for c in LM.chains(exclude=LM.maximal_elements()):
             if c: # the facets of IM are already present
                 # get the cardinality of intersection of facet with IM
-                r = self.rank() - len(c) 
-                
+                r = self.rank() - len(c)
+
                 # get candidate independent_sets
                 for I in self.independent_r_sets(r):
                     if I.issubset(c[0]):
@@ -8012,7 +8012,7 @@ cdef class Matroid(SageObject):
 
         OUTPUT:
 
-        An instance of 
+        An instance of
         :class:`MatroidUnion <sage.matroids.union_matroid.MatroidUnion>`.
 
         EXAMPLES::

src/sage/plot/plot3d/transform.pyx

@@ -266,4 +266,3 @@ def rotate_arbitrary(v, double theta):
         (1 - cos_t)*z*z + cos_t        ]
 
     return matrix(RDF, 3, 3, entries)
-

src/sage/sets/disjoint_set.pyx

@@ -887,7 +887,6 @@ cdef class DisjointSet_of_hashables(DisjointSet_class):
             {{0}, {1, 2, 3, 4}}
             sage: d.to_digraph().edges(sort=True)
             [(0, 0, None), (1, 1, None), (2, 1, None), (3, 1, None), (4, 1, None)]
-
         """
         d = {}
         for i from 0 <= i < self.cardinality():
@@ -896,4 +895,3 @@ cdef class DisjointSet_of_hashables(DisjointSet_class):
             d[e] = [p]
         from sage.graphs.graph import DiGraph
         return DiGraph(d)
-

src/sage/sets/disjoint_union_enumerated_sets.py

@@ -542,11 +542,11 @@ def _element_constructor_facade(self, el):
             sage: p = X._element_constructor_((0, []))  # indirect doctest
             sage: p[1].parent()
             Partitions of the integer 0
- 
+
         Test that facade parents can create and properly access elements
         that are tuples (fixed by :trac:`22382`)::
 
-            sage: f = lambda mu: cartesian_product([mu.standard_tableaux(), 
+            sage: f = lambda mu: cartesian_product([mu.standard_tableaux(),
             ....:                                   mu.standard_tableaux()])
             sage: tabs = DisjointUnionEnumeratedSets(Family(Partitions(4), f))
             sage: s = StandardTableau([[1,3],[2,4]])

src/sage/sets/finite_enumerated_set.py

@@ -109,7 +109,7 @@ def __init__(self, elements):
         self._elements = elements
         Parent.__init__(self, facade=True, category=FiniteEnumeratedSets())
 
-    def __bool__(self):
+    def __bool__(self) -> bool:
         r"""
         Conversion to boolean.
 
@@ -122,8 +122,6 @@ def __bool__(self):
         """
         return bool(self._elements)
 
-    
-
     def _repr_(self):
         """
         TESTS::