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,003
|
ShortCircuitReplica.java
|
@param evictableTimeNs The evictable time in nanoseconds, or null
* to set no evictable time.
| 0
|
@param evictableTimeNs The evictable time in nanoseconds, or null
* to set no evictable time. | ShortCircuitReplica.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
5,004
|
ShortCircuitReplica.java
|
@return the evictable time in nanoseconds.
| 0
|
@return the evictable time in nanoseconds. | ShortCircuitReplica.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
5,005
|
ShortCircuitReplica.java
|
Note: you must hold the cache lock to call this function.
| 0
|
Note: you must hold the cache lock to call this function. | ShortCircuitReplica.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
5,006
|
ShortCircuitReplica.java
|
@return True if we successfully added a no-checksum anchor.
| 0
|
@return True if we successfully added a no-checksum anchor. | ShortCircuitReplica.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
5,007
|
ShortCircuitReplica.java
|
/**
* A ShortCircuitReplica object contains file descriptors for a block that
* we are reading via short-circuit local reads.
*
* The file descriptors can be shared between multiple threads because
* all the operations we perform are stateless-- i.e., we use pread
* instead of read, to avoid using the shared position state.
*/
| 0
|
/**
* A ShortCircuitReplica object contains file descriptors for a block that
* we are reading via short-circuit local reads.
*
* The file descriptors can be shared between multiple threads because
* all the operations we perform are stateless-- i.e., we use pread
* instead of read, to avoid using the shared position state.
*/ | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,008
|
ShortCircuitReplica.java
|
/**
* Identifies this ShortCircuitReplica object.
*/
| 0
|
/**
* Identifies this ShortCircuitReplica object.
*/ | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,009
|
ShortCircuitReplica.java
|
/**
* The block data input stream.
*/
| 0
|
/**
* The block data input stream.
*/ | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,010
|
ShortCircuitReplica.java
|
/**
* The block metadata input stream.
*
* TODO: make this nullable if the file has no checksums on disk.
*/
| 0
|
/**
* The block metadata input stream.
*
* TODO: make this nullable if the file has no checksums on disk.
*/ | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,011
|
ShortCircuitReplica.java
|
/**
* Block metadata header.
*/
| 0
|
/**
* Block metadata header.
*/ | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,012
|
ShortCircuitReplica.java
|
/**
* The cache we belong to.
*/
| 0
|
/**
* The cache we belong to.
*/ | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,013
|
ShortCircuitReplica.java
|
/**
* Monotonic time at which the replica was created.
*/
| 0
|
/**
* Monotonic time at which the replica was created.
*/ | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,014
|
ShortCircuitReplica.java
|
/**
* If non-null, the shared memory slot associated with this replica.
*/
| 0
|
/**
* If non-null, the shared memory slot associated with this replica.
*/ | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,015
|
ShortCircuitReplica.java
|
/**
* Current mmap state.
*
* Protected by the cache lock.
*/
| 0
|
/**
* Current mmap state.
*
* Protected by the cache lock.
*/ | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,016
|
ShortCircuitReplica.java
|
/**
* True if this replica has been purged from the cache; false otherwise.
*
* Protected by the cache lock.
*/
| 0
|
/**
* True if this replica has been purged from the cache; false otherwise.
*
* Protected by the cache lock.
*/ | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,017
|
ShortCircuitReplica.java
|
/**
* Number of external references to this replica. Replicas are referenced
* by the cache, BlockReaderLocal instances, and by ClientMmap instances.
* The number starts at 2 because when we create a replica, it is referenced
* by both the cache and the requester.
*
* Protected by the cache lock.
*/
| 0
|
/**
* Number of external references to this replica. Replicas are referenced
* by the cache, BlockReaderLocal instances, and by ClientMmap instances.
* The number starts at 2 because when we create a replica, it is referenced
* by both the cache and the requester.
*
* Protected by the cache lock.
*/ | ShortCircuitReplica.java
|
[
0,
0,
1,
0,
0,
0,
0
] |
5,018
|
ShortCircuitReplica.java
|
/**
* The monotonic time in nanoseconds at which the replica became evictable, or
* null if it is not evictable.
*
* Protected by the cache lock.
*/
| 0
|
/**
* The monotonic time in nanoseconds at which the replica became evictable, or
* null if it is not evictable.
*
* Protected by the cache lock.
*/ | ShortCircuitReplica.java
|
[
0,
0,
1,
0,
0,
0,
0
] |
5,019
|
ShortCircuitReplica.java
|
/**
* Decrement the reference count.
*/
| 0
|
/**
* Decrement the reference count.
*/ | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,020
|
ShortCircuitReplica.java
|
/**
* Check if the replica is stale.
*
* Must be called with the cache lock held.
*/
| 0
|
/**
* Check if the replica is stale.
*
* Must be called with the cache lock held.
*/ | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,021
|
ShortCircuitReplica.java
|
// Check staleness by looking at the shared memory area we use to
| 0
|
// Check staleness by looking at the shared memory area we use to | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,022
|
ShortCircuitReplica.java
|
// communicate with the DataNode.
| 0
|
// communicate with the DataNode. | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,023
|
ShortCircuitReplica.java
|
// Fall back to old, time-based staleness method.
| 0
|
// Fall back to old, time-based staleness method. | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,024
|
ShortCircuitReplica.java
|
/**
* Try to add a no-checksum anchor to our shared memory slot.
*
* It is only possible to add this anchor when the block is mlocked on the Datanode.
* The DataNode will not munlock the block until the number of no-checksum anchors
* for the block reaches zero.
*
* This method does not require any synchronization.
*
* @return True if we successfully added a no-checksum anchor.
*/
| 0
|
/**
* Try to add a no-checksum anchor to our shared memory slot.
*
* It is only possible to add this anchor when the block is mlocked on the Datanode.
* The DataNode will not munlock the block until the number of no-checksum anchors
* for the block reaches zero.
*
* This method does not require any synchronization.
*
* @return True if we successfully added a no-checksum anchor.
*/ | ShortCircuitReplica.java
|
[
0,
0,
1,
0,
0,
0,
0
] |
5,025
|
ShortCircuitReplica.java
|
/**
* Remove a no-checksum anchor for our shared memory slot.
*
* This method does not require any synchronization.
*/
| 0
|
/**
* Remove a no-checksum anchor for our shared memory slot.
*
* This method does not require any synchronization.
*/ | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,026
|
ShortCircuitReplica.java
|
/**
* Check if the replica has an associated mmap that has been fully loaded.
*
* Must be called with the cache lock held.
*/
| 0
|
/**
* Check if the replica has an associated mmap that has been fully loaded.
*
* Must be called with the cache lock held.
*/ | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,027
|
ShortCircuitReplica.java
|
/**
* Free the mmap associated with this replica.
*
* Must be called with the cache lock held.
*/
| 0
|
/**
* Free the mmap associated with this replica.
*
* Must be called with the cache lock held.
*/ | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,028
|
ShortCircuitReplica.java
|
/**
* Close the replica.
*
* Must be called after there are no more references to the replica in the
* cache or elsewhere.
*/
| 0
|
/**
* Close the replica.
*
* Must be called after there are no more references to the replica in the
* cache or elsewhere.
*/ | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,029
|
ShortCircuitReplica.java
|
* Get the evictable time in nanoseconds.
| 0
|
* Get the evictable time in nanoseconds. | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,030
|
ShortCircuitReplica.java
|
* Set the evictable time in nanoseconds.
| 0
|
* Set the evictable time in nanoseconds. | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,031
|
ShortCircuitReplica.java
|
Convert the replica to a string for debugging purposes.
* Note that we can't take the lock here.
| 0
|
Convert the replica to a string for debugging purposes.
* Note that we can't take the lock here. | ShortCircuitReplica.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,032
|
CMakeLocalLaunchConfigurationProvider.java
|
// launch config added will get called below to add it to the
// configs map
| 0
|
// launch config added will get called below to add it to the
// configs map | CMakeLocalLaunchConfigurationProvider.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,033
|
CMakeLocalLaunchConfigurationProvider.java
|
// Set the project and the connection
| 0
|
// Set the project and the connection | CMakeLocalLaunchConfigurationProvider.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,034
|
CMakeLocalLaunchConfigurationProvider.java
|
// nothing to do since the Local connection can't be removed
| 0
|
// nothing to do since the Local connection can't be removed | CMakeLocalLaunchConfigurationProvider.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,035
|
ScopedBindingBuilder.java
|
@link com.google.inject.Binder
| 0
|
@link com.google.inject.Binder | ScopedBindingBuilder.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
5,036
|
ScopedBindingBuilder.java
|
@link com.google.inject.Binder
| 0
|
@link com.google.inject.Binder | ScopedBindingBuilder.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
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,042
|
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,046
|
AbstractRequestInterceptor.java
|
@link RequestInterceptor
| 0
|
@link RequestInterceptor | AbstractRequestInterceptor.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
5,047
|
AbstractRequestInterceptor.java
|
@link Configuration
| 0
|
@link Configuration | AbstractRequestInterceptor.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
5,048
|
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,052
|
AbstractRequestInterceptor.java
|
@link AMRMProxyApplicationContext
| 0
|
@link AMRMProxyApplicationContext | 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,057
|
AbstractRequestInterceptor.java
|
Implements the RequestInterceptor interface and provides common functionality
* which can can be used and/or extended by other concrete intercepter classes.
| 0
|
Implements the RequestInterceptor interface and provides common functionality
* which can can be used and/or extended by other concrete intercepter classes. | AbstractRequestInterceptor.java
|
[
1,
0,
0,
0,
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,060
|
AbstractRequestInterceptor.java
|
* Gets the {@link Configuration}.
| 0
|
* Gets 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,068
|
DynamicBloomFilter.java
|
@return BloomFilter The active standard Bloom filter.
* <code>Null</code> otherwise.
| 0
|
@return BloomFilter The active standard Bloom filter.
* <code>Null</code> otherwise. | DynamicBloomFilter.java
|
[
0,
0,
0,
1,
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,072
|
DynamicBloomFilter.java
|
* @param nbHash The number of hash function to consider.
| 0
|
* @param nbHash The number of hash function to consider. | DynamicBloomFilter.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
5,073
|
DynamicBloomFilter.java
|
* @param vectorSize The number of bits in the vector.
| 0
|
* @param vectorSize The number of bits in the vector. | 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,079
|
DynamicBloomFilter.java
|
* Threshold for the maximum number of key to record in a dynamic Bloom filter row.
| 0
|
* Threshold for the maximum number of key to record in a dynamic Bloom filter row. | 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,083
|
DynamicBloomFilter.java
|
* @see <a href="http://www.cse.fau.edu/~jie/research/publications/Publication_files/infocom2006.pdf">Theory and Network Applications of Dynamic Bloom Filters</a>
| 0
|
* @see <a href="http://www.cse.fau.edu/~jie/research/publications/Publication_files/infocom2006.pdf">Theory and Network Applications of Dynamic Bloom Filters</a> | 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,092
|
TestHarFileSystemBasics.java
|
@link HarFileSyste
| 0
|
@link HarFileSyste | TestHarFileSystemBasics.java
|
[
0,
0,
0,
0,
1,
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,095
|
TestHarFileSystemBasics.java
|
// ok, expected.
| 0
|
// ok, expected. | TestHarFileSystemBasics.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,096
|
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,099
|
TestHarFileSystemBasics.java
|
// ok, expected.
| 0
|
// ok, expected. | TestHarFileSystemBasics.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
5,100
|
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
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.