return new LinkedHashSet<T>(c);
if (c instanceof Set) { return (Set<T>) c; LinkedHashSet<T> set = new LinkedHashSet<T>(c); return set;
HashSet<T> ret = new HashSet<T>(); ret.addAll(c); return ret;
if (elements == null || elements.length == 0) { return Collections.emptySet(); LinkedHashSet<E> set = new LinkedHashSet<E>(elements.length * 4 / 3 + 1); Collections.addAll(set, elements); return set;
if (pEntities != null) { Set<E> entities = new HashSet<>(); for (E entity : pEntities) { entities.add(entity); return entities; return Collections.emptySet(); ...
if (elements == null) { return new HashSet<>(0); final Set<E> set = new HashSet<>(elements.length); Collections.addAll(set, elements); return Collections.unmodifiableSet(set);
final Set<T> set = new HashSet<T>(ts.length + 1); set.add(t); Collections.addAll(set, ts); return set;
Set<T> arraySet = new HashSet<T>(array.length); Collections.addAll(arraySet, array); return arraySet;
Set<Integer> s = new HashSet<Integer>(); for (int v : values) { s.add(v); return s;
final HashSet<T> set = new HashSet<>(); return asSet(iteratable, set);