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 /**
  29  * Utility methods
  30  */
  31 
  32 class Util {
  33     private Util() { }
  34 
  35     /**
  36      * Splits a string around the given character. The array returned by this
  37      * method contains each substring that is terminated by the character. Use
  38      * for simple string spilting cases when needing to avoid loading regex.
  39      */
  40     static String[] split(String s, char c) {
  41         int count = 0;
  42         for (int i=0; i<s.length(); i++) {
  43             if (s.charAt(i) == c)
  44                 count++;
  45         }
  46         String[] result = new String[count+1];
  47         int n = 0;
  48         int last = 0;
  49         for (int i=0; i<s.length(); i++) {
  50             if (s.charAt(i) == c) {
  51                 result[n++] = s.substring(last, i);
  52                 last = i + 1;
  53             }
  54         }
  55         result[n] = s.substring(last, s.length());
  56         return result;
  57 
  58     }
  59 }