/*
 * The MIT License
 *
 * Copyright (c) 2012-2015 Richard Lavoie, BioUno
 * 
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 * 
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 * 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */
package org.jenkinsci.plugins.imagegallery.comparative;

import java.io.Serializable;
import java.util.Comparator;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.TreeMap;
import java.util.TreeSet;

/**
 * @author Richard Lavoie
 * @since 1.0
 */
public class FilePairTree implements Serializable {
    private static final long serialVersionUID = 1L;

    private Map<String, FilePairTree> nodes = new TreeMap<String, FilePairTree>();
	
	@SuppressWarnings("unchecked")
    private Set<FilePair> leafs = new TreeSet<>(
	    (Comparator<FilePair> & Serializable) (o1, o2) -> {
			return o1.getName().compareTo(o2.getName());
		}
	);
	
	public void addToBranch(List<String> branch, FilePair leaf) {
		if (branch == null) {
			return;
		}
		if (branch.size() == 0) {
			leafs.add(leaf);
		} else {
			String branchRoot = branch.remove(0);
			FilePairTree subs = nodes.get(branchRoot);
	        if (subs == null) {
	            subs = new FilePairTree();
	            nodes.put(branchRoot, subs);
	        }
            subs.addToBranch(branch, leaf);
		}
	}

	public Map<String, FilePairTree> getNodes() {
		return nodes;
	}
	
	public Set<FilePair> getLeafs() {
		return leafs;
	}
	
}

@@ -1622,19 +1622,25 @@
 ree%3E();%0A
-%09%0A%09
+    %0A    
 @Suppres
@@ -1711,17 +1711,20 @@
 eSet%3C%3E(%0A
-%09
+    
     (Com
@@ -1771,19 +1771,28 @@
 2) -%3E %7B%0A
-%09%09%09
+            
 return o
@@ -1832,19 +1832,34 @@
 ));%0A
-%09%09%7D%0A%09);%0A%09%0A%09
+        %7D%0A    );%0A    %0A    
 publ
@@ -1916,18 +1916,24 @@
 leaf) %7B%0A
-%09%09
+        
 if (bran
@@ -1950,25 +1950,46 @@
 ) %7B%0A
-%09%09%09return;%0A%09%09%7D%0A%09%09
+            return;%0A        %7D%0A        
 if (
@@ -2010,19 +2010,28 @@
 == 0) %7B%0A
-%09%09%09
+            
 leafs.ad
@@ -2039,18 +2039,24 @@
 (leaf);%0A
-%09%09
+        
 %7D else %7B
@@ -2056,19 +2056,28 @@
  else %7B%0A
-%09%09%09
+            
 String b
@@ -2110,11 +2110,20 @@
 0);%0A
-%09%09%09
+            
 File
@@ -2161,17 +2161,20 @@
 hRoot);%0A
-%09
+    
         
@@ -2193,17 +2193,20 @@
 null) %7B%0A
-%09
+    
         
@@ -2236,17 +2236,20 @@
 Tree();%0A
-%09
+    
         
@@ -2281,17 +2281,20 @@
  subs);%0A
-%09
+    
         
@@ -2343,17 +2343,29 @@
 f);%0A
-%09%09%7D%0A%09%7D%0A%0A%09
+        %7D%0A    %7D%0A%0A    
 publ
@@ -2402,26 +2402,32 @@
 etNodes() %7B%0A
-%09%09
+        
 return nodes
@@ -2432,14 +2432,23 @@
 es;%0A
-%09%7D%0A%09%0A%09
+    %7D%0A    %0A    
 publ
@@ -2481,10 +2481,16 @@
 ) %7B%0A
-%09%09
+        
 retu
@@ -2503,11 +2503,17 @@
 fs;%0A
-%09%7D%0A%09
+    %7D%0A    
 %0A%7D%0A

Replace tabs by spaces