doc: remove "vector"

Author: james-d-mitchell

src/bipart.cpp

@@ -95,7 +95,7 @@ transverse and those consisting of positive values are not.
 :raises LibsemigroupsError:  if the constructed :any:`Blocks` object is not valid.
 
 :complexity:
-  linear in the sum of the sizes of the vectors in blocks.
+  linear in the sum of the sizes of the lists in blocks.
 )pbdoc");
 
     thing.def(

src/pbr.cpp

@@ -61,11 +61,11 @@ Construct empty PBR of given degree.
 Construct from adjacencies ``1`` to ``n`` and ``-1`` to ``-n``.
 
 Construct from adjacencies ``1`` to ``n`` and ``-1`` to ``-n``. The parameters
-*left* and *right* should be containers of ``n`` vectors of integer values,
-so that the vector in position ``i`` of *left* is the list of points
-adjacent to ``i`` in the :any:`PBR`, and the vector in position ``i`` of
-*right* is the list of points adjacent to ``n + i`` in the :any:`PBR`.
-A negative value ``i`` corresponds to ``n - i``.
+*left* and *right* should be containers of ``n`` lists of integer values, so
+that the list in position ``i`` of *left* is the list of points adjacent to
+``i`` in the :any:`PBR`, and the list in position ``i`` of *right* is the
+list of points adjacent to ``n + i`` in the :any:`PBR`. A negative value ``i``
+corresponds to ``n - i``.
 
 :param left: container of adjacencies of ``1`` to ``n``
 :type left: list[list[int]]
@@ -85,11 +85,11 @@ A negative value ``i`` corresponds to ``n - i``.
 Construct from adjacencies ``0`` to ``2n - 1``.
 
 Construct from adjacencies ``0`` to ``2n - 1``. The parameter *x* must be a
-container of vectors of ``int`` with size ``2n`` for some integer ``n``,
-and the vector in position ``i`` is the list of points adjacent to ``i``
+container of lists of ``int`` with size ``2n`` for some integer ``n``,
+and the list in position ``i`` is the list of points adjacent to ``i``
 in the :any:`PBR` constructed.
 
-:param x: the container of vectors of adjacencies.
+:param x: the container of lists of adjacencies.
 :type x: list[list[int]]
 
 :raises LibsemigroupsError: if the resultant PBR:

src/present.cpp

@@ -60,7 +60,7 @@ This class can be used to construction presentations for semigroups or monoids
 and is intended to be used as the input to other algorithms in
 ``libsemigroups_pybind11``. The idea is to provide a shallow wrapper around a
 collection of words of type :ref:`Word<pseudo_word_type_class>`. We refer to
-this vector of words as the *rules* of the presentation. The :any:`Presentation`
+this list of words as the *rules* of the presentation. The :any:`Presentation`
 class also provides some checks that the rules really define a presentation,
 (i.e. it's consistent with its alphabet), and some related functionality is
 available in the module :any:`libsemigroups_pybind11.presentation`.)pbdoc");
@@ -605,7 +605,7 @@ Change or re-order the alphabet.
 This function replaces ``p.alphabet()`` with ``new_alphabet``, where possible,
 and re-writes the rules in the presentation using the new alphabet.
 
-:param p: the presentation .
+:param p: the presentation.
 :type p: Presentation
 
 :param new_alphabet: the replacement alphabet.
@@ -991,7 +991,7 @@ If *existing* and *replacement* are words, then this function replaces every
 non-overlapping instance of *existing* in every rule by *replacement*. The
 presentation *p* is changed in-place.
 
-:param p: the presentation .
+:param p: the presentation.
 :type p: Presentation
 
 :param existing: the word to be replaced.

src/presentation-examples.cpp

@@ -1717,13 +1717,11 @@ least congruence containing the relation :math:`a^{\sigma(a)} = a` for each
 resultant :math:`\sigma`-plactic monoid is known as the stylic monoid,
 and is given in :any:`stylic_monoid`.
 
-:param sigma: a vector representing the image of :math:`\sigma`.
-:type sigma: list
+:param sigma: a list representing the image of :math:`\sigma`.
+:type sigma: list[int]
 
 :returns: The specified presentation.
 :rtype: Presentation
-
-:raises LibsemigroupsError:  if ``n < 1``.
 )pbdoc");
     m.def("presentation_examples_zero_rook_monoid",
           &examples::zero_rook_monoid,

src/transf.cpp

@@ -653,7 +653,7 @@ Class for representing permutations on up to ``2 ** 32`` points.
 
 A *permutation* :math:`f` is an injective transformation defined on the whole
 of :math:`\{0, 1, \ldots, n - 1\}` for some integer :math:`n` called the
-*degree* of :math:`f`. A permutation is stored as a vector of the images of
+*degree* of :math:`f`. A permutation is stored as a list of the images of
 :math:`(0, 1, \ldots, n - 1)`, i.e. :math:`((0)f, (1)f, \ldots, (n - 1)f)`.
 
 Permutations are optimised for the number of points in the image with
@@ -718,7 +718,7 @@ fewer points requiring less space per point.
       m.def("transf_inverse",
             py::overload_cast<Perm_ const&>(&inverse<N, Scalar>));
     }  // bind_perm
-  }    // namespace
+  }  // namespace
 
   void init_transf(py::module& m) {
     // Transformations