Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 5 of 5 for blibby (0.06 seconds)

  1. guava-tests/test/com/google/common/base/EnumsTest.java

          shadowConstants.add(result.get());
        }
        assertEquals(ImmutableSet.<Object>copyOf(shadowTestEnum.getEnumConstants()), shadowConstants);
        Optional<TestEnum> result = Enums.getIfPresent(shadowTestEnum, "blibby");
        assertThat(result).isAbsent();
        return new WeakReference<>(shadowLoader);
      }
    
      public void testStringConverter_convert() {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 11 20:07:52 GMT 2025
    - 8.3K bytes
    - Click Count (0)
  2. android/guava-tests/test/com/google/common/collect/MultimapsTest.java

            new ImmutableListMultimap.Builder<Integer, String>()
                .put(4, "Inky")
                .put(6, "Blinky")
                .put(5, "Pinky")
                .put(5, "Pinky")
                .put(5, "Clyde")
                .build();
    
        List<String> badGuys = Arrays.asList("Inky", "Blinky", "Pinky", "Pinky", "Clyde");
        Function<String, Integer> stringLengthFunction =
            new Function<String, Integer>() {
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Oct 28 16:03:47 GMT 2025
    - 38.9K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/collect/Multimaps.java

       * List<String> badGuys =
       *     Arrays.asList("Inky", "Blinky", "Pinky", "Pinky", "Clyde");
       * Function<String, Integer> stringLengthFunction = ...;
       * Multimap<Integer, String> index =
       *     Multimaps.index(badGuys, stringLengthFunction);
       * System.out.println(index);
       * }
       *
       * <p>prints
       *
       * {@snippet :
       * {4=[Inky], 6=[Blinky], 5=[Pinky, Pinky, Clyde]}
       * }
       *
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Sep 22 18:35:44 GMT 2025
    - 86.5K bytes
    - Click Count (0)
  4. lib/fips140/v1.0.0-c2097c7c.zip

    // compiler hint T := make([]uint, n*2) var c uint for i := 0; i < n; i++ { d := bLimbs[i] c1 := addMulVVW1024(&T[i], &aLimbs[0], d) Y := T[i] * m.m0inv c2 := addMulVVW1024(&T[i], &mLimbs[0], Y) T[n+i], c = bits.Add(c1, c2, c) } copy(x.reset(n).limbs, T[n:]) x.maybeSubtractModulus(choice(c), m) case 1536 / _W: const n = 1536 / _W // compiler hint T := make([]uint, n*2) var c uint for i := 0; i < n; i++ { d := bLimbs[i] c1 := addMulVVW1536(&T[i], &aLimbs[0], d) Y := T[i] * m.m0inv c2 := addMulVVW1536(&T[i],...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  5. lib/fips140/v1.1.0-rc1.zip

    // compiler hint T := make([]uint, n*2) var c uint for i := 0; i < n; i++ { d := bLimbs[i] c1 := addMulVVW1024(&T[i], &aLimbs[0], d) Y := T[i] * m.m0inv c2 := addMulVVW1024(&T[i], &mLimbs[0], Y) T[n+i], c = bits.Add(c1, c2, c) } copy(x.reset(n).limbs, T[n:]) x.maybeSubtractModulus(choice(c), m) case 1536 / _W: const n = 1536 / _W // compiler hint T := make([]uint, n*2) var c uint for i := 0; i < n; i++ { d := bLimbs[i] c1 := addMulVVW1536(&T[i], &aLimbs[0], d) Y := T[i] * m.m0inv c2 := addMulVVW1536(&T[i],...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top