Remove redundant explicit type for from_int

Author: james-d-mitchell

src/action.cpp

@@ -232,7 +232,7 @@ Returns an iterator yielding the generators.
       thing.def(
           "position",
           [](Action_& self, const_reference_point_type pt) {
-            return from_int<index_type>(self.position(pt));
+            return from_int(self.position(pt));
           },
           py::arg("pt"),
           R"pbdoc(

src/aho-corasick.cpp

@@ -90,9 +90,7 @@ Copy a :any:`AhoCorasick` object.
         "child",
         [](AhoCorasick const&      self,
            AhoCorasick::index_type parent,
-           letter_type             letter) {
-          return from_int<AhoCorasick::index_type>(self.child(parent, letter));
-        },
+           letter_type letter) { return from_int(self.child(parent, letter)); },
         py::arg("parent"),
         py::arg("letter"),
         R"pbdoc(

src/cong-common.cpp

@@ -409,9 +409,7 @@ Copy a :any:`{name}` object.
                              doc                           extra_doc) {
     thing.def(
         "number_of_classes",
-        [](Thing& self) {
-          return from_int<uint64_t>(self.number_of_classes());
-        },
+        [](Thing& self) { return from_int(self.number_of_classes()); },
         make_doc(R"pbdoc(
 :sig=(self: {name}) -> int | PositiveInfinity:
 {only_document_once}

src/froidure-pin.cpp

@@ -206,7 +206,7 @@ See :any:`add_generator` for a detailed description.
       thing.def(
           "current_position",
           [](FroidurePin_ const& self, Element const& x) {
-            return from_int<uint32_t>(self.current_position(x));
+            return from_int(self.current_position(x));
           },
           py::arg("x").noconvert(),
           R"pbdoc(
@@ -713,7 +713,7 @@ elements are sorted, or :any:`UNDEFINED` if *i* is greater than
         m.def(
             "froidure_pin_current_position",
             [](FroidurePinBase const& fpb, word_type const& w) {
-              return from_int<uint32_t>(froidure_pin::current_position(fpb, w));
+              return from_int(froidure_pin::current_position(fpb, w));
             },
             py::arg("fpb"),
             py::arg("w"),

src/paths.cpp

@@ -150,7 +150,7 @@ are no more paths in the range, and ``False`` otherwise.
         "count",
         [](Paths_& p) {
           p.throw_if_source_undefined();
-          return from_int<uint64_t>(p.count());
+          return from_int(p.count());
         },
         R"pbdoc(
 :sig=(self: Paths) -> int | PositiveInfinity:
@@ -200,9 +200,7 @@ Get the current path in the range.
 )pbdoc");
     thing1.def(
         "max",
-        [](Paths_ const& self) {
-          return from_int<decltype(self.max())>(self.max());
-        },
+        [](Paths_ const& self) { return from_int(self.max()); },
         R"pbdoc(
 :sig=(self: Paths) -> int | PositiveInfinity:
 :only-document-once:

src/present.cpp

@@ -823,8 +823,7 @@ If no such word can be found, then a word of length :math:`0` is returned.
       m.def(
           "make_semigroup",
           [](Presentation_& p) {
-            using letter_type = Presentation_::letter_type;
-            return from_int<letter_type>(presentation::make_semigroup<Word>(p));
+            return from_int(presentation::make_semigroup<Word>(p));
           },
           py::arg("p"),
           R"pbdoc(

src/stephen.cpp

@@ -397,8 +397,7 @@ This function triggers the algorithm implemented in this class (if it hasn't bee
       m.def(
           "stephen_number_of_left_factors",
           [](Stephen_& s, size_t min, size_t max) {
-            return from_int<uint64_t>(
-                stephen::number_of_left_factors(s, min, max));
+            return from_int(stephen::number_of_left_factors(s, min, max));
           },
           py::arg("s"),
           py::arg("min") = 0,
@@ -440,8 +439,7 @@ in the range *min* to *max*.
       m.def(
           "stephen_number_of_words_accepted",
           [](Stephen_& s, size_t min, size_t max) {
-            return from_int<uint64_t>(
-                stephen::number_of_words_accepted(s, min, max));
+            return from_int(stephen::number_of_words_accepted(s, min, max));
           },
           py::arg("s"),
           py::arg("min") = 0,

src/todd-coxeter.cpp

@@ -242,7 +242,7 @@ semigroup.
       thing.def(
           "current_index_of",
           [](ToddCoxeter_ const& self, Word const& w) {
-            return from_int<uint32_t>(todd_coxeter::current_index_of(self, w));
+            return from_int(todd_coxeter::current_index_of(self, w));
           },
           py::arg("w"),
           R"pbdoc(

src/ukkonen.cpp

@@ -41,7 +41,7 @@ namespace libsemigroups {
     uk.def(
         "index",
         [](Ukkonen const& self, Word const& w) {
-          return from_int<Ukkonen::index_type>(self.index(w.begin(), w.end()));
+          return from_int(self.index(w.begin(), w.end()));
         },
         py::arg("w"),
         R"pbdoc(
@@ -378,7 +378,7 @@ contained in *u*. If no such suffix exists, then an empty word is returned.
     m.def(
         "number_of_pieces",
         [](Ukkonen const& u, Word const& w) {
-          return from_int<size_t>(ukkonen::number_of_pieces(u, w));
+          return from_int(ukkonen::number_of_pieces(u, w));
         },
         py::arg("u"),
         py::arg("w"),
@@ -621,9 +621,7 @@ The index of the first letter in the edge leading to the node.
     // TODO should the others here also be def_property_readonly?
     node.def_property_readonly(
         "parent",
-        [](Ukkonen::Node const& node) {
-          return from_int<decltype(node.parent)>(node.parent);
-        },
+        [](Ukkonen::Node const& node) { return from_int(node.parent); },
         R"pbdoc(
 The index of the parent node.
 )pbdoc");

src/word-graph.cpp

@@ -200,7 +200,7 @@ the word graph.
         [](WordGraph_ const& self, node_type source) {
           auto result
               = (self.targets(source) | rx::transform([](node_type target) {
-                   return from_int<node_type>(target);
+                   return from_int(target);
                  }));
           return py::make_iterator(rx::begin(result), rx::end(result));
         },
@@ -552,7 +552,7 @@ out_degree())`` , then this function adds an edge from *a* to *b* labelled *a*.
     thing.def(
         "target",
         [](WordGraph_ const& self, node_type source, label_type a) {
-          return from_int<node_type>(self.target(source, a));
+          return from_int(self.target(source, a));
         },
         py::arg("source"),
         py::arg("a"),