Trac #28601: some typos and https

URL: https://trac.sagemath.org/28601
Reported by: chapoton
Ticket author(s): Frédéric Chapoton
Reviewer(s): Thierry Monteil

Author: Release Manager

src/doc/en/developer/git_trac.rst

@@ -9,9 +9,9 @@ Collaborative Development with Git-Trac
 Sometimes you will only want to work on local changes to Sage, for
 your own private needs.  However, typically it is beneficial to
 share code and ideas with others; the manner in which the
-`Sage project <http://sagemath.org>`_ does this (as well as fixing
+`Sage project <https://www.sagemath.org>`_ does this (as well as fixing
 bugs and upgrading components) is in a very collaborative and
-public setting on `the Sage Trac server <http://trac.sagemath.org>`_
+public setting on `the Sage Trac server <https://trac.sagemath.org>`_
 (the Sage bug and enhancement tracker).
 
 One can use ``git`` :ref:`the hard way <chapter-manual-git>` for this,
@@ -71,10 +71,10 @@ Git and Trac Configuration
 
 .. NOTE::
 
-    * `trac <http://trac.sagemath.org>`_ uses username/password for
+    * `trac <https://trac.sagemath.org>`_ uses username/password for
       authentication.
 
-    * Our `git repository server <http://git.sagemath.org>`_ uses SSH
+    * Our `git repository server <https://git.sagemath.org>`_ uses SSH
       public key authentication for write access.
 
 You need to set up both authentication mechanisms to be able to upload
@@ -84,8 +84,8 @@ to the Sage directory and tell ``git trac`` about your trac account::
 
     [user@localhost sage]$ git trac config --user USERNAME --pass 'PASSWORD'
     Trac xmlrpc URL:
-        http://trac.sagemath.org/xmlrpc (anonymous)
-        http://trac.sagemath.org/login/xmlrpc (authenticated)
+        https://trac.sagemath.org/xmlrpc (anonymous)
+        https://trac.sagemath.org/login/xmlrpc (authenticated)
         realm sage.math.washington.edu
     Username: USERNAME
     Password: PASSWORD
@@ -165,7 +165,7 @@ want to add it to Sage. You would first open a ticket for that::
     [user@localhost sage]$ git trac create 'Last Twin Prime'
     Remote branch: u/user/last_twin_prime
     Newly-created ticket number: 12345
-    Ticket URL: http://trac.sagemath.org/12345
+    Ticket URL: https://trac.sagemath.org/12345
     Local branch: t/12345/last_twin_prime
 
 This will create a new trac ticket titled "Last Twin Prime" with a
@@ -190,7 +190,7 @@ Check out an Existing Ticket
 ----------------------------
 
 Alternatively, you can use the `web interface to the Sage trac
-development server <http://trac.sagemath.org>`_ to open a new ticket.
+development server <https://trac.sagemath.org>`_ to open a new ticket.
 Just log in and click on "Create Ticket".
 
 Or maybe somebody else already opened a ticket. Then, to get a suitable
@@ -266,7 +266,7 @@ done by::
     Changing the trac "Branch:" field...
 
 This uploads your changes to a remote branch on the `Sage git server
-<http://git.sagemath.org/sage.git>`_. The ``git trac`` command uses
+<https://git.sagemath.org/sage.git>`_. The ``git trac`` command uses
 the following logic to find out the remote branch name:
 
 * By default, the remote branch name will be whatever is already on
@@ -567,7 +567,7 @@ For an explanation of what should be checked by the reviewer, see
 :ref:`chapter-review`.
 
 If you go to the `web interface to the Sage trac development server
-<http://trac.sagemath.org>`_ then you can click on the "Branch:" field and see
+<https://trac.sagemath.org>`_ then you can click on the "Branch:" field and see
 the code that is added by combining all commits of the ticket. This is what
 needs to be reviewed.
 

src/doc/en/developer/trac.rst

@@ -7,7 +7,7 @@ The Sage Trac Server
 ====================
 
 All changes to Sage source code have to go through the `Sage Trac
-development server <http://trac.sagemath.org>`_. The purpose
+development server <https://trac.sagemath.org>`_. The purpose
 of the Sage trac server is to
 
 1. Provide a place for discussion on issues and store a permanent
@@ -17,15 +17,15 @@ of the Sage trac server is to
 
 3. Link these two together.
 
-There is also a `wiki <http://trac.sagemath.org/wiki>`_ for more general
+There is also a `wiki <https://trac.sagemath.org/wiki>`_ for more general
 organizational web pages, like Sage development workshops.
 
 Thus if you find a bug in Sage, if you have new code to submit, want
 to review new code already written but not yet included in Sage, or if
 you have corrections for the documentation, you should post on the
 trac server. Items on the server are called *tickets*, and anyone may
 search or browse the tickets. For a list of recent changes, just visit
-the `Sage trac timeline <http://trac.sagemath.org/timeline>`_.
+the `Sage trac timeline <https://trac.sagemath.org/timeline>`_.
 
 .. _section-trac-account:
 
@@ -131,7 +131,7 @@ Linking your Public Key to your Trac Account
 The Sage trac server needs to know one of your public keys. You can
 upload it in the preferences, that is
 
-1. Go to http://trac.sagemath.org
+1. Go to https://trac.sagemath.org
 
 2. Log in with your trac username/password
 
@@ -174,14 +174,14 @@ If you think you have found a bug in Sage, here is the procedure:
 - Search through our Google groups for postings related to your possible bug (it
   may have been fixed/reported already):
 
-  * ``sage-devel``: `<http://groups.google.com/group/sage-devel>`_
-  * ``sage-support``: `<http://groups.google.com/group/sage-support>`_
+  * ``sage-devel``: `<https://groups.google.com/group/sage-devel>`_
+  * ``sage-support``: `<https://groups.google.com/group/sage-support>`_
 
   Similarly, you can search :ref:`chapter-sage-trac` to see if anyone else has
   opened a ticket about your bug.
 
 - If you do not find anything, and you are not sure that you have found a bug,
-  ask about it on `sage-devel <http://groups.google.com/group/sage-devel>`_. A
+  ask about it on `sage-devel <https://groups.google.com/group/sage-devel>`_. A
   bug report should contain:
 
   - An explicit and **reproducible example** illustrating your bug (and/or the
@@ -381,7 +381,7 @@ new branch on the trac ticket. The following are some other relevant
 issues:
 
 * The Patch buildbot wil automatically test your ticket. See `the
-  patchbot wiki <http://wiki.sagemath.org/buildbot>`_ for more
+  patchbot wiki <https://wiki.sagemath.org/buildbot>`_ for more
   information about its features and limitations. Make sure that you
   look at the log, especially if the patch buildbot did not give you
   the green blob.

src/sage/combinat/crystals/pbw_datum.pyx

@@ -461,7 +461,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/combinat/rsk.py

@@ -1887,7 +1887,7 @@ class RuleSuperRSK(RuleRSK):
 
     * The output still consists of two tableaux `(P, Q)` of equal
       shapes, but rather than both of them being semistandard, now
-      they are semistandard super tableax.
+      they are semistandard super tableaux.
 
     * The main difference is in the way bumping works. Instead of having 
       only row bumping super RSK uses `\epsilon`-insertion, a combination

src/sage/geometry/newton_polygon.py

@@ -11,7 +11,7 @@
 #
 #  Distributed under the terms of the GNU General Public License (GPL)
 #
-#                  http://www.gnu.org/licenses/
+#                  https://www.gnu.org/licenses/
 #############################################################################
 from __future__ import division
 
@@ -246,7 +246,7 @@ def _mul_(self, other):
             sage: NP = NP1 * NP2; NP
             Infinite Newton polygon with 3 vertices: (0, 0), (1, 1), (2, 5/2) ending by an infinite line of slope 2
 
-        The slopes of ``NP`` is the union of thos of ``NP1`` and those of ``NP2``
+        The slopes of ``NP`` is the union of those of ``NP1`` and those of ``NP2``
         which are less than the last slope::
 
             sage: NP1.slopes()

src/sage/geometry/polyhedron/base.py

@@ -3476,7 +3476,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 collections import Iterator, Sequence
 
@@ -758,7 +759,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/matrix/matrix_space.py

@@ -1810,7 +1810,7 @@ def matrix(self, x=None, **kwds):
     def matrix_space(self, nrows=None, ncols=None, sparse=False):
         """
         Return the matrix space with given number of rows, columns and
-        sparcity over the same base ring as self, and defaults the same as
+        sparsity over the same base ring as self, and defaults the same as
         self.
 
         EXAMPLES::

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 cpython.object cimport *
 from cpython.type cimport type as pytype
@@ -75,7 +75,7 @@ cdef class ClasscallMetaclass(NestedClassMetaclass):
 
     ``ClasscallMetaclass`` is an extension of the base :class:`type`.
 
-    TODO: find a good name for this metaclass.
+    .. TODO:: find a good name for this metaclass.
 
     TESTS::
 
@@ -269,7 +269,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