3 回答

TA貢獻(xiàn)1865條經(jīng)驗(yàn) 獲得超7個(gè)贊
之后過(guò)濾列表;將文件名部分轉(zhuǎn)到int或創(chuàng)建要包含的字符串范圍:
included = {'d{:03d}'.format(i) for i in range(15, 26)} # a set
binary = sorted(f for f in glob.glob('C:/Users/Desktop/bin/*.bin') if f[21:25] in included)
上面的代碼生成所述串'd015' 通過(guò)對(duì)'d025'作為一組進(jìn)行快速測(cè)試籍串,然后測(cè)試前4個(gè)字符針對(duì)該組中的每個(gè)文件的; 因?yàn)間lob()返回整個(gè)文件名,所以我們將其切掉了。
對(duì)于可變路徑,我將基于路徑存儲(chǔ)切片偏移量以提高速度:
pattern = 'C:/Users/Desktop/bin/*.bin'
included = {'d{:03d}'.format(i) for i in range(15, 26)} # a set
offset = len(os.path.dirname(pattern)) + 1
binary = sorted(f for f in glob.glob(pattern) if f[offset:offset + 4] in included)
后者的演示:
$ mkdir test
$ touch test/d014-recomb.bin
$ touch test/d015-recomb.bin
$ touch test/d017-recomb.bin
$ touch test/d018-recomb.bin
$ fg
bin/python2.7
>>> import os, glob
>>> pattern = '/tmp/stackoverflow/test/*.bin'
>>> included = {'d{:03d}'.format(i) for i in range(15, 26)} # a set
>>> offset = len(os.path.dirname(pattern)) + 1
>>> sorted(f for f in glob.glob(pattern) if f[offset:offset + 4] in included)
['/tmp/stackoverflow/test/d015-recomb.bin', '/tmp/stackoverflow/test/d017-recomb.bin', '/tmp/stackoverflow/test/d018-recomb.bin']

TA貢獻(xiàn)1876條經(jīng)驗(yàn) 獲得超7個(gè)贊
您可以使用以下方法過(guò)濾列表:
def filter_path(path,l,r):
i = int(os.path.basename(path)[1:4])
if (i >= l) and (i <= r):
return True
return False
result = [i for i in binary if filter_path(i,19,31)]
如果您對(duì)目錄中的元素?cái)?shù)量有100%的信心,則可以:
result = binary[19:30]
或者,對(duì)數(shù)據(jù)進(jìn)行排序后,您可能會(huì)發(fā)現(xiàn)第一個(gè)索引和最后一個(gè)索引以及[1] [2]:
l = binary.find('C:/Users/Desktop/bin/d015.bin')
r = binary.find('C:/Users/Desktop/bin/d023.bin')
result = binary[l:r+1]

TA貢獻(xiàn)1810條經(jīng)驗(yàn) 獲得超4個(gè)贊
您可能必須手動(dòng)添加此限制,因?yàn)闊o(wú)法通過(guò)全局模式來(lái)實(shí)現(xiàn)。
如果您完全知道文件名的構(gòu)建方式,則可以
import os
for i in range(19, 34): # 19 to 33
filename = "d%03d-recomb.bin" % i
if os.path.exists(os.path.join('C:/Users/Desktop/bin', filename)):
print filename
添加回答
舉報(bào)