提交 22226ae5 authored 作者: James Bergstra's avatar James Bergstra

removing debugprints

上级 706d92fa
...@@ -671,7 +671,7 @@ def _beta_L_plus_alpha_M(beta, L, alpha, M, recurse_flip = True): ...@@ -671,7 +671,7 @@ def _beta_L_plus_alpha_M(beta, L, alpha, M, recurse_flip = True):
#TODO: insert a BLAS ddot Op #TODO: insert a BLAS ddot Op
pass pass
if Mr.ndim == 2: if Mr.ndim == 2:
print "RETURNING GEMV (case 2)" #print "RETURNING GEMV (case 2)"
if Mr.dtype == Ml.dtype: if Mr.dtype == Ml.dtype:
rval = [gemv_no_inplace(L, alpha, Mr.T, Ml, beta)] rval = [gemv_no_inplace(L, alpha, Mr.T, Ml, beta)]
assert L.type == rval[0].type, (L.type, rval[0].type) assert L.type == rval[0].type, (L.type, rval[0].type)
...@@ -680,7 +680,7 @@ def _beta_L_plus_alpha_M(beta, L, alpha, M, recurse_flip = True): ...@@ -680,7 +680,7 @@ def _beta_L_plus_alpha_M(beta, L, alpha, M, recurse_flip = True):
pass pass
if Ml.ndim == 2: if Ml.ndim == 2:
if Mr.ndim == 1: if Mr.ndim == 1:
print "RETURNING GEMV (case 3)" #print "RETURNING GEMV (case 3)"
if Mr.dtype == Ml.dtype: if Mr.dtype == Ml.dtype:
rval = [gemv_no_inplace(L, alpha, Ml, Mr, beta)] rval = [gemv_no_inplace(L, alpha, Ml, Mr, beta)]
assert L.type == rval[0].type, (L.type, rval[0].type) assert L.type == rval[0].type, (L.type, rval[0].type)
......
Markdown 格式
0%
您添加了 0 到此讨论。请谨慎行事。
请先完成此评论的编辑!
注册 或者 后发表评论