index int64 1 10.7k | class stringclasses 782 values | comment_sentence stringlengths 1 1.78k | partition int64 0 0 | combo stringlengths 17 1.81k | labels listlengths 7 7 |
|---|---|---|---|---|---|
5,037 | ScopedBindingBuilder.java | @link com.google.inject.Binder | 0 | @link com.google.inject.Binder | ScopedBindingBuilder.java | [
0,
0,
0,
0,
1,
0,
0
] |
5,038 | ScopedBindingBuilder.java | @link com.google.inject.Injector | 0 | @link com.google.inject.Injector | ScopedBindingBuilder.java | [
0,
0,
0,
0,
1,
0,
0
] |
5,039 | ScopedBindingBuilder.java | @link com.google.inject.Binder | 0 | @link com.google.inject.Binder | ScopedBindingBuilder.java | [
0,
0,
0,
0,
1,
0,
0
] |
5,040 | ScopedBindingBuilder.java | @author crazybob@google.com (Bob Lee) | 0 | @author crazybob@google.com (Bob Lee) | ScopedBindingBuilder.java | [
0,
1,
0,
0,
0,
0,
0
] |
5,041 | ScopedBindingBuilder.java | See the EDSL examples at {@link com.google.inject.Binder}. | 0 | See the EDSL examples at {@link com.google.inject.Binder}. | ScopedBindingBuilder.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,043 | ScopedBindingBuilder.java | * See the EDSL examples at {@link com.google.inject.Binder}. | 0 | * See the EDSL examples at {@link com.google.inject.Binder}. | ScopedBindingBuilder.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,044 | ScopedBindingBuilder.java | Instructs the {@link com.google.inject.Injector} to eagerly initialize this
* singleton-scoped binding upon creation. Useful for application
* initialization logic. See the EDSL examples at | 0 | Instructs the {@link com.google.inject.Injector} to eagerly initialize this
* singleton-scoped binding upon creation. Useful for application
* initialization logic. See the EDSL examples at | ScopedBindingBuilder.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,045 | PreselectedTreeVisible.java | // Removing this line causes the tree to show normally in Firefox | 0 | // Removing this line causes the tree to show normally in Firefox | PreselectedTreeVisible.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,047 | AbstractRequestInterceptor.java | @link Configuration | 0 | @link Configuration | AbstractRequestInterceptor.java | [
0,
0,
0,
0,
1,
0,
0
] |
5,049 | AbstractRequestInterceptor.java | @link RequestInterceptor | 0 | @link RequestInterceptor | AbstractRequestInterceptor.java | [
0,
0,
0,
0,
1,
0,
0
] |
5,050 | AbstractRequestInterceptor.java | @link RequestInterceptor | 0 | @link RequestInterceptor | AbstractRequestInterceptor.java | [
0,
0,
0,
0,
1,
0,
0
] |
5,051 | AbstractRequestInterceptor.java | @link RequestInterceptor | 0 | @link RequestInterceptor | AbstractRequestInterceptor.java | [
0,
0,
0,
0,
1,
0,
0
] |
5,053 | AbstractRequestInterceptor.java | * @return Distributed Scheduler Register Response | 0 | * @return Distributed Scheduler Register Response | AbstractRequestInterceptor.java | [
0,
0,
0,
1,
0,
0,
0
] |
5,054 | AbstractRequestInterceptor.java | * @param request ApplicationMaster registration request | 0 | * @param request ApplicationMaster registration request | AbstractRequestInterceptor.java | [
0,
0,
0,
1,
0,
0,
0
] |
5,055 | AbstractRequestInterceptor.java | * @return Distribtued Scheduler Allocate Response | 0 | * @return Distribtued Scheduler Allocate Response | AbstractRequestInterceptor.java | [
0,
0,
0,
1,
0,
0,
0
] |
5,056 | AbstractRequestInterceptor.java | * @param request ApplicationMaster allocate request | 0 | * @param request ApplicationMaster allocate request | AbstractRequestInterceptor.java | [
0,
0,
0,
1,
0,
0,
0
] |
5,058 | AbstractRequestInterceptor.java | * Sets the {@link RequestInterceptor} in the chain. | 0 | * Sets the {@link RequestInterceptor} in the chain. | AbstractRequestInterceptor.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,059 | AbstractRequestInterceptor.java | * Sets the {@link Configuration}. | 0 | * Sets the {@link Configuration}. | AbstractRequestInterceptor.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,061 | AbstractRequestInterceptor.java | * Initializes the {@link RequestInterceptor}. | 0 | * Initializes the {@link RequestInterceptor}. | AbstractRequestInterceptor.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,062 | AbstractRequestInterceptor.java | * Disposes the {@link RequestInterceptor}. | 0 | * Disposes the {@link RequestInterceptor}. | AbstractRequestInterceptor.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,063 | AbstractRequestInterceptor.java | * Gets the next {@link RequestInterceptor} in the chain. | 0 | * Gets the next {@link RequestInterceptor} in the chain. | AbstractRequestInterceptor.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,064 | AbstractRequestInterceptor.java | * Default implementation that invokes the distributed scheduling version
* of the register method. | 0 | * Default implementation that invokes the distributed scheduling version
* of the register method. | AbstractRequestInterceptor.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,065 | AbstractRequestInterceptor.java | Default implementation that invokes the distributed scheduling version
* of the allocate method. | 0 | Default implementation that invokes the distributed scheduling version
* of the allocate method. | AbstractRequestInterceptor.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,066 | DynamicBloomFilter.java | * Adds a new row to <i>this</i> dynamic Bloom filter. | 0 | * Adds a new row to <i>this</i> dynamic Bloom filter. | DynamicBloomFilter.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,067 | DynamicBloomFilter.java | * Returns the active standard Bloom filter in <i>this</i> dynamic Bloom filter. | 0 | * Returns the active standard Bloom filter in <i>this</i> dynamic Bloom filter. | DynamicBloomFilter.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,069 | DynamicBloomFilter.java | // Writable | 0 | // Writable | DynamicBloomFilter.java | [
0,
0,
0,
1,
0,
0,
0
] |
5,070 | DynamicBloomFilter.java | @param nr The threshold for the maximum number of keys to record in a
* dynamic Bloom filter row. | 0 | @param nr The threshold for the maximum number of keys to record in a
* dynamic Bloom filter row. | DynamicBloomFilter.java | [
0,
0,
0,
1,
0,
0,
0
] |
5,071 | DynamicBloomFilter.java | @param hashType type of the hashing function (see
* {@link org.apache.hadoop.util.hash.Hash}). | 0 | @param hashType type of the hashing function (see
* {@link org.apache.hadoop.util.hash.Hash}). | DynamicBloomFilter.java | [
0,
0,
0,
1,
0,
0,
0
] |
5,074 | DynamicBloomFilter.java | @link org.apache.hadoop.util.hash.Hash} | 0 | @link org.apache.hadoop.util.hash.Hash} | DynamicBloomFilter.java | [
0,
0,
0,
0,
1,
0,
0
] |
5,075 | DynamicBloomFilter.java | Constructor.
* <p>
* Builds an empty Dynamic Bloom filter. | 0 | Constructor.
* <p>
* Builds an empty Dynamic Bloom filter. | DynamicBloomFilter.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,076 | DynamicBloomFilter.java | Zero-args constructor for the serialization. | 0 | Zero-args constructor for the serialization. | DynamicBloomFilter.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,077 | DynamicBloomFilter.java | The matrix of Bloom filter. | 0 | The matrix of Bloom filter. | DynamicBloomFilter.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,078 | DynamicBloomFilter.java | * The number of keys recorded in the current standard active Bloom filter. | 0 | * The number of keys recorded in the current standard active Bloom filter. | DynamicBloomFilter.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,080 | DynamicBloomFilter.java | Implements a <i>dynamic Bloom filter</i>, as defined in the INFOCOM 2006 paper.
* <p>
* A dynamic Bloom filter (DBF) makes use of a <code>s * m</code> bit matrix but
* each of the <code>s</code> rows is a standard Bloom filter. The creation
* process of a DBF is iterative. At the start, the DBF is a <code>1 * m</code>
* bit matrix, i.e., it is composed of a single standard Bloom filter.
* It assumes that <code>n<sub>r</sub></code> elements are recorded in the
* initial bit vector, where <code>n<sub>r</sub> <= n</code> (<code>n</code> is
* the cardinality of the set <code>A</code> to record in the filter).
* <p>
* As the size of <code>A</code> grows during the execution of the application,
* several keys must be inserted in the DBF. When inserting a key into the DBF,
* one must first get an active Bloom filter in the matrix. A Bloom filter is
* active when the number of recorded keys, <code>n<sub>r</sub></code>, is
* strictly less than the current cardinality of <code>A</code>, <code>n</code>.
* If an active Bloom filter is found, the key is inserted and
* <code>n<sub>r</sub></code> is incremented by one. On the other hand, if there
* is no active Bloom filter, a new one is created (i.e., a new row is added to
* the matrix) according to the current size of <code>A</code> and the element
* is added in this new Bloom filter and the <code>n<sub>r</sub></code> value of
* this new Bloom filter is set to one. A given key is said to belong to the
* DBF if the <code>k</code> positions are set to one in one of the matrix rows.
* <p>
* Originally created by
* <a href="http://www.one-lab.org">European Commission One-Lab Project 034819</a>. | 0 | Implements a <i>dynamic Bloom filter</i>, as defined in the INFOCOM 2006 paper.
* <p>
* A dynamic Bloom filter (DBF) makes use of a <code>s * m</code> bit matrix but
* each of the <code>s</code> rows is a standard Bloom filter. The creation
* process of a DBF is iterative. At the start, the DBF is a <code>1 * m</code>
* bit matrix, i.e., it is composed of a single standard Bloom filter.
* It assumes that <code>n<sub>r</sub></code> elements are recorded in the
* initial bit vector, where <code>n<sub>r</sub> <= n</code> (<code>n</code> is
* the cardinality of the set <code>A</code> to record in the filter).
* <p>
* As the size of <code>A</code> grows during the execution of the application,
* several keys must be inserted in the DBF. When inserting a key into the DBF,
* one must first get an active Bloom filter in the matrix. A Bloom filter is
* active when the number of recorded keys, <code>n<sub>r</sub></code>, is
* strictly less than the current cardinality of <code>A</code>, <code>n</code>.
* If an active Bloom filter is found, the key is inserted and
* <code>n<sub>r</sub></code> is incremented by one. On the other hand, if there
* is no active Bloom filter, a new one is created (i.e., a new row is added to
* the matrix) according to the current size of <code>A</code> and the element
* is added in this new Bloom filter and the <code>n<sub>r</sub></code> value of
* this new Bloom filter is set to one. A given key is said to belong to the
* DBF if the <code>k</code> positions are set to one in one of the matrix rows.
* <p>
* Originally created by
* <a href="http://www.one-lab.org">European Commission One-Lab Project 034819</a>. | DynamicBloomFilter.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,081 | DynamicBloomFilter.java | * @see Filter The general behavior of a filter | 0 | * @see Filter The general behavior of a filter | DynamicBloomFilter.java | [
0,
0,
0,
0,
1,
0,
0
] |
5,082 | DynamicBloomFilter.java | * @see BloomFilter A Bloom filter | 0 | * @see BloomFilter A Bloom filter | DynamicBloomFilter.java | [
0,
0,
0,
0,
1,
0,
0
] |
5,084 | TestBlobTypeSpeedDifference.java | A simple benchmark to find out the difference in speed between block
* and page blobs. | 0 | A simple benchmark to find out the difference in speed between block
* and page blobs. | TestBlobTypeSpeedDifference.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,085 | TestBlobTypeSpeedDifference.java | Writes data to the given stream of the given size, flushing every
* x bytes. | 0 | Writes data to the given stream of the given size, flushing every
* x bytes. | TestBlobTypeSpeedDifference.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,086 | TestBlobTypeSpeedDifference.java | Writes data to the given file of the given size, flushing every
* x bytes. Measure performance of that and return it. | 0 | Writes data to the given file of the given size, flushing every
* x bytes. Measure performance of that and return it. | TestBlobTypeSpeedDifference.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,087 | TestBlobTypeSpeedDifference.java | Writes data to a block blob of the given size, flushing every
* x bytes. Measure performance of that and return it. | 0 | Writes data to a block blob of the given size, flushing every
* x bytes. Measure performance of that and return it. | TestBlobTypeSpeedDifference.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,088 | TestBlobTypeSpeedDifference.java | Writes data to a page blob of the given size, flushing every
* x bytes. Measure performance of that and return it. | 0 | Writes data to a page blob of the given size, flushing every
* x bytes. Measure performance of that and return it. | TestBlobTypeSpeedDifference.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,089 | TestBlobTypeSpeedDifference.java | Runs the benchmark over a small 10 KB file, flushing every 500 bytes. | 0 | Runs the benchmark over a small 10 KB file, flushing every 500 bytes. | TestBlobTypeSpeedDifference.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,090 | TestBlobTypeSpeedDifference.java | Runs the benchmark for the given file size and flush frequency. | 0 | Runs the benchmark for the given file size and flush frequency. | TestBlobTypeSpeedDifference.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,091 | TestBlobTypeSpeedDifference.java | Runs the benchmark for the given file size and flush frequency from the
* command line. | 0 | Runs the benchmark for the given file size and flush frequency from the
* command line. | TestBlobTypeSpeedDifference.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,093 | TestHarFileSystemBasics.java | // ok, expected. | 0 | // ok, expected. | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,094 | TestHarFileSystemBasics.java | // ok, expected. | 0 | // ok, expected. | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,097 | TestHarFileSystemBasics.java | // ok, expected. | 0 | // ok, expected. | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,098 | TestHarFileSystemBasics.java | // ok, expected. | 0 | // ok, expected. | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,101 | TestHarFileSystemBasics.java | // all the modification methods of HarFS must lead to IOE. | 0 | // all the modification methods of HarFS must lead to IOE. | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,102 | TestHarFileSystemBasics.java | // ok, expected. | 0 | // ok, expected. | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,103 | TestHarFileSystemBasics.java | // the metadata should *not* be reused from cache: | 0 | // the metadata should *not* be reused from cache: | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,104 | TestHarFileSystemBasics.java | // init the Har: | 0 | // init the Har: | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,105 | TestHarFileSystemBasics.java | // write an unsupported version: | 0 | // write an unsupported version: | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,108 | TestHarFileSystemBasics.java | // ok, expected. | 0 | // ok, expected. | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,110 | TestHarFileSystemBasics.java | // delete the index file: | 0 | // delete the index file: | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,111 | TestHarFileSystemBasics.java | // Construct a valid har file system path with authority that
// contains userinfo and port. The userinfo and port are useless
// in local fs uri. They are only used to verify har file system
// can correctly preserve the information for the underlying file system. | 0 | // Construct a valid har file system path with authority that
// contains userinfo and port. The userinfo and port are useless
// in local fs uri. They are only used to verify har file system
// can correctly preserve the information for the underlying file system. | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,114 | TestHarFileSystemBasics.java | / re-initialize the har file system with host name
// make sure the qualified path name does not append ":" at the end of host name | 0 | / re-initialize the har file system with host name
// make sure the qualified path name does not append ":" at the end of host name | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,115 | TestHarFileSystemBasics.java | // Init HarFS with no constructor arg, so that the underlying FS object
// is created on demand or got from cache in #initialize() method. | 0 | // Init HarFS with no constructor arg, so that the underlying FS object
// is created on demand or got from cache in #initialize() method. | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,119 | TestHarFileSystemBasics.java | // Init 2nd har file system on the same underlying FS, so the
// metadata gets reused: | 0 | // Init 2nd har file system on the same underlying FS, so the
// metadata gets reused: | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,120 | TestHarFileSystemBasics.java | // the metadata should be reused from cache: | 0 | // the metadata should be reused from cache: | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,121 | TestHarFileSystemBasics.java | // Init 2nd har file system on the same underlying FS, so the
// metadata gets reused: | 0 | // Init 2nd har file system on the same underlying FS, so the
// metadata gets reused: | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,122 | TestHarFileSystemBasics.java | // check that its impossible to reset the working directory
// (#setWorkingDirectory should have no effect): | 0 | // check that its impossible to reset the working directory
// (#setWorkingDirectory should have no effect): | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,124 | TestHarFileSystemBasics.java | // check Har home path: | 0 | // check Har home path: | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,125 | TestHarFileSystemBasics.java | // check Har URI: | 0 | // check Har URI: | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,126 | TestHarFileSystemBasics.java | // check Har version: | 0 | // check Har version: | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,128 | TestHarFileSystemBasics.java | // close Har FS: | 0 | // close Har FS: | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,131 | TestHarFileSystemBasics.java | * creates and returns fully initialized HarFileSystem | 0 | * creates and returns fully initialized HarFileSystem | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,132 | TestHarFileSystemBasics.java | // NB: .har suffix is necessary | 0 | // NB: .har suffix is necessary | TestHarFileSystemBasics.java | [
0,
0,
0,
1,
0,
0,
0
] |
5,133 | TestHarFileSystemBasics.java | // Strip drive specifier on Windows, which would make the HAR URI invalid and
// cause tests to fail. | 0 | // Strip drive specifier on Windows, which would make the HAR URI invalid and
// cause tests to fail. | TestHarFileSystemBasics.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,136 | GridInlineDataDeclarativeTest.java | // No headers read or written | 0 | // No headers read or written | GridInlineDataDeclarativeTest.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,138 | GridInlineDataDeclarativeTest.java | // Remove default header | 0 | // Remove default header | GridInlineDataDeclarativeTest.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,139 | GridInlineDataDeclarativeTest.java | // Remove default header | 0 | // Remove default header | GridInlineDataDeclarativeTest.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,140 | GridInlineDataDeclarativeTest.java | // No headers read or written | 0 | // No headers read or written | GridInlineDataDeclarativeTest.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,141 | GridInlineDataDeclarativeTest.java | // No headers read or written | 0 | // No headers read or written | GridInlineDataDeclarativeTest.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,143 | HeartbeatResponse.java | @link DatanodeProtocol#sendHeartbeat | 0 | @link DatanodeProtocol#sendHeartbeat | HeartbeatResponse.java | [
0,
0,
0,
0,
1,
0,
0
] |
5,144 | HeartbeatResponse.java | Response to {@link DatanodeProtocol#sendHeartbeat} | 0 | Response to {@link DatanodeProtocol#sendHeartbeat} | HeartbeatResponse.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,145 | HeartbeatResponse.java | /** Commands returned from the namenode to the datanode */ | 0 | /** Commands returned from the namenode to the datanode */ | HeartbeatResponse.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,146 | HeartbeatResponse.java | /** Information about the current HA-related state of the NN */ | 0 | /** Information about the current HA-related state of the NN */ | HeartbeatResponse.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,147 | InvalidQueueNameException.java | * Thrown when Queue Name is malformed. | 0 | * Thrown when Queue Name is malformed. | InvalidQueueNameException.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,148 | IStatusChangeListener.java | Contributors:
* IBM Corporation - initial API and implementation
* QNX Software System | 0 | Contributors:
* IBM Corporation - initial API and implementation
* QNX Software System | IStatusChangeListener.java | [
0,
1,
0,
0,
0,
0,
0
] |
5,153 | TestRMWebServicesDelegationTokenAuthentication.java | // Test that you can authenticate with only delegation tokens
// 1. Get a delegation token using Kerberos auth(this ends up
// testing the fallback authenticator)
// 2. Submit an app without kerberos or delegation-token
// - we should get an UNAUTHORIZED response
// 3. Submit same app with delegation-token
// - we should get OK response
// - confirm owner of the app is the user whose
// delegation-token we used | 0 | // Test that you can authenticate with only delegation tokens
// 1. Get a delegation token using Kerberos auth(this ends up
// testing the fallback authenticator)
// 2. Submit an app without kerberos or delegation-token
// - we should get an UNAUTHORIZED response
// 3. Submit same app with delegation-token
// - we should get OK response
// - confirm owner of the app is the user whose
// delegation-token we used | TestRMWebServicesDelegationTokenAuthentication.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,154 | TestRMWebServicesDelegationTokenAuthentication.java | // this should fail with unauthorized because only
// auth is kerberos or delegation token | 0 | // this should fail with unauthorized because only
// auth is kerberos or delegation token | TestRMWebServicesDelegationTokenAuthentication.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,155 | TestRMWebServicesDelegationTokenAuthentication.java | // this should not fail | 0 | // this should not fail | TestRMWebServicesDelegationTokenAuthentication.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,156 | TestRMWebServicesDelegationTokenAuthentication.java | // Test to make sure that cancelled delegation tokens
// are rejected | 0 | // Test to make sure that cancelled delegation tokens
// are rejected | TestRMWebServicesDelegationTokenAuthentication.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,157 | TestRMWebServicesDelegationTokenAuthentication.java | // this should fail with unauthorized because only
// auth is kerberos or delegation token | 0 | // this should fail with unauthorized because only
// auth is kerberos or delegation token | TestRMWebServicesDelegationTokenAuthentication.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,159 | TestRMWebServicesDelegationTokenAuthentication.java | // first test create and renew | 0 | // first test create and renew | TestRMWebServicesDelegationTokenAuthentication.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,160 | TestRMWebServicesDelegationTokenAuthentication.java | // test cancel | 0 | // test cancel | TestRMWebServicesDelegationTokenAuthentication.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,161 | TestRMWebServicesDelegationTokenAuthentication.java | // Superuser "client" should be able to get a delegation token
// for user "client2" when authenticated using Kerberos
// The request shouldn't work when authenticated using DelegationTokens | 0 | // Superuser "client" should be able to get a delegation token
// for user "client2" when authenticated using Kerberos
// The request shouldn't work when authenticated using DelegationTokens | TestRMWebServicesDelegationTokenAuthentication.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,163 | TestRMWebServicesDelegationTokenAuthentication.java | // this should also fail due to client2 not being a super user | 0 | // this should also fail due to client2 not being a super user | TestRMWebServicesDelegationTokenAuthentication.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,164 | Suite_Remote_7_8.java | Contributors:
* Marc Khouzam (Ericsson) - Initial implementation of Test cases
* Alvaro Sanchez-Leon (Ericsson) - Bug 437562 - Split the dsf-gdb tests to a plug-in and fragment pair
* Jonah Graham (Kichwa Coders) - Bug 469007 - Add MIExpressionsNonStopTest_7_8 to suite
* Jonah Graham (Kichwa Coders) - Add support for gdb's "set substitute-path" (Bug 472765) | 0 | Contributors:
* Marc Khouzam (Ericsson) - Initial implementation of Test cases
* Alvaro Sanchez-Leon (Ericsson) - Bug 437562 - Split the dsf-gdb tests to a plug-in and fragment pair
* Jonah Graham (Kichwa Coders) - Bug 469007 - Add MIExpressionsNonStopTest_7_8 to suite
* Jonah Graham (Kichwa Coders) - Add support for gdb's "set substitute-path" (Bug 472765) | Suite_Remote_7_8.java | [
0,
1,
0,
0,
0,
0,
0
] |
5,165 | Suite_Remote_7_8.java | This class is meant to be empty. It enables us to define
* the annotations which list all the different JUnit class we
* want to run. When creating a new test class, it should be
* added to the list below. | 0 | This class is meant to be empty. It enables us to define
* the annotations which list all the different JUnit class we
* want to run. When creating a new test class, it should be
* added to the list below. | Suite_Remote_7_8.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,166 | Suite_Remote_7_8.java | * This suite is for tests to be run with GDB 7_8 | 0 | * This suite is for tests to be run with GDB 7_8 | Suite_Remote_7_8.java | [
0,
0,
0,
1,
0,
0,
0
] |
5,167 | Suite_Remote_7_8.java | /* Add your test class here */ | 0 | /* Add your test class here */ | Suite_Remote_7_8.java | [
0,
0,
0,
1,
0,
0,
0
] |
5,170 | AsmModelBuilderTest.java | @since 5.0 | 0 | @since 5.0 | AsmModelBuilderTest.java | [
0,
0,
0,
1,
0,
0,
0
] |
5,171 | RunnableFuture.java | Emulation of RunnableFuture. | 0 | Emulation of RunnableFuture. | RunnableFuture.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,172 | ComboBoxSQLContainerFilteredValueChange.java | (Re)creates the test table | 0 | (Re)creates the test table | ComboBoxSQLContainerFilteredValueChange.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,173 | ComboBoxSQLContainerFilteredValueChange.java | * Adds test data to the test table | 0 | * Adds test data to the test table | ComboBoxSQLContainerFilteredValueChange.java | [
1,
0,
0,
0,
0,
0,
0
] |
5,174 | ComboBoxSQLContainerFilteredValueChange.java | * @param connectionPool | 0 | * @param connectionPool | ComboBoxSQLContainerFilteredValueChange.java | [
0,
0,
0,
1,
0,
0,
0
] |
5,176 | GetClusterNodesResponse.java | @link NodeReport | 0 | @link NodeReport | GetClusterNodesResponse.java | [
0,
0,
0,
0,
1,
0,
0
] |
5,178 | GetClusterNodesResponse.java | * @see ApplicationClientProtocol#getClusterNodes(GetClusterNodesRequest) | 0 | * @see ApplicationClientProtocol#getClusterNodes(GetClusterNodesRequest) | GetClusterNodesResponse.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.