带递归的完整文件路径

Question

I got a folder structure like this in my Google drive

 root
    |
    ├── folder1
    |   |
    │   ├── sub1
    |   |   |
    │   │   └── sub3
    |   |       |
    │   │       └── sub4
    |   |
    │   └── sub2
    |
    └── folder2
        |
        └── sub1

The code to return all files and folders

from googleapiclient import discovery
from httplib2 import Http
from oauth2client import file, client, tools
from merge import drive

def List():
        store = file.Storage('storage.json')
        creds = store.get()
        DRIVE = discovery.build('drive', 'v3', http=creds.authorize(Http()))
        files = []
        token = ""
        while True:
                f = DRIVE.files().list(pageToken=token,fields="files(name,id,parents),nextPageToken").execute()
                files.extend(f["files"])
                token = f.get("nextPageToken","q")
                if token=="q":
                        break
        return files

This List() returns

 [{"name":"folder1", "id":"folderID1", "parents": ["rootID"]},
  {"name":"folder2", "id":"folderID2", "parents": ["rootID"]},
  {"name":"sub1", "id":"subID1", "parents": ["folderID1"]},
  {"name":"sub1", "id":"subID11", "parents": ["folderID2"]},
  {"name":"sub2", "id":"subID2", "parents": ["folderID1"]},
  {"name":"sub3", "id":"subID3", "parents": ["subID1"]},
  {"name":"sub4", "id":"subID4", "parents": ["subID3"]}]

The code I tried to create full path from above list:

def walk(ID, files, dic):
    for file in files:
        if ID == file["parents"][0]:
            dic = walk(file["id"], files, {file["name"]:dic})
    return {file["name"]:file["id"]}

walk("rootID", List(), "root")

output:

{'sub4': 'subID4'}

Expected Output:

{'root': {'folder1': {'sub1': {'sub3': {'sub4': 'subID4'}}, 'sub2': 'sub2ID'},
          'folder2': {'sub1': 'subID11'}}}

EDIT: Expected Output Explanation:

{root_directory : {sub_folders:...{last_sub_folder: ID}...}}

Answer 1

I think there's something wrong with your list() function.

If I would try to repair your walk() function, I would end up with:

def walk2(ID, files):
    result = {}
    for file in files:
        if ID == file["parents"][0]:
            result[file["name"]] = walk2(file["id"], files)
    if not result:
        return ID
    return result

test = {"root": walk2("rootID", myList)}

In other words: Part of the parsing would actually be done outside the tree. That's ugly.

I think the result of your list() function should contain a root node.