mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-06 00:54:32 +08:00
chore: suppress rawtypes
in selected classes (#6261)
This commit is contained in:
1
pom.xml
1
pom.xml
@ -76,7 +76,6 @@
|
|||||||
<compilerArgs>
|
<compilerArgs>
|
||||||
<arg>-Xlint:all</arg>
|
<arg>-Xlint:all</arg>
|
||||||
<arg>-Xlint:-auxiliaryclass</arg>
|
<arg>-Xlint:-auxiliaryclass</arg>
|
||||||
<arg>-Xlint:-rawtypes</arg>
|
|
||||||
<arg>-Xlint:-unchecked</arg>
|
<arg>-Xlint:-unchecked</arg>
|
||||||
<arg>-Werror</arg>
|
<arg>-Werror</arg>
|
||||||
</compilerArgs>
|
</compilerArgs>
|
||||||
|
@ -9,6 +9,7 @@ import java.util.List;
|
|||||||
*
|
*
|
||||||
* @author <a href="https://github.com/siddhant2002">Siddhant Swarup Mallick</a>
|
* @author <a href="https://github.com/siddhant2002">Siddhant Swarup Mallick</a>
|
||||||
*/
|
*/
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
public class AllPathsFromSourceToTarget {
|
public class AllPathsFromSourceToTarget {
|
||||||
|
|
||||||
// No. of vertices in graph
|
// No. of vertices in graph
|
||||||
|
@ -12,6 +12,7 @@ import java.util.BitSet;
|
|||||||
*
|
*
|
||||||
* @param <T> The type of elements to be stored in the Bloom filter.
|
* @param <T> The type of elements to be stored in the Bloom filter.
|
||||||
*/
|
*/
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
public class BloomFilter<T> {
|
public class BloomFilter<T> {
|
||||||
|
|
||||||
private final int numberOfHashFunctions;
|
private final int numberOfHashFunctions;
|
||||||
|
@ -19,6 +19,7 @@ import java.util.PriorityQueue;
|
|||||||
*
|
*
|
||||||
* <p><strong>Time Complexity:</strong> O(E log V), where E is the number of edges and V is the number of vertices.</p>
|
* <p><strong>Time Complexity:</strong> O(E log V), where E is the number of edges and V is the number of vertices.</p>
|
||||||
*/
|
*/
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
public class Kruskal {
|
public class Kruskal {
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
@ -22,6 +22,7 @@ import java.util.stream.IntStream;
|
|||||||
* For more information, see <a href="https://en.wikipedia.org/wiki/Graph_coloring">Graph Coloring</a>.
|
* For more information, see <a href="https://en.wikipedia.org/wiki/Graph_coloring">Graph Coloring</a>.
|
||||||
* </p>
|
* </p>
|
||||||
*/
|
*/
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
public final class WelshPowell {
|
public final class WelshPowell {
|
||||||
private static final int BLANK_COLOR = -1; // Constant representing an uncolored state
|
private static final int BLANK_COLOR = -1; // Constant representing an uncolored state
|
||||||
|
|
||||||
|
@ -23,6 +23,7 @@ import java.util.LinkedList;
|
|||||||
* @param <K> the type of keys maintained by this hash map
|
* @param <K> the type of keys maintained by this hash map
|
||||||
* @param <V> the type of mapped values
|
* @param <V> the type of mapped values
|
||||||
*/
|
*/
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
public class GenericHashMapUsingArray<K, V> {
|
public class GenericHashMapUsingArray<K, V> {
|
||||||
|
|
||||||
private int size; // Total number of key-value pairs
|
private int size; // Total number of key-value pairs
|
||||||
|
@ -8,6 +8,7 @@ package com.thealgorithms.datastructures.hashmap.hashing;
|
|||||||
* @param <K> the type of keys maintained by this map
|
* @param <K> the type of keys maintained by this map
|
||||||
* @param <V> the type of mapped values
|
* @param <V> the type of mapped values
|
||||||
*/
|
*/
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
public class HashMap<K, V> {
|
public class HashMap<K, V> {
|
||||||
private final int hashSize;
|
private final int hashSize;
|
||||||
private final LinkedList<K, V>[] buckets;
|
private final LinkedList<K, V>[] buckets;
|
||||||
|
@ -34,6 +34,7 @@ import java.util.ArrayList;
|
|||||||
* @param <Key> the type of keys maintained by this map
|
* @param <Key> the type of keys maintained by this map
|
||||||
* @param <Value> the type of mapped values
|
* @param <Value> the type of mapped values
|
||||||
*/
|
*/
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
public class LinearProbingHashMap<Key extends Comparable<Key>, Value> extends Map<Key, Value> {
|
public class LinearProbingHashMap<Key extends Comparable<Key>, Value> extends Map<Key, Value> {
|
||||||
private int hsize; // size of the hash table
|
private int hsize; // size of the hash table
|
||||||
private Key[] keys; // array to store keys
|
private Key[] keys; // array to store keys
|
||||||
|
@ -10,6 +10,7 @@ package com.thealgorithms.datastructures.lists;
|
|||||||
*
|
*
|
||||||
* @param <E> the type of elements held in this list
|
* @param <E> the type of elements held in this list
|
||||||
*/
|
*/
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
public class CircleLinkedList<E> {
|
public class CircleLinkedList<E> {
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
@ -10,6 +10,7 @@ import java.util.Objects;
|
|||||||
*
|
*
|
||||||
* @param <T> the type of elements in this list
|
* @param <T> the type of elements in this list
|
||||||
*/
|
*/
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
public class CursorLinkedList<T> {
|
public class CursorLinkedList<T> {
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
@ -29,6 +29,7 @@ import java.util.stream.IntStream;
|
|||||||
* @param <E> type of elements
|
* @param <E> type of elements
|
||||||
* @see <a href="https://en.wikipedia.org/wiki/Skip_list">Wiki. Skip list</a>
|
* @see <a href="https://en.wikipedia.org/wiki/Skip_list">Wiki. Skip list</a>
|
||||||
*/
|
*/
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
public class SkipList<E extends Comparable<E>> {
|
public class SkipList<E extends Comparable<E>> {
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
@ -2,6 +2,7 @@ package com.thealgorithms.dynamicprogramming;
|
|||||||
|
|
||||||
import java.util.HashMap;
|
import java.util.HashMap;
|
||||||
|
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
final class LongestArithmeticSubsequence {
|
final class LongestArithmeticSubsequence {
|
||||||
private LongestArithmeticSubsequence() {
|
private LongestArithmeticSubsequence() {
|
||||||
}
|
}
|
||||||
|
@ -10,6 +10,7 @@ import java.util.Stack;
|
|||||||
* See more:
|
* See more:
|
||||||
* https://www.geeksforgeeks.org/function-to-check-if-a-singly-linked-list-is-palindrome/
|
* https://www.geeksforgeeks.org/function-to-check-if-a-singly-linked-list-is-palindrome/
|
||||||
*/
|
*/
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
public final class PalindromeSinglyLinkedList {
|
public final class PalindromeSinglyLinkedList {
|
||||||
private PalindromeSinglyLinkedList() {
|
private PalindromeSinglyLinkedList() {
|
||||||
}
|
}
|
||||||
|
@ -15,6 +15,7 @@ import com.thealgorithms.devutils.searches.SearchAlgorithm;
|
|||||||
* Note: This algorithm requires that the input array be sorted.
|
* Note: This algorithm requires that the input array be sorted.
|
||||||
* </p>
|
* </p>
|
||||||
*/
|
*/
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
public class FibonacciSearch implements SearchAlgorithm {
|
public class FibonacciSearch implements SearchAlgorithm {
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
@ -7,6 +7,7 @@ import static com.thealgorithms.sorts.SortUtils.less;
|
|||||||
*
|
*
|
||||||
* @see SortAlgorithm
|
* @see SortAlgorithm
|
||||||
*/
|
*/
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
class MergeSort implements SortAlgorithm {
|
class MergeSort implements SortAlgorithm {
|
||||||
|
|
||||||
private Comparable[] aux;
|
private Comparable[] aux;
|
||||||
|
@ -8,6 +8,7 @@ import java.util.List;
|
|||||||
*
|
*
|
||||||
* @author Podshivalov Nikita (https://github.com/nikitap492)
|
* @author Podshivalov Nikita (https://github.com/nikitap492)
|
||||||
*/
|
*/
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
public interface SortAlgorithm {
|
public interface SortAlgorithm {
|
||||||
/**
|
/**
|
||||||
* Main method arrays sorting algorithms
|
* Main method arrays sorting algorithms
|
||||||
|
@ -6,6 +6,7 @@ import java.util.Arrays;
|
|||||||
* It distributes elements into buckets and recursively sorts these buckets.
|
* It distributes elements into buckets and recursively sorts these buckets.
|
||||||
* This implementation is generic and can sort any array of elements that extend Comparable.
|
* This implementation is generic and can sort any array of elements that extend Comparable.
|
||||||
*/
|
*/
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
public class SpreadSort implements SortAlgorithm {
|
public class SpreadSort implements SortAlgorithm {
|
||||||
private static final int MAX_INSERTION_SORT_THRESHOLD = 1000;
|
private static final int MAX_INSERTION_SORT_THRESHOLD = 1000;
|
||||||
private static final int MAX_INITIAL_BUCKET_CAPACITY = 1000;
|
private static final int MAX_INITIAL_BUCKET_CAPACITY = 1000;
|
||||||
|
@ -7,6 +7,7 @@ import static com.thealgorithms.sorts.SortUtils.less;
|
|||||||
* <p>
|
* <p>
|
||||||
* For more details @see <a href="https://en.wikipedia.org/wiki/Timsort">TimSort Algorithm</a>
|
* For more details @see <a href="https://en.wikipedia.org/wiki/Timsort">TimSort Algorithm</a>
|
||||||
*/
|
*/
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
class TimSort implements SortAlgorithm {
|
class TimSort implements SortAlgorithm {
|
||||||
private static final int SUB_ARRAY_SIZE = 32;
|
private static final int SUB_ARRAY_SIZE = 32;
|
||||||
private Comparable[] aux;
|
private Comparable[] aux;
|
||||||
|
@ -10,6 +10,7 @@ import java.util.List;
|
|||||||
import org.junit.jupiter.api.BeforeEach;
|
import org.junit.jupiter.api.BeforeEach;
|
||||||
import org.junit.jupiter.api.Test;
|
import org.junit.jupiter.api.Test;
|
||||||
|
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
public class KruskalTest {
|
public class KruskalTest {
|
||||||
|
|
||||||
private Kruskal kruskal;
|
private Kruskal kruskal;
|
||||||
|
@ -8,6 +8,7 @@ import org.junit.jupiter.params.ParameterizedTest;
|
|||||||
import org.junit.jupiter.params.provider.Arguments;
|
import org.junit.jupiter.params.provider.Arguments;
|
||||||
import org.junit.jupiter.params.provider.MethodSource;
|
import org.junit.jupiter.params.provider.MethodSource;
|
||||||
|
|
||||||
|
@SuppressWarnings("rawtypes")
|
||||||
public class NumberOfDigitsTest {
|
public class NumberOfDigitsTest {
|
||||||
|
|
||||||
@ParameterizedTest
|
@ParameterizedTest
|
||||||
|
Reference in New Issue
Block a user