使用python diff 文件夹

# -*-coding:utf-8-*-    
  
#===============================================================================  
# 目录对比工具(包含子目录 )，并列出
# 1、A比B多了哪些文件  
# 2、B比A多了哪些文件  
# 3、二者相同的文件: md5比较
#============================================================================

import os
import time
import difflib
import hashlib


def getFileMd5(filename):
    if not os.path.isfile(filename):
        print('file not exist: ' + filename)
        return
    myhash = hashlib.md5()
    f = open(filename,'rb')
    while True:
        b = f.read(8096)
        if not b :
            break
        myhash.update(b)
    f.close()
    return myhash.hexdigest()


def getAllFiles(path):
    flist=[]
    for root, dirs , fs in os.walk(path):
        for f in fs:
            f_fullpath = os.path.join(root, f)
            f_relativepath = f_fullpath[len(path):]
            flist.append(f_relativepath)
    return flist

def dirCompare(apath,bpath):
    afiles = getAllFiles(apath)
    bfiles = getAllFiles(bpath)

    setA = set(afiles)
    setB = set(bfiles)

    commonfiles = setA & setB  # 处理共有文件

    for f in sorted(commonfiles):
        amd=getFileMd5(apath+'\\'+f)
        bmd=getFileMd5(bpath+'\\'+f)
        if amd != bmd:  
            print ("dif file: %s" %(f))

    # 处理仅出现在一个目录中的文件
    onlyFiles = setA ^ setB
    onlyInA = []
    onlyInB = []
    for of in onlyFiles:
        if of in afiles:
            onlyInA.append(of)
        elif of in bfiles:
            onlyInB.append(of)
            
    if len(onlyInA) > 0:
        print ('-' * 20,"only in ", apath, '-' * 20)
        for of in sorted(onlyInA):
            print (of)
            
    if len(onlyInB) > 0:
        print ('-' * 20,"only in ", bpath, '-' * 20)
        for of in sorted(onlyInB):
            print (of)
            
if __name__ == '__main__':
    aPath = os.getcwd()+'/a'
    bPath = os.getcwd()+'/b'
    dirCompare(aPath, bPath)
    print("\ndone!")

————————————————
版权声明：本文为CSDN博主「林新发」的原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接及本声明。
原文链接：https://blog.csdn.net/linxinfa/article/details/90240952