diff --git a/README.md b/README.md
index 905ee33..393edc4 100644
--- a/README.md
+++ b/README.md
@@ -27,7 +27,7 @@ Include this dependency in your POM. Be sure to check for the latest version in
 <dependency>
   <groupId>com.hankcs</groupId>
   <artifactId>aho-corasick-double-array-trie</artifactId>
-  <version>1.2.1</version>
+  <version>1.2.2</version>
 </dependency>
 ```
 
diff --git a/pom.xml b/pom.xml
index e6a502d..81ade24 100644
--- a/pom.xml
+++ b/pom.xml
@@ -6,7 +6,7 @@
 
     <groupId>com.hankcs</groupId>
     <artifactId>aho-corasick-double-array-trie</artifactId>
-    <version>1.2.1</version>
+    <version>1.2.2</version>
 
     <name>AhoCorasickDoubleArrayTrie</name>
     <url>https://github.com/hankcs/AhoCorasickDoubleArrayTrie</url>
diff --git a/src/main/java/com/hankcs/algorithm/AhoCorasickDoubleArrayTrie.java b/src/main/java/com/hankcs/algorithm/AhoCorasickDoubleArrayTrie.java
index a6e15ac..2fa72a6 100644
--- a/src/main/java/com/hankcs/algorithm/AhoCorasickDoubleArrayTrie.java
+++ b/src/main/java/com/hankcs/algorithm/AhoCorasickDoubleArrayTrie.java
@@ -889,7 +889,7 @@ private void insert(List<Map.Entry<Integer, State>> firstSiblings)
         {
             Queue<Map.Entry<Integer, List<Map.Entry<Integer, State>>>> siblingQueue = new ArrayDeque<Map.Entry<Integer, List<Map.Entry<Integer, State>>>>();
             siblingQueue.add(new AbstractMap.SimpleEntry<Integer, List<Map.Entry<Integer, State>>>(null, firstSiblings));
-            
+
             while (siblingQueue.isEmpty() == false)
             {
                 insert(siblingQueue);
@@ -901,10 +901,11 @@ private void insert(List<Map.Entry<Integer, State>> firstSiblings)
          *
          * @param siblingQueue a queue holding all siblings being inserted and the position to insert them
          */
-        private void insert(Queue<Map.Entry<Integer, List<Map.Entry<Integer, State>>>> siblingQueue) {
+        private void insert(Queue<Map.Entry<Integer, List<Map.Entry<Integer, State>>>> siblingQueue)
+        {
             Map.Entry<Integer, List<Map.Entry<Integer, State>>> tCurrent = siblingQueue.remove();
             List<Map.Entry<Integer, State>> siblings = tCurrent.getValue();
-            
+
             int begin = 0;
             int pos = Math.max(siblings.get(0).getKey() + 1, nextCheckPos) - 1;
             int nonzero_num = 0;