1319N/A/*
3909N/A * Copyright (c) 2009, 2011, Oracle and/or its affiliates. All rights reserved.
1319N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
1319N/A *
1319N/A * This code is free software; you can redistribute it and/or modify it
1319N/A * under the terms of the GNU General Public License version 2 only, as
2362N/A * published by the Free Software Foundation. Oracle designates this
1319N/A * particular file as subject to the "Classpath" exception as provided
2362N/A * by Oracle in the LICENSE file that accompanied this code.
1319N/A *
1319N/A * This code is distributed in the hope that it will be useful, but WITHOUT
1319N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
1319N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
1319N/A * version 2 for more details (a copy is included in the LICENSE file that
1319N/A * accompanied this code).
1319N/A *
1319N/A * You should have received a copy of the GNU General Public License version
1319N/A * 2 along with this work; if not, write to the Free Software Foundation,
1319N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
1319N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
1319N/A */
1319N/A
1319N/Apackage sun.nio.fs;
1319N/A
3779N/Aimport java.util.*;
3899N/Aimport java.nio.file.*;
3779N/A
1319N/A/**
1319N/A * Utility methods
1319N/A */
1319N/A
1319N/Aclass Util {
1319N/A private Util() { }
1319N/A
1319N/A /**
1319N/A * Splits a string around the given character. The array returned by this
1319N/A * method contains each substring that is terminated by the character. Use
1319N/A * for simple string spilting cases when needing to avoid loading regex.
1319N/A */
1319N/A static String[] split(String s, char c) {
1319N/A int count = 0;
1319N/A for (int i=0; i<s.length(); i++) {
1319N/A if (s.charAt(i) == c)
1319N/A count++;
1319N/A }
1319N/A String[] result = new String[count+1];
1319N/A int n = 0;
1319N/A int last = 0;
1319N/A for (int i=0; i<s.length(); i++) {
1319N/A if (s.charAt(i) == c) {
1319N/A result[n++] = s.substring(last, i);
1319N/A last = i + 1;
1319N/A }
1319N/A }
1319N/A result[n] = s.substring(last, s.length());
1319N/A return result;
3779N/A }
1319N/A
3779N/A /**
3779N/A * Returns a Set containing the given elements.
3779N/A */
3779N/A static <E> Set<E> newSet(E... elements) {
3779N/A HashSet<E> set = new HashSet<>();
3779N/A for (E e: elements) {
3779N/A set.add(e);
3779N/A }
3779N/A return set;
3779N/A }
3779N/A
3779N/A /**
3779N/A * Returns a Set containing all the elements of the given Set plus
3779N/A * the given elements.
3779N/A */
3779N/A static <E> Set<E> newSet(Set<E> other, E... elements) {
3779N/A HashSet<E> set = new HashSet<>(other);
3779N/A for (E e: elements) {
3779N/A set.add(e);
3779N/A }
3779N/A return set;
1319N/A }
3899N/A
3899N/A /**
3899N/A * Returns {@code true} if symbolic links should be followed
3899N/A */
3899N/A static boolean followLinks(LinkOption... options) {
3899N/A boolean followLinks = true;
3899N/A for (LinkOption option: options) {
3899N/A if (option == LinkOption.NOFOLLOW_LINKS) {
3899N/A followLinks = false;
3899N/A } else if (option == null) {
3899N/A throw new NullPointerException();
3899N/A } else {
3899N/A throw new AssertionError("Should not get here");
3899N/A }
3899N/A }
3899N/A return followLinks;
3899N/A }
1319N/A}