Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 7 of 7 for acum (0.06 seconds)

  2. github.com/codelibs/fess

    src/main/resources/fess_indices/_aws/fess.json 

              "type":       "stop",
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sun Mar 15 07:52:55 GMT 2026
    - 117.5K bytes
    - Click Count (0)
  3. github.com/codelibs/fess

    src/main/resources/fess_indices/_cloud/fess.json 

              "type":       "stop",
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sun Mar 15 07:52:55 GMT 2026
    - 117.5K bytes
    - Click Count (0)
  4. github.com/google/guava

    android/guava/src/com/google/common/math/IntMath.java 

          default:
        // continue below to handle the general case
    }
    int accum = 1;
    while (true) {
      switch (k) {
        case 0:
          return accum;
        case 1:
          return Math.multiplyExact(accum, b);
        default:
          if ((k & 1) != 0) {
            accum = Math.multiplyExact(accum, b);
          }
          k >>= 1;
          if (k > 0) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Jan 29 22:14:05 GMT 2026
    - 26.1K bytes
    - Click Count (0)
  5. github.com/google/guava

    android/guava/src/com/google/common/math/LongMath.java 

            default:
          throw new AssertionError();
      }
    }
    long accum = 1;
    while (true) {
      switch (k) {
        case 0:
          return accum;
        case 1:
          return Math.multiplyExact(accum, b);
        default:
          if ((k & 1) != 0) {
            accum = Math.multiplyExact(accum, b);
          }
          k >>= 1;
          if (k > 0) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 09 23:01:02 GMT 2026
    - 46.8K bytes
    - Click Count (0)
  6. github.com/google/guava

    android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java 

     * conventional bounded queues, which either block or reject new elements when full.
 *
 * <p>This implementation is based on the <a
 * href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a> developed by Atkinson, et al.
 * Unlike many other double-ended priority queues, it stores elements in a single array, as compact
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 34K bytes
    - Click Count (0)
  7. github.com/google/guava

    guava/src/com/google/common/collect/MinMaxPriorityQueue.java 

     * conventional bounded queues, which either block or reject new elements when full.
 *
 * <p>This implementation is based on the <a
 * href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a> developed by Atkinson, et al.
 * Unlike many other double-ended priority queues, it stores elements in a single array, as compact
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 34K bytes
    - Click Count (0)
  8. github.com/golang/go

    lib/fips140/v1.26.0.zip 

    ZERO.B16, ACCM.B16, T0.B16 \ VEXT $8, ACCM.B16, ZERO.B16, ACCM.B16 \ VEOR ACCM.B16, ACC0.B16, ACC0.B16 \ VEOR T0.B16, ACC1.B16, ACC1.B16 \ VPMULL POLY.D1, ACC0.D1, T0.Q1 \ VEXT $8, ACC0.B16, ACC0.B16, ACC0.B16 \ VEOR T0.B16, ACC0.B16, ACC0.B16 \ VPMULL POLY.D1, ACC0.D1, T0.Q1 \ VEOR T0.B16, ACC1.B16, ACC1.B16 \ VEXT $8, ACC1.B16, ACC1.B16, ACC1.B16 \ VEOR ACC1.B16, ACC0.B16, ACC0.B16 \ // func gcmAesFinish(productTable *[256]byte, tagMask, T *[16]byte, pLen, dLen uint64) TEXT è·¯gcmAesFinish(SB),NOSPLIT,$0...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jan 08 17:58:32 GMT 2026
    - 660.3K bytes
    - Click Count (0)
Back to Top