directory-walk

I found many examples on walking through directory tree, but I need something a little different. I need a class with some method which each call returns one file from directory and gradually walking through directory tree. How can I do this please? I am using functions FindFirstFile, FindNextFile and FindClose, I am newbie in c++. I have something like this... For example I have this simple directory tree Parent(folder)\ file1.txt file2.txt Child(folder)\ file3.txt file4.txt and I need a class with a method for example getNextFile(), that first call returns file1.txt; second call returns

I need a file system walker that I could instruct to ignore traversing directories that I want to leave untouched, including all subdirectories below that branch. The os.walk and os.path.walk just don't do it. Actually, os.walk may do exactly what you want. Say I have a list (perhaps a set) of directories to ignore in ignore . Then this should work: def my_walk(top_dir, ignore): for dirpath, dirnames, filenames in os.walk(top_dir): dirnames[:] = [ dn for dn in dirnames if os.path.join(dirpath, dn) not in ignore ] yield dirpath, dirnames, filenames It is possible to modify the second element of

I'm working on a job that processes a nested directory structure, containing files on multiple levels: one/ ├── three/ │ └── four/ │ ├── baz.txt │ ├── bleh.txt │ └── foo.txt └── two/ ├── bar.txt └── gaa.txt When I add one/ as an input path, no files are processed, since none are immediately available at the root level. I read about job.addInputPathRecursively(..) , but this seems to have been deprecated in the more recent releases (I'm using hadoop 1.0.2). I've written some code to walk the folders and add each dir with job.addInputPath(dir) , which worked until the job crashed when trying to

I'm messing around with file lookups in python on a large hard disk. I've been looking at os.walk and glob. I usually use os.walk as I find it much neater and seems to be quicker (for usual size directories). Has anyone got any experience with them both and could say which is more efficient? As I say, glob seems to be slower, but you can use wildcards etc, were as with walk, you have to filter results. Here is an example of looking up core dumps. core = re.compile(r"core\.\d*") for root, dirs, files in os.walk("/path/to/dir/") for file in files: if core.search(file): path = os.path.join(root

I feel that assigning files, and folders and doing the += [item] part is a bit hackish. Any suggestions? I'm using Python 3.2 from os import * from os.path import * def dir_contents(path): contents = listdir(path) files = [] folders = [] for i, item in enumerate(contents): if isfile(contents[i]): files += [item] elif isdir(contents[i]): folders += [item] return files, folders Sanjay T. Sharma Take a look at the os.walk function which returns the path along with the directories and files it contains. That should considerably shorten your solution. Indeed using items += [item] is bad for many