- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 102 for Heimes (0.42 sec)
-
guava-tests/test/com/google/common/util/concurrent/AbstractScheduledServiceTest.java
} public void testCustomScheduler_deadlock() throws InterruptedException, BrokenBarrierException { final CyclicBarrier inGetNextSchedule = new CyclicBarrier(2); // This will flakily deadlock, so run it multiple times to increase the flake likelihood for (int i = 0; i < 1000; i++) { Service service = new AbstractScheduledService() { @Override protected void runOneIteration() {}
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 22.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/Iterators.java
@Override T transform(@ParametricNullness F from) { return function.apply(from); } }; } /** * Advances {@code iterator} {@code position + 1} times, returning the element at the {@code * position}th position. * * @param position position of the element to return * @return the element at the specified position in {@code iterator}
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jan 30 00:14:39 GMT 2024 - 50.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
* @since 24.0 */ @Override Set<EndpointPair<N>> incidentEdges(N node); /** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableListMultimap.java
* .putAll("several", 1, 2, 3) * .putAll("many", 1, 2, 3, 4, 5) * .build(); * }</pre> * * <p>Builder instances can be reused; it is safe to call {@link #build} multiple times to build * multiple multimaps in series. Each multimap contains the key-value mappings in the previously * created multimaps. * * @since 2.0 */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 17.6K bytes - Viewed (0) -
src/main/java/jcifs/smb/SmbResourceLocatorImpl.java
* referrals. Nested resources will inherit the information already resolved by the parent resource. * * Invariant: * A directory resource must have a trailing slash/backslash for both URL and UNC path at all times. * * @author mbechler * */ class SmbResourceLocatorImpl implements SmbResourceLocatorInternal, Cloneable { private static final Logger log = LoggerFactory.getLogger(SmbResourceLocatorImpl.class);
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Sat Jul 20 08:24:53 GMT 2019 - 23.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Maps.java
* That could change behavior if the input maps use different equivalence relations (and so * a key that appears once in `right` might appear multiple times in `left`). We don't * guarantee behavior in that case, anyway, and the current behavior is likely undesirable. * So that's either a reason to feel free to change it or a reason to not bother thinking
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 159.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/Iterables.java
* should use an explicit {@code break} or be certain that you will eventually remove all the * elements. * * <p>To cycle over the iterable {@code n} times, use the following: {@code * Iterables.concat(Collections.nCopies(n, iterable))} * * <p><b>Java 8+ users:</b> The {@code Stream} equivalent of this method is {@code
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 42.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMultiset.java
* .addCopies(Bean.RED, 8) * .addCopies(Bean.BLACK_EYED, 10) * .build(); * }</pre> * * <p>Builder instances can be reused; it is safe to call {@link #build} multiple times to build * multiple multisets in series. * * @since 2.0 */ public static class Builder<E> extends ImmutableCollection.Builder<E> { /*
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 22.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/HashTestUtils.java
int same = 0x0; // bitset for output bits with same values int diff = 0x0; // bitset for output bits with different values int count = 0; // originally was 2 * Math.log(...), making it try more times to avoid flakiness issues int maxCount = (int) (4 * Math.log(2 * keyBits * hashBits) + 1); while (same != 0xffffffff || diff != 0xffffffff) { int key1 = rand.nextInt(); // flip input bit for key2
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 25.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Tables.java
* * <p>The function is applied lazily, invoked when needed. This is necessary for the returned * table to be a view, but it means that the function will be applied many times for bulk * operations like {@link Table#containsValue} and {@code Table.toString()}. For this to perform * well, {@code function} should be fast. To avoid lazy evaluation when the returned table doesn't
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Mar 04 22:45:41 GMT 2024 - 26.1K bytes - Viewed (0)