index
int64
1
10.8k
class
stringclasses
784 values
comment_sentence
stringlengths
1
1.78k
partition
int64
0
0
combo
stringlengths
17
1.81k
labels
listlengths
7
7
10,661
Expand
This implementation provides the complete set of optional methods defined in the LoadingCache interface.
0
This implementation provides the complete set of optional methods defined in the LoadingCache interface.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,662
Expand
The implementation uses identity to manage cache entries based on weak or soft references.
0
The implementation uses identity to manage cache entries based on weak or soft references.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,663
rational
This design allows for efficient memory usage by enabling the garbage collection of cache entries when memory is needed.
0
This design allows for efficient memory usage by enabling the garbage collection of cache entries when memory is needed.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,664
Expand
The implementation uses arrays to store object counts efficiently.
0
The implementation uses arrays to store object counts efficiently.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,665
rational
The design exists to ensure that RegularImmutableList can be properly serialized for GWT applications.
0
The design exists to ensure that RegularImmutableList can be properly serialized for GWT applications.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,666
Expand
This implementation manages the registration and deregistration of value change listeners to ensure they receive updates.
0
This implementation manages the registration and deregistration of value change listeners to ensure they receive updates.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,667
Expand
This implementation processes incoming portlet requests and manages their deployment to ensure proper functionality.
0
This implementation processes incoming portlet requests and manages their deployment to ensure proper functionality.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,668
rational
This design ensures that the child class can properly inherit properties and methods from its parent class.
0
This design ensures that the child class can properly inherit properties and methods from its parent class.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,669
rational
This design prevents overcommitting resources, ensuring that allocations do not exceed the physical cluster's capacity.
0
This design prevents overcommitting resources, ensuring that allocations do not exceed the physical cluster's capacity.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,670
Expand
This class uses GWT serialization to convert LinkedListMultimap objects to a format suitable for transmission and storage.
0
This class uses GWT serialization to convert LinkedListMultimap objects to a format suitable for transmission and storage.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,671
Expand
The implementation breaks long strings into manageable sections for processing.
0
The implementation breaks long strings into manageable sections for processing.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,672
rational
This design allows for efficient handling of large strings that exceed size limits.
0
This design allows for efficient handling of large strings that exceed size limits.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,673
rational
The design exists to ensure accurate interpretation of complex declarator syntax in the language.
0
The design exists to ensure accurate interpretation of complex declarator syntax in the language.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,674
Expand
This implementation uses the existing FileSystem to handle file operations.
0
This implementation uses the existing FileSystem to handle file operations.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,675
rational
The design ensures compatibility with the AbstractFileSystem's factory method for file system creation.
0
The design ensures compatibility with the AbstractFileSystem's factory method for file system creation.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,676
Expand
This exception is thrown during the file creation process when a file is already in the midst of being created.
0
This exception is thrown during the file creation process when a file is already in the midst of being created.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,677
rational
The design exists to prevent conflicts and ensure that file creation operations are handled safely.
0
The design exists to prevent conflicts and ensure that file creation operations are handled safely.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,678
rational
The design aims to ensure compatibility with different browsers by managing how the tree is displayed.
0
The design aims to ensure compatibility with different browsers by managing how the tree is displayed.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,679
Expand
This class serves as a container for JUnit annotations that specify which test classes to execute.
0
This class serves as a container for JUnit annotations that specify which test classes to execute.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,680
rational
The design allows for easy management and organization of test classes in a single location.
0
The design allows for easy management and organization of test classes in a single location.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,681
Expand
The implementation initializes the preference store when it cannot be retrieved from the preference dialog's element.
0
The implementation initializes the preference store when it cannot be retrieved from the preference dialog's element.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,682
rational
This design ensures that the dynamic printf functionality has a valid preference store to operate with.
0
This design ensures that the dynamic printf functionality has a valid preference store to operate with.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,683
Expand
The implementation reads and interprets the structure of SOM archive files to extract their contents.
0
The implementation reads and interprets the structure of SOM archive files to extract their contents.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,684
rational
The design exists to ensure a standardized API for selection models, enhancing code consistency and usability.
0
The design exists to ensure a standardized API for selection models, enhancing code consistency and usability.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,685
Expand
This method handles row selection without triggering events for changes in selection.
0
This method handles row selection without triggering events for changes in selection.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,686
rational
This design allows for performance optimization by reducing unnecessary event firing.
0
This design allows for performance optimization by reducing unnecessary event firing.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,687
Expand
This implementation selects a specific row in a data table by utilizing the AbstractRowHandleSelectionModel class.
0
This implementation selects a specific row in a data table by utilizing the AbstractRowHandleSelectionModel class.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,688
Expand
This implementation maintains a separate map for additional attributes that are parsed but not serialized into the JSON output.
0
This implementation maintains a separate map for additional attributes that are parsed but not serialized into the JSON output.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,689
rational
This design allows for flexibility in handling extra data without cluttering the JSON representation of the record.
0
This design allows for flexibility in handling extra data without cluttering the JSON representation of the record.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,690
Expand
This implementation creates a CacheLoader that uses a simple approach to load multiple entries by calling the load method for each entry.
0
This implementation creates a CacheLoader that uses a simple approach to load multiple entries by calling the load method for each entry.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,691
Expand
This method runs the specified runnable on the abstract syntax tree (AST) obtained from the cache for the provided translation unit.
0
This method runs the specified runnable on the abstract syntax tree (AST) obtained from the cache for the provided translation unit.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,692
rational
The design ensures thread safety by managing the index read-lock during the execution of the runnable.
0
The design ensures thread safety by managing the index read-lock during the execution of the runnable.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,693
Expand
The implementation tracks the last write access timestamp to the index when caching the AST.
0
The implementation tracks the last write access timestamp to the index when caching the AST.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,694
rational
This design ensures that the cached AST remains valid only until any subsequent write access occurs.
0
This design ensures that the cached AST remains valid only until any subsequent write access occurs.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,695
Expand
This implementation processes the arg1 parameter in the executeOp method to determine its role based on the specific operation.
0
This implementation processes the arg1 parameter in the executeOp method to determine its role based on the specific operation.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,696
Expand
This comment explains the relationship between the arg1 argument and the executeOp method, detailing its varying meanings based on the operation.
0
This comment explains the relationship between the arg1 argument and the executeOp method, detailing its varying meanings based on the operation.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,697
Expand
This class uses GWT serialization to convert ArrayListMultimap objects to and from a format suitable for remote communication.
0
This class uses GWT serialization to convert ArrayListMultimap objects to and from a format suitable for remote communication.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,698
rational
This design allows for flexibility in handling actions that may or may not be linked to a user interface component.
0
This design allows for flexibility in handling actions that may or may not be linked to a user interface component.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,699
rational
This design choice ensures that actions can be dynamically referenced and created from the plugin's configuration file.
0
This design choice ensures that actions can be dynamically referenced and created from the plugin's configuration file.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,700
Expand
This implementation manages the selection and configuration of working sets by integrating with the project configurations controller.
0
This implementation manages the selection and configuration of working sets by integrating with the project configurations controller.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,701
Expand
The implementation enqueues a message that contains the current position of the window.
0
The implementation enqueues a message that contains the current position of the window.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,702
rational
This design ensures that the window's state is accurately reported after an asynchronous removal operation.
0
This design ensures that the window's state is accurately reported after an asynchronous removal operation.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,703
Expand
This implementation manages a collection of child InputSplits, ensuring they can be instantiated properly.
0
This implementation manages a collection of child InputSplits, ensuring they can be instantiated properly.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,704
rational
This design exists to prevent data loss and facilitate recovery in case of failures.
0
This design exists to prevent data loss and facilitate recovery in case of failures.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,705
rational
The design exists to ensure that the system correctly handles error scenarios and raises exceptions as expected.
0
The design exists to ensure that the system correctly handles error scenarios and raises exceptions as expected.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,706
rational
This design allows for a consistent user experience by adapting the tooltip behavior based on the context.
0
This design allows for a consistent user experience by adapting the tooltip behavior based on the context.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,707
Expand
This class processes input data to extract specified fields based on user-defined criteria.
0
This class processes input data to extract specified fields based on user-defined criteria.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,708
rational
The design allows users to efficiently select and manipulate data fields, enhancing data processing capabilities.
0
The design allows users to efficiently select and manipulate data fields, enhancing data processing capabilities.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,709
Expand
This implementation uses the writeReplace method to control the serialization process.
0
This implementation uses the writeReplace method to control the serialization process.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,710
rational
The design exists to ensure that the object is serialized in a specific manner rather than using the default serialization.
0
The design exists to ensure that the object is serialized in a specific manner rather than using the default serialization.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,711
Expand
The implementation listens for drop events on the Make Target View and processes the dropped make targets accordingly.
0
The implementation listens for drop events on the Make Target View and processes the dropped make targets accordingly.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,712
rational
This design allows users to easily transfer make targets between different Eclipse sessions, enhancing usability.
0
This design allows users to easily transfer make targets between different Eclipse sessions, enhancing usability.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,713
rational
The design ensures that critical components can operate correctly even when certain parameters are modified.
0
The design ensures that critical components can operate correctly even when certain parameters are modified.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,714
Expand
This implementation ensures that either allThreads or groupId can be used, but not both simultaneously.
0
This implementation ensures that either allThreads or groupId can be used, but not both simultaneously.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,715
rational
This design prevents conflicts and maintains a single source for hard-coded strings to enhance maintainability.
0
This design prevents conflicts and maintains a single source for hard-coded strings to enhance maintainability.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,716
rational
It exists to ensure that a specific value of heap memory is utilized.
0
It exists to ensure that a specific value of heap memory is utilized.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,717
Expand
The memory-emulation code executes based on the specified frequency relative to the task's progress.
0
The memory-emulation code executes based on the specified frequency relative to the task's progress.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,718
rational
This design allows for controlled emulation of memory usage to optimize performance during task execution.
0
This design allows for controlled emulation of memory usage to optimize performance during task execution.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,719
Expand
This implementation runs a scheduled task that identifies and removes outdated entries and files from the shared cache.
0
This implementation runs a scheduled task that identifies and removes outdated entries and files from the shared cache.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,720
rational
The design ensures that cache management is efficient and prevents conflicts by allowing only one cleaner task to operate at a time.
0
The design ensures that cache management is efficient and prevents conflicts by allowing only one cleaner task to operate at a time.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,721
rational
This design allows for future changes in the type system without breaking the test.
0
This design allows for future changes in the type system without breaking the test.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,722
rational
The design ensures that only one instance of PDOMBinding is created per AST binding to optimize resource usage.
0
The design ensures that only one instance of PDOMBinding is created per AST binding to optimize resource usage.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,723
rational
The design allows for flexibility in referencing elements across different linkages, enhancing modularity.
0
The design allows for flexibility in referencing elements across different linkages, enhancing modularity.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,724
Expand
This implementation calculates the starting position of the attributes section in the data structure.
0
This implementation calculates the starting position of the attributes section in the data structure.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,725
rational
This design allows for efficient access to the attributes by determining their starting point.
0
This design allows for efficient access to the attributes by determining their starting point.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,726
Expand
This implementation retrieves the preceding identifier to determine its attributes.
0
This implementation retrieves the preceding identifier to determine its attributes.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,727
rational
This design exists to ensure that valid attribute values can be identified based on context.
0
This design exists to ensure that valid attribute values can be identified based on context.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,728
Expand
This implementation retrieves and stores the IP address of the current proxy object for access during debugging.
0
This implementation retrieves and stores the IP address of the current proxy object for access during debugging.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,729
Expand
This method triggers the execution process of the element from the beginning.
0
This method triggers the execution process of the element from the beginning.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,730
rational
This design allows for the reinitialization of the element's state when needed.
0
This design allows for the reinitialization of the element's state when needed.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,731
rational
The design allows for easy management and organization of test classes to be run together in a suite.
0
The design allows for easy management and organization of test classes to be run together in a suite.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,732
Expand
This method retrieves the statuses contained within the BuildMacroException as an array.
0
This method retrieves the statuses contained within the BuildMacroException as an array.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,733
rational
The design allows for easy access to the specific statuses related to the exception for better error handling.
0
The design allows for easy access to the specific statuses related to the exception for better error handling.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,734
rational
The design exists to ensure compatibility and functionality across different environments by providing fallback options.
0
The design exists to ensure compatibility and functionality across different environments by providing fallback options.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,735
Expand
This method retrieves and displays the widget located at the given index in the tabbed panel.
0
This method retrieves and displays the widget located at the given index in the tabbed panel.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,736
rational
The design allows for a clean transition between widgets by hiding the previously visible one, enhancing user experience.
0
The design allows for a clean transition between widgets by hiding the previously visible one, enhancing user experience.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,737
rational
The design exists to ensure consistency and correctness in the behavior of the binders.
0
The design exists to ensure consistency and correctness in the behavior of the binders.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,738
rational
This design exists to improve execution speed by focusing on the most frequently executed code paths.
0
This design exists to improve execution speed by focusing on the most frequently executed code paths.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,739
Expand
This class manages the loading and storage of Build Macros in an XML format.
0
This class manages the loading and storage of Build Macros in an XML format.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,740
rational
The design allows for easy persistence and retrieval of Build Macros.
0
The design allows for easy persistence and retrieval of Build Macros.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,741
Expand
This class processes data by iterating over internal structures and updating state.
0
This class processes data by iterating over internal structures and updating state.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,742
Expand
This class processes data by iterating over internal collections and updating state.
0
This class processes data by iterating over internal collections and updating state.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,743
Expand
This class processes data by iterating over internal buffers and updating state.
0
This class processes data by iterating over internal buffers and updating state.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,744
Expand
This class processes data by iterating over internal lists and updating state.
0
This class processes data by iterating over internal lists and updating state.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,745
Expand
This class processes data by iterating over internal maps and updating state.
0
This class processes data by iterating over internal maps and updating state.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,746
Expand
This class processes data by iterating over internal queues and updating state.
0
This class processes data by iterating over internal queues and updating state.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,747
Expand
This class processes data by iterating over internal arrays and updating state.
0
This class processes data by iterating over internal arrays and updating state.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,748
Expand
This class processes data by iterating over internal sets and updating state.
0
This class processes data by iterating over internal sets and updating state.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,749
Expand
This class processes data by iterating over internal objects and updating state.
0
This class processes data by iterating over internal objects and updating state.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,750
Expand
This class processes data by iterating over internal records and updating state.
0
This class processes data by iterating over internal records and updating state.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,751
Expand
This class processes data by iterating over internal elements and updating state.
0
This class processes data by iterating over internal elements and updating state.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,752
Expand
This class processes data by iterating over internal entries and updating state.
0
This class processes data by iterating over internal entries and updating state.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,753
Expand
This class processes data by iterating over internal items and updating state.
0
This class processes data by iterating over internal items and updating state.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,754
Expand
This class processes data by iterating over internal nodes and updating state.
0
This class processes data by iterating over internal nodes and updating state.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,755
Expand
This class processes data by iterating over internal components and updating state.
0
This class processes data by iterating over internal components and updating state.
[ 0, 0, 1, 0, 0, 0, 0 ]
10,756
rational
This design exists to ensure predictable behavior and avoid inconsistent system state.
0
This design exists to ensure predictable behavior and avoid inconsistent system state.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,757
rational
This design exists to ensure predictable behavior and avoid inconsistent execution state.
0
This design exists to ensure predictable behavior and avoid inconsistent execution state.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,758
rational
This design exists to ensure predictable behavior and avoid inconsistent internal state.
0
This design exists to ensure predictable behavior and avoid inconsistent internal state.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,759
rational
This design exists to ensure predictable behavior and avoid inconsistent runtime state.
0
This design exists to ensure predictable behavior and avoid inconsistent runtime state.
[ 0, 0, 0, 0, 0, 0, 1 ]
10,760
rational
This design exists to ensure predictable behavior and avoid inconsistent application state.
0
This design exists to ensure predictable behavior and avoid inconsistent application state.
[ 0, 0, 0, 0, 0, 0, 1 ]