File tree Expand file tree Collapse file tree 1 file changed +6
-4
lines changed Expand file tree Collapse file tree 1 file changed +6
-4
lines changed Original file line number Diff line number Diff line change @@ -3290,8 +3290,9 @@ def index_of_max(iterable):
3290
3290
# between 0 and S(0)
3291
3291
for s in range (l , n_f ):
3292
3292
for j in range (1 , S [0 ]):
3293
- v = tuple (PM [permutations_bar [n_p ][0 ](s + 1 ) - 1 , permutations_bar [n_p ][1 ](i + 1 ) - 1 ] for i in range (n_v ))
3294
- if v [0 ] < v [j ]:
3293
+ v0 = PM [permutations_bar [n_p ][0 ](s + 1 ) - 1 , permutations_bar [n_p ][1 ](1 ) - 1 ]
3294
+ vj = PM [permutations_bar [n_p ][0 ](s + 1 ) - 1 , permutations_bar [n_p ][1 ](j + 1 ) - 1 ]
3295
+ if v0 < vj :
3295
3296
permutations_bar [n_p ][1 ] = PGE (S_v , 1 , j + 1 ) * permutations_bar [n_p ][1 ]
3296
3297
if ccf == 0 :
3297
3298
l_r [0 ] = PM [permutations_bar [n_p ][0 ](s + 1 ) - 1 , permutations_bar [n_p ][1 ](1 ) - 1 ]
@@ -3336,8 +3337,9 @@ def index_of_max(iterable):
3336
3337
s -= 1
3337
3338
# Find the largest value in this symmetry block
3338
3339
for j in range (c + 1 , h ):
3339
- v = tuple (PM [(permutations_bar [s ][0 ])(l + 1 ) - 1 , (permutations_bar [s ][1 ])(i + 1 ) - 1 ] for i in range (n_v ))
3340
- if (v [c ] < v [j ]):
3340
+ vc = PM [(permutations_bar [s ][0 ])(l + 1 ) - 1 , (permutations_bar [s ][1 ])(c + 1 ) - 1 ]
3341
+ vj = PM [(permutations_bar [s ][0 ])(l + 1 ) - 1 , (permutations_bar [s ][1 ])(j + 1 ) - 1 ]
3342
+ if (vc < vj ):
3341
3343
permutations_bar [s ][1 ] = PGE (S_v , c + 1 , j + 1 ) * permutations_bar [s ][1 ]
3342
3344
if ccf == 0 :
3343
3345
# Set reference and carry on to next permutation
You can’t perform that action at this time.
0 commit comments