Révision 171
pobysoPythonSage/src/sageSLZ/sagePolynomialOperations.sage (revision 171) | ||
---|---|---|
969 | 969 |
def spo_polynomial_to_polynomials_list_7(p, alpha, N, iBound, tBound, |
970 | 970 |
columnsWidth=0): |
971 | 971 |
""" |
972 |
As per Random Bits... direct loops nesting. |
|
972 | 973 |
""" |
973 | 974 |
pRing = p.parent() |
974 | 975 |
polynomialsList = [] |
... | ... | |
994 | 995 |
def spo_polynomial_to_polynomials_list_8(p, alpha, N, iBound, tBound, |
995 | 996 |
columnsWidth=0): |
996 | 997 |
""" |
998 |
As per Random Bits... (reversed loop nesting) |
|
997 | 999 |
""" |
998 | 1000 |
pRing = p.parent() |
999 | 1001 |
polynomialsList = [] |
... | ... | |
1052 | 1054 |
numRows = len(protoMatrixRows) |
1053 | 1055 |
if numRows == 0: |
1054 | 1056 |
return None |
1055 |
# The last row is the longest one. |
|
1056 |
numColumns = len(protoMatrixRows[numRows-1]) |
|
1057 |
# Search for the longest row to get the number of columns. |
|
1058 |
numColumns = 0 |
|
1059 |
for row in protoMatrixRows: |
|
1060 |
rowLength = len(row) |
|
1061 |
if numColumns < rowLength: |
|
1062 |
numColumns = rowLength |
|
1057 | 1063 |
if numColumns == 0: |
1058 | 1064 |
return None |
1059 | 1065 |
baseMatrix = matrix(ZZ, numRows, numColumns) |
Formats disponibles : Unified diff