Lines Matching defs:it
6 * This code is free software; you can redistribute it and/or modify it
12 * This code is distributed in the hope that it will be useful, but WITHOUT
55 * inconsistent with {@code equals}; it just fails to obey the general contract
60 * threads modifies the map structurally, it <em>must</em> be synchronized
82 * as it is, generally speaking, impossible to make any hard guarantees in the
85 * Therefore, it would be wrong to write a program that depended on this
92 * method. (Note however that it is possible to change mappings in the
118 * null if it uses the natural ordering of its keys.
263 * method returns {@code v}; otherwise it returns {@code null}.
267 * indicate that the map contains no mapping for the key; it's also
308 * the specified map prevents it from being stored in this map
1301 * that it copes with {@code null} o1 properly.
2081 // Otherwise, it would hide Map.Entry.
2344 // Start fixup at replacement node, if it exists.
2446 * serialize it).
2474 * deserialize it).
2509 * 1) An iterator of Map.Entries. (it != null, defaultVal == null).
2510 * 2) An iterator of keys. (it != null, defaultVal != null).
2512 * (it == null, defaultVal == null).
2513 * 4) A stream of serialized keys. (it == null, defaultVal != null).
2520 * @param it If non-null, new entries are created from entries
2524 * Exactly one of it and str should be non-null.
2533 private void buildFromSorted(int size, Iterator<?> it,
2539 it, str, defaultVal);
2559 Iterator<?> it,
2564 * Strategy: The root is the middlemost element. To get to it, we
2582 it, str, defaultVal);
2587 if (it != null) {
2589 Map.Entry<?,?> entry = (Map.Entry<?,?>)it.next();
2593 key = (K)it.next();
2614 it, str, defaultVal);