- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 50 for heddle (0.2 sec)
-
android/guava/src/com/google/common/util/concurrent/AggregateFuture.java
if (futures.isEmpty()) { handleAllCompleted(); return; } // NOTE: If we ever want to use a custom executor here, have a look at CombinedFuture as we'll // need to handle RejectedExecutionException if (allMustSucceed) { // We need fail fast, so we have to keep track of which future failed so we can propagate // the exception immediately
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 15.4K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/mylasta/direction/sponsor/FessMultipartRequestHandler.java
protected Map<String, String[]> elementsText; // =================================================================================== // Handle Request // ============== @Override public void handleRequest(final HttpServletRequest request) throws ServletException {
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 16.4K bytes - Viewed (0) -
android/guava/src/com/google/common/net/InetAddresses.java
* cause DNS services to be accessed. For this reason, you should prefer these methods as much as * possible over their JDK equivalents whenever you are expecting to handle only IP address string * literals -- there is no blocking DNS penalty for a malformed string. * * <p>When dealing with {@link Inet4Address} and {@link Inet6Address} objects as byte arrays (vis.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 44K bytes - Viewed (1) -
android/guava-tests/test/com/google/common/graph/AbstractGraphTest.java
* class. For example, testing that {@code nodes()} method returns the set of the nodes in the * graph. The following test cases are left for the subclasses to handle: * * <ul> * <li>Test cases related to whether the graph is directed or undirected. * <li>Test cases related to the specific implementation of the {@link Graph} interface. * </ul> *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
E parentElement = elementData(parentIndex); if (parentIndex != 0) { /* * This is a guard for the case of the childless aunt node. Since the end of the array is * actually the middle of the heap, a smaller childless aunt node can become a child of x * when we bubble up alternate levels, violating the invariant. */ int grandparentIndex = getParentIndex(parentIndex);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
maven-artifact/src/test/java/org/apache/maven/artifact/versioning/ComparableVersionTest.java
*/ @Test void testMng5568() { String a = "6.1.0"; String b = "6.1.0rc3"; String c = "6.1H.5-beta"; // this is the unusual version string, with 'H' in the middle checkVersionsOrder(b, a); // classical checkVersionsOrder(b, c); // now b < c, but before MNG-5568, we had b > c checkVersionsOrder(a, c); } /**
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Tue Jan 09 06:39:47 GMT 2024 - 14K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
calculateNextPermutation(); return next; } void calculateNextPermutation() { j = list.size() - 1; int s = 0; // Handle the special case of an empty list. Skip the calculation of the // next permutation. if (j == -1) { return; } while (true) { int q = c[j] + o[j];
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 22.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
} /** Returns whether arrays need to be allocated. */ @VisibleForTesting boolean needsAllocArrays() { return table == null; } /** Handle lazy allocation of arrays. */ @CanIgnoreReturnValue int allocArrays() { Preconditions.checkState(needsAllocArrays(), "Arrays already allocated"); int expectedSize = metadata;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 24K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/OrderingTest.java
Ordering<Integer> d = numbers.compound(integers); Ordering<Integer> e = integers.compound(numbers); // This works with three levels too (IDEA falsely reports errors as noted // below. Both javac and eclipse handle these cases correctly.) Ordering<Number> f = numbers.compound(objects).compound(objects); // bad IDEA Ordering<Number> g = objects.compound(numbers).compound(objects);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0)