fix doc string

Author: vtavana

dpnp/dpnp_iface_linearalgebra.py

@@ -169,8 +169,7 @@ def dot(a, b, out=None):
 
 def einsum(*operands, out=None, optimize=False, **kwargs):
     """
-    einsum(subscripts, *operands, out=None, dtype=None, order="K",
-           casting="safe", optimize=False)
+    einsum(subscripts, *operands, out=None, dtype=None, order="K", casting="safe", optimize=False)
 
     Evaluates the Einstein summation convention on the operands.
 
@@ -199,10 +198,10 @@ def einsum(*operands, out=None, optimize=False, **kwargs):
         Default is ``"K"``.
     casting : {"no", "equiv", "safe", "same_kind", "unsafe"}, optional
         Controls what kind of data casting may occur. Setting this to
-        "unsafe" is not recommended, as it can adversely affect accumulations.
+        `"unsafe"` is not recommended, as it can adversely affect accumulations.
 
-          * "no" means the data types should not be cast at all.
-          * "equiv" means only byte-order changes are allowed.
+          * ``"no"`` means the data types should not be cast at all.
+          * 'equiv' means only byte-order changes are allowed.
           * "safe" means only casts which can preserve values are allowed.
           * "same_kind" means only safe casts or casts within a kind,
             like float64 to float32, are allowed.
@@ -382,9 +381,9 @@ def einsum(*operands, out=None, optimize=False, **kwargs):
     larger arrays:
 
     >>> a = np.ones(64000).reshape(20, 40, 80)
-
-    (benchmarked on 12th Gen Intel(R) Core(TM) i7-1265U.)
-    Basic `einsum`: 146 ms ± 23.5 ms per loop
+    
+    Basic `einsum`: 146 ms ± 23.5 ms per loop (benchmarked on 12th 
+    Gen Intel® Core™ i7-1265U)
 
     >>> %timeit -r 10 -n 50 np.einsum("ijk,ilm,njm,nlk,abc->",a,a,a,a,a)