code: public static <E extends Comparable<?>> TreeSet<E> newTreeSet(Iterable<? extends E> elements) {
  		TreeSet<E> set = newTreeSet();
  		for (E element : elements) {
  			set.add(element);
  		}
  		return set;
  	}
docs: Creates a <i>mutable</i> {@code TreeSet} instance containing the given elements sorted by their natural ordering.
  
  @param elements the elements that the set should contain
  @return a new {@code TreeSet} containing those elements (minus duplicates)