Lines Matching defs:map
177 AbstractMapIterator(TreeMap<K, V> map, Node<K, V> startNode, int startOffset) {
178 backingMap = map;
179 expectedModCount = map.modCount;
184 AbstractMapIterator(TreeMap<K, V> map, Node<K, V> startNode) {
185 this(map, startNode, startNode != null ?
189 AbstractMapIterator(TreeMap<K, V> map) {
190 this(map, minimum(map.root));
234 UnboundedEntryIterator(TreeMap<K, V> map, Node<K, V> startNode, int startOffset) {
235 super(map, startNode, startOffset);
238 UnboundedEntryIterator(TreeMap<K, V> map) {
239 super(map);
252 UnboundedKeyIterator(TreeMap<K, V> map, Node<K, V> startNode, int startOffset) {
253 super(map, startNode, startOffset);
256 UnboundedKeyIterator(TreeMap<K, V> map) {
257 super(map);
269 UnboundedValueIterator(TreeMap<K, V> map, Node<K, V> startNode, int startOffset) {
270 super(map, startNode, startOffset);
273 UnboundedValueIterator(TreeMap<K, V> map) {
274 super(map);
288 BoundedMapIterator(Node<K, V> startNode, int startOffset, TreeMap<K, V> map,
290 super(map, finalNode==null? null : startNode, startOffset);
295 BoundedMapIterator(Node<K, V> startNode, TreeMap<K, V> map,
299 map, finalNode, finalOffset);
303 TreeMap<K, V> map, Node<K, V> finalNode) {
304 this(startNode, startOffset, map, finalNode,
319 public BoundedEntryIterator(Node<K, V> startNode, int startOffset, TreeMap<K, V> map,
321 super(startNode, startOffset, map, finalNode, finalOffset);
334 public BoundedKeyIterator(Node<K, V> startNode, int startOffset, TreeMap<K, V> map,
336 super(startNode, startOffset, map, finalNode, finalOffset);
348 public BoundedValueIterator(Node<K, V> startNode, int startOffset, TreeMap<K, V> map,
350 super(startNode, startOffset, map, finalNode, finalOffset);
375 SubMap(K start, TreeMap<K, V> map) {
376 backingMap = map;
381 SubMap(K start, TreeMap<K, V> map, K end) {
382 backingMap = map;
388 SubMap(TreeMap<K, V> map, K end) {
389 backingMap = map;
806 SubMapEntrySet(SubMap<K, V> map) {
807 subMap = map;
869 SubMapKeySet(SubMap<K, V> map) {
870 subMap = map;
982 * the specified map and using natural ordering.
984 * @param map
987 * if a key in the specified map does not implement the
988 * Comparable interface, or if the keys in the map cannot be
991 public TreeMap(Map<? extends K, ? extends V> map) {
992 putAll(map);
999 * @param map
1002 public TreeMap(SortedMap<K, ? extends V> map) {
1003 this(map.comparator());
1005 Iterator<? extends Map.Entry<K, ? extends V>> it = map.entrySet().iterator();
1088 * Returns the comparator used to compare elements in this map.
1097 * Returns whether this map contains the specified key.
1101 * @return {@code true} if this map contains the specified key,
1105 * map.
1153 * Returns whether this map contains the specified value.
1157 * @return {@code true} if this map contains the specified value,
1193 * Returns a set containing all of the mappings in this map. Each mapping is
1194 * an instance of {@link Map.Entry}. As the set is backed by this map,
1247 * Returns the first key in this map.
1249 * @return the first key in this map.
1251 * if this map is empty.
1269 * if the key cannot be compared with the keys in this map.
1322 * Returns a sorted map over a range of this sorted map with all keys that
1324 * sorted map are reflected in this sorted map and vice versa.
1326 * Note: The returned map will not allow an insertion of a key outside the
1331 * @return a sorted map where the keys are less than {@code endKey}.
1334 * map.
1339 * if this map is itself a sorted map over a range of another
1340 * map and the specified key is outside of its range.
1353 * Returns a set of the keys contained in this map. The set is backed by
1354 * this map so changes to one are reflected by the other. The set does not
1397 * Returns the last key in this map.
1399 * @return the last key in this map.
1401 * if this map is empty.
1442 * map.
1812 * Copies all the mappings in the given map to this map. These mappings will
1813 * replace all mappings that this map had for any of the keys currently in
1814 * the given map.
1816 * @param map
1817 * the map to copy mappings from.
1819 * if a key in the specified map cannot be compared with the
1820 * keys in this map.
1822 * if a key in the specified map is {@code null} and the
1826 public void putAll(Map<? extends K, ? extends V> map) {
1827 super.putAll(map);
1831 * Removes the mapping with the specified key from this map.
1839 * map.
2258 * Returns the number of mappings in this map.
2260 * @return the number of mappings in this map.
2268 * Returns a sorted map over a range of this sorted map with all keys
2270 * specified {@code endKey}. Changes to the returned sorted map are
2271 * reflected in this sorted map and vice versa.
2273 * Note: The returned map will not allow an insertion of a key outside the
2280 * @return a sorted map with the key from the specified range.
2283 * this map.
2288 * if the start key is greater than the end key, or if this map
2289 * is itself a sorted map over a range of another sorted map and
2306 * Returns a sorted map over a range of this sorted map with all keys that
2308 * the returned sorted map are reflected in this sorted map and vice versa.
2310 * Note: The returned map will not allow an insertion of a key outside the
2315 * @return a sorted map where the keys are greater or equal to
2319 * map.
2324 * if this map itself a sorted map over a range of another map
2338 * Returns a collection of the values contained in this map. The collection
2339 * is backed by this map so changes to one are reflected by the other. The
2345 * "wrapper object" over the iterator of map's entrySet(). The {@code size}
2346 * method wraps the map's size method and the {@code contains} method wraps
2347 * the map's containsValue method.
2354 * @return a collection of the values contained in this map.