|
gptkbp:instance_of
|
gptkb:collection
|
|
gptkbp:bfsLayer
|
4
|
|
gptkbp:bfsParent
|
gptkb:Set_interface
|
|
gptkbp:allows
|
gptkb:theorem
|
|
gptkbp:available_sizes
|
size() method
|
|
gptkbp:can_be
|
any object that is not a duplicate
|
|
gptkbp:can_be_extended_by
|
gptkb:Linked_Hash_Set
|
|
gptkbp:can_be_used_with
|
Generics
Lambda expressions
other collections
|
|
gptkbp:can_create
|
another collection
new Hash Set() constructor
|
|
gptkbp:communication
|
gptkb:theorem
a file
|
|
gptkbp:formulation
|
gptkb:Police_Department
for-each loop
|
|
gptkbp:has_transformation
|
Array using to Array() method
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Hash Set
|
|
gptkbp:hyper_threading
|
gptkb:theorem
|
|
gptkbp:is_available_on
|
gptkb:Java_1.2
|
|
gptkbp:is_implemented_in
|
gptkb:Java
Sets in mathematics
|
|
gptkbp:is_often_compared_to
|
Tree Set
|
|
gptkbp:is_often_used_in
|
gptkb:Algorithms
Functional programming
Web applications
Game development
|
|
gptkbp:is_part_of
|
gptkb:Java_Collections_Framework
gptkb:software
gptkb:language
gptkb:Java_Enhancement_Proposal
|
|
gptkbp:is_reflected_in
|
gptkb:theorem
|
|
gptkbp:is_used_for
|
Count unique occurrences
Implement hash tables
Removing duplicates from a list
Storing unique elements
Track unique items in a collection
|
|
gptkbp:is_used_in
|
Data structures
Database applications
Caching mechanisms
Concurrent programming with care
|
|
gptkbp:is_utilized_in
|
clear() method
|
|
gptkbp:order
|
gptkb:theorem
|
|
gptkbp:performance
|
O(1) for add, remove, contains
|
|
gptkbp:publishes
|
gptkb:theorem
|
|
gptkbp:sponsor
|
gptkb:currency
|
|
gptkbp:suitable_for
|
Array List for unique elements
Ordered operations
Sorted data
|