From 1ea92011a3b60725e8cc15d4a7b0fece53e154ec Mon Sep 17 00:00:00 2001
From: Reinhard Pointner <rednoah@users.noreply.github.com>
Date: Thu, 9 Apr 2015 18:31:13 +0000
Subject: [PATCH] * experiment with data structures for keeping/checking file
 trees in memory

---
 source/net/filebot/util/FileSet.java | 116 +++++++++++++++++++++++++++
 1 file changed, 116 insertions(+)
 create mode 100644 source/net/filebot/util/FileSet.java

diff --git a/source/net/filebot/util/FileSet.java b/source/net/filebot/util/FileSet.java
new file mode 100644
index 00000000..5aab14cc
--- /dev/null
+++ b/source/net/filebot/util/FileSet.java
@@ -0,0 +1,116 @@
+package net.filebot.util;
+
+import java.io.File;
+import java.nio.file.Path;
+import java.nio.file.Paths;
+import java.util.AbstractSet;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.Iterator;
+import java.util.Map;
+import java.util.Set;
+import java.util.Spliterator;
+import java.util.stream.Stream;
+
+public class FileSet extends AbstractSet<Path> {
+
+	private final Map<Path, FileSet> folders = new HashMap<Path, FileSet>(4, 2);
+	private final Set<Path> files = new HashSet<Path>(4, 2);
+
+	private boolean add(Path e, int depth) {
+		// add new leaf element
+		if (e.getNameCount() - depth == 1) {
+			return files.add(e.getFileName());
+		}
+
+		// add new node element
+		if (e.getNameCount() - depth > 1) {
+			folders.computeIfAbsent(e.getName(depth), k -> new FileSet()).add(e, depth + 1);
+		}
+
+		return false;
+	}
+
+	@Override
+	public boolean add(Path e) {
+		return add(e, 0);
+	}
+
+	public boolean add(File e) {
+		return add(e.toPath());
+	}
+
+	public boolean add(String e) {
+		return add(getPath(e));
+	}
+
+	private boolean contains(Path e, int depth) {
+		// add new leaf element
+		if (e.getNameCount() - depth == 1) {
+			return files.contains(e.getFileName());
+		}
+
+		// add new node element
+		if (e.getNameCount() - depth > 1) {
+			FileSet subSet = folders.get(e.getName(depth));
+			return subSet == null ? false : subSet.contains(e, depth + 1);
+		}
+
+		return false;
+	}
+
+	public boolean contains(Path e) {
+		return contains(e, 0);
+	};
+
+	public boolean contains(File e) {
+		return contains(e.toPath());
+	}
+
+	public boolean contains(String e) {
+		return contains(getPath(e));
+	}
+
+	@Override
+	public boolean contains(Object e) {
+		return e == null ? false : contains(getPath(e.toString()));
+	};
+
+	@Override
+	public int size() {
+		return folders.values().stream().mapToInt(f -> f.size()).sum() + files.size();
+	}
+
+	@Override
+	public Stream<Path> stream() {
+		Stream<Path> descendants = folders.entrySet().stream().flatMap(node -> {
+			return node.getValue().stream().map(f -> {
+				return node.getKey().resolve(f);
+			});
+		});
+
+		Stream<Path> children = files.stream();
+
+		return Stream.concat(descendants, children);
+	}
+
+	protected Path getPath(String path) {
+		return Paths.get(path);
+	}
+
+	@Override
+	public Spliterator<Path> spliterator() {
+		return stream().spliterator();
+	}
+
+	@Override
+	public Iterator<Path> iterator() {
+		return stream().iterator();
+	}
+
+	@Override
+	public boolean remove(Object o) {
+		throw new UnsupportedOperationException();
+	}
+
+}