Skip to content

Commit 33aadcc

Browse files
author
Justin Wetherell
committed
Removed unneeded warning suppressions
1 parent f45c156 commit 33aadcc

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

44 files changed

+16
-92
lines changed

‎src/com/jwetherell/algorithms/data_structures/CompactSuffixTrie.java

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -13,6 +13,7 @@
1313
*
1414
* @author Justin Wetherell <phishman3579@gmail.com>
1515
*/
16+
@SuppressWarnings("unchecked")
1617
public class CompactSuffixTrie<C extends CharSequence> {
1718

1819
private PatriciaTrie<C> tree = null;
@@ -23,7 +24,6 @@ public class CompactSuffixTrie<C extends CharSequence> {
2324
* @param sequence
2425
* to create a suffix trie from.
2526
*/
26-
@SuppressWarnings("unchecked")
2727
public CompactSuffixTrie(C sequence) {
2828
tree = new PatriciaTrie<C>();
2929
int length = sequence.length();
@@ -40,7 +40,6 @@ public CompactSuffixTrie(C sequence) {
4040
* to add to trie.
4141
* @return True if added successfully.
4242
*/
43-
@SuppressWarnings("unchecked")
4443
public boolean add(C sequence) {
4544
int length = sequence.length();
4645
for (int i = 0; i < length; i++) {

‎src/com/jwetherell/algorithms/data_structures/Graph.java

Lines changed: 3 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -14,6 +14,7 @@
1414
*
1515
* @author Justin Wetherell <phishman3579@gmail.com>
1616
*/
17+
@SuppressWarnings("unchecked")
1718
public class Graph<T extends Comparable<T>> {
1819

1920
private List<Vertex<T>> verticies = new ArrayList<Vertex<T>>();
@@ -171,7 +172,6 @@ public int hashCode() {
171172
/**
172173
* {@inheritDoc}
173174
*/
174-
@SuppressWarnings("unchecked")
175175
@Override
176176
public boolean equals(Object v1) {
177177
if (!(v1 instanceof Vertex))
@@ -259,7 +259,6 @@ public int hashCode() {
259259
/**
260260
* {@inheritDoc}
261261
*/
262-
@SuppressWarnings("unchecked")
263262
@Override
264263
public boolean equals(Object e1) {
265264
if (!(e1 instanceof Edge))
@@ -342,13 +341,12 @@ public int hashCode() {
342341
/**
343342
* {@inheritDoc}
344343
*/
345-
@SuppressWarnings("rawtypes")
346344
@Override
347345
public boolean equals(Object e1) {
348346
if (!(e1 instanceof CostVertexPair))
349347
return false;
350348

351-
CostVertexPair pair = (CostVertexPair)e1;
349+
CostVertexPair<?> pair = (CostVertexPair<?>)e1;
352350
if (this.cost != pair.cost)
353351
return false;
354352

@@ -422,13 +420,12 @@ public int hashCode() {
422420
/**
423421
* {@inheritDoc}
424422
*/
425-
@SuppressWarnings({ "rawtypes", "unchecked" })
426423
@Override
427424
public boolean equals(Object obj) {
428425
if (!(obj instanceof CostPathPair))
429426
return false;
430427

431-
CostPathPair pair = (CostPathPair)obj;
428+
CostPathPair<?> pair = (CostPathPair<?>)obj;
432429
if (this.cost != pair.cost)
433430
return false;
434431

‎src/com/jwetherell/algorithms/data_structures/Matrix.java

Lines changed: 2 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -12,6 +12,7 @@
1212
*
1313
* @author Justin Wetherell <phishman3579@gmail.com>
1414
*/
15+
@SuppressWarnings("unchecked")
1516
public class Matrix<T extends Number> {
1617

1718
private int rows = 0;
@@ -24,7 +25,7 @@ public class Matrix<T extends Number> {
2425
*/
2526
@Override
2627
public int compare(T o1, T o2) {
27-
/* TODO: What if Java adds new numberic type? */
28+
/* TODO: What if Java adds new numeric type? */
2829
int result = 0;
2930
if (o1 instanceof BigDecimal || o2 instanceof BigDecimal) {
3031
BigDecimal c1 = (BigDecimal)o1;
@@ -61,7 +62,6 @@ public int compare(T o1, T o2) {
6162
* @param rows Number of rows in Matrix.
6263
* @param cols Number of columns in Matrix.
6364
*/
64-
@SuppressWarnings("unchecked")
6565
public Matrix(int rows, int cols) {
6666
this.rows = rows;
6767
this.cols = cols;
@@ -76,7 +76,6 @@ public Matrix(int rows, int cols) {
7676
* @param cols Number of columns in Matrix.
7777
* @param matrix 2D matrix used to populate Matrix.
7878
*/
79-
@SuppressWarnings("unchecked")
8079
public Matrix(int rows, int cols, T[][] matrix) {
8180
this.rows = rows;
8281
this.cols = cols;
@@ -96,7 +95,6 @@ public T get(int row, int col) {
9695
return matrix[getIndex(row, col)];
9796
}
9897

99-
@SuppressWarnings("unchecked")
10098
public T[] getRow(int row) {
10199
T[] result = (T[]) new Number[cols];
102100
for (int c = 0; c < cols; c++) {
@@ -105,7 +103,6 @@ public T[] getRow(int row) {
105103
return result;
106104
}
107105

108-
@SuppressWarnings("unchecked")
109106
public T[] getColumn(int col) {
110107
T[] result = (T[]) new Number[rows];
111108
for (int r = 0; r < rows; r++) {
@@ -118,7 +115,6 @@ public void set(int row, int col, T value) {
118115
matrix[getIndex(row, col)] = value;
119116
}
120117

121-
@SuppressWarnings("unchecked")
122118
public Matrix<T> add(Matrix<T> input) {
123119
Matrix<T> output = new Matrix<T>(this.rows, this.cols);
124120
if ((this.cols != input.cols) || (this.rows != input.rows))
@@ -158,7 +154,6 @@ public Matrix<T> add(Matrix<T> input) {
158154
return output;
159155
}
160156

161-
@SuppressWarnings("unchecked")
162157
public Matrix<T> subtract(Matrix<T> input) {
163158
Matrix<T> output = new Matrix<T>(this.rows, this.cols);
164159
if ((this.cols != input.cols) || (this.rows != input.rows))
@@ -198,7 +193,6 @@ public Matrix<T> subtract(Matrix<T> input) {
198193
return output;
199194
}
200195

201-
@SuppressWarnings("unchecked")
202196
public Matrix<T> multiply(Matrix<T> input) {
203197
Matrix<T> output = new Matrix<T>(this.rows, input.cols);
204198
if (this.cols != input.rows)
@@ -299,7 +293,6 @@ public int hashCode() {
299293
/**
300294
* {@inheritDoc}
301295
*/
302-
@SuppressWarnings("unchecked")
303296
@Override
304297
public boolean equals(Object obj) {
305298
if (obj == null)

‎src/com/jwetherell/algorithms/data_structures/QuadTree.java

Lines changed: 1 addition & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -14,6 +14,7 @@
1414
*
1515
* @author Justin Wetherell <phishman3579@gmail.com>
1616
*/
17+
@SuppressWarnings("unchecked")
1718
public abstract class QuadTree<G extends QuadTree.GeometricObject> {
1819

1920
/**
@@ -108,7 +109,6 @@ public QuadTree.QuadNode<P> getRoot() {
108109
* @param x X position of point.
109110
* @param y Y position of point.
110111
*/
111-
@SuppressWarnings("unchecked")
112112
public boolean insert(float x, float y) {
113113
XYPoint xyPoint = new XYPoint(x,y);
114114
return root.insert((P)xyPoint);
@@ -120,7 +120,6 @@ public boolean insert(float x, float y) {
120120
* @param x X position of point.
121121
* @param y Y position of point.
122122
*/
123-
@SuppressWarnings("unchecked")
124123
public boolean remove(float x, float y) {
125124
XYPoint xyPoint = new XYPoint(x,y);
126125
return root.remove((P)xyPoint);
@@ -383,7 +382,6 @@ public QuadTree.QuadNode<B> getRoot() {
383382
* @param width Width of the rectangle.
384383
* @param height Height of the rectangle.
385384
*/
386-
@SuppressWarnings("unchecked")
387385
public boolean insert(float x, float y, float width, float height) {
388386
XYPoint xyPoint = new XYPoint(x,y);
389387
AxisAlignedBoundingBox range = new AxisAlignedBoundingBox(xyPoint,width,height);
@@ -398,7 +396,6 @@ public boolean insert(float x, float y, float width, float height) {
398396
* @param width Width of the rectangle.
399397
* @param height Height of the rectangle.
400398
*/
401-
@SuppressWarnings("unchecked")
402399
public boolean remove(float x, float y, float width, float height) {
403400
XYPoint xyPoint = new XYPoint(x,y);
404401
AxisAlignedBoundingBox range = new AxisAlignedBoundingBox(xyPoint,width,height);
@@ -637,7 +634,6 @@ public int hashCode() {
637634
/**
638635
* {@inheritDoc}
639636
*/
640-
@SuppressWarnings("unchecked")
641637
@Override
642638
public boolean equals(Object obj) {
643639
if (obj == null)

‎src/com/jwetherell/algorithms/data_structures/SegmentTree.java

Lines changed: 3 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -28,6 +28,7 @@
2828
*
2929
* @author Justin Wetherell <phishman3579@gmail.com>
3030
*/
31+
@SuppressWarnings("unchecked")
3132
public abstract class SegmentTree<D extends SegmentTree.Data> {
3233

3334
protected Segment<D> root = null;
@@ -306,7 +307,6 @@ public RangeMaximumData(long start, long end, N number) {
306307
* {@inheritDoc}
307308
*/
308309
@Override
309-
@SuppressWarnings("unchecked")
310310
public Data combined(Data data) {
311311
RangeMaximumData<N> q = null;
312312
if (data instanceof RangeMaximumData) {
@@ -381,7 +381,6 @@ public int hashCode() {
381381
/**
382382
* {@inheritDoc}
383383
*/
384-
@SuppressWarnings("unchecked")
385384
@Override
386385
public boolean equals(Object obj) {
387386
if (!(obj instanceof RangeMaximumData))
@@ -446,7 +445,6 @@ public void clear() {
446445
* {@inheritDoc}
447446
*/
448447
@Override
449-
@SuppressWarnings("unchecked")
450448
public Data combined(Data data) {
451449
RangeMinimumData<N> q = null;
452450
if (data instanceof RangeMinimumData) {
@@ -525,7 +523,6 @@ public int hashCode() {
525523
public boolean equals(Object obj) {
526524
if (!(obj instanceof RangeMinimumData))
527525
return false;
528-
@SuppressWarnings("unchecked")
529526
RangeMinimumData<N> data = (RangeMinimumData<N>) obj;
530527
if (this.start == data.start && this.end == data.end && this.minimum.equals(data.minimum))
531528
return true;
@@ -585,7 +582,6 @@ public void clear() {
585582
* {@inheritDoc}
586583
*/
587584
@Override
588-
@SuppressWarnings("unchecked")
589585
public Data combined(Data data) {
590586
RangeSumData<N> q = null;
591587
if (data instanceof RangeSumData) {
@@ -601,7 +597,6 @@ public Data combined(Data data) {
601597
* @param data
602598
* resulted from combination.
603599
*/
604-
@SuppressWarnings("unchecked")
605600
private void combined(RangeSumData<N> data) {
606601
if (this.sum == null && data.sum == null)
607602
return;
@@ -665,7 +660,6 @@ public int hashCode() {
665660
public boolean equals(Object obj) {
666661
if (!(obj instanceof RangeSumData))
667662
return false;
668-
@SuppressWarnings("unchecked")
669663
RangeSumData<N> data = (RangeSumData<N>) obj;
670664
if (this.start == data.start && this.end == data.end && this.sum.equals(data.sum))
671665
return true;
@@ -761,7 +755,6 @@ public void clear() {
761755
* {@inheritDoc}
762756
*/
763757
@Override
764-
@SuppressWarnings("unchecked")
765758
public Data combined(Data data) {
766759
IntervalData<O> q = null;
767760
if (data instanceof IntervalData) {
@@ -823,7 +816,6 @@ public int hashCode() {
823816
public boolean equals(Object obj) {
824817
if (!(obj instanceof IntervalData))
825818
return false;
826-
@SuppressWarnings("unchecked")
827819
IntervalData<O> data = (IntervalData<O>) obj;
828820
if (this.start == data.start && this.end == data.end) {
829821
if (this.set.size() != data.set.size())
@@ -958,7 +950,6 @@ public FlatSegmentTree(List<D> data) {
958950
this(data, 1);
959951
}
960952

961-
@SuppressWarnings("unchecked")
962953
public FlatSegmentTree(List<D> data, int minLength) {
963954

964955
if (data.size() <= 0)
@@ -1046,7 +1037,6 @@ public NonOverlappingSegment(int minLength, D data) {
10461037
this(minLength, data.start, data.end, data);
10471038
}
10481039

1049-
@SuppressWarnings("unchecked")
10501040
public NonOverlappingSegment(int minLength, long start, long end, D data) {
10511041
super(minLength);
10521042
this.start = start;
@@ -1057,7 +1047,6 @@ public NonOverlappingSegment(int minLength, long start, long end, D data) {
10571047
this.data = ((D) data.copy());
10581048
}
10591049

1060-
@SuppressWarnings("unchecked")
10611050
protected static <D extends Data> Segment<D> createFromList(int minLength,
10621051
List<NonOverlappingSegment<D>> segments, long start, int length) {
10631052
NonOverlappingSegment<D> segment = new NonOverlappingSegment<D>(minLength);
@@ -1072,8 +1061,7 @@ protected static <D extends Data> Segment<D> createFromList(int minLength,
10721061
segment.data.combined(s.data); // Update our data to reflect all children's data
10731062
}
10741063

1075-
// If segment is greater or equal to two, split data into
1076-
// children
1064+
// If segment is greater or equal to two, split data into children
10771065
if (segment.length >= 2 && segment.length >= minLength) {
10781066
segment.half = segment.length / 2;
10791067
List<NonOverlappingSegment<D>> s1 = new ArrayList<NonOverlappingSegment<D>>();
@@ -1110,7 +1098,6 @@ protected static <D extends Data> Segment<D> createFromList(int minLength,
11101098
* {@inheritDoc}
11111099
*/
11121100
@Override
1113-
@SuppressWarnings("unchecked")
11141101
public D query(long startOfQuery, long endOfQuery) {
11151102
if (startOfQuery == this.start && endOfQuery == this.end) {
11161103
if (this.data == null)
@@ -1185,7 +1172,6 @@ public DynamicSegmentTree(List<D> data) {
11851172
this(data, 1);
11861173
}
11871174

1188-
@SuppressWarnings("unchecked")
11891175
public DynamicSegmentTree(List<D> data, int minLength) {
11901176
if (data.size() <= 0)
11911177
return;
@@ -1293,7 +1279,6 @@ public OverlappingSegment(int minLength) {
12931279
super(minLength);
12941280
}
12951281

1296-
@SuppressWarnings("unchecked")
12971282
public OverlappingSegment(int minLength, long start, long end, D data) {
12981283
super(minLength);
12991284
this.start = start;
@@ -1304,7 +1289,6 @@ public OverlappingSegment(int minLength, long start, long end, D data) {
13041289
this.data = ((D) data.copy());
13051290
}
13061291

1307-
@SuppressWarnings("unchecked")
13081292
protected static <D extends Data> Segment<D> createFromList(int minLength, List<OverlappingSegment<D>> segments,
13091293
long start, int length)
13101294
{
@@ -1334,8 +1318,7 @@ protected static <D extends Data> Segment<D> createFromList(int minLength, List<
13341318
}
13351319
}
13361320

1337-
// If segment is greater or equal to two, split data into
1338-
// children
1321+
// If segment is greater or equal to two, split data into children
13391322
if (segment.length >= 2 && segment.length >= minLength) {
13401323
segment.half = segment.length / 2;
13411324
List<OverlappingSegment<D>> s1 = new ArrayList<OverlappingSegment<D>>();
@@ -1367,7 +1350,6 @@ protected static <D extends Data> Segment<D> createFromList(int minLength, List<
13671350
* {@inheritDoc}
13681351
*/
13691352
@Override
1370-
@SuppressWarnings("unchecked")
13711353
public D query(long startOfQuery, long endOfQuery) {
13721354
D result = null;
13731355

‎src/com/jwetherell/algorithms/data_structures/SuffixTrie.java

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -16,6 +16,7 @@
1616
*
1717
* @author Justin Wetherell <phishman3579@gmail.com>
1818
*/
19+
@SuppressWarnings("unchecked")
1920
public class SuffixTrie<C extends CharSequence> implements ISuffixTree<C> {
2021

2122
private Trie<C> tree = null;
@@ -26,7 +27,6 @@ public class SuffixTrie<C extends CharSequence> implements ISuffixTree<C> {
2627
* @param sequence
2728
* to create a suffix trie from.
2829
*/
29-
@SuppressWarnings("unchecked")
3030
public SuffixTrie(C sequence) {
3131
tree = new Trie<C>();
3232
int length = sequence.length();
@@ -43,7 +43,6 @@ public SuffixTrie(C sequence) {
4343
* to add to trie.
4444
* @return True if added successfully.
4545
*/
46-
@SuppressWarnings("unchecked")
4746
public boolean add(C sequence) {
4847
int length = sequence.length();
4948
for (int i = 0; i < length; i++) {

0 commit comments

Comments
 (0)