Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 16 of 16 for Mills (0.2 sec)

  1. okhttp/src/main/kotlin/okhttp3/internal/http2/Hpack.kt

     *
     * This implementation uses an array for the dynamic table and a list for indexed entries. Dynamic
     * entries are added to the array, starting in the last position moving forward. When the array
     * fills, it is doubled.
     */
    @Suppress("NAME_SHADOWING")
    object Hpack {
      private const val PREFIX_4_BITS = 0x0f
      private const val PREFIX_5_BITS = 0x1f
      private const val PREFIX_6_BITS = 0x3f
    Plain Text
    - Registered: Fri Apr 26 11:42:10 GMT 2024
    - Last Modified: Mon Jan 08 01:13:22 GMT 2024
    - 22.5K bytes
    - Viewed (1)
  2. src/cmd/cgo/ast.go

    	f.walk(ast2, ctxProg, (*File).saveExprs)
    
    	// Accumulate exported functions.
    	// The comments are only on ast1 but we need to
    	// save the function bodies from ast2.
    	// The first walk fills in ExpFunc, and the
    	// second walk changes the entries to
    	// refer to ast2 instead.
    	f.walk(ast1, ctxProg, (*File).saveExport)
    	f.walk(ast2, ctxProg, (*File).saveExport2)
    
    	f.Comments = ast1.Comments
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Wed Jun 07 16:54:27 GMT 2023
    - 14.3K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/util/concurrent/Futures.java

          ListenableFuture<? extends V>... futures) {
        ListenableFuture<List<@Nullable V>> nullable =
            new ListFuture<V>(ImmutableList.copyOf(futures), true);
        // allAsList ensures that it fills the output list with V instances.
        @SuppressWarnings("nullness")
        ListenableFuture<List<V>> nonNull = nullable;
        return nonNull;
      }
    
      /**
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Mon Apr 01 16:15:01 GMT 2024
    - 59.6K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java

            queue[index] = elementData(minChildIndex);
            queue[minChildIndex] = x;
            return minChildIndex;
          }
          return crossOverUp(index, x);
        }
    
        /**
         * Fills the hole at {@code index} by moving in the least of its grandchildren to this position,
         * then recursively filling the new hole created.
         *
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Thu Feb 22 21:19:52 GMT 2024
    - 34K bytes
    - Viewed (0)
  5. tensorflow/c/eager/tape.h

      void PopState() { call_state_.pop(); }
    
     private:
      // Helper for Accumulate: uses a GradientTape to compute forward gradients
      // from a backward gradient function. Fills `out_grads` corresponding to
      // `output_tensors`. `out_grads` must not be null.
      //
      // Executes the backward function in order to trace its gradient, which will
    C
    - Registered: Tue Apr 23 12:39:09 GMT 2024
    - Last Modified: Tue Apr 02 12:40:29 GMT 2024
    - 47.2K bytes
    - Viewed (1)
  6. RELEASE.md

    Jeff Carpenter, Jeremy Sharpe, Jeroen BéDorf, Jimmy Jia, Jinze Bai, Jiongyan
    Zhang, Joe Castagneri, Johan Ju, Josh Varty, Julian Niedermeier, JxKing, Karl
    Lessard, Kb Sriram, Keven Wang, Koan-Sin Tan, Kyle Mills, lanhin, LevineHuang,
    Loki Der Quaeler, Loo Rong Jie, Luke Iwanski, LáSzló Csomor, Mahdi Abavisani,
    Mahmoud Abuzaina, ManHyuk, Marek ŠUppa, MathSquared, Mats Linander, Matt Wytock,
    Plain Text
    - Registered: Tue Apr 23 12:39:09 GMT 2024
    - Last Modified: Wed Apr 03 20:27:38 GMT 2024
    - 727.4K bytes
    - Viewed (8)
Back to top