1 /* 2 * Copyright (c) 2009, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. Oracle designates this 8 * particular file as subject to the "Classpath" exception as provided 9 * by Oracle in the LICENSE file that accompanied this code. 10 * 11 * This code is distributed in the hope that it will be useful, but WITHOUT 12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 14 * version 2 for more details (a copy is included in the LICENSE file that 15 * accompanied this code). 16 * 17 * You should have received a copy of the GNU General Public License version 18 * 2 along with this work; if not, write to the Free Software Foundation, 19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 20 * 21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 22 * or visit www.oracle.com if you need additional information or have any 23 * questions. 24 */ 25 26 package sun.nio.fs; 27 28 import java.util.*; 29 import java.nio.file.*; 30 31 /** 32 * Utility methods 33 */ 34 35 class Util { 36 private Util() { } 37 38 /** 39 * Splits a string around the given character. The array returned by this 40 * method contains each substring that is terminated by the character. Use 41 * for simple string spilting cases when needing to avoid loading regex. 42 */ 43 static String[] split(String s, char c) { 44 int count = 0; 45 for (int i=0; i<s.length(); i++) { 46 if (s.charAt(i) == c) 47 count++; 48 } 49 String[] result = new String[count+1]; 50 int n = 0; 51 int last = 0; 52 for (int i=0; i<s.length(); i++) { 53 if (s.charAt(i) == c) { 54 result[n++] = s.substring(last, i); 55 last = i + 1; 56 } 57 } 58 result[n] = s.substring(last, s.length()); 59 return result; 60 } 61 62 /** 63 * Returns a Set containing the given elements. 64 */ 65 static <E> Set<E> newSet(E... elements) { 66 HashSet<E> set = new HashSet<>(); 67 for (E e: elements) { 68 set.add(e); 69 } 70 return set; 71 } 72 73 /** 74 * Returns a Set containing all the elements of the given Set plus 75 * the given elements. 76 */ 77 static <E> Set<E> newSet(Set<E> other, E... elements) { 78 HashSet<E> set = new HashSet<>(other); 79 for (E e: elements) { 80 set.add(e); 81 } 82 return set; 83 } 84 85 /** 86 * Returns {@code true} if symbolic links should be followed 87 */ 88 static boolean followLinks(LinkOption... options) { 89 boolean followLinks = true; 90 for (LinkOption option: options) { 91 if (option == LinkOption.NOFOLLOW_LINKS) { 92 followLinks = false; 93 } if (option == null) { 94 throw new NullPointerException(); 95 } else { 96 throw new AssertionError("Should not get here"); 97 } 98 } 99 return followLinks; 100 } 101 }