Minor fix in API doc of pyfaust/matfaust.

wrapper/matlab/+matfaust/@Faust/Faust.m

@@ -652,6 +652,8 @@ classdef Faust
 
 		%======================================================================
 		%> @brief Returns a new Faust whose class is single. It allows to convert all the factors to single precision.
+		%>
+		%>
 		%> @b Usage
 		%>
 		%>     @b sF = single(F)

wrapper/python/pyfaust.py

@@ -3019,9 +3019,9 @@ class FaustMulMode:
     """
     ## \brief The default method, it computes the product from the right to the left.
     DEFAULT_L2R=0
-    ## \brief This method implements the classic dynamic programming solution
+    ## \brief This method implements the classic dynamic programming solution to the chain matrix problem.
     ##
-    ## to the chain matrix problem (see https://en.wikipedia.org/wiki/Matrix_chain_multiplication#A_dynamic_programming_algorithm).
+    ## See https://en.wikipedia.org/wiki/Matrix_chain_multiplication#A_dynamic_programming_algorithm.
     ## Note that the standard method is extended in order to take into account the complexity of multiplications including a sparse matrix (because that's not the same cost than multiplying dense matrices).
     DYNPROG=5
     ## \brief This method computes the product of the matrix chain from the left to the right using the Torch C++ library (CPU backend).

wrapper/python/pyfaust/fact.py

@@ -1289,7 +1289,7 @@ def butterfly(M, type="right"):
         >>> from pyfaust import Faust, wht, dft
         >>> from pyfaust.fact import butterfly
         >>> H = wht(32).toarray() # it works with dft too!
-        >>> F = butterfly(H, dir='bbtree')
+        >>> F = butterfly(H, type='bbtree')
         >>> (F-H).norm()/Faust(H).norm()
         1.0272844187006565e-15