Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for diffRes (0.09 sec)

  1. android/guava/src/com/google/common/util/concurrent/Futures.java

       * input futures, if all succeed.
       *
       * <p>The list of results is in the same order as the input list.
       *
       * <p>This differs from {@link #successfulAsList(ListenableFuture[])} in that it will return a
       * failed future if any of the items fails.
       *
       * <p>Canceling this future will attempt to cancel all the component futures, and if any of the
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 64.3K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/collect/IteratorsTest.java

        a = ImmutableList.of(4, 8, 15, 16, 23, 42);
        b = asList(4, 8, 15, 16, 23, 42);
        assertTrue(elementsEqual(a.iterator(), b.iterator()));
    
        // An element differs.
        a = asList(4, 8, 15, 12, 23, 42);
        b = asList(4, 8, 15, 16, 23, 42);
        assertFalse(elementsEqual(a.iterator(), b.iterator()));
    
        // null versus non-null.
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 54.4K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/collect/IteratorsTest.java

        a = ImmutableList.of(4, 8, 15, 16, 23, 42);
        b = asList(4, 8, 15, 16, 23, 42);
        assertTrue(elementsEqual(a.iterator(), b.iterator()));
    
        // An element differs.
        a = asList(4, 8, 15, 12, 23, 42);
        b = asList(4, 8, 15, 16, 23, 42);
        assertFalse(elementsEqual(a.iterator(), b.iterator()));
    
        // null versus non-null.
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 54.4K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/collect/MapMakerInternalMap.java

       * hash functions. This is critical when the concurrent hash map uses power-of-two length hash
       * tables, that otherwise encounter collisions for hash codes that do not differ in lower or upper
       * bits.
       *
       * @param h hash code
       */
      static int rehash(int h) {
        // Spread bits to regularize both segment and index locations,
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 90K bytes
    - Viewed (0)
Back to top