test/java/nio/file/Files/walkFileTree/CreateFileTree.java
Print this page
*** 32,56 ****
public class CreateFileTree {
static final Random rand = new Random();
- public static Path createTemporaryDirectory() throws IOException {
- Path tmpdir = Paths.get(System.getProperty("java.io.tmpdir"));
- Path dir;
- do {
- dir = tmpdir.resolve("name" + rand.nextInt());
- } while (dir.exists());
- dir.createDirectory();
- return dir;
- }
-
public static void main(String[] args) throws IOException {
! Path top = createTemporaryDirectory();
! if (!top.isAbsolute())
! top = top.toAbsolutePath();
!
List<Path> dirs = new ArrayList<Path>();
// create tree
Queue<Path> queue = new ArrayDeque<Path>();
queue.add(top);
--- 32,43 ----
public class CreateFileTree {
static final Random rand = new Random();
public static void main(String[] args) throws IOException {
! Path top = Files.createTempDirectory("tree");
List<Path> dirs = new ArrayList<Path>();
// create tree
Queue<Path> queue = new ArrayDeque<Path>();
queue.add(top);
*** 59,69 ****
Path dir;
while (((dir = queue.poll()) != null) && (n < total)) {
int r = Math.min((total-n), (1+rand.nextInt(3)));
for (int i=0; i<r; i++) {
String name = "dir" + (++n);
! Path subdir = dir.resolve(name).createDirectory();
queue.offer(subdir);
dirs.add(subdir);
}
}
assert dirs.size() >= 2;
--- 46,56 ----
Path dir;
while (((dir = queue.poll()) != null) && (n < total)) {
int r = Math.min((total-n), (1+rand.nextInt(3)));
for (int i=0; i<r; i++) {
String name = "dir" + (++n);
! Path subdir = Files.createDirectory(dir.resolve(name));
queue.offer(subdir);
dirs.add(subdir);
}
}
assert dirs.size() >= 2;
*** 71,81 ****
// create a few regular files in the file tree
int files = dirs.size() * 3;
for (int i=0; i<files; i++) {
String name = "file" + (i+1);
int x = rand.nextInt(dirs.size());
! dirs.get(x).resolve(name).createFile();
}
// create a few sym links in the file tree so as to create cycles
int links = 1 + rand.nextInt(5);
for (int i=0; i<links; i++) {
--- 58,68 ----
// create a few regular files in the file tree
int files = dirs.size() * 3;
for (int i=0; i<files; i++) {
String name = "file" + (i+1);
int x = rand.nextInt(dirs.size());
! Files.createFile(dirs.get(x).resolve(name));
}
// create a few sym links in the file tree so as to create cycles
int links = 1 + rand.nextInt(5);
for (int i=0; i<links; i++) {
*** 85,95 ****
y = rand.nextInt(dirs.size());
} while (y != x);
String name = "link" + (i+1);
Path link = dirs.get(x).resolve(name);
Path target = dirs.get(y);
! link.createSymbolicLink(target);
}
// done
System.out.println(top);
}
--- 72,82 ----
y = rand.nextInt(dirs.size());
} while (y != x);
String name = "link" + (i+1);
Path link = dirs.get(x).resolve(name);
Path target = dirs.get(y);
! Files.createSymbolicLink(link, target);
}
// done
System.out.println(top);
}