1 /*
   2  * Copyright (c) 2009, 2011, 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 
  30 /**
  31  * Utility methods
  32  */
  33 
  34 class Util {
  35     private Util() { }
  36 
  37     /**
  38      * Splits a string around the given character. The array returned by this
  39      * method contains each substring that is terminated by the character. Use
  40      * for simple string spilting cases when needing to avoid loading regex.
  41      */
  42     static String[] split(String s, char c) {
  43         int count = 0;
  44         for (int i=0; i<s.length(); i++) {
  45             if (s.charAt(i) == c)
  46                 count++;
  47         }
  48         String[] result = new String[count+1];
  49         int n = 0;
  50         int last = 0;
  51         for (int i=0; i<s.length(); i++) {
  52             if (s.charAt(i) == c) {
  53                 result[n++] = s.substring(last, i);
  54                 last = i + 1;
  55             }
  56         }
  57         result[n] = s.substring(last, s.length());
  58         return result;
  59     }
  60 
  61     /**
  62      * Returns a Set containing the given elements.
  63      */
  64     static <E> Set<E> newSet(E... elements) {
  65         HashSet<E> set = new HashSet<>();
  66         for (E e: elements) {
  67             set.add(e);
  68         }
  69         return set;
  70     }
  71 
  72     /**
  73      * Returns a Set containing all the elements of the given Set plus
  74      * the given elements.
  75      */
  76     static <E> Set<E> newSet(Set<E> other, E... elements) {
  77         HashSet<E> set = new HashSet<>(other);
  78         for (E e: elements) {
  79             set.add(e);
  80         }
  81         return set;
  82     }
  83 }