HADOOP-14390. Correct spelling of 'succeed' and variants. Contributed by Dongtao Zhang
This commit is contained in:
parent
a3954ccab1
commit
e4f34ecb04
|
@ -251,7 +251,7 @@ abstract public class ViewFileSystemBaseTest {
|
||||||
fsTarget.isFile(new Path(targetTestRoot,"user/foo")));
|
fsTarget.isFile(new Path(targetTestRoot,"user/foo")));
|
||||||
|
|
||||||
// Delete the created file
|
// Delete the created file
|
||||||
Assert.assertTrue("Delete should suceed",
|
Assert.assertTrue("Delete should succeed",
|
||||||
fsView.delete(new Path("/user/foo"), false));
|
fsView.delete(new Path("/user/foo"), false));
|
||||||
Assert.assertFalse("File should not exist after delete",
|
Assert.assertFalse("File should not exist after delete",
|
||||||
fsView.exists(new Path("/user/foo")));
|
fsView.exists(new Path("/user/foo")));
|
||||||
|
@ -266,7 +266,7 @@ abstract public class ViewFileSystemBaseTest {
|
||||||
fsTarget.isFile(new Path(targetTestRoot,"dir2/foo")));
|
fsTarget.isFile(new Path(targetTestRoot,"dir2/foo")));
|
||||||
|
|
||||||
// Delete the created file
|
// Delete the created file
|
||||||
Assert.assertTrue("Delete should suceed",
|
Assert.assertTrue("Delete should succeed",
|
||||||
fsView.delete(new Path("/internalDir/linkToDir2/foo"), false));
|
fsView.delete(new Path("/internalDir/linkToDir2/foo"), false));
|
||||||
Assert.assertFalse("File should not exist after delete",
|
Assert.assertFalse("File should not exist after delete",
|
||||||
fsView.exists(new Path("/internalDir/linkToDir2/foo")));
|
fsView.exists(new Path("/internalDir/linkToDir2/foo")));
|
||||||
|
@ -370,7 +370,7 @@ abstract public class ViewFileSystemBaseTest {
|
||||||
public void testRenameAcrossMounts1() throws IOException {
|
public void testRenameAcrossMounts1() throws IOException {
|
||||||
fileSystemTestHelper.createFile(fsView, "/user/foo");
|
fileSystemTestHelper.createFile(fsView, "/user/foo");
|
||||||
fsView.rename(new Path("/user/foo"), new Path("/user2/fooBarBar"));
|
fsView.rename(new Path("/user/foo"), new Path("/user2/fooBarBar"));
|
||||||
/* - code if we had wanted this to suceed
|
/* - code if we had wanted this to succeed
|
||||||
Assert.assertFalse(fSys.exists(new Path("/user/foo")));
|
Assert.assertFalse(fSys.exists(new Path("/user/foo")));
|
||||||
Assert.assertFalse(fSysLocal.exists(new Path(targetTestRoot,"user/foo")));
|
Assert.assertFalse(fSysLocal.exists(new Path(targetTestRoot,"user/foo")));
|
||||||
Assert.assertTrue(fSys.isFile(FileSystemTestHelper.getTestRootPath(fSys,"/user2/fooBarBar")));
|
Assert.assertTrue(fSys.isFile(FileSystemTestHelper.getTestRootPath(fSys,"/user2/fooBarBar")));
|
||||||
|
|
|
@ -232,7 +232,7 @@ abstract public class ViewFsBaseTest {
|
||||||
isFile(fcTarget, new Path(targetTestRoot,"dir2/foo")));
|
isFile(fcTarget, new Path(targetTestRoot,"dir2/foo")));
|
||||||
|
|
||||||
// Delete the created file
|
// Delete the created file
|
||||||
Assert.assertTrue("Delete should suceed",
|
Assert.assertTrue("Delete should succeed",
|
||||||
fcView.delete(new Path("/internalDir/linkToDir2/foo"),false));
|
fcView.delete(new Path("/internalDir/linkToDir2/foo"),false));
|
||||||
Assert.assertFalse("File should not exist after deletion",
|
Assert.assertFalse("File should not exist after deletion",
|
||||||
exists(fcView, new Path("/internalDir/linkToDir2/foo")));
|
exists(fcView, new Path("/internalDir/linkToDir2/foo")));
|
||||||
|
|
|
@ -510,7 +510,7 @@ public class TestCheckpoint {
|
||||||
secondary.shutdown(); // secondary namenode crash!
|
secondary.shutdown(); // secondary namenode crash!
|
||||||
|
|
||||||
// start new instance of secondary and verify that
|
// start new instance of secondary and verify that
|
||||||
// a new rollEditLog suceedes inspite of the fact that
|
// a new rollEditLog succeeds inspite of the fact that
|
||||||
// edits.new already exists.
|
// edits.new already exists.
|
||||||
//
|
//
|
||||||
secondary = startSecondaryNameNode(conf);
|
secondary = startSecondaryNameNode(conf);
|
||||||
|
|
|
@ -93,7 +93,7 @@ public class NNBenchWithoutMR {
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Create and write to a given number of files. Repeat each remote
|
* Create and write to a given number of files. Repeat each remote
|
||||||
* operation until is suceeds (does not throw an exception).
|
* operation until is succeeds (does not throw an exception).
|
||||||
*
|
*
|
||||||
* @return the number of exceptions caught
|
* @return the number of exceptions caught
|
||||||
*/
|
*/
|
||||||
|
@ -178,7 +178,7 @@ public class NNBenchWithoutMR {
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Rename a given number of files. Repeat each remote
|
* Rename a given number of files. Repeat each remote
|
||||||
* operation until is suceeds (does not throw an exception).
|
* operation until is succeeds (does not throw an exception).
|
||||||
*
|
*
|
||||||
* @return the number of exceptions caught
|
* @return the number of exceptions caught
|
||||||
*/
|
*/
|
||||||
|
@ -208,7 +208,7 @@ public class NNBenchWithoutMR {
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Delete a given number of files. Repeat each remote
|
* Delete a given number of files. Repeat each remote
|
||||||
* operation until is suceeds (does not throw an exception).
|
* operation until is succeeds (does not throw an exception).
|
||||||
*
|
*
|
||||||
* @return the number of exceptions caught
|
* @return the number of exceptions caught
|
||||||
*/
|
*/
|
||||||
|
|
|
@ -866,7 +866,7 @@ public class TestAlignedPlanner {
|
||||||
curAlloc.clear();
|
curAlloc.clear();
|
||||||
curAlloc.put(new ReservationInterval(9 * step, 10 * step),
|
curAlloc.put(new ReservationInterval(9 * step, 10 * step),
|
||||||
Resource.newInstance(1024, 1));
|
Resource.newInstance(1024, 1));
|
||||||
assertTrue("validateOrderNoFap() should have suceeded",
|
assertTrue("validateOrderNoFap() should have succeeded",
|
||||||
IterativePlanner.validateOrderNoGap(allocation, curAlloc, false));
|
IterativePlanner.validateOrderNoGap(allocation, curAlloc, false));
|
||||||
|
|
||||||
// 2. allocateLeft = false, fail when curAlloc has a gap
|
// 2. allocateLeft = false, fail when curAlloc has a gap
|
||||||
|
@ -888,7 +888,7 @@ public class TestAlignedPlanner {
|
||||||
curAlloc.clear();
|
curAlloc.clear();
|
||||||
curAlloc.put(new ReservationInterval(13 * step, 14 * step),
|
curAlloc.put(new ReservationInterval(13 * step, 14 * step),
|
||||||
Resource.newInstance(1024, 1));
|
Resource.newInstance(1024, 1));
|
||||||
assertTrue("validateOrderNoFap() should have suceeded",
|
assertTrue("validateOrderNoFap() should have succeeded",
|
||||||
IterativePlanner.validateOrderNoGap(allocation, curAlloc, true));
|
IterativePlanner.validateOrderNoGap(allocation, curAlloc, true));
|
||||||
|
|
||||||
// 5. allocateLeft = true, fail when there is a gap between curAlloc and
|
// 5. allocateLeft = true, fail when there is a gap between curAlloc and
|
||||||
|
|
Loading…
Reference in New Issue