L117: // it. To preserve FIFO order and failure atomicity of rejected execution when the same L118: // Runnable is executed more than once, allocate a wrapper that we know is safe to remove by L119: // object identity. L120: // A data structure that returned a removal handle from add() would allow eliminating this L121: // allocation. L122: submittedTask = L123: new Runnable() { L124: @Override L125: public void run() { L126: ...

input to read L62: * @return a long of a concatenated 8 bytes L63: */ L64: static long load64Safely(byte[] input, int offset, int length) { L65: long result = 0; L66: // Due to the way we shift, we can stop iterating once we've run out of data, the rest L67: // of the result already being filled with zeros. L68: L69: // This loop is critical to performance, so please check HashBenchmark if altering it. L70: int limit = min(length, 8); L71: for (int i = 0; i < limit; i++) { L72:...

ons.CanIgnoreReturnValue; L23:import java.util.AbstractSet; L24:import java.util.Iterator; L25:import java.util.Map; L26:import java.util.Map.Entry; L27:import java.util.Set; L28:import javax.annotation.CheckForNull; L29: L30:/** L31: * A map-like data structure that wraps a backing map and caches values while iterating through L32: * {@link #unmodifiableKeySet()}. By design, the cache is cleared when this structure is mutated. If L33: * this structure is never mutated, it provides a thread-safe...

L18: L19:import com.google.common.annotations.Beta; L20:import com.google.errorprone.annotations.DoNotMock; L21: L22:/** L23: * A functional interface for <a L24: * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data. L25: * L26: * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as L27: * topological sort) that only need a way of accessing the predecessors of a node in a graph. L28: * L29: * <h3>Usage</h3> L30: * L31:...

(); L881: keyToKeyList = Maps.newLinkedHashMap(); L882: int size = stream.readInt(); L883: for (int i = 0; i < size; i++) { L884: @SuppressWarnings("unchecked") // reading data stored by writeObject L885: K key = (K) stream.readObject(); L886: @SuppressWarnings("unchecked") // reading data stored by writeObject L887: V value = (V) stream.readObject(); L888: put(key, value); L889: } L890: } L891: L892: @GwtIncompatible // java serialization not supported L893:...

");var a=b.createDocumentFragment();return"undefined"==typeof a.cloneNode||"undefined"==typeof a.createDocumentFragment||"undefined"==typeof a.createElement}()}catch(c){k=!0,l=!0}}();var t={elements:n.elements||"abbr article aside audio bdi canvas data datalist details dialog figcaption figure footer header hgroup main mark meter nav output picture progress section summary template time video",version:m,shivCSS:n.shivCSS!==!1,supportsUnknownElements:l,shivMethods:n.shivMethods!==!1,type:"default...

ting; L18: L19:import com.google.common.annotations.GwtCompatible; L20:import java.util.ArrayList; L21:import java.util.Arrays; L22:import java.util.Collection; L23:import java.util.Collections; L24: L25:/** L26: * An {@link ClusterException} is a data structure that allows for some code to "throw multiple L27: * exceptions", or something close to it. The prototypical code that calls for this class is L28: * presented below: L29: * L30: * <pre> L31: * void runManyThings({@literal List<ThingToRun>}...

* constant ({@code application/cbor}) is used for the Concise Binary Object Representation (CBOR) L465: * data format. L466: * L467: * @since NEXT L468: */ L469: public static final MediaType CBOR = createConstant(APPLICATION_TYPE, "cbor"); L470: L471: /** L472: * Media type for the <a href="https://tools.ietf.org/html/rfc7946">GeoJSON Format</a>, a L473: * geospatial data interchange format based on JSON. L474: * L475: * @since 28.0 L476: */ L477: public static final MediaType...

count(@CheckForNull Object element) { L146: AtomicInteger existingCounter = safeGet(countMap, element); L147: return (existingCounter == null) ? 0 : existingCounter.get(); L148: } L149: L150: /** L151: * {@inheritDoc} L152: * L153: * <p>If the data in the multiset is modified by any other threads during this method, it is L154: * undefined which (if any) of these modifications will be reflected in the result. L155: */ L156: @Override L157: public int size() { L158: long sum = 0L; L159:...

given row key may be viewed as a {@link Map} whose keys are L36: * the columns. The reverse is also available, associating a column with a row key / value map. Note L37: * that, in some implementations, data access by column key may have fewer supported operations or L38: * worse performance than data access by row key. L39: * L40: * <p>The methods returning collections or maps always return views of the underlying table. L41: * Updating the table can change the contents of those collections, and updating...