Rename parameter for brevity.

cython/pycddlib.pxi

@@ -549,25 +549,25 @@ cdef polyhedron_from_ptr(dd_PolyhedraPtr dd_poly):
 
 
 def polyhedron_from_matrix(
-    mat: Matrix, row_order_type: Optional[RowOrderType] = None
+    mat: Matrix, row_order: Optional[RowOrderType] = None
 ) -> Polyhedron:
     """Run the double description method to convert *mat* into a polyhedron,
-    using *row_order_type* if specified.
+    using *row_order* if specified.
 
     .. versionadded:: 3.0.0
 
-        The *row_order_type* parameter.
+        The *row_order* parameter.
     """
     if (
         mat.dd_mat.representation != dd_Inequality
         and mat.dd_mat.representation != dd_Generator
     ):
         raise ValueError("rep_type must be INEQUALITY or GENERATOR")
     cdef dd_ErrorType error = dd_NoError
-    if row_order_type is None:
+    if row_order is None:
         dd_poly = dd_DDMatrix2Poly(mat.dd_mat, &error)
     else:
-        dd_poly = dd_DDMatrix2Poly2(mat.dd_mat, row_order_type, &error)
+        dd_poly = dd_DDMatrix2Poly2(mat.dd_mat, row_order, &error)
     if error != dd_NoError:
         dd_FreePolyhedra(dd_poly)
         _raise_error(error, "failed to run double description method")

src/cdd/__init__.pyi

@@ -109,5 +109,5 @@ def matrix_from_array(
     obj_func: Optional[Sequence[SupportsNumberType]] = None,
 ) -> Matrix: ...
 def polyhedron_from_matrix(
-    mat: Matrix, row_order_type: Optional[RowOrderType] = None
+    mat: Matrix, row_order: Optional[RowOrderType] = None
 ) -> Polyhedron: ...

src/cdd/gmp.pyi

@@ -77,5 +77,5 @@ def matrix_from_array(
     obj_func: Optional[Sequence[SupportsNumberType]] = None,
 ) -> Matrix: ...
 def polyhedron_from_matrix(
-    mat: Matrix, row_order_type: Optional[RowOrderType] = None
+    mat: Matrix, row_order: Optional[RowOrderType] = None
 ) -> Polyhedron: ...

test/test_polyhedron.py

@@ -84,7 +84,7 @@ def test_polyhedron_cube_2() -> None:
 
 
 @pytest.mark.parametrize(
-    "row_order_type,order",
+    "row_order,order",
     [
         (cdd.RowOrderType.MAX_INDEX, [2, 3, 0, 1]),
         (cdd.RowOrderType.MIN_INDEX, [2, 1, 0, 3]),
@@ -95,13 +95,13 @@ def test_polyhedron_cube_2() -> None:
         (cdd.RowOrderType.LEX_MAX, [2, 3, 0, 1]),
     ],
 )
-def test_polyhedron_row_order_type(
-    row_order_type: Optional[cdd.RowOrderType], order: Sequence[int]
+def test_polyhedron_row_order(
+    row_order: Optional[cdd.RowOrderType], order: Sequence[int]
 ) -> None:
     generators = [[1, 1, 0], [1, 0, 0], [1, 0, 1], [1, 1, 1]]
     inequalities = [[0, 0, 1], [0, 1, 0], [1, 0, -1], [1, -1, 0]]
     mat = cdd.matrix_from_array(inequalities, rep_type=cdd.RepType.INEQUALITY)
-    poly = cdd.polyhedron_from_matrix(mat, row_order_type=row_order_type)
+    poly = cdd.polyhedron_from_matrix(mat, row_order=row_order)
     print(cdd.copy_generators(poly).array)
     assert_matrix_almost_equal(
         cdd.copy_generators(poly).array, [generators[i] for i in order]