-package org.simantics.scl.ui.console;\r
-\r
-import java.util.Collection;\r
-import java.util.Deque;\r
-import java.util.Iterator;\r
-import java.util.LinkedList;\r
-import java.util.Set;\r
-import java.util.TreeSet;\r
-\r
-/**\r
- * @author Antti Villberg\r
- */\r
-public final class Preferences {\r
-\r
- public static final String COMMAND_HISTORY = "COMMAND_HISTORY";\r
-\r
- private static final String DELIMITER = "¤¤¤¤";\r
-\r
- public static String join(Collection<String> s, String delimiter) {\r
- if (s == null || s.isEmpty()) return "";\r
- Iterator<String> iter = s.iterator();\r
- StringBuilder builder = new StringBuilder(iter.next());\r
- while( iter.hasNext() )\r
- {\r
- builder.append(delimiter).append(iter.next());\r
- }\r
- return builder.toString();\r
- }\r
- \r
- public static Deque<String> decodePaths(String recentPathsPref) {\r
- Deque<String> result = new LinkedList<String>();\r
- for(String s : recentPathsPref.split(DELIMITER)) result.add(s);\r
- return result;\r
- }\r
-\r
- public static String encodePaths(Collection<String> recentPaths) {\r
- return join(recentPaths, DELIMITER);\r
- }\r
-\r
- public static <T> void removeDuplicates(Iterable<String> iter) {\r
- // Remove duplicates\r
- Set<String> dups = new TreeSet<String>(String.CASE_INSENSITIVE_ORDER);\r
- for (Iterator<String> it = iter.iterator(); it.hasNext();) {\r
- String path = it.next();\r
- if (!dups.add(path)) {\r
- it.remove();\r
- }\r
- }\r
- }\r
-\r
-}\r
+package org.simantics.scl.ui.console;
+
+import java.util.Collection;
+import java.util.Deque;
+import java.util.Iterator;
+import java.util.LinkedList;
+import java.util.Set;
+import java.util.TreeSet;
+
+/**
+ * @author Antti Villberg
+ */
+public final class Preferences {
+
+ public static final String COMMAND_HISTORY = "COMMAND_HISTORY";
+
+ private static final String DELIMITER = "¤¤¤¤";
+
+ public static String join(Collection<String> s, String delimiter) {
+ if (s == null || s.isEmpty()) return "";
+ Iterator<String> iter = s.iterator();
+ StringBuilder builder = new StringBuilder(iter.next());
+ while( iter.hasNext() )
+ {
+ builder.append(delimiter).append(iter.next());
+ }
+ return builder.toString();
+ }
+
+ public static Deque<String> decodePaths(String recentPathsPref) {
+ Deque<String> result = new LinkedList<String>();
+ for(String s : recentPathsPref.split(DELIMITER)) result.add(s);
+ return result;
+ }
+
+ public static String encodePaths(Collection<String> recentPaths) {
+ return join(recentPaths, DELIMITER);
+ }
+
+ public static <T> void removeDuplicates(Iterable<String> iter) {
+ // Remove duplicates
+ Set<String> dups = new TreeSet<String>(String.CASE_INSENSITIVE_ORDER);
+ for (Iterator<String> it = iter.iterator(); it.hasNext();) {
+ String path = it.next();
+ if (!dups.add(path)) {
+ it.remove();
+ }
+ }
+ }
+
+}