performance improvements

pom.xml

@@ -2,7 +2,7 @@
   <modelVersion>4.0.0</modelVersion>
   <groupId>org.hashids</groupId>
   <artifactId>hashids</artifactId>
-  <version>1.0.3-SNAPSHOT</version>
+  <version>1.0.4-SNAPSHOT</version>
   <packaging>jar</packaging>
   <name>hashids</name>
   <description>Implementing Hashids algorithm v1.0.0 version(http://hashids.org)</description>
@@ -207,5 +207,9 @@
       <name>Matthias Vill</name>
       <url>https://github.com/TheConstructor</url>
     </contributor>
+    <contributor>
+      <name>Mihai CAZACU</name>
+      <url>https://github.com/cazacugmihai</url>
+    </contributor>
   </contributors>
 </project>

src/main/java/org/hashids/CharUtils.java

@@ -0,0 +1,158 @@
+package org.hashids;
+
+import static java.util.Arrays.copyOfRange;
+
+public final class CharUtils {
+
+  private CharUtils() {
+    throw new UnsupportedOperationException();
+  }
+
+  public static char[] concatenate(char a, char[] arrB, char[] arrC, int maxSize) {
+    if (maxSize == 0) {
+      return new char[0];
+    }
+
+    final char[] result = new char[maxSize];
+    int i = 0;
+
+    result[i++] = a;
+
+    if (i == maxSize) {
+      return result;
+    }
+
+    for (final char c : arrB) {
+      result[i++] = c;
+
+      if (i == maxSize) {
+        return result;
+      }
+    }
+
+    for (final char c : arrC) {
+      result[i++] = c;
+
+      if (i == maxSize) {
+        return result;
+      }
+    }
+
+    return result;
+  }
+
+  public static char[] concatenate(char[] arrA, char[] arrB, char[] arrC) {
+    final char[] result = new char[arrA.length + arrB.length + arrC.length];
+    int i = 0;
+
+    for (final char c : arrA) {
+      result[i++] = c;
+    }
+
+    for (final char c : arrB) {
+      result[i++] = c;
+    }
+
+    for (final char c : arrC) {
+      result[i++] = c;
+    }
+
+    return result;
+  }
+
+  public static char[] concatenate(char[] arrA, char[] arrB, int bFrom, int bTo) {
+    final char[] result = new char[arrA.length + bTo - bFrom];
+    int i = 0;
+
+    for (final char c : arrA) {
+      result[i++] = c;
+    }
+
+    for (int j = bFrom; j < bTo; j++) {
+      result[i++] = arrB[j];
+    }
+
+    return result;
+  }
+
+  public static int indexOf(char[] source, char c) {
+    int i = 0;
+
+    for (final char s : source) {
+      if (s == c) {
+        break;
+      }
+      i++;
+    }
+
+    return i;
+  }
+
+  public static char[] cleanup(char[] source, char[] allowedChars) {
+    if ((source == null) || (allowedChars == null)) {
+      return source;
+    }
+
+    final char[] result = new char[source.length];
+    int i = 0;
+
+    for (final char s : source) {
+      for (final char a : allowedChars) {
+        if (s == a) {
+          result[i++] = s;
+          break;
+        }
+      }
+    }
+
+    return copyOfRange(result, 0, i);
+  }
+
+  public static char[] removeAll(char[] source, char[] charsToRemove) {
+    if ((source == null) || (charsToRemove == null)) {
+      return source;
+    }
+
+    final char[] result = new char[source.length];
+    int i = 0;
+    boolean found;
+
+    for (final char s : source) {
+      found = false;
+
+      for (final char c : charsToRemove) {
+        if (s == c) {
+          found = true;
+          break;
+        }
+      }
+
+      if (!found) {
+        result[i++] = s;
+      }
+    }
+
+    return copyOfRange(result, 0, i);
+  }
+
+  public static boolean validate(char[] source, char[] allowedChars) {
+    boolean found;
+
+    for (final char s : source) {
+      found = false;
+
+      for (final char a : allowedChars) {
+        if (s == a) {
+          found = true;
+          break;
+        }
+      }
+
+      if (!found) {
+        return false;
+      }
+    }
+
+    return true;
+  }
+}