big-data/hadoop
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

HDFS-12445. Correct spellings of choosen to chosen. Contributed by hu xiaodong.

Browse Source
This commit is contained in:
Andrew Wang 2017-09-19 13:48:23 -07:00
parent 59830ca772
commit 51edaacd09
5 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
hadoop-hdfs-project/hadoop-hdfs/src/main/java/org/apache/hadoop/hdfs/server/blockmanagement/BlockManager.java
View File

@ -3551,8 +3551,8 @@ private void chooseExcessRedundancyContiguous(
List<DatanodeStorageInfo> replicasToDelete = replicator List<DatanodeStorageInfo> replicasToDelete = replicator
.chooseReplicasToDelete(nonExcess, nonExcess, replication, excessTypes, .chooseReplicasToDelete(nonExcess, nonExcess, replication, excessTypes,
addedNode, delNodeHint); addedNode, delNodeHint);
for (DatanodeStorageInfo choosenReplica : replicasToDelete) { for (DatanodeStorageInfo chosenReplica : replicasToDelete) {
processChosenExcessRedundancy(nonExcess, choosenReplica, storedBlock); processChosenExcessRedundancy(nonExcess, chosenReplica, storedBlock);
} }
} }

2
hadoop-hdfs-project/hadoop-hdfs/src/test/java/org/apache/hadoop/hdfs/server/namenode/TestDeadDatanode.java
View File

@ -178,7 +178,7 @@ public void testDeadNodeAsBlockTarget() throws Exception {
clientNode, new HashSet<>(), 256 * 1024 * 1024L, null, (byte) 7, clientNode, new HashSet<>(), 256 * 1024 * 1024L, null, (byte) 7,
BlockType.CONTIGUOUS, null, null); BlockType.CONTIGUOUS, null, null);
for (DatanodeStorageInfo datanodeStorageInfo : results) { for (DatanodeStorageInfo datanodeStorageInfo : results) {
assertFalse("Dead node should not be choosen", datanodeStorageInfo assertFalse("Dead node should not be chosen", datanodeStorageInfo
.getDatanodeDescriptor().equals(clientNode)); .getDatanodeDescriptor().equals(clientNode));
} }
} }

2
hadoop-mapreduce-project/hadoop-mapreduce-examples/src/main/java/org/apache/hadoop/examples/dancing/DancingLinks.java
View File

@ -368,7 +368,7 @@ public List<int[]> split(int depth) {
/** /**
* Make one move from a prefix * Make one move from a prefix
* @param goalRow the row that should be choosen * @param goalRow the row that should be chosen
* @return the row that was found * @return the row that was found
*/ */
private Node<ColumnName> advance(int goalRow) { private Node<ColumnName> advance(int goalRow) {

4
hadoop-mapreduce-project/hadoop-mapreduce-examples/src/main/java/org/apache/hadoop/examples/dancing/DistributedPentomino.java
View File

@ -39,8 +39,8 @@
* Launch a distributed pentomino solver. * Launch a distributed pentomino solver.
* It generates a complete list of prefixes of length N with each unique prefix * It generates a complete list of prefixes of length N with each unique prefix
* as a separate line. A prefix is a sequence of N integers that denote the * as a separate line. A prefix is a sequence of N integers that denote the
* index of the row that is choosen for each column in order. Note that the * index of the row that is chosen for each column in order. Note that the
* next column is heuristically choosen by the solver, so it is dependant on * next column is heuristically chosen by the solver, so it is dependant on
* the previous choice. That file is given as the input to * the previous choice. That file is given as the input to
* map/reduce. The output key/value are the move prefix/solution as Text/Text. * map/reduce. The output key/value are the move prefix/solution as Text/Text.
*/ */

2
hadoop-mapreduce-project/hadoop-mapreduce-examples/src/main/java/org/apache/hadoop/examples/dancing/Pentomino.java
View File

@ -411,7 +411,7 @@ public List<int[]> getSplits(int depth) {
/** /**
* Find all of the solutions that start with the given prefix. The printer * Find all of the solutions that start with the given prefix. The printer
* is given each solution as it is found. * is given each solution as it is found.
* @param split a list of row indexes that should be choosen for each row * @param split a list of row indexes that should be chosen for each row
* in order * in order
* @return the number of solutions found * @return the number of solutions found
*/ */