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
|
|---|---|---|---|---|---|
5,834
|
NNThroughputBenchmark.java
|
// Operation types
| 0
|
// Operation types | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,835
|
NNThroughputBenchmark.java
|
// parse command line
| 0
|
// parse command line | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,836
|
NNThroughputBenchmark.java
|
* returns client name
| 0
|
* returns client name | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,837
|
NNThroughputBenchmark.java
|
* Do mkdirs operation.
| 0
|
* Do mkdirs operation. | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,838
|
NNThroughputBenchmark.java
|
Open file statistics.
*
* Measure how many open calls (getBlockLocations())
* the name-node can handle per second.
| 0
|
Open file statistics.
*
* Measure how many open calls (getBlockLocations())
* the name-node can handle per second. | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,839
|
NNThroughputBenchmark.java
|
Operation
| 0
|
Operation | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,840
|
NNThroughputBenchmark.java
|
// do not generate files, use existing ones
| 0
|
// do not generate files, use existing ones | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,841
|
NNThroughputBenchmark.java
|
// create files using opsPerThread
| 0
|
// create files using opsPerThread | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,842
|
NNThroughputBenchmark.java
|
// create files if they were not created before
| 0
|
// create files if they were not created before | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,843
|
NNThroughputBenchmark.java
|
// use the same files for open
| 0
|
// use the same files for open | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,844
|
NNThroughputBenchmark.java
|
* Do file open.
| 0
|
* Do file open. | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,845
|
NNThroughputBenchmark.java
|
Delete file statistics.
*
* Measure how many delete calls the name-node can handle per second.
| 0
|
Delete file statistics.
*
* Measure how many delete calls the name-node can handle per second. | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,846
|
NNThroughputBenchmark.java
|
Operation types
| 0
|
Operation types | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,847
|
NNThroughputBenchmark.java
|
List file status statistics.
*
* Measure how many get-file-status calls the name-node can handle per second.
| 0
|
List file status statistics.
*
* Measure how many get-file-status calls the name-node can handle per second. | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,848
|
NNThroughputBenchmark.java
|
Operation types
| 0
|
Operation types | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,849
|
NNThroughputBenchmark.java
|
Rename file statistics.
*
* Measure how many rename calls the name-node can handle per second.
| 0
|
Rename file statistics.
*
* Measure how many rename calls the name-node can handle per second. | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,850
|
NNThroughputBenchmark.java
|
Operation types
| 0
|
Operation types | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,851
|
NNThroughputBenchmark.java
|
Minimal data-node simulator.
| 0
|
Minimal data-node simulator. | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,852
|
NNThroughputBenchmark.java
|
//only one storage
| 0
|
//only one storage | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,853
|
NNThroughputBenchmark.java
|
// actual number of blocks
| 0
|
// actual number of blocks | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,854
|
NNThroughputBenchmark.java
|
// get versions from the namenode
| 0
|
// get versions from the namenode | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,855
|
NNThroughputBenchmark.java
|
// register datanode
| 0
|
// register datanode | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,856
|
NNThroughputBenchmark.java
|
//first block reports
| 0
|
//first block reports | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,857
|
NNThroughputBenchmark.java
|
Send a heartbeat to the name-node.
* Ignore reply commands.
| 0
|
Send a heartbeat to the name-node.
* Ignore reply commands. | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,858
|
NNThroughputBenchmark.java
|
// register datanode
| 0
|
// register datanode | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,859
|
NNThroughputBenchmark.java
|
// fill remaining slots with blocks that do not exist
| 0
|
// fill remaining slots with blocks that do not exist | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,860
|
NNThroughputBenchmark.java
|
* Send a heartbeat to the name-node and replicate blocks if requested.
| 0
|
* Send a heartbeat to the name-node and replicate blocks if requested. | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,861
|
NNThroughputBenchmark.java
|
// keep it for future blockReceived benchmark
| 0
|
// keep it for future blockReceived benchmark | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,862
|
NNThroughputBenchmark.java
|
// register datanode
| 0
|
// register datanode | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,863
|
NNThroughputBenchmark.java
|
// Send a copy of a block to another datanode
| 0
|
// Send a copy of a block to another datanode | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,864
|
NNThroughputBenchmark.java
|
Transfer blocks to another data-node.
* Just report on behalf of the other data-node
* that the blocks have been received.
| 0
|
Transfer blocks to another data-node.
* Just report on behalf of the other data-node
* that the blocks have been received. | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,865
|
NNThroughputBenchmark.java
|
Block report statistics.
*
* Each thread here represents its own data-node.
* Data-nodes send the same block report each time.
* The block report may contain missing or non-existing blocks.
| 0
|
Block report statistics.
*
* Each thread here represents its own data-node.
* Data-nodes send the same block report each time.
* The block report may contain missing or non-existing blocks. | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,866
|
NNThroughputBenchmark.java
|
// array of data-nodes sorted by name
| 0
|
// array of data-nodes sorted by name | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,867
|
NNThroughputBenchmark.java
|
// set heartbeat interval to 3 min, so that expiration were 40 min
| 0
|
// set heartbeat interval to 3 min, so that expiration were 40 min | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,868
|
NNThroughputBenchmark.java
|
// adjust replication to the number of data-nodes
| 0
|
// adjust replication to the number of data-nodes | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,869
|
NNThroughputBenchmark.java
|
// parse command line
| 0
|
// parse command line | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,870
|
NNThroughputBenchmark.java
|
// create data-nodes
| 0
|
// create data-nodes | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,871
|
NNThroughputBenchmark.java
|
// create files
| 0
|
// create files | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,872
|
NNThroughputBenchmark.java
|
// prepare block reports
| 0
|
// prepare block reports | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,873
|
NNThroughputBenchmark.java
|
// IBRs are asynchronously processed by NameNode. The next
// ClientProtocol#addBlock() may throw NotReplicatedYetException.
| 0
|
// IBRs are asynchronously processed by NameNode. The next
// ClientProtocol#addBlock() may throw NotReplicatedYetException. | NNThroughputBenchmark.java
|
[
0,
0,
0,
0,
0,
0,
1
] |
5,874
|
NNThroughputBenchmark.java
|
Retry ClientProtocol.addBlock() if it throws NotReplicatedYetException.
* Because addBlock() also commits the previous block,
* it fails if enough IBRs are not processed by NameNode.
*/
| 0
|
Retry ClientProtocol.addBlock() if it throws NotReplicatedYetException.
* Because addBlock() also commits the previous block,
* it fails if enough IBRs are not processed by NameNode.
*/ | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,875
|
NNThroughputBenchmark.java
|
* Does not require the argument
| 0
|
* Does not require the argument | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,876
|
NNThroughputBenchmark.java
|
Measures how fast replication monitor can compute data-node work.
*
* It runs only one thread until no more work can be scheduled.
| 0
|
Measures how fast replication monitor can compute data-node work.
*
* It runs only one thread until no more work can be scheduled. | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,877
|
NNThroughputBenchmark.java
|
// parse command line
| 0
|
// parse command line | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,878
|
NNThroughputBenchmark.java
|
// start data-nodes; create a bunch of files; generate block reports.
| 0
|
// start data-nodes; create a bunch of files; generate block reports. | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,879
|
NNThroughputBenchmark.java
|
// stop replication monitor
| 0
|
// stop replication monitor | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,880
|
NNThroughputBenchmark.java
|
// report blocks once
| 0
|
// report blocks once | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,881
|
NNThroughputBenchmark.java
|
// decommission data-nodes
| 0
|
// decommission data-nodes | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,882
|
NNThroughputBenchmark.java
|
// set node replication limit
| 0
|
// set node replication limit | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,883
|
NNThroughputBenchmark.java
|
Does not require the argument
| 0
|
Does not require the argument | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,884
|
NNThroughputBenchmark.java
|
// compute data-node work
| 0
|
// compute data-node work | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,885
|
NNThroughputBenchmark.java
|
@param aArgs command line parameters
| 0
|
@param aArgs command line parameters | NNThroughputBenchmark.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
5,886
|
NNThroughputBenchmark.java
|
Main method of the benchmark.
| 0
|
Main method of the benchmark. | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,887
|
NNThroughputBenchmark.java
|
// Start the NameNode
| 0
|
// Start the NameNode | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,888
|
NNThroughputBenchmark.java
|
// run each benchmark
| 0
|
// run each benchmark | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,889
|
NNThroughputBenchmark.java
|
// print statistics
| 0
|
// print statistics | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,890
|
NNThroughputBenchmark.java
|
// Configurable
| 0
|
// Configurable | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,891
|
NNThroughputBenchmark.java
|
// Configurable
| 0
|
// Configurable | NNThroughputBenchmark.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,892
|
NNThroughputBenchmark.java
|
@link Level#ERROR
| 0
|
@link Level#ERROR | NNThroughputBenchmark.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
5,893
|
NNThroughputBenchmark.java
|
@link NameNodeRpcServer#refreshUserToGroupsMappings
| 0
|
@link NameNodeRpcServer#refreshUserToGroupsMappings | NNThroughputBenchmark.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
5,894
|
NNThroughputBenchmark.java
|
@docRoot
| 0
|
@docRoot | NNThroughputBenchmark.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
5,895
|
JpaTestEntity.java
|
@author Dhanji R. Prasanna (dhanji@gmail.com)
| 0
|
@author Dhanji R. Prasanna (dhanji@gmail.com) | JpaTestEntity.java
|
[
0,
1,
0,
0,
0,
0,
0
] |
5,896
|
FairCallQueueMXBean.java
|
// Get the size of each subqueue, the index corresponding to the priority
// level.
| 0
|
// Get the size of each subqueue, the index corresponding to the priority
// level. | FairCallQueueMXBean.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,897
|
CompletionTest_SingleName_NoPrefix.java
|
Contributors:
* IBM Rational Software - Initial API and implementation
| 0
|
Contributors:
* IBM Rational Software - Initial API and implementation | CompletionTest_SingleName_NoPrefix.java
|
[
0,
1,
0,
0,
0,
0,
0
] |
5,898
|
CompletionTest_SingleName_NoPrefix.java
|
@author hamer
| 0
|
@author hamer | CompletionTest_SingleName_NoPrefix.java
|
[
0,
1,
0,
0,
0,
0,
0
] |
5,899
|
CompletionTest_SingleName_NoPrefix.java
|
Testing Single name reference, with prefix
| 0
|
Testing Single name reference, with prefix | CompletionTest_SingleName_NoPrefix.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,900
|
CompletionTest_SingleName_NoPrefix.java
|
// note: macros are omitted intentionally
| 0
|
// note: macros are omitted intentionally | CompletionTest_SingleName_NoPrefix.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,901
|
CompletionTest_SingleName_NoPrefix.java
|
@see org.eclipse.cdt.core.codeassist.tests.CompletionProposalsTest#getCompletionPosition()
| 0
|
@see org.eclipse.cdt.core.codeassist.tests.CompletionProposalsTest#getCompletionPosition() | CompletionTest_SingleName_NoPrefix.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
5,902
|
CompletionTest_SingleName_NoPrefix.java
|
* @see org.eclipse.cdt.core.codeassist.tests.CompletionProposalsTest#getExpectedPrefix()
| 0
|
* @see org.eclipse.cdt.core.codeassist.tests.CompletionProposalsTest#getExpectedPrefix() | CompletionTest_SingleName_NoPrefix.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
5,903
|
CompletionTest_SingleName_NoPrefix.java
|
* @see org.eclipse.cdt.core.codeassist.tests.CompletionProposalsTest#getExpectedResultsValues()
| 0
|
* @see org.eclipse.cdt.core.codeassist.tests.CompletionProposalsTest#getExpectedResultsValues() | CompletionTest_SingleName_NoPrefix.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
5,904
|
CompletionTest_SingleName_NoPrefix.java
|
* @see org.eclipse.cdt.core.codeassist.tests.CompletionProposalsTest#getFileName()
| 0
|
* @see org.eclipse.cdt.core.codeassist.tests.CompletionProposalsTest#getFileName() | CompletionTest_SingleName_NoPrefix.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
5,905
|
CompletionTest_SingleName_NoPrefix.java
|
* @see org.eclipse.cdt.core.codeassist.tests.CompletionProposalsTest#getFileFullPath()
| 0
|
* @see org.eclipse.cdt.core.codeassist.tests.CompletionProposalsTest#getFileFullPath() | CompletionTest_SingleName_NoPrefix.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
5,906
|
CompletionTest_SingleName_NoPrefix.java
|
* @see org.eclipse.cdt.core.codeassist.tests.CompletionProposalsTest#getHeaderFileFullPath()
| 0
|
* @see org.eclipse.cdt.core.codeassist.tests.CompletionProposalsTest#getHeaderFileFullPath() | CompletionTest_SingleName_NoPrefix.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
5,907
|
CompletionTest_SingleName_NoPrefix.java
|
* @see org.eclipse.cdt.core.codeassist.tests.CompletionProposalsTest#getHeaderFileName()
| 0
|
* @see org.eclipse.cdt.core.codeassist.tests.CompletionProposalsTest#getHeaderFileName() | CompletionTest_SingleName_NoPrefix.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
5,909
|
ArrayListMultimap_CustomFieldSerializer.java
|
@link ArrayListMultimap
| 0
|
@link ArrayListMultimap | ArrayListMultimap_CustomFieldSerializer.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
5,910
|
ArrayListMultimap_CustomFieldSerializer.java
|
This class implements the GWT serialization of {@link ArrayListMultimap}.
| 0
|
This class implements the GWT serialization of {@link ArrayListMultimap}. | ArrayListMultimap_CustomFieldSerializer.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,911
|
TestRollingFileSystemSinkWithSecureHdfs.java
|
@link RollingFileSystemSink
| 0
|
@link RollingFileSystemSink | TestRollingFileSystemSinkWithSecureHdfs.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
5,912
|
TestRollingFileSystemSinkWithSecureHdfs.java
|
Test the {@link RollingFileSystemSink} class in the context of HDFS with
* Kerberos enabled.
| 0
|
Test the {@link RollingFileSystemSink} class in the context of HDFS with
* Kerberos enabled. | TestRollingFileSystemSinkWithSecureHdfs.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,913
|
TestRollingFileSystemSinkWithSecureHdfs.java
|
Do a basic write test against an HDFS cluster with Kerberos enabled. We
* assume that if a basic write succeeds, more complex operations will also
* succeed.
| 0
|
Do a basic write test against an HDFS cluster with Kerberos enabled. We
* assume that if a basic write succeeds, more complex operations will also
* succeed. | TestRollingFileSystemSinkWithSecureHdfs.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,914
|
TestRollingFileSystemSinkWithSecureHdfs.java
|
Restore non-secure conf
| 0
|
Restore non-secure conf | TestRollingFileSystemSinkWithSecureHdfs.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,915
|
TestRollingFileSystemSinkWithSecureHdfs.java
|
Do a basic write test against an HDFS cluster with Kerberos enabled but
* without the principal and keytab properties set.
| 0
|
Do a basic write test against an HDFS cluster with Kerberos enabled but
* without the principal and keytab properties set. | TestRollingFileSystemSinkWithSecureHdfs.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,916
|
TestRollingFileSystemSinkWithSecureHdfs.java
|
// Restore non-secure conf
| 0
|
// Restore non-secure conf | TestRollingFileSystemSinkWithSecureHdfs.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,917
|
TestRollingFileSystemSinkWithSecureHdfs.java
|
Create the /tmp directory as <i>hdfs</i> and /tmp/test as <i>sink</i> and
* return the UGI for <i>sink</i>.
| 0
|
Create the /tmp directory as <i>hdfs</i> and /tmp/test as <i>sink</i> and
* return the UGI for <i>sink</i>. | TestRollingFileSystemSinkWithSecureHdfs.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,918
|
TestRollingFileSystemSinkWithSecureHdfs.java
|
* Setup the KDC for testing a secure HDFS cluster
| 0
|
* Setup the KDC for testing a secure HDFS cluster | TestRollingFileSystemSinkWithSecureHdfs.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,919
|
TestRollingFileSystemSinkWithSecureHdfs.java
|
* Stop the mini-KDC.
| 0
|
* Stop the mini-KDC. | TestRollingFileSystemSinkWithSecureHdfs.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,920
|
TestRollingFileSystemSinkWithSecureHdfs.java
|
* Creates a configuration for starting a secure cluster.
| 0
|
* Creates a configuration for starting a secure cluster. | TestRollingFileSystemSinkWithSecureHdfs.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,921
|
TestRollingFileSystemSinkWithSecureHdfs.java
|
* @param cluster the mini-cluster
| 0
|
* @param cluster the mini-cluster | TestRollingFileSystemSinkWithSecureHdfs.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
5,922
|
TestRollingFileSystemSinkWithSecureHdfs.java
|
* @return the UGI for <i>sink</i>
| 0
|
* @return the UGI for <i>sink</i> | TestRollingFileSystemSinkWithSecureHdfs.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
5,923
|
TestRollingFileSystemSinkWithSecureHdfs.java
|
* @param dataTransferProtection supported QOPs
| 0
|
* @param dataTransferProtection supported QOPs | TestRollingFileSystemSinkWithSecureHdfs.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
5,924
|
TestRollingFileSystemSinkWithSecureHdfs.java
|
* @return configuration for starting a secure cluster
| 0
|
* @return configuration for starting a secure cluster | TestRollingFileSystemSinkWithSecureHdfs.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
5,925
|
RmController.java
|
Do NOT rename/refactor this to RMView as it will wreak havoc
// on Mac OS HFS as its case-insensitive!
| 0
|
Do NOT rename/refactor this to RMView as it will wreak havoc
// on Mac OS HFS as its case-insensitive! | RmController.java
|
[
0,
0,
0,
0,
0,
0,
1
] |
5,926
|
RmController.java
|
// limit applications to those in states relevant to scheduling
| 0
|
// limit applications to those in states relevant to scheduling | RmController.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,927
|
GridStateTest.java
|
* Tests for Grid State.
| 0
|
* Tests for Grid State. | GridStateTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,928
|
TableHeightWhenHidingHeaders.java
|
Setting table height and setting column header mode as hidden leaves the body
* height of the table as it would be with the headers visible and leaves an
* empty area below the body.
| 0
|
Setting table height and setting column header mode as hidden leaves the body
* height of the table as it would be with the headers visible and leaves an
* empty area below the body. | TableHeightWhenHidingHeaders.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,929
|
TableHeightWhenHidingHeaders.java
|
// table body height is now 77px, which together
// with header makes 100px
| 0
|
// table body height is now 77px, which together
// with header makes 100px | TableHeightWhenHidingHeaders.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,930
|
TableHeightWhenHidingHeaders.java
|
// header disappears, but table body height stays at
// 77px
// and below the body is an empty area (same height
// as header would
// have)
| 0
|
// header disappears, but table body height stays at
// 77px
// and below the body is an empty area (same height
// as header would
// have) | TableHeightWhenHidingHeaders.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,931
|
CheckpointNamingService.java
|
* This class represent a naming service for checkpoints.
| 0
|
* This class represent a naming service for checkpoints. | CheckpointNamingService.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,932
|
CheckpointNamingService.java
|
* Generate a new checkpoint Name
| 0
|
* Generate a new checkpoint Name | CheckpointNamingService.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,933
|
CheckpointNamingService.java
|
* @return the checkpoint name
| 0
|
* @return the checkpoint name | CheckpointNamingService.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
5,934
|
JSONHistoryViewerPrinter.java
|
@link HistoryViewer
| 0
|
@link HistoryViewer | JSONHistoryViewerPrinter.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.