index
int64 0
10.7k
| class
stringclasses 867
values | comment_sentence
stringlengths 1
1.78k
| partition
int64 0
0
| combo
stringlengths 17
1.81k
| labels
listlengths 7
7
|
|---|---|---|---|---|---|
10,641
|
SnapshotException.java
|
/** Snapshot related exception. */
| 0
|
/** Snapshot related exception. */ | SnapshotException.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
10,642
|
TestProcessCorruptBlocks.java
|
/**
* The corrupt block has to be removed when the number of valid replicas
* matches replication factor for the file. In this the above condition is
* tested by reducing the replication factor
* The test strategy :
* Bring up Cluster with 3 DataNodes
* Create a file of replication factor 3
* Corrupt one replica of a block of the file
* Verify that there are still 2 good replicas and 1 corrupt replica
* (corrupt replica should not be removed since number of good
* replicas (2) is less than replication factor (3))
* Set the replication factor to 2
* Verify that the corrupt replica is removed.
* (corrupt replica should not be removed since number of good
* replicas (2) is equal to replication factor (2))
*/
| 0
|
/**
* The corrupt block has to be removed when the number of valid replicas
* matches replication factor for the file. In this the above condition is
* tested by reducing the replication factor
* The test strategy :
* Bring up Cluster with 3 DataNodes
* Create a file of replication factor 3
* Corrupt one replica of a block of the file
* Verify that there are still 2 good replicas and 1 corrupt replica
* (corrupt replica should not be removed since number of good
* replicas (2) is less than replication factor (3))
* Set the replication factor to 2
* Verify that the corrupt replica is removed.
* (corrupt replica should not be removed since number of good
* replicas (2) is equal to replication factor (2))
*/ | TestProcessCorruptBlocks.java
|
[
0,
0,
1,
0,
0,
0,
0
] |
10,643
|
TestProcessCorruptBlocks.java
|
/**
* The corrupt block has to be removed when the number of valid replicas
* matches replication factor for the file. In this test, the above
* condition is achieved by increasing the number of good replicas by
* replicating on a new Datanode.
* The test strategy :
* Bring up Cluster with 3 DataNodes
* Create a file of replication factor 3
* Corrupt one replica of a block of the file
* Verify that there are still 2 good replicas and 1 corrupt replica
* (corrupt replica should not be removed since number of good replicas
* (2) is less than replication factor (3))
* Start a new data node
* Verify that the a new replica is created and corrupt replica is
* removed.
*
*/
| 0
|
/**
* The corrupt block has to be removed when the number of valid replicas
* matches replication factor for the file. In this test, the above
* condition is achieved by increasing the number of good replicas by
* replicating on a new Datanode.
* The test strategy :
* Bring up Cluster with 3 DataNodes
* Create a file of replication factor 3
* Corrupt one replica of a block of the file
* Verify that there are still 2 good replicas and 1 corrupt replica
* (corrupt replica should not be removed since number of good replicas
* (2) is less than replication factor (3))
* Start a new data node
* Verify that the a new replica is created and corrupt replica is
* removed.
*
*/ | TestProcessCorruptBlocks.java
|
[
0,
0,
1,
0,
0,
0,
0
] |
10,644
|
TestProcessCorruptBlocks.java
|
/**
* The corrupt block has to be removed when the number of valid replicas
* matches replication factor for the file. The above condition should hold
* true as long as there is one good replica. This test verifies that.
*
* The test strategy :
* Bring up Cluster with 2 DataNodes
* Create a file of replication factor 2
* Corrupt one replica of a block of the file
* Verify that there is one good replicas and 1 corrupt replica
* (corrupt replica should not be removed since number of good
* replicas (1) is less than replication factor (2)).
* Set the replication factor to 1
* Verify that the corrupt replica is removed.
* (corrupt replica should be removed since number of good
* replicas (1) is equal to replication factor (1))
*/
| 0
|
/**
* The corrupt block has to be removed when the number of valid replicas
* matches replication factor for the file. The above condition should hold
* true as long as there is one good replica. This test verifies that.
*
* The test strategy :
* Bring up Cluster with 2 DataNodes
* Create a file of replication factor 2
* Corrupt one replica of a block of the file
* Verify that there is one good replicas and 1 corrupt replica
* (corrupt replica should not be removed since number of good
* replicas (1) is less than replication factor (2)).
* Set the replication factor to 1
* Verify that the corrupt replica is removed.
* (corrupt replica should be removed since number of good
* replicas (1) is equal to replication factor (1))
*/ | TestProcessCorruptBlocks.java
|
[
0,
0,
1,
0,
0,
0,
0
] |
10,645
|
TestProcessCorruptBlocks.java
|
/**
* None of the blocks can be removed if all blocks are corrupt.
*
* The test strategy :
* Bring up Cluster with 3 DataNodes
* Create a file of replication factor 3
* Corrupt all three replicas
* Verify that all replicas are corrupt and 3 replicas are present.
* Set the replication factor to 1
* Verify that all replicas are corrupt and 3 replicas are present.
*/
| 0
|
/**
* None of the blocks can be removed if all blocks are corrupt.
*
* The test strategy :
* Bring up Cluster with 3 DataNodes
* Create a file of replication factor 3
* Corrupt all three replicas
* Verify that all replicas are corrupt and 3 replicas are present.
* Set the replication factor to 1
* Verify that all replicas are corrupt and 3 replicas are present.
*/ | TestProcessCorruptBlocks.java
|
[
0,
0,
1,
0,
0,
0,
0
] |
10,646
|
TestProcessCorruptBlocks.java
|
// Truncate the block on the first datanode that has not been corrupted,
// so that directory scanner can discover the corruption from file size
// change.
// the indexes change once the nodes are restarted.
// But the datadirectory will not change
| 0
|
// Truncate the block on the first datanode that has not been corrupted,
// so that directory scanner can discover the corruption from file size
// change.
// the indexes change once the nodes are restarted.
// But the datadirectory will not change | TestProcessCorruptBlocks.java
|
[
0,
0,
1,
0,
0,
0,
0
] |
10,647
|
TestProcessCorruptBlocks.java
|
// restart the detained so the corrupt replica will be detected
| 0
|
// restart the detained so the corrupt replica will be detected | TestProcessCorruptBlocks.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
10,648
|
TestProcessCorruptBlocks.java
|
// wait for one minute for deletion to succeed;
| 0
|
// wait for one minute for deletion to succeed; | TestProcessCorruptBlocks.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
10,649
|
TestProcessCorruptBlocks.java
|
// Each datanode has multiple data dirs, check each
| 0
|
// Each datanode has multiple data dirs, check each | TestProcessCorruptBlocks.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
10,650
|
TestProcessCorruptBlocks.java
|
// Run directory scanner to update the DN's volume map
| 0
|
// Run directory scanner to update the DN's volume map | TestProcessCorruptBlocks.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
10,651
|
TestProcessCorruptBlocks.java
|
// wait for 3 seconds so that all block reports are processed.
| 0
|
// wait for 3 seconds so that all block reports are processed. | TestProcessCorruptBlocks.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
10,652
|
TestProcessCorruptBlocks.java
|
// wait for 3 seconds so that all block reports are processed.
| 0
|
// wait for 3 seconds so that all block reports are processed. | TestProcessCorruptBlocks.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
10,653
|
TestProcessCorruptBlocks.java
|
// wait for 3 seconds so that all block reports are processed.
| 0
|
// wait for 3 seconds so that all block reports are processed. | TestProcessCorruptBlocks.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
10,654
|
TestProcessCorruptBlocks.java
|
// wait for 3 seconds so that all block reports are processed.
| 0
|
// wait for 3 seconds so that all block reports are processed. | TestProcessCorruptBlocks.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.