Skip to content

added javadoc clarifying hashCode() requirements #140

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Sep 12, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
Expand Up @@ -37,6 +37,12 @@
* This map implementation internally uses {@link Lazy} references internally,
* to enable automatic partial loading of it's content.
* <br><br>
* <b>
* This Map implementation requires the key objects to implement the hashCode()
* in a manner that guarantees consistent, identical hash values from one execution of an
* application to another execution of the same application.
* </b>
* <br><br>
* Internally the key value pairs are kept in segments that are controlled by
* {@link Lazy} references. The maxSegmentSize define the maximal desired number of
* key / value pairs to be kept in a single segment. When loading data all elements of a segment
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -22,6 +22,12 @@

/**
* Implementation of the {@code Set} interface, backed by a {@link LazyHashMap}
* <br><br>
* <b>
* This Set implementation requires the objects that are added to the set to implement the hashCode()
* in a manner that guarantees consistent, identical hash values from one execution of an
* application to another execution of the same application.
* </b>
*
* @param <T> Type of contained elements
*/
Expand Down
Loading