content: /*
   *
   *                                Apache License
   *                          Version 2.0, January 2004
   *                       http://www.apache.org/licenses/
   *
   *  TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
   *
   *  1. Definitions.
   *
   *     "License" shall mean the terms and conditions for use, reproduction,
   *     and distribution as defined by Sections 1 through 9 of this document.
   *
   *     "Licensor" shall mean the copyright owner or entity authorized by
   *     the copyright owner that is granting the License.
   *
   *     "Legal Entity" shall mean the union of the acting entity and all
   *     other entities that control, are controlled by, or are under common
   *     control with that entity. For the purposes of this definition,
   *     "control" means (i) the power, direct or indirect, to cause the
   *     direction or management of such entity, whether by contract or
   *     otherwise, or (ii) ownership of fifty percent (50%) or more of the
   *     outstanding shares, or (iii) beneficial ownership of such entity.
   *
   *     "You" (or "Your") shall mean an individual or Legal Entity
   *     exercising permissions granted by this License.
   *
   *     "Source" form shall mean the preferred form for making modifications,
   *     including but not limited to software source code, documentation
   *     source, and configuration files.
   *
   *     "Object" form shall mean any form resulting from mechanical
   *     transformation or translation of a Source form, including but
   *     not limited to compiled object code, generated documentation,
   *     and conversions to other media types.
   *
   *     "Work" shall mean the work of authorship, whether in Source or
   *     Object form, made available under the License, as indicated by a
   *     copyright notice that is included in or attached to the work
   *     (an example is provided in the Appendix below).
   *
   *     "Derivative Works" shall mean any work, whether in Source or Object
   *     form, that is based on (or derived from) the Work and for which the
   *     editorial revisions, annotations, elaborations, or other modifications
   *     represent, as a whole, an original work of authorship. For the purposes
   *     of this License, Derivative Works shall not include works that remain
   *     separable from, or merely link (or bind by name) to the interfaces of,
   *     the Work and Derivative Works thereof.
   *
   *     "Contribution" shall mean any work of authorship, including
   *     the original version of the Work and any modifications or additions
   *     to that Work or Derivative Works thereof, that is intentionally
   *     submitted to Licensor for inclusion in the Work by the copyright owner
   *     or by an individual or Legal Entity authorized to submit on behalf of
   *     the copyright owner. For the purposes of this definition, "submitted"
   *     means any form of electronic, verbal, or written communication sent
   *     to the Licensor or its representatives, including but not limited to
   *     communication on electronic mailing lists, source code control systems,
   *     and issue tracking systems that are managed by, or on behalf of, the
   *     Licensor for the purpose of discussing and improving the Work, but
   *     excluding communication that is conspicuously marked or otherwise
   *     designated in writing by the copyright owner as "Not a Contribution."
   *
   *     "Contributor" shall mean Licensor and any individual or Legal Entity
   *     on behalf of whom a Contribution has been received by Licensor and
   *     subsequently incorporated within the Work.
   *
   *  2. Grant of Copyright License. Subject to the terms and conditions of
   *     this License, each Contributor hereby grants to You a perpetual,
   *     worldwide, non-exclusive, no-charge, royalty-free, irrevocable
   *     copyright license to reproduce, prepare Derivative Works of,
   *     publicly display, publicly perform, sublicense, and distribute the
   *     Work and such Derivative Works in Source or Object form.
   *
   *  3. Grant of Patent License. Subject to the terms and conditions of
   *     this License, each Contributor hereby grants to You a perpetual,
   *     worldwide, non-exclusive, no-charge, royalty-free, irrevocable
   *     (except as stated in this section) patent license to make, have made,
   *     use, offer to sell, sell, import, and otherwise transfer the Work,
   *     where such license applies only to those patent claims licensable
   *     by such Contributor that are necessarily infringed by their
   *     Contribution(s) alone or by combination of their Contribution(s)
   *     with the Work to which such Contribution(s) was submitted. If You
   *     institute patent litigation against any entity (including a
   *     cross-claim or counterclaim in a lawsuit) alleging that the Work
   *     or a Contribution incorporated within the Work constitutes direct
   *     or contributory patent infringement, then any patent licenses
   *     granted to You under this License for that Work shall terminate
   *     as of the date such litigation is filed.
   *
   *  4. Redistribution. You may reproduce and distribute copies of the
   *     Work or Derivative Works thereof in any medium, with or without
   *     modifications, and in Source or Object form, provided that You
   *     meet the following conditions:
   *
   *     (a) You must give any other recipients of the Work or
   *         Derivative Works a copy of this License; and
   *
   *     (b) You must cause any modified files to carry prominent notices
   *         stating that You changed the files; and
   *
   *     (c) You must retain, in the Source form of any Derivative Works
   *         that You distribute, all copyright, patent, trademark, and
   *         attribution notices from the Source form of the Work,
   *         excluding those notices that do not pertain to any part of
   *         the Derivative Works; and
   *
   *     (d) If the Work includes a "NOTICE" text file as part of its
   *         distribution, then any Derivative Works that You distribute must
   *         include a readable copy of the attribution notices contained
   *         within such NOTICE file, excluding those notices that do not
   *         pertain to any part of the Derivative Works, in at least one
   *         of the following places: within a NOTICE text file distributed
   *         as part of the Derivative Works; within the Source form or
   *         documentation, if provided along with the Derivative Works; or,
   *         within a display generated by the Derivative Works, if and
   *         wherever such third-party notices normally appear. The contents
   *         of the NOTICE file are for informational purposes only and
   *         do not modify the License. You may add Your own attribution
   *         notices within Derivative Works that You distribute, alongside
   *         or as an addendum to the NOTICE text from the Work, provided
   *         that such additional attribution notices cannot be construed
   *         as modifying the License.
   *
   *     You may add Your own copyright statement to Your modifications and
   *     may provide additional or different license terms and conditions
   *     for use, reproduction, or distribution of Your modifications, or
   *     for any such Derivative Works as a whole, provided Your use,
   *     reproduction, and distribution of the Work otherwise complies with
   *     the conditions stated in this License.
   *
   *  5. Submission of Contributions. Unless You explicitly state otherwise,
   *     any Contribution intentionally submitted for inclusion in the Work
   *     by You to the Licensor shall be under the terms and conditions of
   *     this License, without any additional terms or conditions.
   *     Notwithstanding the above, nothing herein shall supersede or modify
   *     the terms of any separate license agreement you may have executed
   *     with Licensor regarding such Contributions.
   *
   *  6. Trademarks. This License does not grant permission to use the trade
   *     names, trademarks, service marks, or product names of the Licensor,
   *     except as required for reasonable and customary use in describing the
   *     origin of the Work and reproducing the content of the NOTICE file.
   *
   *  7. Disclaimer of Warranty. Unless required by applicable law or
   *     agreed to in writing, Licensor provides the Work (and each
   *     Contributor provides its Contributions) on an "AS IS" BASIS,
   *     WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
   *     implied, including, without limitation, any warranties or conditions
   *     of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
   *     PARTICULAR PURPOSE. You are solely responsible for determining the
   *     appropriateness of using or redistributing the Work and assume any
   *     risks associated with Your exercise of permissions under this License.
   *
   *  8. Limitation of Liability. In no event and under no legal theory,
   *     whether in tort (including negligence), contract, or otherwise,
   *     unless required by applicable law (such as deliberate and grossly
   *     negligent acts) or agreed to in writing, shall any Contributor be
   *     liable to You for damages, including any direct, indirect, special,
   *     incidental, or consequential damages of any character arising as a
   *     result of this License or out of the use or inability to use the
   *     Work (including but not limited to damages for loss of goodwill,
   *     work stoppage, computer failure or malfunction, or any and all
   *     other commercial damages or losses), even if such Contributor
   *     has been advised of the possibility of such damages.
   *
   *  9. Accepting Warranty or Additional Liability. While redistributing
   *     the Work or Derivative Works thereof, You may choose to offer,
   *     and charge a fee for, acceptance of support, warranty, indemnity,
   *     or other liability obligations and/or rights consistent with this
   *     License. However, in accepting such obligations, You may act only
   *     on Your own behalf and on Your sole responsibility, not on behalf
   *     of any other Contributor, and only if You agree to indemnify,
   *     defend, and hold each Contributor harmless for any liability
   *     incurred by, or claims asserted against, such Contributor by reason
   *     of your accepting any such warranty or additional liability.
   *
   *  END OF TERMS AND CONDITIONS
   *
   *  APPENDIX: How to apply the Apache License to your work.
   *
   *     To apply the Apache License to your work, attach the following
   *     boilerplate notice, with the fields enclosed by brackets "[]"
   *     replaced with your own identifying information. (Don't include
   *     the brackets!)  The text should be enclosed in the appropriate
   *     comment syntax for the file format. We also recommend that a
   *     file or class name and description of purpose be included on the
   *     same "printed page" as the copyright notice for easier
   *     identification within third-party archives.
   *
   *  Copyright 2016 Alibaba Group
   *
   *  Licensed under the Apache License, Version 2.0 (the "License");
   *  you may not use this file except in compliance with the License.
   *  You may obtain a copy of the License at
   *
   *      http://www.apache.org/licenses/LICENSE-2.0
   *
   *  Unless required by applicable law or agreed to in writing, software
   *  distributed under the License is distributed on an "AS IS" BASIS,
   *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   *  See the License for the specific language governing permissions and
   *  limitations under the License.
   *
   *
   *
   */
  
  package android.taobao.atlas.util;
  
  import java.util.ArrayList;
  import java.util.List;
  
  public class StringUtils {
  
      public static final String EMPTY = "";
  
      public static boolean isEmpty(String str) {
          if (str == null || str.length() == 0) {
              return true;
          }
          return false;
      }
  
      public static boolean isNotEmpty(String str) {
          return (str != null && str.length() > 0);
      }
      
      public static boolean startWith(String str, String prefix) {
          if (str == null || prefix == null) {
              return false;
          }
          return str.startsWith(prefix);
      }
  
      public static boolean equals(String str1, String str2) {
          if (str1 == null) {
              return false;
          }
          return str1.equals(str2);
      }
  
      public static String substringAfter(String str, String separator) {
          if (isEmpty(str)) {
              return str;
          }
          if (separator == null) {
              return "";
          }
          int pos = str.indexOf(separator);
          if (pos == -1) {
              return "";
          }
          return str.substring(pos + separator.length());
      }
  
      public static String substringBetween(String str, String open, String close) {
          if (str == null || open == null || close == null) {
              return null;
          }
          int start = str.indexOf(open);
          if (start != -1) {
              int end = str.indexOf(close, start + open.length());
              if (end != -1) {
                  return str.substring(start + open.length(), end);
              }
          }
          return null;
      }
  
  //    public static String replace(String text, String searchString, String replacement) {
  //        return replace(text, searchString, replacement, -1);
  //    }
  //
  //    public static String replace(String text, String searchString, String replacement, int max) {
  //        if (isEmpty(text) || isEmpty(searchString) || replacement == null || max == 0) {
  //            return text;
  //        }
  //        int start = 0;
  //        int end = text.indexOf(searchString, start);
  //        if (end == -1) {
  //            return text;
  //        }
  //        int replLength = searchString.length();
  //        int increase = replacement.length() - replLength;
  //        increase = (increase < 0 ? 0 : increase);
  //        increase *= (max < 0 ? 16 : (max > 64 ? 64 : max));
  //        StringBuilder buf = new StringBuilder(text.length() + increase);
  //        while (end != -1) {
  //            buf.append(text.substring(start, end)).append(replacement);
  //            start = end + replLength;
  //            if (--max == 0) {
  //                break;
  //            }
  //            end = text.indexOf(searchString, start);
  //        }
  //        buf.append(text.substring(start));
  //        return buf.toString();
  //    }
  
  //    public static boolean endsWith(String str, String suffix) {
  //        return endsWith(str, suffix, false);
  //    }
  //
  //    private static boolean endsWith(String str, String suffix, boolean ignoreCase) {
  //        if (str == null || suffix == null) {
  //            return (str == null && suffix == null);
  //        }
  //        if (suffix.length() > str.length()) {
  //            return false;
  //        }
  //        int strOffset = str.length() - suffix.length();
  //        return str.regionMatches(ignoreCase, strOffset, suffix, 0, suffix.length());
  //    }
  
      /**
       * <p>Splits the provided text into an array, separators specified.
       * This is an alternative to using StringTokenizer.</p>
       *
       * <p>The separator is not included in the returned String array.
       * Adjacent separators are treated as one separator.
       * For more control over the split use the StrTokenizer class.</p>
       *
       * <p>A <code>null</code> input String returns <code>null</code>.
       * A <code>null</code> separatorChars splits on whitespace.</p>
       *
       * <pre>
       * StringUtils.split(null, *)         = null
       * StringUtils.split("", *)           = []
       * StringUtils.split("abc def", null) = ["abc", "def"]
       * StringUtils.split("abc def", " ")  = ["abc", "def"]
       * StringUtils.split("abc  def", " ") = ["abc", "def"]
       * StringUtils.split("ab:cd:ef", ":") = ["ab", "cd", "ef"]
       * </pre>
       *
       * @param str  the String to parse, may be null
       * @param separatorChars  the characters used as the delimiters,
       *  <code>null</code> splits on whitespace
       * @return an array of parsed Strings, <code>null</code> if null String input
       */    
      public static String[] split(String str, String separatorChars) {
          return splitWorker(str, separatorChars, -1, false);
      }
      
      /**
       * Performs the logic for the <code>split</code> and 
       * <code>splitPreserveAllTokens</code> methods that return a maximum array 
       * length.
       *
       * @param str  the String to parse, may be <code>null</code>
       * @param separatorChars the separate character
       * @param max  the maximum number of elements to include in the
       *  array. A zero or negative value implies no limit.
       * @param preserveAllTokens if <code>true</code>, adjacent separators are
       * treated as empty token separators; if <code>false</code>, adjacent
       * separators are treated as one separator.
       * @return an array of parsed Strings, <code>null</code> if null String input
       */
      private static String[] splitWorker(String str, String separatorChars, int max, boolean preserveAllTokens) {
          // Performance tuned for 2.0 (JDK1.4)
          // Direct code is quicker than StringTokenizer.
          // Also, StringTokenizer uses isSpace() not isWhitespace()
  
          if (str == null) {
              return null;
          }
          int len = str.length();
          if (len == 0) {
              return new String[0];
          }
          List<String> list = new ArrayList<String>();
          int sizePlus1 = 1;
          int i = 0, start = 0;
          boolean match = false;
          boolean lastMatch = false;
          if (separatorChars == null) {
              // Null separator means use whitespace
              while (i < len) {
                  if (Character.isWhitespace(str.charAt(i))) {
                      if (match || preserveAllTokens) {
                          lastMatch = true;
                          if (sizePlus1++ == max) {
                              i = len;
                              lastMatch = false;
                          }
                          list.add(str.substring(start, i));
                          match = false;
                      }
                      start = ++i;
                      continue;
                  }
                  lastMatch = false;
                  match = true;
                  i++;
              }
          } else if (separatorChars.length() == 1) {
              // Optimise 1 character case
              char sep = separatorChars.charAt(0);
              while (i < len) {
                  if (str.charAt(i) == sep) {
                      if (match || preserveAllTokens) {
                          lastMatch = true;
                          if (sizePlus1++ == max) {
                              i = len;
                              lastMatch = false;
                          }
                          list.add(str.substring(start, i));
                          match = false;
                      }
                      start = ++i;
                      continue;
                  }
                  lastMatch = false;
                  match = true;
                  i++;
              }
          } else {
              // standard case
              while (i < len) {
                  if (separatorChars.indexOf(str.charAt(i)) >= 0) {
                      if (match || preserveAllTokens) {
                          lastMatch = true;
                          if (sizePlus1++ == max) {
                              i = len;
                              lastMatch = false;
                          }
                          list.add(str.substring(start, i));
                          match = false;
                      }
                      start = ++i;
                      continue;
                  }
                  lastMatch = false;
                  match = true;
                  i++;
              }
          }
          if (match || (preserveAllTokens && lastMatch)) {
              list.add(str.substring(start, i));
          }
          return (String[]) list.toArray(new String[list.size()]);
      }
  
  //    public static String join(Object[] array, String separator) {
  //        if (array == null) {
  //            return null;
  //        }
  //        return join(array, separator, 0, array.length);
  //    }
  //
  //    public static String join(Object[] array, String separator, int startIndex, int endIndex) {
  //        if (array == null) {
  //            return null;
  //        }
  //        if (separator == null) {
  //            separator = EMPTY;
  //        }
  //
  //        // endIndex - startIndex > 0:   Len = NofStrings *(len(firstString) + len(separator))
  //        //           (Assuming that all Strings are roughly equally long)
  //        int bufSize = (endIndex - startIndex);
  //        if (bufSize <= 0) {
  //            return EMPTY;
  //        }
  //
  //        bufSize *= ((array[startIndex] == null ? 16 : array[startIndex].toString().length())
  //                + separator.length());
  //
  //        StringBuilder buf = new StringBuilder(bufSize);
  //
  //        for (int i = startIndex; i < endIndex; i++) {
  //            if (i > startIndex) {
  //                buf.append(separator);
  //            }
  //            if (array[i] != null) {
  //                buf.append(array[i]);
  //            }
  //        }
  //        return buf.toString();
  //    }
  }
  