Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for Mills (0.16 sec)

  1. src/main/java/org/codelibs/fess/helper/DataIndexHelper.java

                        logger.debug("Interrupted.", e);
                    }
                }
            }
    
            public void awaitTermination(final long mills) {
                try {
                    join(mills);
                } catch (final InterruptedException e) {
                    if (logger.isDebugEnabled()) {
                        logger.debug("Interrupted.", e);
                    }
                }
    Java
    - Registered: Mon Apr 29 08:04:11 GMT 2024
    - Last Modified: Thu Feb 22 01:37:57 GMT 2024
    - 12K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/primitives/Ints.java

        // There are several well-known algorithms for rotating part of an array (or, equivalently,
        // exchanging two blocks of memory). This classic text by Gries and Mills mentions several:
        // https://ecommons.cornell.edu/bitstream/handle/1813/6292/81-452.pdf.
        // (1) "Reversal", the one we have here.
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Thu Feb 15 16:12:13 GMT 2024
    - 29.7K bytes
    - Viewed (0)
  3. okhttp/src/main/kotlin/okhttp3/MultipartBody.kt

        /**
         * The media-type multipart/form-data follows the rules of all multipart MIME data streams as
         * outlined in RFC 2046. In forms, there are a series of fields to be supplied by the user who
         * fills out the form. Each field has a name. Within a given form, the names are unique.
         */
        @JvmField
        val FORM = "multipart/form-data".toMediaType()
    
    Plain Text
    - Registered: Fri Apr 26 11:42:10 GMT 2024
    - Last Modified: Mon Jan 08 01:13:22 GMT 2024
    - 10.9K bytes
    - Viewed (0)
  4. 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)
  5. 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)
  6. 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 30 12:39:09 GMT 2024
    - Last Modified: Tue Apr 02 12:40:29 GMT 2024
    - 47.2K bytes
    - Viewed (1)
Back to top