Lines Matching full:code
75 // http://code.google.com/p/google-web-toolkit/issues/detail?id=3028
89 * @param elements the elements, all of the same {@code enum} type, that the
93 // http://code.google.com/p/google-web-toolkit/issues/detail?id=3028
114 * Returns a new {@code EnumSet} instance containing the given elements.
117 * just a {@code Collection}.
143 * Creates a <i>mutable</i>, empty {@code HashSet} instance.
148 * <p><b>Note:</b> if {@code E} is an {@link Enum} type, use {@link
151 * @return a new, empty {@code HashSet}
158 * Creates a <i>mutable</i> {@code HashSet} instance containing the given
164 * <p><b>Note:</b> if {@code E} is an {@link Enum} type, use {@link
168 * @return a new {@code HashSet} containing those elements (minus duplicates)
178 * Creates an empty {@code HashSet} instance with enough capacity to hold the
182 * @return a new, empty {@code HashSet} with enough capacity to hold {@code
184 * @throws IllegalArgumentException if {@code expectedSize} is negative
191 * Creates a <i>mutable</i> {@code HashSet} instance containing the given
197 * <p><b>Note:</b> if {@code E} is an {@link Enum} type, use
201 * @return a new {@code HashSet} containing those elements (minus duplicates)
214 * Creates a <i>mutable</i> {@code HashSet} instance containing the given
220 * <p><b>Note:</b> if {@code E} is an {@link Enum} type, you should create an
224 * @return a new {@code HashSet} containing those elements (minus duplicates)
237 * Creates a <i>mutable</i>, empty {@code LinkedHashSet} instance.
242 * @return a new, empty {@code LinkedHashSet}
249 * Creates a <i>mutable</i> {@code LinkedHashSet} instance containing the
256 * @return a new {@code LinkedHashSet} containing those elements (minus
277 * Creates a <i>mutable</i>, empty {@code TreeSet} instance sorted by the
283 * @return a new, empty {@code TreeSet}
291 * Creates a <i>mutable</i> {@code TreeSet} instance containing the given
297 * <p><b>Note:</b> If {@code elements} is a {@code SortedSet} with an explicit
299 * {@link TreeSet#TreeSet(SortedSet)}, which returns a {@code TreeSet} with
303 * @return a new {@code TreeSet} containing those elements (minus duplicates)
316 * Creates a <i>mutable</i>, empty {@code TreeSet} instance with the given
319 * <p><b>Note:</b> if mutability is not required, use {@code
323 * @return a new, empty {@code TreeSet}
324 * @throws NullPointerException if {@code comparator} is null
331 * Creates an {@code EnumSet} consisting of all enum values that are not in
340 * @return a new, modifiable {@code EnumSet} containing all values of the enum
342 * @throws IllegalArgumentException if {@code collection} is not an
343 * {@code EnumSet} instance and contains no elements
357 * Creates an {@code EnumSet} consisting of all enum values that are not in
363 * {@code EnumSet}
365 * @return a new, modifiable {@code EnumSet} initially containing all the
409 * in the following code fragment: <pre> {@code
415 * {@code Collections.newSetFromMap()}. The returned set is serializable if
498 * retain a reference of type {@code SetView}; typically, you either use it
500 * {@link #copyInto} and forget the {@code SetView} itself.
520 * method has equivalent behavior to {@code set.addAll(this)}, assuming that
523 * @return a reference to {@code set}, for convenience
537 * {@code set1}, then over each element of {@code set2}, in order, that is not
538 * contained in {@code set1}.
540 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
544 * <p><b>Note:</b> The returned view performs better when {@code set1} is the
587 * The iteration order of the returned set matches that of {@code set1}.
589 * <p>Results are undefined if {@code set1} and {@code set2} are sets based
590 * on different equivalence relations (as {@code HashSet}, {@code TreeSet},
591 * and the keySet of an {@code IdentityHashMap} all are).
593 * <p><b>Note:</b> The returned view performs slightly better when {@code
598 * you to make a cast, for example: <pre> {@code
641 * returned set contains all elements that are contained by {@code set1} and
642 * not contained by {@code set2}. {@code set2} may also contain elements not
643 * present in {@code set1}; these are simply ignored. The iteration order of
644 * the returned set matches that of {@code set1}.
646 * <p>Results are undefined if {@code set1} and {@code set2} are sets based
647 * on different equivalence relations (as {@code HashSet}, {@code TreeSet},
648 * and the keySet of an {@code IdentityHashMap} all are).
676 * Returns the elements of {@code unfiltered} that satisfy a predicate. The
677 * returned set is a live view of {@code unfiltered}; changes to one affect
680 * <p>The resulting set's iterator does not support {@code remove()}, but all
681 * other set methods are supported. The set's {@code add()} and
682 * {@code addAll()} methods throw an {@link IllegalArgumentException} if an
684 * as {@code removeAll()} and {@code clear()} are called on the filtered set,
689 * {@code unfiltered} is.
691 * <p>Many of the filtered set's methods, such as {@code size()}, iterate
694 * to copy {@code Iterables.filter(unfiltered, predicate)} and use the copy.
731 * product</a>" of the sets. For example: <pre class="code"> {@code
740 * <li>{@code ImmutableList.of(1, "A")}
741 * <li>{@code ImmutableList.of(1, "B")}
742 * <li>{@code ImmutableList.of(1, "C")}
743 * <li>{@code ImmutableList.of(2, "A")}
744 * <li>{@code ImmutableList.of(2, "B")}
745 * <li>{@code ImmutableList.of(2, "C")}
762 * @throws NullPointerException if {@code sets}, any one of the {@code sets},
776 * product</a>" of the sets. For example: <pre class="code"> {@code
785 * <li>{@code ImmutableList.of(1, "A")}
786 * <li>{@code ImmutableList.of(1, "B")}
787 * <li>{@code ImmutableList.of(1, "C")}
788 * <li>{@code ImmutableList.of(2, "A")}
789 * <li>{@code ImmutableList.of(2, "B")}
790 * <li>{@code ImmutableList.of(2, "C")}
807 * @throws NullPointerException if {@code sets}, any one of the {@code sets},
940 * Calculates and returns the hash code of {@code s}.
