string segment optimization

datastructures-trie/src/main/java/org/xbib/datastructures/trie/segment/PatternSegment.java

@@ -0,0 +1,30 @@
+package org.xbib.datastructures.trie.segment;
+
+import java.util.regex.Pattern;
+
+public class PatternSegment implements TrieKeySegment<Pattern> {
+
+    private final Pattern segment;
+
+    public PatternSegment(Pattern segment) {
+        this.segment = segment;
+    }
+
+    public Pattern getSegment() {
+        return segment;
+    }
+
+    public static PatternSegment of(Pattern segment) {
+        return new PatternSegment(segment);
+    }
+
+    @Override
+    public int compareTo(Pattern o) {
+        return segment.pattern().compareTo(o.pattern());
+    }
+
+    @Override
+    public String toString() {
+        return segment.pattern();
+    }
+}

datastructures-trie/src/test/java/org/xbib/datastructures/trie/segment/TrieTest.java

@@ -43,13 +43,12 @@ public class TrieTest {
 
     @Test
     public void testLargeInsertionAndSearch() {
+        Random random = new Random();
         Trie<String, TrieKey<String>, Long> trie = new TrieImpl<>();
         List<TrieKey<String>> keys = new ArrayList<>();
         for (int i = 0; i < 10000; i++) {
-            Random random = new Random();
             Long value = random.nextLong();
-            String key = value.toString();
-            TrieKey<String> trieKey = TrieKeyImpl.stringKey(key);
+            TrieKey<String> trieKey = TrieKeyImpl.stringKey(value.toString());
             trie.put(trieKey, value);
             keys.add(trieKey);
         }