Apache
/
hadoop
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

HDFS-4294. Backwards compatibility is not maintained for TestVolumeId. Contributed by Ivan A. Veselovsky and Robert Parker. 

git-svn-id: https://svn.apache.org/repos/asf/hadoop/common/trunk@1419875 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Aaron Myers 2012-12-10 23:46:10 +00:00
parent 64cbb3c2ff
commit 6e82da0dea
2 changed files with 6 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
hadoop-hdfs-project/hadoop-hdfs/CHANGES.txt
View File

@ -597,6 +597,9 @@ Release 2.0.3-alpha - Unreleased
HDFS-4295. Using port 1023 should be valid when starting Secure DataNode HDFS-4295. Using port 1023 should be valid when starting Secure DataNode
(Stephen Chu via todd) (Stephen Chu via todd)
HDFS-4294. Backwards compatibility is not maintained for TestVolumeId.
(Ivan A. Veselovsky and Robert Parker via atm)
BREAKDOWN OF HDFS-3077 SUBTASKS BREAKDOWN OF HDFS-3077 SUBTASKS
HDFS-3077. Quorum-based protocol for reading and writing edit logs. HDFS-3077. Quorum-based protocol for reading and writing edit logs.

6
hadoop-hdfs-project/hadoop-hdfs/src/test/java/org/apache/hadoop/fs/TestVolumeId.java
View File

@ -51,7 +51,7 @@ public class TestVolumeId {
} }
@SuppressWarnings("unchecked") @SuppressWarnings("unchecked")
private <T> void testEq(final boolean eq, Comparable<? super T> id1, Comparable<? super T> id2) { private <T> void testEq(final boolean eq, Comparable<T> id1, Comparable<T> id2) {
final int h1 = id1.hashCode(); final int h1 = id1.hashCode();
final int h2 = id2.hashCode(); final int h2 = id2.hashCode();
@ -99,8 +99,8 @@ public class TestVolumeId {
} }
@SuppressWarnings("unchecked") @SuppressWarnings("unchecked")
private <T> void testEqMany(final boolean eq, Comparable<? super T>... volumeIds) { private <T> void testEqMany(final boolean eq, Comparable<T>... volumeIds) {
Comparable<? super T> vidNext; Comparable<T> vidNext;
int sum = 0; int sum = 0;
for (int i=0; i<volumeIds.length; i++) { for (int i=0; i<volumeIds.length; i++) {
if (i == volumeIds.length - 1) { if (i == volumeIds.length - 1) {