我有一个相当大的(3.9 kB)脚本,旨在根据一些参数对齐一些文本,居中等。这是我希望改进的块:(为some-codegolf道歉,但重点不是函数的作用是它们的结构:它们在理论上工作得很好,但我想让它们更短)
#manage + control the margin in spaces between the body text and right vertical rule
def calcMgn(lnNum): return toEven(bwinner-(len(LnOpn[lnNum])+len(LnCtn[lnNum])),-1)//2
def calcRMgn(lnNum): return (0-(1-(toEven(((bwinner-(len(LnOpn[lnNum])+len(LnCtn[lnNum])))//2),-1))))
def calcLenOf(lnNum): return len(LnMgn[lnNum])+len(LnOpn[lnNum])+len(LnCtn[lnNum])+calcRMgn(lnNum)
def calcRDiff(lnNum): return LnMgnR[lnNum] - (lenOf[lnNum] - bwinner)
def calcRMgnSpa(lnNum): return ((LnMgnRAdjust[lnNum])-adjust)
#there absolutely must be a better way to call a function based on its position in a list than the following:
LnMgn=[calcMgn(0)*spa,calcMgn(1)*spa,calcMgn(2)*spa,calcMgn(3)*spa]
LnMgnR=[calcRMgn(0),calcRMgn(1),calcRMgn(2),calcRMgn(3)]
lenOf=[calcLenOf(0),calcLenOf(1),calcLenOf(2),calcLenOf(3)]
LnMgnRAdjust=[calcRDiff(0),calcRDiff(1),calcRDiff(2),calcRDiff(3)]
LnMgnR_spa=[calcRMgnSpa(0)*spa,calcRMgnSpa(1)*spa,calcRMgnSpa(2)*spa,calcRMgnSpa(3)*spa,]
#take the lengths for a test drive to see if they break any rules
testLen=[LnMgn[0] + LnOpn[0] + spa + LnCtn[0] + LnMgnR_spa[0],\
LnMgn[1] + LnOpn[1] + spa + LnCtn[1] + LnMgnR_spa[1],\
LnMgn[2] + LnOpn[2] + spa + LnCtn[2] + LnMgnR_spa[2],\
LnMgn[3] + LnOpn[3] + spa + LnCtn[3] + LnMgnR_spa[3]] #instead of this, I want something like a for statement or ???
for i in range(0,3):
if len(testLen[i]) > bwinner:
LnMgnR_spa[i] = int((toEven(LnMgnRAdjust[i])-adjust)-(len(testLen[i])-bwinner))*str(spa)
#concatenate strings
addLine=[idt + vl + LnMgn[0] + LnOpn[0] + spa + LnCtn[0] + LnMgnR_spa[0] + vr + nl,\
idt + vl + LnMgn[1] + LnOpn[1] + spa + LnCtn[1] + LnMgnR_spa[1] + vr + nl,\
idt + vl + LnMgn[2] + LnOpn[2] + spa + LnCtn[2] + LnMgnR_spa[2] + vr + nl,\
idt + vl + LnMgn[3] + LnOpn[3] + spa + LnCtn[3] + LnMgnR_spa[3] + vr + nl]
我知道 SO 的“我们不会为你编写代码”的政策,我绝对不打算要求这样的帮助,只是指导:有没有办法(我已经用谷歌搜索过,用谷歌搜索过)来制作 LnMgn 及其类似的数组通过其内容动态迭代调用和基于其数组索引的自定义而更有效且更小?