java/util/Collections.java

69  * Java Collections Framework</a>.
80 public class Collections {
82     private Collections() {
213             return Collections.indexedBinarySearch(list, key);
215             return Collections.iteratorBinarySearch(list, key);
320             return Collections.indexedBinarySearch(list, key, c);
322             return Collections.iteratorBinarySearch(list, key, c);
728      * After invoking {@code Collections.rotate(list, 1)} (or
729      * {@code Collections.rotate(list, -4)}), {@code list} will comprise
738      *     Collections.rotate(list.subList(j, k+1), -1);
744      *     Collections.rotate(l.subList(1, 4), -1);
1965      *  Collection c = Collections.synchronizedCollection(myCollection);
2096      *  Set s = Collections.synchronizedSet(new HashSet());
2157      *  SortedSet s = Collections.synchronizedSortedSet(new TreeSet());
2167      *  SortedSet s = Collections.synchronizedSortedSet(new TreeSet());
2249      *  NavigableSet s = Collections.synchronizedNavigableSet(new TreeSet());
2259      *  NavigableSet s = Collections.synchronizedNavigableSet(new TreeSet());
2364      *  List list = Collections.synchronizedList(new ArrayList());
2533      *  Map m = Collections.synchronizedMap(new HashMap());
2713      *  SortedMap m = Collections.synchronizedSortedMap(new TreeMap());
2725      *  SortedMap m = Collections.synchronizedSortedMap(new TreeMap());
2811      *  NavigableMap m = Collections.synchronizedNavigableMap(new TreeMap());
2823      *  NavigableMap m = Collections.synchronizedNavigableMap(new TreeMap());
2995      *     Collection<String> c = Collections.checkedCollection(
4296      *     Set&lt;String&gt; s = Collections.emptySet();
4370      *     SortedSet<String> s = Collections.emptySortedSet();
4391      *     NavigableSet<String> s = Collections.emptyNavigableSet();
4419      *     List&lt;String&gt; s = Collections.emptyList();
4521      *     Map&lt;String, Date&gt; s = Collections.emptyMap();
4544      *     SortedMap<String, Date> s = Collections.emptySortedMap();
4565      *     NavigableMap<String, Date> s = Collections.emptyNavigableMap();
4916                 entrySet = Collections.<Map.Entry<K,V>>singleton(
5119      *          Arrays.sort(a, Collections.reverseOrder());
5150         private Object readResolve() { return Collections.reverseOrder(); }
5375             // Both are mere Collections. Iterate over smaller collection.
5396                // Found a common element. Collections are not disjoint.
5415      *     Collections.addAll(flavors, "Peaches 'n Plutonium", "Rocky Racoon");
5460      *    Set&lt;Object&gt; weakHashSet = Collections.newSetFromMap(