jodd-core/src/main/java/jodd/io/findfile/FindFile.java
public File nextFile() {
		if (todoFiles == null) {
			init();
		}

		while (true) {

			// iterate files

			if (!todoFiles.isEmpty()) {
				FilesIterator filesIterator = todoFiles.getLast();
				File nextFile = filesIterator.next();

				if (nextFile == null) {
					todoFiles.removeLast();
					continue;
				}

				if (nextFile.isDirectory()) {
					if (!walking) {
						todoFolders.add(nextFile);
						continue;
					}
					// walking
					if (recursive) {
						todoFiles.add(new FilesIterator(nextFile));
					}
					if (includeDirs) {
						if (acceptFile(nextFile)) {
							lastFile = nextFile;
							return nextFile;
						}
					}
					continue;
				}

				lastFile = nextFile;
				return nextFile;
			}

			// process folders

			File folder;
			boolean initialDir = false;

			if (todoFolders.isEmpty()) {
				if (pathList.isEmpty()) {
					// the end
					return null;
				}

				folder = pathList.removeFirst();

				rootFile = folder;
				rootPath = rootFile.getAbsolutePath();

				initialDir = true;
			} else {
				folder = todoFolders.removeFirst();
			}

			if ((initialDir) || (recursive)) {
				todoFiles.add(new FilesIterator(folder));
			}

			if ((!initialDir) && (includeDirs)) {
				if (acceptFile(folder)) {
					lastFile = folder;
					return folder;
				}
			}
		}
	}
public File nextFile() {
		if (todoFiles == null) {
			init();
		}

		while (true) {

			// iterate files

			if (!todoFiles.isEmpty()) {
				FilesIterator filesIterator = todoFiles.getLast();
				File nextFile = filesIterator.next();

				if (nextFile == null) {
					todoFiles.removeLast();
					continue;
				}

				if (nextFile.isDirectory()) {
					if (!walking) {
						todoFolders.add(nextFile);
						continue;
					}
					// walking
					if (recursive) {
						todoFiles.add(new FilesIterator(nextFile));
					}
					if (includeDirs) {
						if (acceptFile(nextFile)) {
							lastFile = nextFile;
							return nextFile;
						}
					}
					continue;
				}

				lastFile = nextFile;
				return nextFile;
			}

			// process folders

			File folder;
			boolean initialDir = false;

			if (todoFolders.isEmpty()) {
				if (pathList.isEmpty()) {
					// the end
					return null;
				}

				folder = pathList.removeFirst();

				rootFile = folder;
				rootPath = rootFile.getAbsolutePath();

				initialDir = true;
			} else {
				folder = todoFolders.removeFirst();
			}

			if ((initialDir) || (recursive)) {
				todoFiles.add(new FilesIterator(folder));
			}

			if ((!initialDir) && (includeDirs)) {
				if (acceptFile(folder)) {
					lastFile = folder;
					return folder;
				}
			}
		}
	}
public File nextFile ( ) { if ( todoFiles == null ) { init ( ) ; } while ( true ) { // iterate files if ( ! todoFiles . isEmpty ( ) ) { FilesIterator filesIterator = todoFiles . getLast ( ) ; File nextFile = filesIterator . next ( ) ; if ( nextFile == null ) { todoFiles . removeLast ( ) ; continue ; } if ( nextFile . isDirectory ( ) ) { if ( ! walking ) { todoFolders . add ( nextFile ) ; continue ; } // walking if ( recursive ) { todoFiles . add ( new FilesIterator ( nextFile ) ) ; } if ( includeDirs ) { if ( acceptFile ( nextFile ) ) { lastFile = nextFile ; return nextFile ; } } continue ; } lastFile = nextFile ; return nextFile ; } // process folders File folder ; boolean initialDir = false ; if ( todoFolders . isEmpty ( ) ) { if ( pathList . isEmpty ( ) ) { // the end return null ; } folder = pathList . removeFirst ( ) ; rootFile = folder ; rootPath = rootFile . getAbsolutePath ( ) ; initialDir = true ; } else { folder = todoFolders . removeFirst ( ) ; } if ( ( initialDir ) || ( recursive ) ) { todoFiles . add ( new FilesIterator ( folder ) ) ; } if ( ( ! initialDir ) && ( includeDirs ) ) { if ( acceptFile ( folder ) ) { lastFile = folder ; return folder ; } } } }
Finds the next file. Returns founded file that matches search configuration
or <code>null</code> if no more files can be found.
Finds the next file . Returns founded file that matches search configuration or <code > null< / code > if no more files can be found .