Parameterize references to generic types. (TheAlgorithms#5078)

sozelfist · vil02 · web-flow · commit 192427a5d288 · 2024-03-15T19:03:27.000+01:00
* chore: remove unused imports

* fix: parameterize references to generic types


---------

Co-authored-by: vil02 &lt;65706193+vil02@users.noreply.github.com&gt;
diff --git a/src/main/java/com/thealgorithms/backtracking/MColoring.java b/src/main/java/com/thealgorithms/backtracking/MColoring.java
@@ -1,6 +1,5 @@
 package com.thealgorithms.backtracking;
 
-import java.io.*;
 import java.util.*;
 
 /**
diff --git a/src/main/java/com/thealgorithms/datastructures/dynamicarray/DynamicArray.java b/src/main/java/com/thealgorithms/datastructures/dynamicarray/DynamicArray.java
@@ -145,7 +145,7 @@ public String toString() {
      * @return Iterator a Dynamic Array Iterator
      */
     @Override
-    public Iterator iterator() {
+    public Iterator<E> iterator() {
         return new DynamicArrayIterator();
     }
 
diff --git a/src/main/java/com/thealgorithms/datastructures/lists/CircleLinkedList.java b/src/main/java/com/thealgorithms/datastructures/lists/CircleLinkedList.java
@@ -53,7 +53,7 @@ public void append(E value) {
 
     // utility function for traversing the list
     public String toString() {
-        Node p = head.next;
+        Node<E> p = head.next;
         String s = "[ ";
         while (p != head) {
             s += p.value;
@@ -91,7 +91,7 @@ public E remove(int pos) {
     }
 
     public static void main(String[] args) {
-        CircleLinkedList cl = new CircleLinkedList<String>();
+        CircleLinkedList<Integer> cl = new CircleLinkedList<>();
         cl.append(12);
         System.out.println(cl);
         cl.append(23);
diff --git a/src/main/java/com/thealgorithms/datastructures/lists/CursorLinkedList.java b/src/main/java/com/thealgorithms/datastructures/lists/CursorLinkedList.java
@@ -134,7 +134,7 @@ public void remove(T element) {
     }
 
     private void free(int index) {
-        Node os_node = cursorSpace[os];
+        Node<T> os_node = cursorSpace[os];
         int os_next = os_node.next;
         cursorSpace[os].next = index;
         cursorSpace[index].element = null;
diff --git a/src/main/java/com/thealgorithms/misc/ThreeSumProblem.java b/src/main/java/com/thealgorithms/misc/ThreeSumProblem.java
@@ -75,7 +75,7 @@ public List<List<Integer>> TwoPointer(int[] nums, int target) {
 
     public List<List<Integer>> Hashmap(int[] nums, int target) {
         Arrays.sort(nums);
-        Set<List<Integer>> ts = new HashSet();
+        Set<List<Integer>> ts = new HashSet<>();
         HashMap<Integer, Integer> hm = new HashMap<>();
 
         for (int i = 0; i < nums.length; i++) {
@@ -94,6 +94,6 @@ public List<List<Integer>> Hashmap(int[] nums, int target) {
                 }
             }
         }
-        return new ArrayList(ts);
+        return new ArrayList<>(ts);
     }
 }
diff --git a/src/main/java/com/thealgorithms/searches/UnionFind.java b/src/main/java/com/thealgorithms/searches/UnionFind.java
@@ -45,7 +45,7 @@ public void union(int x, int y) {
     }
 
     public int count() {
-        List parents = new ArrayList();
+        List<Integer> parents = new ArrayList<>();
         for (int i = 0; i < p.length; i++) {
             if (!parents.contains(find(i))) {
                 parents.add(find(i));
diff --git a/src/main/java/com/thealgorithms/strings/WordLadder.java b/src/main/java/com/thealgorithms/strings/WordLadder.java
@@ -51,13 +51,13 @@ class WordLadder {
      * if the endword is there. Otherwise, will return the length as 0.
      */
     public static int ladderLength(String beginWord, String endWord, List<String> wordList) {
-        HashSet<String> set = new HashSet(wordList);
+        HashSet<String> set = new HashSet<>(wordList);
 
         if (!set.contains(endWord)) {
             return 0;
         }
 
-        Queue<String> queue = new LinkedList();
+        Queue<String> queue = new LinkedList<>();
         queue.offer(beginWord);
         int level = 1;
 

Original file line number	Diff line number	Diff line change
`@@ -145,7 +145,7 @@ public String toString() {`
`145`	`145`	`* @return Iterator a Dynamic Array Iterator`
`146`	`146`	`*/`
`147`	`147`	`@Override`
`148`		`- public Iterator iterator() {`
	`148`	`+ public Iterator<E> iterator() {`
`149`	`149`	`return new DynamicArrayIterator();`
`150`	`150`	`}`
`151`	`151`
Original file line number	Diff line number	Diff line change
`@@ -134,7 +134,7 @@ public void remove(T element) {`
`134`	`134`	`}`
`135`	`135`
`136`	`136`	`private void free(int index) {`
`137`		`- Node os_node = cursorSpace[os];`
	`137`	`+ Node<T> os_node = cursorSpace[os];`
`138`	`138`	`int os_next = os_node.next;`
`139`	`139`	`cursorSpace[os].next = index;`
`140`	`140`	`cursorSpace[index].element = null;`
Original file line number	Diff line number	Diff line change
`@@ -75,7 +75,7 @@ public List<List<Integer>> TwoPointer(int[] nums, int target) {`
`75`	`75`
`76`	`76`	`public List<List<Integer>> Hashmap(int[] nums, int target) {`
`77`	`77`	`Arrays.sort(nums);`
`78`		`- Set<List<Integer>> ts = new HashSet();`
	`78`	`+ Set<List<Integer>> ts = new HashSet<>();`
`79`	`79`	`HashMap<Integer, Integer> hm = new HashMap<>();`
`80`	`80`
`81`	`81`	`for (int i = 0; i < nums.length; i++) {`
`@@ -94,6 +94,6 @@ public List<List<Integer>> Hashmap(int[] nums, int target) {`
`94`	`94`	`}`
`95`	`95`	`}`
`96`	`96`	`}`
`97`		`- return new ArrayList(ts);`
	`97`	`+ return new ArrayList<>(ts);`
`98`	`98`	`}`
`99`	`99`	`}`
Original file line number	Diff line number	Diff line change
`@@ -45,7 +45,7 @@ public void union(int x, int y) {`
`45`	`45`	`}`
`46`	`46`
`47`	`47`	`public int count() {`
`48`		`- List parents = new ArrayList();`
	`48`	`+ List<Integer> parents = new ArrayList<>();`
`49`	`49`	`for (int i = 0; i < p.length; i++) {`
`50`	`50`	`if (!parents.contains(find(i))) {`
`51`	`51`	`parents.add(find(i));`