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
|
|---|---|---|---|---|---|
6,140
|
WorkingSetConfigsController.java
|
* Assigns me my "Add..." button.
| 0
|
* Assigns me my "Add..." button. | WorkingSetConfigsController.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,141
|
WorkingSetConfigsController.java
|
// make the selection
| 0
|
// make the selection | WorkingSetConfigsController.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,142
|
WorkingSetConfigsController.java
|
// Shouldn't happen: there should at least be the
// read-only config.
// Can only select the initial working set
| 0
|
// Shouldn't happen: there should at least be the
// read-only config.
// Can only select the initial working set | WorkingSetConfigsController.java
|
[
0,
0,
0,
0,
0,
0,
1
] |
6,143
|
WorkingSetConfigsController.java
|
// we have a most-recently-used working set. Just
// take the first in tree order
| 0
|
// we have a most-recently-used working set. Just
// take the first in tree order | WorkingSetConfigsController.java
|
[
0,
0,
0,
0,
0,
0,
1
] |
6,144
|
WorkingSetConfigsController.java
|
* Assigns the tree viewer that I control.
| 0
|
* Assigns the tree viewer that I control. | WorkingSetConfigsController.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,145
|
WorkingSetConfigsController.java
|
Initializes
| 0
|
Initializes | WorkingSetConfigsController.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,146
|
WorkingSetConfigsController.java
|
* Initializes me we an initial working set to select.
| 0
|
* Initializes me we an initial working set to select. | WorkingSetConfigsController.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,147
|
WorkingSetConfigsController.java
|
The view controller for the working set configurations pane in the dialog. It takes care of coordinating
* the user gestures in the pane with the working set configuration model, and vice-versa. It also implements
* the handling of the action buttons.
| 0
|
The view controller for the working set configurations pane in the dialog. It takes care of coordinating
* the user gestures in the pane with the working set configuration model, and vice-versa. It also implements
* the handling of the action buttons. | WorkingSetConfigsController.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,150
|
OnStateChangeVisitor.java
|
Visits Connector classes and check for methods with @OnStateChange
* annotations.
| 0
|
Visits Connector classes and check for methods with @OnStateChange
* annotations. | OnStateChangeVisitor.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,151
|
OnStateChangeVisitor.java
|
// Find all the annotated methods in all the superclasses
| 0
|
// Find all the annotated methods in all the superclasses | OnStateChangeVisitor.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,152
|
ArrayBasedEscaperMapTest.java
|
@author David Beaumont
| 0
|
@author David Beaumont | ArrayBasedEscaperMapTest.java
|
[
0,
1,
0,
0,
0,
0,
0
] |
6,153
|
ArrayBasedEscaperMapTest.java
|
// pass
| 0
|
// pass | ArrayBasedEscaperMapTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,154
|
ArrayBasedEscaperMapTest.java
|
// Non-null array of zero length.
| 0
|
// Non-null array of zero length. | ArrayBasedEscaperMapTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,155
|
ArrayBasedEscaperMapTest.java
|
// Array length is highest character value + 1
| 0
|
// Array length is highest character value + 1 | ArrayBasedEscaperMapTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,156
|
ArrayBasedEscaperMapTest.java
|
// Array length is highest character value + 1
| 0
|
// Array length is highest character value + 1 | ArrayBasedEscaperMapTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,157
|
ArrayBasedEscaperMapTest.java
|
// The final element should always be non null.
| 0
|
// The final element should always be non null. | ArrayBasedEscaperMapTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,158
|
Dispatcher.java
|
Event Dispatcher interface. It dispatches events to registered
* event handlers based on event types.
| 0
|
Event Dispatcher interface. It dispatches events to registered
* event handlers based on event types. | Dispatcher.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,159
|
Dispatcher.java
|
Configuration to make sure dispatcher crashes but doesn't do system-exit in
// case of errors. By default, it should be false, so that tests are not
// affected. For all daemons it should be explicitly set to true so that
// daemons can crash instead of hanging around.
| 0
|
Configuration to make sure dispatcher crashes but doesn't do system-exit in
// case of errors. By default, it should be false, so that tests are not
// affected. For all daemons it should be explicitly set to true so that
// daemons can crash instead of hanging around. | Dispatcher.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,160
|
ReduceTaskAttemptImpl.java
|
//job file name is set in TaskAttempt, setting it null here
| 0
|
//job file name is set in TaskAttempt, setting it null here | ReduceTaskAttemptImpl.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,161
|
ReduceTaskAttemptImpl.java
|
// YARN doesn't have the concept of slots per task, set it as 1.
| 0
|
// YARN doesn't have the concept of slots per task, set it as 1. | ReduceTaskAttemptImpl.java
|
[
0,
0,
0,
0,
0,
0,
1
] |
6,162
|
TestAuditLogAtDebug.java
|
Test that the HDFS Audit logger respects DFS_NAMENODE_AUDIT_LOG_DEBUG_CMDLIST.
| 0
|
Test that the HDFS Audit logger respects DFS_NAMENODE_AUDIT_LOG_DEBUG_CMDLIST. | TestAuditLogAtDebug.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,163
|
IRemoteConnectionHostConstants.java
|
Contributors:
* Johann Draschwandtner (Wind River) - initial API and implementation
* Martin Oberhuber (Wind River) - [261486][api][cleanup] Mark @noimplement interfaces as @noextend
| 0
|
Contributors:
* Johann Draschwandtner (Wind River) - initial API and implementation
* Martin Oberhuber (Wind River) - [261486][api][cleanup] Mark @noimplement interfaces as @noextend | IRemoteConnectionHostConstants.java
|
[
0,
1,
0,
0,
0,
0,
0
] |
6,166
|
IRemoteConnectionHostConstants.java
|
@since org.eclipse.rse.remotecdt 2.1
| 0
|
@since org.eclipse.rse.remotecdt 2.1 | IRemoteConnectionHostConstants.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,167
|
IRemoteConnectionHostConstants.java
|
Constants used for Remote CDT connection properties.
*
* <strong>EXPERIMENTAL</strong>. This class or interface has been added as part
* of a work in progress. There is no guarantee that this API will work or that
* it will remain the same. Please do not use this API without consulting with
* the <a href="http://www.eclipse.org/dsdp/tm/">Target Management</a> team.
* </p>
| 0
|
Constants used for Remote CDT connection properties.
*
* <strong>EXPERIMENTAL</strong>. This class or interface has been added as part
* of a work in progress. There is no guarantee that this API will work or that
* it will remain the same. Please do not use this API without consulting with
* the <a href="http://www.eclipse.org/dsdp/tm/">Target Management</a> team.
* </p> | IRemoteConnectionHostConstants.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,168
|
TextFieldValueChangeTest.java
|
Check that the value change listener for a text field is triggered exactly
* once when setting the value, at the correct time.
| 0
|
Check that the value change listener for a text field is triggered exactly
* once when setting the value, at the correct time. | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,169
|
TextFieldValueChangeTest.java
|
Case where the text field only uses its internal buffer, no external
* property data source.
| 0
|
Case where the text field only uses its internal buffer, no external
* property data source. | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,170
|
TextFieldValueChangeTest.java
|
Test that field propagates value change events originating from property,
* but don't fire value change events twice if value has only changed once.
| 0
|
Test that field propagates value change events originating from property,
* but don't fire value change events twice if value has only changed once. | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,171
|
TextFieldValueChangeTest.java
|
// defaults, buffering off
| 0
|
// defaults, buffering off | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,172
|
TextFieldValueChangeTest.java
|
// Expectations and start test
| 0
|
// Expectations and start test | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,173
|
TextFieldValueChangeTest.java
|
// Add listener and set the value -> should end up in listener once
| 0
|
// Add listener and set the value -> should end up in listener once | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,174
|
TextFieldValueChangeTest.java
|
// Ensure listener was called once
| 0
|
// Ensure listener was called once | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,175
|
TextFieldValueChangeTest.java
|
// get value should not fire value change again
| 0
|
// get value should not fire value change again | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,176
|
TextFieldValueChangeTest.java
|
// Ensure listener still has been called only once
| 0
|
// Ensure listener still has been called only once | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,177
|
TextFieldValueChangeTest.java
|
Value change events from property should not propagate if read through is
* false. Execpt when the property is being set.
| 0
|
Value change events from property should not propagate if read through is
* false. Execpt when the property is being set. | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,178
|
TextFieldValueChangeTest.java
|
// set buffering
| 0
|
// set buffering | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,179
|
TextFieldValueChangeTest.java
|
Value change should only happen once, when setting the property,
// further changes via property should not cause value change listener
// in field to be notified
| 0
|
Value change should only happen once, when setting the property,
// further changes via property should not cause value change listener
// in field to be notified | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,180
|
TextFieldValueChangeTest.java
|
// Ensure listener was called once
| 0
|
// Ensure listener was called once | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,181
|
TextFieldValueChangeTest.java
|
modify property value, should not fire value change in field as the
// read buffering is on (read through == false)
| 0
|
modify property value, should not fire value change in field as the
// read buffering is on (read through == false) | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,182
|
TextFieldValueChangeTest.java
|
// Ensure listener still has been called only once
| 0
|
// Ensure listener still has been called only once | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,183
|
TextFieldValueChangeTest.java
|
// get value should not fire value change again
| 0
|
// get value should not fire value change again | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,184
|
TextFieldValueChangeTest.java
|
field value should be different from the original value and current
// proeprty value
| 0
|
field value should be different from the original value and current
// proeprty value | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,185
|
TextFieldValueChangeTest.java
|
// Ensure listener still has been called only once
| 0
|
// Ensure listener still has been called only once | TextFieldValueChangeTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,186
|
TextFieldValueChangeTest.java
|
See <a href="http://dev.vaadin.com/ticket/4394">Ticket 4394</a>.
| 0
|
See <a href="http://dev.vaadin.com/ticket/4394">Ticket 4394</a>. | TextFieldValueChangeTest.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
6,187
|
BlockStoragePolicySpi.java
|
* @return true if the policy is inherit-only.
| 0
|
* @return true if the policy is inherit-only. | BlockStoragePolicySpi.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,188
|
BlockStoragePolicySpi.java
|
* @return fallback storage types for replicating existing block replicas.
| 0
|
* @return fallback storage types for replicating existing block replicas. | BlockStoragePolicySpi.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,189
|
BlockStoragePolicySpi.java
|
* @return fallback storage types for new block replicas..
| 0
|
* @return fallback storage types for new block replicas.. | BlockStoragePolicySpi.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,190
|
BlockStoragePolicySpi.java
|
* @return preferred storage types used for placing block replicas.
| 0
|
* @return preferred storage types used for placing block replicas. | BlockStoragePolicySpi.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,191
|
BlockStoragePolicySpi.java
|
* @return the name of the storage policy.
| 0
|
* @return the name of the storage policy. | BlockStoragePolicySpi.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,192
|
BlockStoragePolicySpi.java
|
A storage policy specifies the placement of block replicas on specific
* storage types.
| 0
|
A storage policy specifies the placement of block replicas on specific
* storage types. | BlockStoragePolicySpi.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,193
|
BlockStoragePolicySpi.java
|
Return the name of the storage policy. Policies are uniquely
* identified by name.
| 0
|
Return the name of the storage policy. Policies are uniquely
* identified by name. | BlockStoragePolicySpi.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,194
|
BlockStoragePolicySpi.java
|
Return the preferred storage types associated with this policy. These
* storage types are used sequentially for successive block replicas.
| 0
|
Return the preferred storage types associated with this policy. These
* storage types are used sequentially for successive block replicas. | BlockStoragePolicySpi.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,195
|
BlockStoragePolicySpi.java
|
Get the fallback storage types for creating new block replicas. Fallback
* storage types are used if the preferred storage types are not available.
| 0
|
Get the fallback storage types for creating new block replicas. Fallback
* storage types are used if the preferred storage types are not available. | BlockStoragePolicySpi.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,196
|
BlockStoragePolicySpi.java
|
Get the fallback storage types for replicating existing block replicas.
* Fallback storage types are used if the preferred storage types are not
* available.
| 0
|
Get the fallback storage types for replicating existing block replicas.
* Fallback storage types are used if the preferred storage types are not
* available. | BlockStoragePolicySpi.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,197
|
BlockStoragePolicySpi.java
|
Returns true if the policy is inherit-only and cannot be changed for
* an existing file.
| 0
|
Returns true if the policy is inherit-only and cannot be changed for
* an existing file. | BlockStoragePolicySpi.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,199
|
ICThread.java
|
C/C++ extension of <code>IThread</code>.
| 0
|
C/C++ extension of <code>IThread</code>. | ICThread.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,201
|
CNewOptionsPage.java
|
@deprecated as of CDT 4.0. Does not seem to be used anywhere, looks like
* remnant of 3.X style new project wizard.
| 0
|
@deprecated as of CDT 4.0. Does not seem to be used anywhere, looks like
* remnant of 3.X style new project wizard. | CNewOptionsPage.java
|
[
0,
0,
0,
0,
0,
1,
0
] |
6,203
|
CNewOptionsPage.java
|
@noinstantiate This class is not intended to be instantiated by clients.
| 0
|
@noinstantiate This class is not intended to be instantiated by clients. | CNewOptionsPage.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,204
|
ResynchronizeAfterAsyncRemoval.java
|
The window will enqueue a non-immediate message reporting its current
// position.
| 0
|
The window will enqueue a non-immediate message reporting its current
// position. | ResynchronizeAfterAsyncRemoval.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,205
|
ResynchronizeAfterAsyncRemoval.java
|
// Remove window immediately when the current response is sent
| 0
|
// Remove window immediately when the current response is sent | ResynchronizeAfterAsyncRemoval.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,206
|
ResynchronizeAfterAsyncRemoval.java
|
Clicking the button will trigger sending the window coordinates, but
// the window is already removed at that point.
| 0
|
Clicking the button will trigger sending the window coordinates, but
// the window is already removed at that point. | ResynchronizeAfterAsyncRemoval.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,209
|
IElementUpdateTesterExtension.java
|
* @param viewerInput The input to the viewer for the given cache entry.
| 0
|
* @param viewerInput The input to the viewer for the given cache entry. | IElementUpdateTesterExtension.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,210
|
IElementUpdateTesterExtension.java
|
* @param path The viewer tree path for the given cache entry.
| 0
|
* @param path The viewer tree path for the given cache entry. | IElementUpdateTesterExtension.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,211
|
IElementUpdateTesterExtension.java
|
* @param isDirty <code>true</code> if the given cache entry is already dirty
| 0
|
* @param isDirty <code>true</code> if the given cache entry is already dirty | IElementUpdateTesterExtension.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,212
|
IElementUpdateTesterExtension.java
|
@return Collection of properties which should be flushed, or
* <code>null</code> if none.
| 0
|
@return Collection of properties which should be flushed, or
* <code>null</code> if none. | IElementUpdateTesterExtension.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,213
|
IElementUpdateTesterExtension.java
|
* Returns the properties that should be flushed for the element.
| 0
|
* Returns the properties that should be flushed for the element. | IElementUpdateTesterExtension.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,214
|
IElementUpdateTesterExtension.java
|
Element update tester extension which allows an update policy to selectively
* flush properties of elements. This can be useful if the update tester's event
* only affects a certain aspect of the element's presentation.
| 0
|
Element update tester extension which allows an update policy to selectively
* flush properties of elements. This can be useful if the update tester's event
* only affects a certain aspect of the element's presentation. | IElementUpdateTesterExtension.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,215
|
JndiProviderClient.java
|
// Bind Context to the default InitialContext.
| 0
|
// Bind Context to the default InitialContext. | JndiProviderClient.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,216
|
JndiProviderClient.java
|
// Bind to DataSource from JNDI.
| 0
|
// Bind to DataSource from JNDI. | JndiProviderClient.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,217
|
TestModuleEntryPoint.java
|
* A dummy entry point of the test module.
| 0
|
* A dummy entry point of the test module. | TestModuleEntryPoint.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,219
|
Partitioner.java
|
Partitions the key space.
*
* <p><code>Partitioner</code> controls the partitioning of the keys of the
* intermediate map-outputs. The key (or a subset of the key) is used to derive
* the partition, typically by a hash function. The total number of partitions
* is the same as the number of reduce tasks for the job. Hence this controls
* which of the <code>m</code> reduce tasks the intermediate key (and hence the
* record) is sent for reduction.</p>
| 0
|
Partitions the key space.
*
* <p><code>Partitioner</code> controls the partitioning of the keys of the
* intermediate map-outputs. The key (or a subset of the key) is used to derive
* the partition, typically by a hash function. The total number of partitions
* is the same as the number of reduce tasks for the job. Hence this controls
* which of the <code>m</code> reduce tasks the intermediate key (and hence the
* record) is sent for reduction.</p> | Partitioner.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,220
|
Partitioner.java
|
<p>Note: A <code>Partitioner</code> is created only when there are multiple
* reducers.</p>
| 0
|
<p>Note: A <code>Partitioner</code> is created only when there are multiple
* reducers.</p> | Partitioner.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,221
|
Partitioner.java
|
* @param key the key to be paritioned.
| 0
|
* @param key the key to be paritioned. | Partitioner.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,222
|
Partitioner.java
|
* @param numPartitions the total number of partitions.
| 0
|
* @param numPartitions the total number of partitions. | Partitioner.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,223
|
Partitioner.java
|
* @param value the entry value.
| 0
|
* @param value the entry value. | Partitioner.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,224
|
Partitioner.java
|
* @return the partition number for the <code>key</code>.
| 0
|
* @return the partition number for the <code>key</code>. | Partitioner.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,225
|
Partitioner.java
|
Get the paritition number for a given key (hence record) given the total
* number of partitions i.e. number of reduce-tasks for the job.
*
* <p>Typically a hash function on a all or a subset of the key.</p>
| 0
|
Get the paritition number for a given key (hence record) given the total
* number of partitions i.e. number of reduce-tasks for the job.
*
* <p>Typically a hash function on a all or a subset of the key.</p> | Partitioner.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,226
|
Partitioner.java
|
@see Reducer
| 0
|
@see Reducer | Partitioner.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
6,227
|
PreemptionMessage.java
|
@link PreemptionMessage
| 0
|
@link PreemptionMessage | PreemptionMessage.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
6,228
|
PreemptionMessage.java
|
@code ApplicationMaster
| 0
|
@code ApplicationMaster | PreemptionMessage.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
6,229
|
PreemptionMessage.java
|
@link
* StrictPreemptionContract
| 0
|
@link
* StrictPreemptionContract | PreemptionMessage.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
6,230
|
PreemptionMessage.java
|
@link PreemptionContract
| 0
|
@link PreemptionContract | PreemptionMessage.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
6,231
|
PreemptionMessage.java
|
@link
* StrictPreemptionContract
| 0
|
@link
* StrictPreemptionContract | PreemptionMessage.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
6,232
|
PreemptionMessage.java
|
@link
* PreemptionContract#getContainers()
| 0
|
@link
* PreemptionContract#getContainers() | PreemptionMessage.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
6,233
|
PreemptionMessage.java
|
@link PreemptionContract
| 0
|
@link PreemptionContract | PreemptionMessage.java
|
[
0,
0,
0,
0,
1,
0,
0
] |
6,234
|
PreemptionMessage.java
|
A {@link PreemptionMessage} is part of the RM-AM protocol, and it is used by
* the RM to specify resources that the RM wants to reclaim from this
* {@code ApplicationMaster} (AM). The AM receives a {@link
* StrictPreemptionContract} message encoding which containers the platform may
* forcibly kill, granting it an opportunity to checkpoint state or adjust its
* execution plan. The message may also include a {@link PreemptionContract}
* granting the AM more latitude in selecting which resources to return to the
* cluster.
| 0
|
A {@link PreemptionMessage} is part of the RM-AM protocol, and it is used by
* the RM to specify resources that the RM wants to reclaim from this
* {@code ApplicationMaster} (AM). The AM receives a {@link
* StrictPreemptionContract} message encoding which containers the platform may
* forcibly kill, granting it an opportunity to checkpoint state or adjust its
* execution plan. The message may also include a {@link PreemptionContract}
* granting the AM more latitude in selecting which resources to return to the
* cluster. | PreemptionMessage.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,235
|
PreemptionMessage.java
|
The AM should decode both parts of the message. The {@link
* StrictPreemptionContract} specifies particular allocations that the RM
* requires back. The AM can checkpoint containers' state, adjust its execution
* plan to move the computation, or take no action and hope that conditions that
* caused the RM to ask for the container will change.
* <p>
* In contrast, the {@link PreemptionContract} also includes a description of
* resources with a set of containers. If the AM releases containers matching
* that profile, then the containers enumerated in {@link
* PreemptionContract#getContainers()} may not be killed.
* <p>
* Each preemption message reflects the RM's current understanding of the
* cluster state, so a request to return <em>N</em> containers may not
* reflect containers the AM is releasing, recently exited containers the RM has
* yet to learn about, or new containers allocated before the message was
* generated. Conversely, an RM may request a different profile of containers in
* subsequent requests.
* <p>
* The policy enforced by the RM is part of the scheduler. Generally, only
* containers that have been requested consistently should be killed, but the
* details are not specified.
| 0
|
The AM should decode both parts of the message. The {@link
* StrictPreemptionContract} specifies particular allocations that the RM
* requires back. The AM can checkpoint containers' state, adjust its execution
* plan to move the computation, or take no action and hope that conditions that
* caused the RM to ask for the container will change.
* <p>
* In contrast, the {@link PreemptionContract} also includes a description of
* resources with a set of containers. If the AM releases containers matching
* that profile, then the containers enumerated in {@link
* PreemptionContract#getContainers()} may not be killed.
* <p>
* Each preemption message reflects the RM's current understanding of the
* cluster state, so a request to return <em>N</em> containers may not
* reflect containers the AM is releasing, recently exited containers the RM has
* yet to learn about, or new containers allocated before the message was
* generated. Conversely, an RM may request a different profile of containers in
* subsequent requests.
* <p>
* The policy enforced by the RM is part of the scheduler. Generally, only
* containers that have been requested consistently should be killed, but the
* details are not specified. | PreemptionMessage.java
|
[
0,
0,
0,
0,
0,
0,
1
] |
6,236
|
PreemptionMessage.java
|
@return Specific resources that may be killed by the
* <code>ResourceManager</code>
| 0
|
@return Specific resources that may be killed by the
* <code>ResourceManager</code> | PreemptionMessage.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,237
|
PreemptionMessage.java
|
@return Contract describing resources to return to the cluster.
| 0
|
@return Contract describing resources to return to the cluster. | PreemptionMessage.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,238
|
OpportunisticContainerAllocator.java
|
<p>The OpportunisticContainerAllocator allocates containers on a given list
* of Nodes after it modifies the container sizes to within allowable limits
* specified by the <code>ClusterManager</code> running on the RM. It tries to
* distribute the containers as evenly as possible. It also uses the
* <code>NMTokenSecretManagerInNM</code> to generate the required NM tokens for
* the allocated containers</p>
| 0
|
<p>The OpportunisticContainerAllocator allocates containers on a given list
* of Nodes after it modifies the container sizes to within allowable limits
* specified by the <code>ClusterManager</code> running on the RM. It tries to
* distribute the containers as evenly as possible. It also uses the
* <code>NMTokenSecretManagerInNM</code> to generate the required NM tokens for
* the allocated containers</p> | OpportunisticContainerAllocator.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,239
|
OpportunisticContainerAllocator.java
|
// Bias away from whatever we have already allocated and respect blacklist
| 0
|
// Bias away from whatever we have already allocated and respect blacklist | OpportunisticContainerAllocator.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,240
|
OpportunisticContainerAllocator.java
|
// Normalize the resource asks (Similar to what the the RM scheduler does
// before accepting an ask)
| 0
|
// Normalize the resource asks (Similar to what the the RM scheduler does
// before accepting an ask) | OpportunisticContainerAllocator.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,241
|
OpportunisticContainerAllocator.java
|
// RPC layer client expects ip:port as service for tokens
| 0
|
// RPC layer client expects ip:port as service for tokens | OpportunisticContainerAllocator.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,242
|
CalendarShownNotCorrectlyWhenPartiallyOutOfViewTest.java
|
* Tests calendar via prepared screenshots 'Calendar event not shown correctly
* when partially out of view' (#7261)
| 0
|
* Tests calendar via prepared screenshots 'Calendar event not shown correctly
* when partially out of view' (#7261) | CalendarShownNotCorrectlyWhenPartiallyOutOfViewTest.java
|
[
1,
0,
0,
0,
0,
0,
0
] |
6,244
|
AutotoolsNewProjectNature.java
|
Contributors:
* Red Hat Incorporated - initial implementation
* IBM Rational Software - add and remove nature static methods
* Anna Dushistova (MontaVista) - [402595]Autotools nature loses builders added by contributed wizard pages
| 0
|
Contributors:
* Red Hat Incorporated - initial implementation
* IBM Rational Software - add and remove nature static methods
* Anna Dushistova (MontaVista) - [402595]Autotools nature loses builders added by contributed wizard pages | AutotoolsNewProjectNature.java
|
[
0,
1,
0,
0,
0,
0,
0
] |
6,245
|
AutotoolsNewProjectNature.java
|
@since 1.3
| 0
|
@since 1.3 | AutotoolsNewProjectNature.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,246
|
AutotoolsNewProjectNature.java
|
* @param project
| 0
|
* @param project | AutotoolsNewProjectNature.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,247
|
AutotoolsNewProjectNature.java
|
* @param monitor
| 0
|
* @param monitor | AutotoolsNewProjectNature.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,248
|
AutotoolsNewProjectNature.java
|
* @param proj the project to add the autotools nature to.
| 0
|
* @param proj the project to add the autotools nature to. | AutotoolsNewProjectNature.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,249
|
AutotoolsNewProjectNature.java
|
* @param proj the project to add the nature to.
| 0
|
* @param proj the project to add the nature to. | AutotoolsNewProjectNature.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
6,250
|
AutotoolsNewProjectNature.java
|
* @param natureId the id of the nature to assign to the project
| 0
|
* @param natureId the id of the nature to assign to the project | AutotoolsNewProjectNature.java
|
[
0,
0,
0,
1,
0,
0,
0
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.