mirror of
https://github.com/TheAlgorithms/Java.git
synced 2026-03-13 08:40:43 +08:00
chore: suppress rawtypes in selected classes (#6261)
This commit is contained in:
@@ -12,6 +12,7 @@ import java.util.BitSet;
|
||||
*
|
||||
* @param <T> The type of elements to be stored in the Bloom filter.
|
||||
*/
|
||||
@SuppressWarnings("rawtypes")
|
||||
public class BloomFilter<T> {
|
||||
|
||||
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>
|
||||
*/
|
||||
@SuppressWarnings("rawtypes")
|
||||
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>.
|
||||
* </p>
|
||||
*/
|
||||
@SuppressWarnings("rawtypes")
|
||||
public final class WelshPowell {
|
||||
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 <V> the type of mapped values
|
||||
*/
|
||||
@SuppressWarnings("rawtypes")
|
||||
public class GenericHashMapUsingArray<K, V> {
|
||||
|
||||
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 <V> the type of mapped values
|
||||
*/
|
||||
@SuppressWarnings("rawtypes")
|
||||
public class HashMap<K, V> {
|
||||
private final int hashSize;
|
||||
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 <Value> the type of mapped values
|
||||
*/
|
||||
@SuppressWarnings("rawtypes")
|
||||
public class LinearProbingHashMap<Key extends Comparable<Key>, Value> extends Map<Key, Value> {
|
||||
private int hsize; // size of the hash table
|
||||
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
|
||||
*/
|
||||
@SuppressWarnings("rawtypes")
|
||||
public class CircleLinkedList<E> {
|
||||
|
||||
/**
|
||||
|
||||
@@ -10,6 +10,7 @@ import java.util.Objects;
|
||||
*
|
||||
* @param <T> the type of elements in this list
|
||||
*/
|
||||
@SuppressWarnings("rawtypes")
|
||||
public class CursorLinkedList<T> {
|
||||
|
||||
/**
|
||||
|
||||
@@ -29,6 +29,7 @@ import java.util.stream.IntStream;
|
||||
* @param <E> type of elements
|
||||
* @see <a href="https://en.wikipedia.org/wiki/Skip_list">Wiki. Skip list</a>
|
||||
*/
|
||||
@SuppressWarnings("rawtypes")
|
||||
public class SkipList<E extends Comparable<E>> {
|
||||
|
||||
/**
|
||||
|
||||
Reference in New Issue
Block a user