{@link Map} interface. L106: */ L107: @Override L108: Set<V> values(); L109: L110: /** L111: * Returns the inverse view of this bimap, which maps each of this bimap's values to its L112: * associated key. The two bimaps are backed by the same data; any changes to one will appear in L113: * the other. L114: * L115: * <p><b>Note:</b>There is no guaranteed correspondence between the iteration order of a bimap and L116: * that of its inverse. L117: * L118: * @return the inverse view...

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:...

AbstractIteratorTest extends TestCase { L39: L40: public void testDefaultBehaviorOfNextAndHasNext() { L41: L42: // This sample AbstractIterator returns 0 on the first call, 1 on the L43: // second, then signals that it's reached the end of the data L44: Iterator<Integer> iter = L45: new AbstractIterator<Integer>() { L46: private int rep; L47: L48: @Override L49: public Integer computeNext() { L50: switch (rep++) { L51: case 0: L52:...

return new CompactLinkedHashMap<>(); L62: } L63: L64: /** L65: * Creates a {@code CompactLinkedHashMap} instance, with a high enough "initial capacity" that it L66: * <i>should</i> hold {@code expectedSize} elements without rebuilding internal data structures. L67: * L68: * @param expectedSize the number of elements you expect to add to the returned set L69: * @return a new, empty {@code CompactLinkedHashMap} with enough capacity to hold {@code L70: * expectedSize} elements without...

of the dataset. There is a L109: * worst case time complexity of O(N^2). You are extremely unlikely to hit this quadratic case on L110: * randomly ordered data (the probability decreases faster than exponentially in N), but if you are L111: * passing in unsanitized user data then a malicious user could force it. A light shuffle of the L112: * data using an unpredictable seed should normally be enough to thwart this attack. L113: * L114: * <p>The time taken to compute multiple quantiles on the same...

xactly("bar.com", "������.co.jp") L217: } L218: L219: assertThat(verifier.verify("foo.com", session)).isFalse() L220: assertThat(verifier.verify("a.foo.com", session)).isFalse() L221: // these checks test alternative subjects. The test data contains an L222: // alternative subject starting with a japanese kanji character. This is L223: // not supported by Android because the underlying implementation from L224: // harmony follows the definition from rfc 1034 page 10 for alternative...

call, to append L329: * more values and build again. L330: * L331: * <p><b>Performance note:</b> the returned array is backed by the same array as the builder, so L332: * no data is copied as part of this step, but this may occupy more memory than strictly L333: * necessary. To copy the data to a right-sized backing array, use {@code .build().trimmed()}. L334: */ L335: public ImmutableIntArray build() { L336: return count == 0 ? EMPTY : new ImmutableIntArray(array,...

e L230: boolean setCount(@ParametricNullness E element, int oldCount, int newCount); L231: L232: // Views L233: L234: /** L235: * Returns the set of distinct elements contained in this multiset. The element set is backed by L236: * the same data as the multiset, so any change to either is immediately reflected in the other. L237: * The order of the elements in the element set is unspecified. L238: * L239: * <p>If the element set supports any removal operations, these necessarily cause...

com/kubernetes/kubernetes/pull/29006), [@jsafrane](https://github.com/jsafrane)) L1211:* Allow setting permission mode bits on secrets, configmaps and downwardAPI files ([#28936](https://github.com/kubernetes/kubernetes/pull/28936), [@rata](https://github.com/rata)) L1212:* Skip safe to detach check if node API object no longer exists ([#30737](https://github.com/kubernetes/kubernetes/pull/30737), [@saad-ali](https://github.com/saad-ali)) L1213:* The Kubelet now supports the `--require-kubeconfig`...

caseDesc, Method method) { L85: super(factory, string, suiteName, caseDesc, method); L86: this.expectedLines = getLines(expected); L87: } L88: L89: @Override L90: protected void setUp() throws Exception { L91: this.source = factory.createSource(data); L92: } L93: L94: public void testOpenStream() throws IOException { L95: Reader reader = source.openStream(); L96: L97: StringWriter writer = new StringWriter(); L98: char[] buf = new char[64]; L99: int read; L100: while ((read =...