HashSet < E > function ( int arg0 ) { return new HashSet < E > ( arg0 ) ; }
creates a hashset instance , with a high enough `` initial capacity `` that it should hold expectedsize elements without growth.this behavior can not be broadly guaranteed , but it is observed to be true for openjdk 1.6 . it also ca n't be guaranteed that the method is n't inadvertently oversizing the returned set . concode_field_sep PlaceHolder placeHolder concode_field_sep HashSet<E> newHashSet concode_elem_sep HashSet<E> newHashSet concode_elem_sep HashSet<E> newHashSet concode_elem_sep HashSet<E> newHashSet concode_elem_sep Set<E> newSetFromMap concode_elem_sep LinkedHashSet<E> newLinkedHashSet concode_elem_sep CopyOnWriteArraySet<E> newCopyOnWriteArraySet concode_elem_sep Set<E> newIdentityHashSet