Do not instanciate generic classes with []

Signed-off-by: Alexandre Terrasa <alexandre.terrasa@shopify.com>

Author: Morriar

lib/ruby_indexer/lib/ruby_indexer/index.rb

@@ -60,7 +60,7 @@ def initialize
       @entries = {} #: Hash[String, Array[Entry]]
 
       # Holds all entries in the index using a prefix tree for searching based on prefixes to provide autocompletion
-      @entries_tree = PrefixTree[T::Array[Entry]].new #: PrefixTree[Array[Entry]]
+      @entries_tree = PrefixTree.new #: PrefixTree[Array[Entry]]
 
       # Holds references to where entries where discovered so that we can easily delete them
       # {
@@ -71,7 +71,7 @@ def initialize
       @uris_to_entries = {} #: Hash[String, Array[Entry]]
 
       # Holds all require paths for every indexed item so that we can provide autocomplete for requires
-      @require_paths_tree = PrefixTree[URI::Generic].new #: PrefixTree[URI::Generic]
+      @require_paths_tree = PrefixTree.new #: PrefixTree[URI::Generic]
 
       # Holds the linearized ancestors list for every namespace
       @ancestors = {} #: Hash[String, Array[String]]

lib/ruby_indexer/test/prefix_tree_test.rb

@@ -22,7 +22,7 @@ def test_single_item
     end
 
     def test_multiple_items
-      tree = PrefixTree[String].new
+      tree = PrefixTree.new #: PrefixTree[String]
       ["foo", "bar", "baz"].each { |item| tree.insert(item, item) }
 
       assert_equal(["baz", "bar", "foo"], tree.search(""))
@@ -34,7 +34,7 @@ def test_multiple_items
     end
 
     def test_multiple_prefixes
-      tree = PrefixTree[String].new
+      tree = PrefixTree.new #: PrefixTree[String]
       ["fo", "foo"].each { |item| tree.insert(item, item) }
 
       assert_equal(["fo", "foo"], tree.search(""))
@@ -45,7 +45,7 @@ def test_multiple_prefixes
     end
 
     def test_multiple_prefixes_with_shuffled_order
-      tree = PrefixTree[String].new
+      tree = PrefixTree.new #: PrefixTree[String]
       [
         "foo/bar/base",
         "foo/bar/on",
@@ -97,7 +97,7 @@ def test_multiple_prefixes_with_shuffled_order
     end
 
     def test_deletion
-      tree = PrefixTree[String].new
+      tree = PrefixTree.new #: PrefixTree[String]
       ["foo/bar", "foo/baz"].each { |item| tree.insert(item, item) }
       assert_equal(["foo/baz", "foo/bar"], tree.search("foo"))
 
@@ -107,7 +107,7 @@ def test_deletion
     end
 
     def test_delete_does_not_impact_other_keys_with_the_same_value
-      tree = PrefixTree[String].new
+      tree = PrefixTree.new #: PrefixTree[String]
       tree.insert("key1", "value")
       tree.insert("key2", "value")
       assert_equal(["value", "value"], tree.search("key"))
@@ -118,7 +118,7 @@ def test_delete_does_not_impact_other_keys_with_the_same_value
     end
 
     def test_deleted_node_is_removed_from_the_tree
-      tree = PrefixTree[String].new
+      tree = PrefixTree.new #: PrefixTree[String]
       tree.insert("foo/bar", "foo/bar")
       assert_equal(["foo/bar"], tree.search("foo"))
 
@@ -128,7 +128,7 @@ def test_deleted_node_is_removed_from_the_tree
     end
 
     def test_deleting_non_terminal_nodes
-      tree = PrefixTree[String].new
+      tree = PrefixTree.new #: PrefixTree[String]
       tree.insert("abc", "value1")
       tree.insert("abcdef", "value2")
 
@@ -138,7 +138,7 @@ def test_deleting_non_terminal_nodes
     end
 
     def test_overriding_values
-      tree = PrefixTree[Integer].new
+      tree = PrefixTree.new #: PrefixTree[Integer]
 
       tree.insert("foo/bar", 123)
       assert_equal([123], tree.search("foo/bar"))