HDFS-12445. Correct spellings of choosen to chosen. Contributed by hu xiaodong.
This commit is contained in:
parent
59830ca772
commit
51edaacd09
|
@ -3551,8 +3551,8 @@ public class BlockManager implements BlockStatsMXBean {
|
|||
List<DatanodeStorageInfo> replicasToDelete = replicator
|
||||
.chooseReplicasToDelete(nonExcess, nonExcess, replication, excessTypes,
|
||||
addedNode, delNodeHint);
|
||||
for (DatanodeStorageInfo choosenReplica : replicasToDelete) {
|
||||
processChosenExcessRedundancy(nonExcess, choosenReplica, storedBlock);
|
||||
for (DatanodeStorageInfo chosenReplica : replicasToDelete) {
|
||||
processChosenExcessRedundancy(nonExcess, chosenReplica, storedBlock);
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
@ -178,7 +178,7 @@ public class TestDeadDatanode {
|
|||
clientNode, new HashSet<>(), 256 * 1024 * 1024L, null, (byte) 7,
|
||||
BlockType.CONTIGUOUS, null, null);
|
||||
for (DatanodeStorageInfo datanodeStorageInfo : results) {
|
||||
assertFalse("Dead node should not be choosen", datanodeStorageInfo
|
||||
assertFalse("Dead node should not be chosen", datanodeStorageInfo
|
||||
.getDatanodeDescriptor().equals(clientNode));
|
||||
}
|
||||
}
|
||||
|
|
|
@ -368,7 +368,7 @@ public class DancingLinks<ColumnName> {
|
|||
|
||||
/**
|
||||
* 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
|
||||
*/
|
||||
private Node<ColumnName> advance(int goalRow) {
|
||||
|
|
|
@ -39,8 +39,8 @@ import com.google.common.base.Charsets;
|
|||
* Launch a distributed pentomino solver.
|
||||
* 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
|
||||
* index of the row that is choosen for each column in order. Note that the
|
||||
* next column is heuristically choosen by the solver, so it is dependant on
|
||||
* index of the row that is chosen for each column in order. Note that the
|
||||
* next column is heuristically chosen by the solver, so it is dependant on
|
||||
* 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.
|
||||
*/
|
||||
|
|
|
@ -411,7 +411,7 @@ public class Pentomino {
|
|||
/**
|
||||
* Find all of the solutions that start with the given prefix. The printer
|
||||
* 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
|
||||
* @return the number of solutions found
|
||||
*/
|
||||
|
|
Loading…
Reference in New Issue