more typos

Author: fchapoton

src/sage/combinat/crystals/pbw_datum.pyx

@@ -462,7 +462,7 @@ cpdef list enhance_braid_move_chain(braid_move_chain, cartan_type):
     # This likely could be done when performing chain_of_reduced_words
     # Things in here get called the most (about 50x more than enhance_braid_move_chain)
     for pos in range(1, len(braid_move_chain)):
-        # This gets the smallest continguous half-open interval [a, b)
+        # This gets the smallest contiguous half-open interval [a, b)
         # that contains the indices where current_word and previous_word differ.
         current_word = <tuple> (braid_move_chain[pos])
         for k in range(ell):

src/sage/geometry/polyhedron/base.py

@@ -3455,7 +3455,7 @@ def triangulate(self, engine='auto', connected=True, fine=False, regular=None, s
             except AssertionError:
                 # PointConfiguration is not adapted to inhomogeneous cones
                 # This is a hack. TODO: Implement the necessary things in
-                # PointConfiguration to accep such cases.
+                # PointConfiguration to accept such cases.
                 c = self.representative_point()
                 normed_v = ((1/(r.vector()*c))*r.vector() for r in self.ray_generator())
                 pc = PointConfiguration(normed_v, connected=connected, fine=fine, regular=regular, star=star)

src/sage/graphs/generic_graph.py

@@ -6196,7 +6196,7 @@ def edge_disjoint_spanning_trees(self, k, root=None, solver=None, verbose=0):
         if root is None:
             root = next(self.vertex_iterator())
 
-        # r_edges is a relaxed variable grater than edges. It is used to
+        # r_edges is a relaxed variable greater than edges. It is used to
         # check the presence of cycles
         r_edges = p.new_variable(nonnegative=True)
 

src/sage/matrix/matrix_modn_sparse.pyx

@@ -4,8 +4,9 @@ Sparse matrices over `\ZZ/n\ZZ` for `n` small
 This is a compiled implementation of sparse matrices over
 `\ZZ/n\ZZ` for `n` small.
 
-TODO: - move vectors into a Cython vector class - add _add_ and
-_mul_ methods.
+.. TODO::
+
+    move vectors into a Cython vector class - add _add_ and _mul_ methods.
 
 EXAMPLES::
 
@@ -68,15 +69,15 @@ TESTS::
     []
 """
 
-#*****************************************************************************
+# ****************************************************************************
 #       Copyright (C) 2006 William Stein <[email protected]>
 #
 # This program is free software: you can redistribute it and/or modify
 # it under the terms of the GNU General Public License as published by
 # the Free Software Foundation, either version 2 of the License, or
 # (at your option) any later version.
-#                  http://www.gnu.org/licenses/
-#*****************************************************************************
+#                  https://www.gnu.org/licenses/
+# ****************************************************************************
 
 from __future__ import absolute_import
 
@@ -760,7 +761,7 @@ cdef class Matrix_modn_sparse(matrix_sparse.Matrix_sparse):
         .. NOTE::
 
            For very sparse matrices Gaussian elimination is faster
-           because it barly has anything to do. If the fill in needs to
+           because it barely has anything to do. If the fill in needs to
            be considered, 'Symbolic Reordering' is usually much faster.
         """
         if self._nrows == 0 or self._ncols == 0:

src/sage/misc/classcall_metaclass.pyx

@@ -9,7 +9,7 @@ AUTHORS:
   documentation, Cythonization and optimization.
 """
 
-#*****************************************************************************
+# ****************************************************************************
 #       Copyright (C) 2009      Nicolas M. Thiery <nthiery at users.sf.net>
 #       Copyright (C) 2010-2012 Florent Hivert <Florent.Hivert at lri.fr>
 #
@@ -18,7 +18,7 @@ AUTHORS:
 # the Free Software Foundation, either version 2 of the License, or
 # (at your option) any later version.
 #                  https://www.gnu.org/licenses/
-#*****************************************************************************
+# ****************************************************************************
 from __future__ import print_function
 
 from cpython.object cimport *
@@ -270,7 +270,7 @@ cdef class ClasscallMetaclass(NestedClassMetaclass):
 
         Typical applications include the implementation of factories or of
         unique representation (see :class:`UniqueRepresentation`). Such
-        features are traditionaly implemented by either using a wrapper
+        features are traditionally implemented by either using a wrapper
         function, or fiddling with :meth:`~object.__new__`.
 
         The benefit, compared with fiddling directly with

src/sage/schemes/elliptic_curves/ell_rational_field.py

@@ -3773,7 +3773,7 @@ def congruence_number(self, M=1):
         r"""
         The case `M==1` corresponds to the classical definition of congruence number:
         Let `X` be the subspace of `S_2(\Gamma_0(N))` spanned by the newform
-        associated with this elliptic curve, and `Y` be orthogonal compliment
+        associated with this elliptic curve, and `Y` be orthogonal complement
         of `X` under the Petersson inner product. Let `S_X` and `S_Y` be the
         intersections of `X` and `Y` with `S_2(\Gamma_0(N), \ZZ)`. The congruence
         number is defined to be `[S_X \oplus S_Y : S_2(\Gamma_0(N),\ZZ)]`.

src/sage/sets/cartesian_product.py

@@ -5,14 +5,14 @@
 
 - Nicolas Thiery (2010-03): initial version
 """
-#*****************************************************************************
+# ****************************************************************************
 #       Copyright (C) 2008 Nicolas Thiery <nthiery at users.sf.net>,
 #                          Mike Hansen <[email protected]>,
 #                          Florent Hivert <[email protected]>
 #
 #  Distributed under the terms of the GNU General Public License (GPL)
-#                  http://www.gnu.org/licenses/
-#*****************************************************************************
+#                  https://www.gnu.org/licenses/
+# ****************************************************************************
 from __future__ import print_function
 
 import numbers
@@ -121,7 +121,7 @@ def _element_constructor_(self,x):
             sage: R(-5)
             (-5, -5)
         """
-        # NOTE: should we more generlly allow diagonal embedding
+        # NOTE: should we more generally allow diagonal embedding
         # if we have a conversion?
         if self in _Rings and isinstance(x, numbers.Integral):
             return x * self.one()

src/sage/sets/integer_range.py

@@ -5,15 +5,15 @@
 
  - Nicolas Borie  (2010-03): First release.
  - Florent Hivert (2010-03): Added a class factory + cardinality method.
- - Vincent Delecroix (2012-02): add methods rank/unrank, make it complient with
+ - Vincent Delecroix (2012-02): add methods rank/unrank, make it compliant with
    Python int.
 """
-#*****************************************************************************
+# ****************************************************************************
 #  Copyright (C) 2010 Nicolas Borie <[email protected]>
 #
 #  Distributed under the terms of the GNU General Public License (GPL)
-#                  http://www.gnu.org/licenses/
-#*****************************************************************************
+#                  https://www.gnu.org/licenses/
+# ****************************************************************************
 
 from sage.structure.parent import Parent
 from sage.categories.infinite_enumerated_sets import InfiniteEnumeratedSets
@@ -24,6 +24,7 @@
 from sage.rings.integer_ring import IntegerRing
 from sage.rings.infinity import Infinity, MinusInfinity, PlusInfinity
 
+
 class IntegerRange(UniqueRepresentation, Parent):
     r"""
     The class of :class:`Integer <sage.rings.integer.Integer>` ranges

src/sage/stats/hmm/hmm.pyx

@@ -21,15 +21,15 @@ AUTHOR:
    - William Stein, 2010-03
 """
 
-#*****************************************************************************
+# ****************************************************************************
 #       Copyright (C) 2010 William Stein <[email protected]>
 #
 # This program is free software: you can redistribute it and/or modify
 # it under the terms of the GNU General Public License as published by
 # the Free Software Foundation, either version 2 of the License, or
 # (at your option) any later version.
-#                  http://www.gnu.org/licenses/
-#*****************************************************************************
+#                  https://www.gnu.org/licenses/
+# ****************************************************************************
 
 from __future__ import print_function
 
@@ -385,9 +385,11 @@ cdef class DiscreteHiddenMarkovModel(HiddenMarkovModel):
     def emission_matrix(self):
         """
         Return the matrix whose i-th row specifies the emission
-        probability distribution for the i-th state.  More precisely,
+        probability distribution for the i-th state.
+
+        More precisely,
         the i,j entry of the matrix is the probability of the Markov
-        model outputing the j-th symbol when it is in the i-th state.
+        model outputting the j-th symbol when it is in the i-th state.
 
         OUTPUT:
 

src/sage/typeset/character_art_factory.py

@@ -2,7 +2,7 @@
 r"""
 Factory for Character-Based Art
 """
-#*******************************************************************************
+# ******************************************************************************
 #       Copyright (C) 2013 Jean-Baptiste Priez <[email protected]>,
 #
 #  Distributed under the terms of the GNU General Public License (GPL)
@@ -14,8 +14,8 @@
 #
 #  The full text of the GPL is available at:
 #
-#                  http://www.gnu.org/licenses/
-#*******************************************************************************
+#                  https://www.gnu.org/licenses/
+# ******************************************************************************
 from six import iteritems, string_types, text_type, binary_type
 from six.moves import range
 
@@ -364,7 +364,7 @@ def build_list(self, l, baseline=0):
             sage: l.get_breakpoints()
             [9, 17, 25]
 
-        The parantheses only stretch as high as the content (:trac:`28527`)::
+        The parentheses only stretch as high as the content (:trac:`28527`)::
 
             sage: ascii_art([ascii_art('a', baseline=1)])
             [ a ]