H A D | Collections.java | 238 * @param key the key to be searched for. 239 * @return the index of the search key, if it is contained in the list; 242 * key would be inserted into the list: the index of the first 243 * element greater than the key, or <tt>list.size()</tt> if all 244 * elements in the list are less than the specified key. Note 246 * and only if the key is found. 249 * integers), or the search key is not mutually comparable 253 int binarySearch(List<? extends Comparable<? super T>> list, T key) { argument 255 return Collections.indexedBinarySearch(list, key); 261 indexedBinarySearch(List<? extends Comparable<? super T>> list, T key) argument 281 iteratorBinarySearch(List<? extends Comparable<? super T>> list, T key) argument 357 binarySearch(List<? extends T> list, T key, Comparator<? super T> c) argument 367 indexedBinarySearch(List<? extends T> l, T key, Comparator<? super T> c) argument 386 iteratorBinarySearch(List<? extends T> l, T key, Comparator<? super T> c) argument 1494 containsKey(Object key) argument 1496 get(Object key) argument 1498 put(K key, V value) argument 1501 remove(Object key) argument 1556 putIfAbsent(K key, V value) argument 1561 remove(Object key, Object value) argument 1566 replace(K key, V oldValue, V newValue) argument 1571 replace(K key, V value) argument 1576 computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) argument 1581 computeIfPresent(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) argument 1587 compute(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) argument 1593 merge(K key, V value, BiFunction<? super V, ? super V, ? extends V> remappingFunction) argument 1920 lowerKey(K key) argument 1921 floorKey(K key) argument 1922 ceilingKey(K key) argument 1923 higherKey(K key) argument 1926 lowerEntry(K key) argument 1934 floorEntry(K key) argument 1942 ceilingEntry(K key) argument 1951 higherEntry(K key) argument 2621 containsKey(Object key) argument 2627 get(Object key) argument 2631 put(K key, V value) argument 2634 remove(Object key) argument 2698 putIfAbsent(K key, V value) argument 2702 remove(Object key, Object value) argument 2706 replace(K key, V oldValue, V newValue) argument 2710 replace(K key, V value) argument 2714 computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) argument 2719 computeIfPresent(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) argument 2724 compute(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) argument 2729 merge(K key, V value, BiFunction<? super V, ? super V, ? extends V> remappingFunction) argument 2908 lowerEntry(K key) argument 2910 lowerKey(K key) argument 2912 floorEntry(K key) argument 2914 floorKey(K key) argument 2916 ceilingEntry(K key) argument 2918 ceilingKey(K key) argument 2920 higherEntry(K key) argument 2922 higherKey(K key) argument 3617 typeCheck(Object key, Object value) argument 3635 badKeyMsg(Object key) argument 3653 containsKey(Object key) argument 3655 get(Object key) argument 3656 remove(Object key) argument 3664 put(K key, V value) argument 3710 putIfAbsent(K key, V value) argument 3716 remove(Object key, Object value) argument 3721 replace(K key, V oldValue, V newValue) argument 3727 replace(K key, V value) argument 3733 computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) argument 3744 computeIfPresent(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) argument 3750 compute(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) argument 3756 merge(K key, V value, BiFunction<? super V, ? super V, ? extends V> remappingFunction) argument 4097 lowerEntry(K key) argument 4104 lowerKey(K key) argument 4106 floorEntry(K key) argument 4113 floorKey(K key) argument 4115 ceilingEntry(K key) argument 4122 ceilingKey(K key) argument 4124 higherEntry(K key) argument 4131 higherKey(K key) argument 4624 containsKey(Object key) argument 4626 get(Object key) argument 4655 putIfAbsent(K key, V value) argument 4660 remove(Object key, Object value) argument 4665 replace(K key, V oldValue, V newValue) argument 4670 replace(K key, V value) argument 4675 computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) argument 4681 computeIfPresent(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) argument 4687 compute(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) argument 4693 merge(K key, V value, BiFunction<? super V, ? super V, ? extends V> remappingFunction) argument 4901 singletonMap(K key, V value) argument 4916 SingletonMap(K key, V value) argument 4923 containsKey(Object key) argument 4925 get(Object key) argument 4952 getOrDefault(Object key, V defaultValue) argument 4967 putIfAbsent(K key, V value) argument 4972 remove(Object key, Object value) argument 4977 replace(K key, V oldValue, V newValue) argument 4982 replace(K key, V value) argument 4987 computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) argument 4993 computeIfPresent(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) argument 4999 compute(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) argument 5005 merge(K key, V value, BiFunction<? super V, ? super V, ? extends V> remappingFunction) argument [all...] |